Implementation of an effective hybrid GA for large-scale traveling salesman problems

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 37, Issue 1, 2007, Pages 92-99

  Nguyen, Hung Dinh ^a   Yoshihara, Ikuo ^a   Yamamori, Kunihito ^a   Yasunaga, Moritoshi ^b  

^a UNIVERSITY OF MIYAZAKI   (Japan)

^b UNIVERSITY OF TSUKUBA   (Japan)

Author keywords

Hybrid genetic algorithm; Maximal preservative crossover (MPX); Memetic algorithm; Traveling salesman problem (TSP)

Indexed keywords

GENETIC ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION; PROBLEM SOLVING;

HYBRID GENETIC ALGORITHM; LOCAL SEARCH HEURISTICS; MAXIMAL PRESERVATIVE CROSSOVER (MPX); MEMETIC ALGORITHM;

TRAVELING SALESMAN PROBLEM;

ALGORITHM; ARTIFICIAL INTELLIGENCE; BIOLOGICAL MODEL; BIOMIMETICS; COMPUTER PROGRAM; COMPUTER SIMULATION; EVALUATION; GAME; LETTER; METHODOLOGY; SYSTEMS THEORY;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; BIOMIMETICS; COMPUTER SIMULATION; GAME THEORY; MODELS, GENETIC; SOFTWARE; SYSTEMS THEORY;

EID: 33847610250     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2006.880136     Document Type: Article

References (42)

