Toward minimal restriction of genetic encoding and crossovers for the two-dimensional Euclidean TSP

IEEE Transactions on Evolutionary Computation

Volumn 6, Issue 6, 2002, Pages 557-565

  Jung, Soonchul ^a   Moon, Byung Ro ^a  

^a Seoul National University   (South Korea)

Author keywords

Chromosome encoding; Evolutionary algorithms; Evolutionary computation; Traveling salesman problem (TSP)

Indexed keywords

COMPUTATIONAL COMPLEXITY; ENCODING (SYMBOLS); EQUIVALENCE CLASSES; MARKOV PROCESSES; NEURAL NETWORKS; POLYNOMIALS; SIMULATED ANNEALING; TRAVELING SALESMAN PROBLEM; TWO DIMENSIONAL;

GENETIC ENCODING; TABU SEARCH;

EVOLUTIONARY ALGORITHMS;

EID: 0036955576     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/TEVC.2002.804321     Document Type: Article

References (42)

1. C. A. Anderson, K. F. Jones, and J. Ryan, "A two-dimensional genetic algorithm for the Ising problem," Complex Syst., vol. 5, pp. 327-333, 1991.
2. S. Arora, "Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems," J. ACM, vol. 45, no. 5, pp. 753-782, 1998.
3. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, "Proof verification and intractability of approximation problems," in Proc. 33rd IEEE Symp. Foundations of Computer Science, 1992, pp. 13-22.
4. J. L. Bentley, "Experiments on traveling salesman heuristics," in Proc. 1st Annu. ACM-SIAM Symp. Discrete Algorithms (SODA'90), 1990, pp. 91-99.
5. H. Braun, "On traveling salesman problems by genetic algorithms," in Workshop on Parallel Problem Solving from Nature, 1990, pp. 129-133.
6. T. N. Bui and B. R. Moon, "Hyperplane synthesis for genetic algorithms," in Proc. 5th Int. Conf. Genetic Algorithms, July 1993, pp. 102-109.
7. ____, "A new genetic approach for the traveling salesman problem," in Proc. 1st IEEE Conf. Evolutionary Computation, 1994, pp. 7-12.
8. ____, "On multi-dimensional encoding/Crossover," in Proc. 6th Int. Conf. Genetic Algorithms, 1995, pp. 49-56.
9. ____, "Graph partitioning and genetic algorithms," IEEE Transactions on Computers, vol. 45, pp. 841-855, 1996.
10. N. Christofides, "Worst-case analysis of a new heuristic for the traveling salesman problem," in Symp. New Directions and Recent Results in Algorithms and Complexity, 1976, p. 441.
11. J. P. Cohoon and W. Paris, "Genetic placement," IEEE Trans. Computer-Aided Design, vol. CAD-6, no. 6, pp. 956-964.
12. L. Davis, "Applying adapting algorithms to epistatic domains," in Proc. Int. Joint Conf. Artificial Intelligence, Quebec, Canada, 1985.
13. C. N. Fiechter, "A parallel tabu search algorithm for large traveling salesman problems," Discrete Appl. Math. Combin. Oper. Res. Comput. Sci., vol. 51, pp. 243-267, 1994.
14. B. R. Fox and M. B. McMahon, "Genetic operators for sequencing problems," in Foundations of Genetic Algorithms, G. Rawlins, Ed. Reading, MA: Addison-Wesley, 1991, pp. 284-300.
15. M. L. Fredman, D. S. Johnson, L. A. McGeoch, and G. Ostheimer, "Data structures for traveling salesmen," in Proc. 4th Annu. ACM-SIAM Symp. Discrete Algorithms (SODA'93), 1993, pp. 145-154.
16. B. Freisleben and P. Merz, "New genetic local search operators for the traveling salesman problem," in Proc. 4th Conf. Parallel Problem Solving from Nature, 1996, pp. 616-621.
17. M. R. Garey, R. L. Graham, and D. S. Johnson, "Some NP-complete geometric problems," in Proc. 8th Annu. ACM Symp. Theory of Computing, 1976, pp. 10-22.
18. D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Reading, MA: Addison-Wesley, 1989.
19. A. Homaifar, S. Guan, and G. Liepins, "A new approach on the traveling salesman problem by genetic algorithms," North Carolina A&T State Univ., Greensboro, NC, 1991.
20. P. Jog, J. Suh, and D. Gucht, "The effect of population size, heuristic crossover and local improvement on a genetic algorithm for the traveling salesman problem," in Proc. 3rd Int. Conf. Genetic Algorithms, 1989, pp. 110-115.
21. D. S. Johnson, "Local optimization and the traveling salesman problem," in Proc. 17th Colloq. Automata, Languages, and Programming, 1990, pp. 446-461.
22. D. S. Johnson and L. A. McGeoch, "The traveling salesman problem: A case study in local optimization," in Local Search in Combinatorial Optimization, E. H. L. Aarts and J. K. Lenstra, Eds. New York: Wiley, 1997, pp. 215-310.
23. A. B. Kahng and B. R. Moon, "Toward more powerful recombinations," in Proc. 6th Int. Conf. Genetic Algorithms, 1995, pp. 96-103.
24. K. Katayama, and H. Narihisa, "Iterated local search approach using genetic transformation to the traveling salesman problem," in Proc. Genetic and Evolutionary Computation Conf., 1999, pp. 321-328.
25. S. Kirkpatrick, C. D. Gelatt Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, no. 4598, pp. 671-680, 1983.
26. P. Larranaga, C. Kuijpers, R. Murga, I. Inza, and S. Dizdarevic, "Genetic algorithms for the traveling salesman problem: A review of representations and operators," Artificial Intell. Rev., vol. 13, pp. 129-170, 1999.
27. S. Lin and B. Kernighan, "An effective heuristic algorithm for the traveling salesman problem," Oper. Res., vol. 21, no. 4598, pp. 498-516, 1973.
28. N. Linial, E. London, and Y. Rabinovich, "The geometry of graphs and some of its algorithmic applications," Foundations Comput. Sci., pp. 577-591, 1994.
29. 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.
30. P. Merz and B. Freisleben, "Genetic local search for the TSP: New results," in Proc. IEEE Conf. Evolutionary Computation, 1997, pp. 159-163.
31. B. R. Moon, Y. S. Lee and C. Kim, "VLSI circuit partitioner with a new genetic algorithm framework," J. Intell. Manufact., vol. 9, no. 5, pp. 401-412, 1998.
32. P. Moscato, "On evolution, search, optimization, genetic algorithms and martial arts: Toward memetic algorithms," Caltech Concurrent Computation Program, California Inst. Technol., Pasadena, 1989.
33. 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.
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. J. O'Rourke, Computational Geometry in C. Cambridge, U.K.: Cambridge Univ. Press, 1998.
36. J. Y. Potvin, "The traveling salesman problem: A neural network perspective," ORSA J. Comput., vol. 5, pp. 328-348, 1993.
37. G. Reinelt, "TSPLIB - A traveling salesman library," ORSA J. Comput., vol. 3, pp. 376-384, 1991.
38. D. Seniw, "A genetic algorithm for the traveling salesman problem," Ph.D. dissertation, Univ. North Carolina, Charlotte, 1991.
39. W. Smith, "Finding the optimum N-city traveling salesman tour in the Euclidean plan in subexponential time and polynomial space," unpublished, 1988.
40. T. Starkweather, S. McDaniel, K. Mathias, D. Whitley, and C. Whitley, "A comparison of genetic sequencing operators," in Proc. 4th Int. Conf. Genetic Algorithms, 1991, pp. 69-76.
41. J. Watson, C. Ross, V. Eisele, J. Denton, J. Bins, C. Guerra, D. Whitley, and A. Howe, "The traveling salesrep problem, edge assembly crossover, and 2-opt," in Proc. 5th Conf. Parallel Problem Solving from Nature, 1998.
42. 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.