A parallel hybrid heuristic for the tsp

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

Volumn 2037, Issue , 2001, Pages 193-202

  Ranieri, Ranieri Baraglia ^a   Hidalgo, José Ignacio ^b   Raffaele, Raffaele Perego ^a  

^a ISTI CNR   (Italy)

^b UNIVERSIDAD COMPLUTENSE DE MADRID   (Spain)

Author keywords

Compact genetic algorithm; Hybrid GA; Lin Kernighan algorithm; Parallel algorithms; TSP

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; PARALLEL ALGORITHMS;

CLUSTER OF WORKSTATIONS; COARSE-GRAINED PARALLELS; COMPACT GENETIC ALGORITHM; EFFICIENT IMPLEMENTATION; HYBRID GA; HYBRID HEURISTICS; LIN-KERNIGHAN ALGORITHM; LOCAL SEARCH HEURISTICS;

TRAVELING SALESMAN PROBLEM;

EID: 84958033812     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45365-2_20     Document Type: Conference Paper

References (26)

1. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
2. J. Grefenstette, R. Gopal, B. Rosimaita, and D. van Gucht. Genetic algorithms for the traveling salesman problem. In Proceedings of the International Conference on Genetics Algorithms and their Applications, pages 160-168, 1985.
3. H. C. Braun. On solving traveling salesman problems by genetic algorithm. In H. P. Schwefel and R. Manner, editors, Parallel Problem Solving from Nature, volume 496 of Lecture Notes in Computer Science, pages 129-133, Berlin, 1991. Springer-Verlag.
4. G. A. Croes. A method for solving traveling salesman problems. Operations Research, 6:791-812, 1958.
5. S. Lin. Computer solution of the traveling salesman problem. Bell System Technical Journal, 44:2245-2269, 1965.
6. S. Lin and B. W. Kernighan. An effective heuristic algorithm for the traveling salesman problem. Operations Research, 21:498-516, 1973.
7. D. S. Johnson and L. A. McGeoch. Local Search in Combinatorial Optimization, chapter The Traveling Salesman Problem: A Case Study in Local Optimization. John Wiley and Sons, New York, 1996.
8. D. Applegate, R. Bixby, V. Chvatal, and W. Cook. Finding tours in the tsp. Preliminary chapter of a planned monograph on the TSP, available at URL: http://www.caam.rice.edu/~keck/reports/lk_report.ps, 1999.
9. O. Martin and S.W. Otto. Combining simulated annealing with local search heuristic. To appear on Annals of Operation Research.
10. P. Merz and B. Freisleben. Genetic local search for the TSP: New results. In Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pages 159-163, Indianapolis, USA, 1997. IEEE press.
11. M. Gorges-Schleuter. Asparagos96 and the travelling salesman problem. In T. Bäck, editor, Proceedings of the Fourth International Conference on Evolutionary Computation, pages 171-174, New York, IEEE Press, 1997.
12. R. Perego R. Baraglia, J. I. Hidalgo. A hybrid approach for the TSP combining genetics and the Lin-Kerninghan local search. Technical Report CNUCE-B4-2000-007, CNUCE-Institute of the Italian National Research Council, 2000.
13. R. Perego,R. Baraglia, J. I. Hidalgo. A hybrid approach for the Traveling Salesman Problem. submitted paper.
14. G. Harik, F. Lobo, and D. Goldberg. The compact genetic algorithm. IEEE Transactions on Evolutionary Computation, 3(4):287-297, 1999.
15. D. Thierens and D. Goldberg. Mixing in genetic algorithms. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages38-45, San Mateo, CA, 1993. Morgan Kaufmann.
16. E. Cantu-Paz. A survey of parallel genetic algoritms. Technical Report 97003, University of Illinois at Urbana-Champaign, Genetic Algoritms Lab. (IlliGAL), http://gal4.ge.uiuc.edu/illigal.home.html, July 1997.
17. M. Tomassini. A survey of genetic algorithms. Technical Report 95/137, Department of Computer Science, Swiss Federal Institute of Technology, Lausanne, Switzerland, July 1995.
18. P. Grosso. Computer Simulations of Genetic Adaptation: Parallel Subcomponent Interaction in a Multilocus Model. PhD thesis, University of Michigan, 1985.
19. R. Tanese. Parallel genetic algorithms for a hypercube. In Proceedings of the Second International Conference on Genetic Algorithms, pages 177-183. L. Erlbaum Associates, 1987.
20. R. Tanese. Distribuited genetic algorithms. In Proceedings of the Third International Conference on Genetic Algorithms, pages 434-440. M. Kaufmann, 1989.
21. S. Cohoon, J. Hedge, S. Martin, and D. Richards. Punctuated equilibria: a parallel genetic algorithm. IEEE Transaction on CAD, 10(4):483-491, April 1991.
22. C. Pettey, M. Lenze, and J. Grefenstette. A parallel genetic algorithm. In Proceedings of the Second International Conference on Genetic Algorithms, pages 155-161. L. Erlbaum Associates, 1987.
23. H. Muhlenbein, M. Schomisch, and J. Born. The parallel genetic algorithm as function optimizer. Parallel Computing, 17:619-632, 1991.
24. W. Gropp, E. Lusk, and A. Skjellum. Using MPI. Massachusetts Institute of Technology, 1999.
25. D. E. Culler and J. P. Singh. Parallel Computer Architecture a Harware/Sotware Approach. Morgan Kaufmann Publishers, Inc, 1999.
26. G. Reinelt. TSPLIB-A traveling salesman problem library. ORSA Journal on Computing, 3:376-384, 1991.