Perturbation method for probabilistic search for the traveling salesperson problem

Proceedings of SPIE - The International Society for Optical Engineering

Volumn 3455, Issue , 1998, Pages 118-127

  Cohoon, James P ^a   Karro, John E ^a   Martin, Worthy N ^a   Niebel, William D ^a   Nagel, Klaus ^b  

^a University of Virginia   (United States)

^b SIEMENS AG   (Germany)

Author keywords

Genetic algorithms; Minimum spanning tree; Probabilistic search; Traveling salesperson problem

Indexed keywords

APPLICATIONS; COMBINATORIAL MATHEMATICS; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL METHODS; DIESEL ENGINES; FUZZY LOGIC; FUZZY NEURAL NETWORKS; FUZZY SYSTEMS; GENETIC ALGORITHMS; GENETIC ENGINEERING; HEURISTIC ALGORITHMS; HEURISTIC METHODS; NEURAL NETWORKS; PERTURBATION TECHNIQUES; PROBABILITY; QUERY PROCESSING; TRAVELING SALESMAN PROBLEM; TREES (MATHEMATICS);

COMBINATORIAL OPTIMIZATION PROBLEMS; CONTROL STRATEGIES; GA SYSTEMS; HYBRID APPROACHES; MINIMAL SPANNING TREES; MINIMUM SPANNING TREE; ORIGINAL PROBLEMS; PERTURBATION METHODS; PROBABILISTIC SEARCH; SCHEDULING APPLICATIONS; SEARCH CONTROLS; SEARCH PROCESSES; SIMPLE MODIFICATIONS; SOLUTION QUALITIES; TRAVELING SALESPERSON PROBLEM; TRAVELING SALESPERSON PROBLEMS;

PROBABILISTIC LOGICS;

EID: 58149265150     PISSN: 0277786X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1117/12.326703     Document Type: Conference Paper

References (21)

1. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, "Introduction to algorithms," McGraw-Hill: New York, 1990.
2. L. Davis, "Applying adaptive algorithms to epistatic domains," International Conference on Genetic Algorithms and Their Applications, pp. 162-164, Los Angeles, CA, 1985.
3. M. R. Garey and D. S. Johnson, "Computers And Intractability - A guide to the theory of NP-completeness," W. H. Freeman and Co: San Francisco, CA, 979.
4. P. C. Gilmore, E. L. Lawler, and D. B. Shmoys, "Well-solved special cases," in "The traveling salesman problem," E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys (editors), Wiley: New York, 1985.
5. D. E. Goldberg, "Genetic Algorithms in Search, Optimization, and Machine Learning," Addison-Wesley: Reading, MA, 1988.
6. D. E. Goldberg, A R. Lingle, Jr., "Alleles, loci, and the traveling salesperson problem," International Conference on Genetic Algorithms and Their Applications, Pittsburgh, PA, pp. 154-159, 1985.
7. J. J. Grefenstette, R. Gopal, B. J. Rosmaita, and D. Van Gucht, "Genetic algorithms for the traveling salesperson problem," International Conference on Genetic Algorithms and Their Applications, pp. 160-168, Pittsburgh, PA, 1985.
8. J. H. Holland, "Adaptation in Natural and Artificial Systems," University of Michigan Press: Ann Arbor, MI, 1975.
9. S. Kirkpatrick, C. D. Gelatt, M. P. Vecchi, "Optimization by simulated annealing," Science, pp. 671-680, May 13, 1983.
10. J. B. Kruskal Jr., "On the shortest spanning subtree of a graph and the traveling salesman problem," Proceedings of the American Mathematical Society, pp. 48-50, 1956.
11. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, and D. B. Shmoys (editors), "The traveling salesman problem," Wiley: New York, 1985.
12. S. Lin and B. W. Kernighan, "An Effective Heuristic for the Travelling Salesman Problem," Operations Research, pp. 498-516, 1973.
13. I. M. Oliver, D. J. Smith, and J. R. C. Holland, "A study of permutation crossover operators on the traveling salesman problem," International Conference on Genetic Algorithms, Cambridge, MA, pp. 224-230, 1987.
14. J.-Y. Potvin, "Genetic algorithms for the traveling salesman problem," Annals of Operations Research, pp. 339-370, 1996.
15. R. C. Prim, "Shortest connection networks and some generalizations," Bell Systems Technical Journal, pp. 1389-1401, 1957.
16. R. M. Karp, "Probabilistic analysis of partitioning algorithms for the traveling-salesman problem," Mathematics for Operations Research, pp. 209-225, 1977.
17. G. Reinelt, "TSPLIB - A traveling salesman problem library," ORSA Journal on Computing, pp. 376-384, 1991. Data instances are available at University of Heidelberg, http://www.iwr.uni-heidelberg.de/iwr/ comopt/soft/TSPLIB95/TSPLIB.html.
18. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis, "An analysis of several heuristics for the traveling salesman problem," SIAM Journal of Computing, pp. 563-581, 1977.
19. T. Starkweather, S. McDaniel, K. Mathias, D. Whitely, C. Whitely, "A comparison of genetic sequencing operators, International Conference on Genetic Algorithms and Their Applications, pp. 69-76, 1991.
20. C. L. Valenzuela and L. P. Williams, "Improving Simple Heuristic Algorithms for the Travelling Salesman Problem using a Genetic Algorithm," International Conference on Genetic Algorithms, 1997, pp. 458-464.
21. D. Whitley, T. Starkweather, and D. Shaner, "Traveling salesman and sequence scheduling: quality solutions using genetic edge recombination," in "Handbook of genetic algorithms," L. Davis (editor), Van Nostrand Reinhold: New York, pp. 350-372, 1990.