A particle swarm-based metaheuristic to solve the travelling salesman problem

Proceedings of the 2006 International Conference on Artificial Intelligence, ICAI'06

Volumn 2, Issue , 2006, Pages 698-702

  Gomez, A ^a   Gonzalez K ^a   Parreno, J ^a   Pino, R ^a  

^a UNIVERSITY OF OVIEDO   (Spain)

Author keywords

Combinatorial Optimization; Hamiltonian cycle; Local Search; Metaheuristic; Particle swarrm particle swarm; The travelling salesman problem (TSP)

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; GUIDED LOCAL SEARCH; HAMILTONIAN CYCLE; LOCAL SEARCH; LOCAL SEARCH TECHNIQUES; META-HEURISTIC TECHNIQUES; METAHEURISTIC; PARTICLE SWARM; TRAVELLING SALESMAN PROBLEM; TSP PROBLEMS;

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; HAMILTONIANS;

TRAVELING SALESMAN PROBLEM;

EID: 84857109682     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Banzhaf, W., The "Molecular" Traveling Salesman. Biological Cybernetics 64, pp. 7-14, 1990.
2. Clerc, M., Discrete Particle Swarm Optimization: Illustrated by the Traveling Salesman Problem. 29 February 2000, http://www.mauriceclerc.net
3. Croes, G. A., A method for solving traveling salesman problems. Operations Res. 6, pp. 791-812, 1958.
4. Dorigo, M., and Gambardella, L.M., Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation, vol. 1, no. 1, pp. 53-66, 1997.
5. Reenter, C.N., A Parallel Tabu Search Algorithm for Large Scale Traveling Salesman Problems. Working Paper 90/1, Department of Mathematics, Ecole Polytechnique Federale de Lausanne, Switzerland, 1990.
6. Flood, M. M., The traveling-salesman problem. Operations Res. 4, pp. 61-75, 1956.
7. Fogel, D.B., An Evolutionary Approach to the Traveling Salesman Problem. Biological Cybernetics 60, pp. 139-144, 1988.
8. Hernandez, E., Coello, C.A., y Aguirre, A.H., Diseno de Circuitos Logicos Combinatorios usando Optimizacion mediante Cumulos de Partículas. Memorias de la 9 conferencia de Ingenieria Elgctrica, CINVESTAV-IPN, pp. 485-491, Mexico D.F., Septiembre de 2003.
9. Hoffman, K., and Padberg, M., Traveling Salesman Problem. George Mason University, http://iris.gmu.edu/~khoffman/papcrs/travsalcsman.html
10. Hu, X., Eberhart, R.C., and Shi, Y., Swarm Intelligence for Permutation Optimization: A Case Study on n-Queens Problem. IEEE Swarm Intelligence Symposium 2003, Indianapolis, IN, USA.
11. Johnson, D.S., and McGeoch, L.A., The traveling salesman problem: a case study in local optimization, in: E. Aarts, J.K. Lenstra (Eds.), Local Search in Combinatorial Optimization, Wiley, New York, 1997.
12. Kennedy, J., Eberhart, R.C., and Shi, Y., Swarm Intelligence. Morgan Kaufmann, 2001.
13. Lastra, M., y Gomez, A., Programapara la resolucion del problema del viajanle de comercio mediante diversas ticnicas de inteligencia artificial. Proyecto fin de carrera num. 1001060, Area de Organization de Empresas, Universidad de Oviedo, Junio 2001.
14. Lin, S., Computer Solutions to the Traveling Salesman Problem. Bell Syst. Tech. Jou. 44, pp. 2245-2269, 1965.
15. Lin, S., and Kernighan, B.W., An Effective Heuristic Algorithm for the Traveling Salesman Problem. Operations Researchs 20, pp. 498-516, 1973.
16. Michalewicz, Z., Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag, Berlin Heidelberg, 1992.
17. Oliver, I.M., Smith, D.J., and Holland, J.R.C., A Study of Permutation Crossover Operators on the TSP. in Grefenstette, J.J. (Ed.) Genetic Algorithms and Their Applications: Proceedings of the Second International Conference, Lawrence Blbaum, Hillsdale, New Jersey, pp. 224-230, 1987.
18. Pomeroy, P., An Introduction to Particle Swarm Optimization. March 2003, http://www.adaptiveview.eom/articles/ipsopl.hlml
19. Potvin, J.V., The Traveling Salesman Problem: A Neural Network Perspective. INFORMS Journal on Computing 5, pp. 328-348, 1993.
20. Potvin, J.V., Genetic Algorithms for the Traveling Salesman Problem. Annals of Operations Research 63, pp. 339-370, 1996.
21. Romano, C.A., y Lozano, S., Un algoritmo basado en cúmulos de partíeulas para la resolucion de problemas de agrupación celular de máquinas. Actas del II Congreso Español sobre Metaheuristicas, Algoritmos Evolutivos y Bioinspirados, Gijon (Asturias), Departamento de Informática, Universidad de Oviedo, 134-138, 2003.
22. Reinelt, G., TSPLIB - A traveling salesman library. Department of Computer Science, University of Heidelberg, Germany, http://www.iwr.uni- heidelberg.de/groups/cornopt/software/TSPLIB95/
23. Vesterstrom, J., and Riget, J., Particle Swarms: Extensions for improved local, multi-modal, and dynamic search in numerical optimization. Master's Thesis, Department of Computer Science, University of Aarhus.2002.