P. Merz and B. Freisleben, "A Comparison of Memetic Algorithms, Tabu Search, and Ant Colonies for the Quadratic Assignment Problem," in 1999. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Hybrid Genetic Algorithm for the Quadratic Assignment Problem - Vázquez, Whitley (2000) (Correct)
....to the individuals to determine the probability of survival. Several GA approaches have been used in solving the QAP. As indicated by Cela [Cela, 1998] pure GAs show some drawbacks; GAs have been improved by combining them with local search techniques. Merz and Freisleben [Merz, et al. 1997] [Merz, et al. 1999] developed a Genetic Local Search (GLS) strategy by applying a variant of the 2 opt heuristic as a local search technique. A next descent search is used. Merz and Freisleben claim that their algorithm is superior to TS and to Ant Systems (AS) in terms of the quality of solution found within a ....
:Peter Merz and Bernd Freisleben. "A Comparison of Memetic Algorithms, Tabu Search, and Ant Colonies for the Quadratic Assignment Problem". International Congress on Evolutionary Computation (CEC' 99), IEEE Press, pp 2063-2070, 1999.
Memetic Algorithms for Combinatorial Optimization Problems.. - Merz (2001) (8 citations) Self-citation (Merz Freisleben) (Correct)
No context found.
P. Merz and B. Freisleben, "A Comparison of Memetic Algorithms, Tabu Search, and Ant Colonies for the Quadratic Assignment Problem," in 1999.
Genetic Algorithms for Binary Quadratic Programming - Merz, Freisleben (1999) (3 citations) Self-citation (Merz Freisleben) (Correct)
....for more than 30 generations) the whole population is mutated except the best individual and the search is restarted. This kind of selection diversification strategy has been shown to be very effective for small populations and has been used in our algorithms to solve the TSP [20, 25] QAP [19, 23], GBP[21, 26] and NK landscapes [22] 2.2 HYBRID GENETIC ALGORITHMS A promising approach to use domain knowledge in genetic algorithms is the incorporation of local search. The resulting algorithms, often called genetic local search algorithms (GLS) 35, 7, 36] or memetic algorithms [27, 28, 25] ....
P. Merz and B. Freisleben, "A Comparison of Memetic Algorithms, Tabu Search, and Ant Colonies for the Quadratic Assignment Problem," in 1999 Congress on Evolutionary Computation (CEC'99), 1999. to appear.
Systematic Integration of Parameterized Local.. - Bambha.. (2004) (Correct)
No context found.
P. Merz and B. Freisleben, "A comparison of memetic algorithms, Tabu search, and ant colonies for the quadratic assignment problem," in Proc. Int. Conf. Evolutionary Computation (CEC '99), 1999.
Competent Memetic Algorithms: Model, Taxonomy and Dessing Issues - Krasnogor, Smith (Correct)
No context found.
P. Merz and B. Freisleben, "A comparison of memetic algorithms, tabu search, and ant colonies for the quadratic assignment problem," in Proceedings of the 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC