Results 1 -
3 of
3
A review of population-based meta-heuristic algorithms
- Int. J. Adv. Soft Comput. Appl
, 2013
"... Abstract Exact optimization algorithms are not able to provide an appropriate solution in solving optimization problems with a high-dimensional search space. In these problems, the search space grows exponentially with the problem size therefore; exhaustive search is not practical. Also, classical ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
(Show Context)
Abstract Exact optimization algorithms are not able to provide an appropriate solution in solving optimization problems with a high-dimensional search space. In these problems, the search space grows exponentially with the problem size therefore; exhaustive search is not practical. Also, classical approximate optimization methods like greedy-based algorithms make several assumptions to solve the problems. Sometimes, the validation of these assumptions is difficult in each problem. Hence, meta-heuristic algorithms which make few or no assumptions about a problem and can search very large spaces of candidate solutions have been extensively developed to solve optimization problems these days. Among these algorithms, population-based meta-heuristic algorithms are proper for global searches due to global exploration and local exploitation ability. In this paper, a survey on meta-heuristic algorithms is performed and several population-based meta-heuristics in continuous (real) and discrete (binary) search spaces are explained in details. This covers design, main algorithm, advantages and disadvantages of the algorithms.
A NEW GENETIC REPRESENTATION FOR QUADRATIC ASSIGNMENT PROBLEM 1 Dugošija / A New Genetic Representation for QAP 226
, 2011
"... Abstract: In this paper, we propose a new genetic encoding for well known Quadratic Assignment Problem (QAP). The new encoding schemes are implemented with appropriate objective function and modified genetic operators. The numerical experiments were carried out on the standard QAPLIB data sets know ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract: In this paper, we propose a new genetic encoding for well known Quadratic Assignment Problem (QAP). The new encoding schemes are implemented with appropriate objective function and modified genetic operators. The numerical experiments were carried out on the standard QAPLIB data sets known from the literature. The presented results show that in all cases proposed genetic algorithm reached known optimal solutions in reasonable time.
unknown title
"... Over the last few years, scientist, engineers and economists have extensively used genetic algorithms (GA), to solve optimization problems involving single objective functions. During the last few years several researchers ..."
Abstract
- Add to MetaCart
(Show Context)
Over the last few years, scientist, engineers and economists have extensively used genetic algorithms (GA), to solve optimization problems involving single objective functions. During the last few years several researchers