Evolutionary computational approaches to solving the multiple traveling salesman problem using a neighborhood attractor schema

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2279 LNCS, Issue , 2002, Pages 153-162

  Sofge, Donald ^a   Schultz, Alan ^a   De Jong, Kenneth ^b  

^a NAVAL RESEARCH LABORATORY   (United States)

^b Krasnow Institute for Advanced Study   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; COMBINATORIAL OPTIMIZATION; GENETIC ALGORITHMS; K-MEANS CLUSTERING; MONTE CARLO METHODS; PARTICLE SWARM OPTIMIZATION (PSO); SIGNAL PROCESSING; ALGORITHMS; CLUSTERING ALGORITHMS; TRAVELING SALESMAN PROBLEM;

COMPUTATIONAL APPROACH; EUCLIDEAN; EVOLUTIONARY STRATEGIES; LOCAL NEIGHBORHOODS; MONTE CARLO OPTIMIZATION; MULTIPLE TRAVELING SALESMAN PROBLEMS; MULTIPLE TRAVELING SALESMAN PROBLEMS (MTSP); K-MEANS CLUSTERING;

TRAVELING SALESMAN PROBLEM; EVOLUTIONARY ALGORITHMS;

EID: 84878655011     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46004-7_16     Document Type: Conference Paper

References (13)

1. Bellman, R.E., "Dynamic programming treatment of the traveling salesman problem", Journal of the ACM, 9: 61-63 (1962)
2. Bellmore, M. and G.L. Nemhauser, "The traveling salesman problem: a survey", Operations Res. 16, 538-558 (1968)
3. Karp, R.M., "Probabilistic analysis of partitioning algorithms for the traveling-salesman problem in the plane", Math. of Operations Research, 2: 209-224 (1977)
4. Papadamitriou, C.H., "The Euclidean traveling salesman problem is NP-complete", Theoretical Computer Science, 4: 237-244 (1977)
5. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G and D.B. Shmoys. The traveling salesman problem. Wiley, New York (1985)
6. Arora, S., "Nearly linear time approximation schemes for Euclidean TSP and other geometric problems", In 38th Annual Symposium on Foundations of Computer Science, pages 554-563, Miami Beach, Florida, 20-22 October (1997)
7. Goldberg, D.E., "Messy genetic algorithms: Motivation, Analysis, and First results", Complex Systems, Vol. 3, pp. 493-530 (1989)
8. Jog, P., Suh, J.Y., and D. Van Gucht, "The Effects of Population Size, Heuristic Crossover and Local Improvement on a Genetic Algorithm for the Traveling Salesman Problem", Proc. of the 3rd Intl. Conference on Genetic Algorithms, pp. 110-115, Morgan Kaufmann, (1989)
9. Julstrom, B.A., "Insertion Decoding Algorithms and Initial Tours in a Weight-Coded GA for TSP", Genetic Programming 1998: Proc. of the Third Annual Conference, pp. 528-534, Morgan Kaufmann, 22-25 (1998)
10. Hansen, P., and N. Mladenoviæ, "J-Means: A new local search heuristic for minimum sum-of-squares clustering", Pattern Recognition, Vol. 34 (2) 405-413, 2001. (Pubitemid 32871885)
11. De Jong, K., Course on Evolutionary Computation, George Mason University, (1998)
12. Kennedy, J. and R.C. Eberhart, "Particle Swarm Optimization", Proc. IEEE Intl. Conf. on Neural Networks, pp. IV:1942-1948 (1995)
13. Eberhart, R.C., and Y. Shi, "Evolving Artificial Neural Networks", Proc. Intl. Conf. on Neural Networks and the Brain - Beijing (1998)