1. D. Applegate, R. Bixby, V. Chvátal, and W. Cook, "TSP cuts which do not conform to the template paradigm," in Computational Combinatorial Optimization. New York: Springer-Verlag, 2001, pp. 261-304.
2. D. Applegate, W. Cook, and A. Rohe, "Chained Lin-Kernighan for large traveling salesman problems," INFORMS J. Comput., vol. 15, no. 1, pp. 82-92, Jan. 2003.
3. R. Baraglia, J. I. Hidalgo, and R. Perego, "A hybrid heuristic for the traveling salesman problem," IEEE Trans. Evol. Comput., vol. 5, no. 6, pp. 613-622, Dec. 2001.
4. J. L. Bentley, "Experiments on traveling salesman heuristics," in Proc. 1st Annu. ACM-SIAM Symp. Discr. Algorithms, D. Johnson, Ed., 1990, pp. 91-99.
5. E. Cantu-Paz, "Implementing fast and flexible parallel genetic algorithms," in Practical Handbook of Genetic Algorithms, vol. III, L. D. Chambers, Ed. Boca Raton, FL: CRC, 1998, pp. 65-84.
6. J. Dzubera and D. Whitley, "Advanced correlation analysis of operators for the traveling salesman problem," in Parallel Problem Solving From Nature - PPSN III, Y. Davidor, H.-P. Schwefel, and R. Männer, Eds. New York: Springer-Verlag, 1994, pp. 68-77.
7. M. L. Fredman, D. S. Johnson, L. A. McGeoch, and G. Ostheimer, "Data structures for traveling salesmen," J. Alg., vol. 18, no. 3, pp. 432-479, May 1995.
8. B. Freisleben and P. Merz, "A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems," in Proc. IEEE Int. Conf. Evol. Comput., 1996, pp. 616-621.
9. D. E. Goldberg and R. Lingle, "Alleles, loci, and the traveling salesman problem," in Proc. Int. Conf. Genetic Algorithms and Their Appl., 1985, pp. 154-159.
10. D. E. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
11. M. Gorges-Schleuter, "Asparagos96 and the traveling salesman problem," in Proc. IEEE Int. Conf. Evol. Comput., 1997, pp. 171-174.
12. J. J. Grefenstette, R. Gopal, B. Rosmaita, and D. VanGucht, "Genetic algorithms for the traveling salesman problem," in Proc. Int. Conf. Genetic Algorithms and Their Appl., 1985, pp. 160-168.
13. M. Held and R. M. Karp, "The traveling salesman problem and minimal spanning trees," Oper. Res., vol. 18, no. 6, pp. 1138-1162, 1970.
14. M. Held and R. M. Karp, "The traveling salesman problem and minimal spanning trees: Part II," Math. Program., vol. 1, no. 1, pp. 6-25, 1971.
15. K. Helsgaun, "An effective implementation of the Lin-Kernighan traveling salesman heuristic," Eur. J. Oper. Res., vol. 126, no. 1, pp. 106-130, Oct. 2000.
16. K. Helsgaun, Department of Computer Science, Roskilde Univ., Roskilde, Denmark, private communication, 2004.
17. J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor: Univ. of Michigan Press, 1975.
18. H. Ishibuchi, T. Yoshida, and T. Murata, "Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling," IEEE Trans. Evol. Comput., vol. 7, no. 2, pp. 204-223, Apr. 2003.
19. S. Johnson and L. A. McGeoch, "The traveling salesman problem: A case study in local optimization," in Local Search in Combinatorial Optimization. Hoboken, NJ: Wiley, 1997, pp. 215-310.
20. S. Johnson and L. A. McGeoch, "Experimental analysis of heuristics for the STSP," in The Traveling Salesman Problem and Its Variations. Norwell, MA: Kluwer, 2002, pp. 369-443.
21. S. Jung and B. Moon, "The natural crossover for the 2D Euclidean TSP," in Proc. Genetic and Evol. Comput. Conf., 2001, pp. 1003-1010.
22. N. Krasnogor and J. E. Smith, "A tutorial for competent memetic algorithms: Model, taxonomy, and design issues," IEEE Trans. Evol. Comput., vol. 9, no. 5, pp. 474-488, Oct. 2005.
23. S. Lin and B. Kernighan, "Effective heuristic algorithm for the traveling salesman problem," Oper. Res., vol. 21, no. 2, pp. 498-516, 1973.
24. O. Martin, S. W. Otto, and E. W. Felten, "Large-step Markov chains for the traveling salesman problem," Complex Syst., vol. 5, no. 3, pp. 299-326, 1991.
25. K. Mathias and D. Whitley, "Genetic operators, the fitness landscape, and the traveling salesman problem," in Parallel Problem Solving From Nature. Amsterdam, The Netherlands: Elsevier, 1992, pp. 219-228.
26. P. Merz and B. Freisleben, "Genetic local search for the TSP: New results," in Proc. IEEE Int. Conf. Evol. Comput., 1997, pp. 159-164.
27. P. Merz and B. Freisleben, "Memetic algorithms for the traveling salesman problem," Complex Syst., vol. 13, no. 4, pp. 297-345, 2001.
28. H. Muhlenbein, "Evolution in time and space - The parallel genetic algorithm," in Foundations of Genetic Algorithms. San Mateo, CA: Morgan Kaufmann, 1991, pp. 316-337.
29. Y. Nagata and S. Kobayashi, "Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem," in Proc. 7th Int. Conf. Genetic Algorithms, 1997, pp. 450-457.
30. Y. Nagata, "The EAX algorithm considering diversity loss," in Parallel Problem Solving From Nature - PPSN VIII. New York: Springer-Verlag, 2004, pp. 332-341.
31. H. D. Nguyen, I. Yoshihara, and M. Yasunaga, "Modified edge recombination operators of genetic algorithms for the traveling salesman problem," in Proc. 3rd Asia-Pacific Conf. Simul. Evol. and Learn., Nagoya, Japan, 2000, pp. 2815-2820.
32. H. D. Nguyen, I. Yoshihara, K. Yamamori, and M. Yasunaga, "Greedy genetic algorithms for symmetric and asymmetric TSPs," IPSJ Trans. Math. Modeling and Appl., vol. 43, no. SIG10 (TOM7), pp. 165-175, Nov. 2002.
33. H. D. Nguyen, "Hybrid genetic algorithms for combinatorial optimization problems," Ph.D. dissertation, Faculty Eng., Univ. Miyazaki, Miyazaki, Japan, 2004.
34. I. Oliver, D. Smith, and J. Holland, "A study of permutation crossover operators on the traveling salesman problem," in Proc. 2nd Int. Conf. Genetic Algorithms, 1987, pp. 224-230.
35. Y. S. Ong and A. J. Keane, "Meta-Lamarckian learning in memetic algorithms," IEEE Trans. Evol. Comput., vol. 8, no. 2, pp. 99-110, Apr. 2004.
36. G. Reinelt, "TSPLIB - A traveling salesman problem library," ORSA J. Comput., vol. 3, no. 4, pp. 376-384, 1991. [Online]. Available: http://www.iwr.uni-heidelberg.de/iwr/comopt/software/TSPLIB95
37. H. Sengoku and I. Yoshihara, "A fast TSP solver using GA on JAVA," in Proc. 3rd Int. Symp. Artif. Life and Robot., 1998, pp. 283-288.
38. T. Starkweather, S. McDaniel, K. Mathias, C. Whitley, and D. Whitley, "A comparison of genetic sequencing operators," in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 69-76.
39. A. Takeda, S. Yamada, K. Sugawara, I. Yoshihara, and K. Abe, "Optimization of delivery route in a city area using genetic algorithm," in Proc. 4th Int. Symp. Artif. Life and Robot., 1999, pp. 496-499.
40. D. Whitley, "The GENITOR algorithm and selective pressure: Why rank-based allocation of reproductive trials is best," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 116-121.
41. D. Whitley, T. Starkweather, and D. Fuquay, "Scheduling problems and traveling salesman: The genetic edge recombination operator," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 133-140.
42. D. Whitley, T. Starkweather, and D. Shaner, "The traveling salesman and sequence scheduling: Quality solutions using genetic edge recombination," in The Handbook of Genetic Algorithms, L. Davis, Ed. New York: Van Nostrand, 1991, pp. 350-372.