Genetic local search for the traveling salesman problem

Aarts, Ehl Emile; Verhoeven, M.G.A.

doi:10.1887/0750308958/b386c120

Cited by 1 publication

(2 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [37], a short review on early MAs for the TSP is presented, where an MA was defined by the following skeleton code. Here, we can regard as a particular instantiation of , and appropriate code should be used to initialize the population, mate solutions, and select the next generation.…”

Section: Traveling Salesman Problemmentioning

confidence: 99%

See 1 more Smart Citation

A Tutorial for Competent Memetic Algorithms: Model, Taxonomy, and Design Issues

Krasnogor

Smith

2005

IEEE Trans. Evol. Computat.

653

317

View full text Add to dashboard Cite

Disclaimer UWE has obtained warranties from all depositors as to their title in the material deposited and as to their right to deposit such material. UWE makes no representation or warranties of commercial utility, title, or fitness for a particular purpose or any other warranty, express or implied in respect of any material deposited. UWE makes no representation that the use of the materials will not infringe any patent, copyright, trademark or other property or proprietary rights. UWE accepts no liability for any infringement of intellectual property rights in any material deposited but will remove such material from public view pending investigation in the event of an allegation of any such infringement. PLEASE SCROLL DOWN FOR TEXT. , 1976). In the case of MA's, "memes" refer to the strategies (e.g., local refinement, perturbation, or constructive methods, etc.) that are employed to improve individuals. In this paper, we review some works on the application of MAs to well-known combinatorial optimization problems, and place them in a framework defined by a general syntactic model. This model provides us with a classification scheme based on a computable index , which facilitates algorithmic comparisons and suggests areas for future research. Also, by having an abstract model for this class of metaheuristics, it is possible to explore their design space and better understand their behavior from a theoretical standpoint. We illustrate the theoretical and practical relevance of this model and taxonomy for MAs in the context of a discussion of important design issues that must be addressed to produce effective and efficient MAs.Index Terms-Design issues, evolutionary global-local search hybrids, memetic algorithms (MAs), model, taxonomy.

show abstract

Section: Traveling Salesman Problemmentioning

confidence: 99%

“…The use of local search and the absence of mutation is a clear difference between and standard EAs. In [37], early works on the application of MAs to the TSP were commented on. Those works used different instantiations of the above skeleton to produce near-optimal solution for small instances of the problem.…”

Section: Traveling Salesman Problemmentioning

confidence: 99%