Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms

Expert Systems with Applications

Volumn 38, Issue 3, 2011, Pages 1313-1320

  Albayrak, Murat ^a   Allahverdi, Novruz ^b  

^a Center Primary Education Scholl   (Turkey)

^b SELCUK UNIVERSITY   (Turkey)

Author keywords

Genetic Algorithm; Greedy methods; Mutation operator; Optimization; Traveling Salesman Problem

Indexed keywords

AVERAGE ERRORS; ERROR VALUES; GREEDY METHOD; GREEDY SEARCH METHODS; MUTATION OPERATORS; SHORTEST DISTANCE; SIMPLE GA; TRAVELING SALESMAN;

GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 78049529209     PISSN: 09574174     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.eswa.2010.07.006     Document Type: Article

References (23)

1. Albayrak Murat (2008). Determination of route by means of Genetic Algorithms for printed circuit board driller machines. Master dissertation (p. 180). Selcuk University.
2. W. Banzhaf The 'molecular' traveling salesman Biological Cybernetics 64 1990 7 14
3. Davis, L. (1985). Applying adaptive algorithms to epispastics domains. In Proceedings of the int. joint conf. on artificial intelligence (IJCAI'85) (pp. 162-164). Los Angeles, CA.
4. M. Dorigo, and L.M. Gambardella Ant colonies for the traveling salesman problem BioSystems 43 1997 73 81
5. D.B. Fogel An evolutionary approach to the traveling salesman problems Biological Cybernetics 60 1988 139 144
6. Fogel, D. B. (1993a). Empirical estimation of the computation required to discover approximate solutions to the traveling salesman problem using evolutionary programming. In Proceedings of 2nd annual conference on evolutionary programming (pp. 56-61).
7. D.B. Fogel Applying evolutionary programming to selected traveling salesman problems Cybernetics and Systems: An International Journal 24 1993 27 36
8. B. Freisleben, and P. Merz A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems Proceedings of the IEEE international conference on evolutionary computation 1996 IEEE Press 616 621
9. Genetic Algorithms (2009). Wikipedia. http://en.wikipedia.org/wiki/ Genetic-Algorithms ; last access.
10. D.E. Goldberg, and R. Lingle Alleles, loci and the traveling salesman problem Proceedings of the first int. conf. on genetic algorithms (ICGA'85) 1985 Carnegie-Mellon University Pittsburgh, PA 154 159
11. Grefenstette, J.; Gopal, R.; Rosmaita, B.; Gucht, D. V. (1985). Genetic Algorithms for the TSP. In Proceedings of the first international conference on genetic algorithms and their applications (pp. 160-65).
12. K. Helsgaun An effective implementation of the Lin-Kernighan traveling salesman heuristic European Journal of Operational Research 126 1 2000 106 130
13. J.H. Holland Adaptation in natural and artificial systems 1975 University of Michigan Press Ann Arbor
14. G.A. Jayalakshmi, S. Sathiamoorthy, and R. Rajaram A hybrid genetic algorithm-a new approach to solve traveling salesman problem International Journal of Computational Engineering Science 2 2 2001 339 355
15. Louis, S. J.; Tang, R. (1999). Interactive genetic algorithms for the traveling salesman problem. In Proceedings of the 1999 genetic and evolutionary computing conference (GECCO 1999) (pp. 385-392).
16. Z. Michalewicz Genetic algorithms + data structures = evolution programs 1992 Springer Berlin
17. A. Misevicius Using iterated tabu search for the traveling salesman problem Information Technology and Control 3 32 2004 29 40
18. I.M. Oliver, D.J. Smith, and J.R.C. Holland A study of permutation crossover operators on the traveling salesman problem Proceedings of the second int. conf. on genetic algorithms (ICGA'87) 1987 Massachusetts Institute of Technology Cambridge, MA 224 230
19. M.G. Schleuter Asparagos96 and the traveling salesman problem Proceedings of the 1997 IEEE international conference on evolutionary computation 1997 IEEE Press 171 174
20. Seo, D.; Moon, B. (2002). Voronoi quantized crossover for traveling salesman problem. In Proceedings of the genetic and evolutionary computation conference (pp. 544-552).
21. Stützle, T.; Hoos, H. (1997). The MAX-MIN ant system and local search for the traveling salesman problem. In Proceedings of the IEEE international conference on evolutionary computation (pp. 308-313). Indianapolis, Indiana, USA.
22. G. Syswerda Schedule optimization using genetic algorithms L. Davis, Handbook of genetic algorithms 1991 Van Nostrand Reinhold 332 349
23. TSPLIB (2009). http://www.iwr.uni-heidelberg.de/groups/comopt/software/ TSPLIB95/ ; last access: April 2009.