Integrate the Hungarian method and genetic algorithm to solve the shortest distance problem

Proceedings - 2012 3rd International Conference on Digital Manufacturing and Automation, ICDMA 2012

Volumn , Issue , 2012, Pages 496-499

  Huang, Chin Jung ^a  

^a ST JOHN'S UNIVERSITY   (Taiwan)

Author keywords

Genetic Algorithm; Hungarian Method; Shortest Distance; Traveling Salesman problem

Indexed keywords

HUNGARIAN METHOD; SHORTEST DISTANCE;

MANUFACTURE; PERSONAL COMPUTERS; TRAVELING SALESMAN PROBLEM;

GENETIC ALGORITHMS;

EID: 84868223590     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMA.2012.118     Document Type: Conference Paper

References (10)

1. G. Dantzig, R. Fulkerson, and S. Johnson, "Solution of a large-scale traveling-salesman problem", Operations Research, 2, 1954, pp.393-410.
2. R. Bellman, "Combinatorial processes and dynamic programming", in: Combinatorial Analysis (R. Bellman and M. Hall, Jr., eds.), American Mathematical Society, 1960, pp.217-249.
3. R.L. Karg and G.L. Thompson, "A heuristic approach to solving traveling salesman problems", Management Science , 10, 1964, pp.225-248.
4. E.L. Lawler and D.E. Wood, "Branch-and-bound methods: a survey", Operations Research, 14, 1966, pp.699-719.
5. B. Fleischmann, "A cutting plane procedure for the travelling salesman problem on road networks", European Journal of Operational Research, 21, 1985, pp.307-317.
6. D. Applegate, R. Bixby, V. Chvátal, and W. Cook, "Finding cuts in the TSP (A preliminary report)", DIMACS Technical Report 95-05, 1995.
7. J.V. Potvin, "Genetic Algorithms for the Traveling Salesman Problem", Annals of Operations Research, 63, 1996, pp.339-370.
8. Traveling Salesman Problem-Home Page(www.math.Princeton.edu/tsp/)
9. M.M. Flood, "The traveling-salesman problem", Operations Research 4, 1956, pp.61-75.
10. Liu, Han-Chu, "Traveling Salesman Problem", Journal of Mathematic, vol. 11, no.3, Taipei, 1987.