A memetic algorithm for symmetric traveling salesman problem

References

• 1985 . The traveling salesman problem: A guided tour of combinatorial optimization , Wiley and Sons .
   Google Scholar
• Aarts , E. and Stehouwer , H. Neural networks and the travelling salesman problem . Proc. of International Conference on Artificial Neural Networks . pp. 950 – 955 . in
   Google Scholar
• Bentley , J. 1992 . Fast algorithms for geometric traveling salesman problems . ORSA Journal on computing , 4 : 387 – 411 .
   Google Scholar
• Boese , K. 1995 . “ Cost versus distance in the traveling salesman problem ” . In Tech. Rep. TR-950018 , UCLA CS Department .
   Google Scholar
• Charon , I. and Hudry , O. 2000 . Application of the noising method to the travelling salesman problem . European Journal of Operational Research , 125 : 266 – 277 .
   Web of Science ®Google Scholar
• Dorigo , M. and Gambardella , L. 1997 . Ant colonies for traveling salesman problem . Biosystems , 43 : 73 – 81 .
   PubMed Web of Science ®Google Scholar
• Dorigo , M. and Gambardella , L. 1997 . Ant colony system: A cooperative learning approach to the traveling salesman problem . IEEE Transactions on Evolutionary Computations , 1 : 53 – 66 .
   Google Scholar
• et al. Parameter control in evolutionary algorithms Computational Intelligence (SCI) 2007 54 19 46
   Google Scholar
• Feichter , L. 1994 . A parallel tabu search for large traveling salesman problems . Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science , 51 : 234 – 267 .
   Google Scholar
• Freisleben , B. and Merz , P. 1996 . “ A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems ” . In Proc. of IEEE international conference on evolutionary computation in
   Google Scholar
• Garey , M. and Johnston , D. 1979 . Computers and Intractability: A Guide to the Theory of NP-Completeness , Freeman .
   Google Scholar
• Goldberg , D. 1989 . Genetic algorithms in search, optimization and machine learning , Addison -Wesley .
   Google Scholar
• Homaifar , L. , Guan , C. and Liepins , G. A new approach to the traveling salesman problem by genetic algorithms . Proc. of 5th International Conference on Genetic Algorithms . pp. 460 – 466 . in
   Google Scholar
• Johnson , D. and McGeoch , L. 2003 . “ The traveling salesman problem: A case study in local optimization ” . In Local Search in Combinatorial Optimization , 215 – 310 . Princeton University Press . in
   Google Scholar
• Laarhoven , P. and Aarts , E. 1987 . Simulated Annealing: Theory and Applications , Kluwer Academic Publishers .
   Google Scholar
• Moscato , P. 2002 . “ Memetic algorithms ” . In Handbook of Applied Optimization , 157 – 165 . OXFORD UNIVERSITY PRESS . in
   Google Scholar
• Moscato , P. 2003 . “ A gentle introduction to memetic algorithms ” . In HANDBOOK OF METAHEURISTICS , 105 – 144 . KLUWER ACADEMIC PUBLISHERS . in
   Google Scholar
• Reinelt , G. 1991 . Tsplib a traveling salesman problem library . ORSA Journal on Computing , 3 : 376 – 384 .
   Google Scholar
• Tang , A. and Leung , K. 1994 . “ A modified edge recombination operator for the travelling salesman problem ” . In Proc. of Parallel Problem Solving from Nature III Edited by: Schwefel , H. and Manner , R. 180 – 188 . in
   Google Scholar
• Wolpert , D. and Macready , W. 1997 . No free lunch theorems for optimization . IEEE Transactions on Evolutionary Computation , 1 ( 1 ) : 67 – 82 .
   Google Scholar
• Yaguira , M. and Ibaraki , T. 2002 . “ Local search ” . In Handbook of Applied Optimization , 104 – 123 . OXFORD UNIVERSITY PRESS . in
   Google Scholar