The travelling salesman's problem: A self-adapting PSO-ACS algorithm

ICIIS 2007 - 2nd International Conference on Industrial and Information Systems 2007, Conference Proceedings

Volumn , Issue , 2007, Pages 479-484

  Gómez Cabrero, David ^a   Armero, Carmen ^a   Nalin Ranasinghe, D ^b  

^a UNIVERSITY OF VALENCIA   (Spain)

^b UNIVERSITY OF COLOMBO   (Sri Lanka)

Author keywords

[No Author keywords available]

Indexed keywords

ARSENIC COMPOUNDS; COMPUTER NETWORKS; CONTROL THEORY; HEURISTIC METHODS; INFORMATION SCIENCE; INFORMATION SYSTEMS;

ANT COLONY SYSTEM; INTERNATIONAL CONFERENCES;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 51549117290     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICIINFS.2007.4579225     Document Type: Conference Paper

References (21)

1. B. Adenso-Díaz, M. Laguna, Fine-tuning of Algorithms Using Fractional Experimental Designs and Local Search, Operations Research, Vol. 5:1, pp. 99-114, 2006.
2. R. S. Barr, B. L. Golden, J. P. Kelly, M.G.C. Resende, W. R. Stewart, Designing and Reporting on Computational Experiments with Heuristic Methods, Journal of Heuristics 1:1, pp. 9-35, 1995.
3. M. Birrattari, T. Stutzle, L. Paquete, K. Varrentrapp, A Racing Algorithm For Configuring Metaheuristics, GECCO 2002, W. B. Langdon et al editors, Morgan Kaufmann Publishers, San Francisco, pp. 11-18, 2002.
4. N. K. Bose, P. Liang, Neural Networks Fundamentals with Graphs, Algorithms and Applications, McGraw-Hill, 1996.
5. E. K. Burke, G. Kendall, Search Metodologies - Introductory Tutorials in Optimization and Decision Support Techniques, Springer, 2005.
6. E. Cantu-Paz, A Summary of Research on Parallel Genetic Algorithms, IlliGAL Report No. 95007, July 1995.
7. S. P. Coy, B. L. Golden, G. C. Runger, E. A. Wasil, Using Experimental Design to Find Effective parameter settings for heuristics, Journal of Heuristics 7:1, pp. 77-97, 2001.
8. M. Dorigo, L. M. Gambardella, Ant Colony System: A Cooperative Learning Aproach to the Travelling Salesman Problem, IEEE Transactions on Evolutionary Computation, 1:1, pp. 53-66, 1997.
9. M. Dorigo, V. Maniezzo, A. Colorni, The Ant System: Optimization by a Colony of Cooperating Agents, IEEE Transactions on Systems, Man and Cybernetics, Part B, 26:1, pp. 29-42, 1996.
10. M. Dorigo, T. Stutzle, Ant Colony Optimization, MIT Press, 2004.
11. L. M. Gambardella, M. Dorigo, Ant-Q: A reinforcement Learning Approach to the Symmetric and Asymmetric Travelling Salesman Problems, Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'96), Morgan Kaufmann, pp. 252-260, 1995.
12. E. Gamma, R. Helm, R. Johnson, J. Vlissides, Design Patterns - Elements of Reusable Object-Oriented Software, Addison-Wesley, 1995.
13. F. Glover, Tabu search-part I, ORSA Journal of Computing 1:3 pp. 190-206, 1989.
14. D. Gómez-Cabrero, D. N, Ranasinghe, Fine-tuning the Ant Colony System algorithm through Particle Swarm Optimization, Proceedings of the International Conference on Information and Automation, Colombo, Sri Lanka, 2005.
15. G. Gutin, A. P. Punnen, The Travelling Salesman Problem and its Variations, Combinatorial Optimization: Springer, 2002.
16. F. Hutter, Y. Hamadi, Parameter Adjustement Based on Performance Prediction: Towards an Instance-Aware Problem Solver, Technical Report MSR-TR-2005-125, Microsoft Research, 2005.
17. J. Kennedy, R. C. Eberhart, Particle Swarm Optimization, Proc. IEEE International Conference on Neural Networks, Piscataway, NJ, USA, pp. 1942-1948, 1995.
18. J. Kennedy, R. C. Eberhart, Swarm Intelligence, Morgan Kaufmann Publishers, 2001.
19. C. C. Lo, C. C. Hus, Annealing framework with learning memory, IEEE Transactions on System, Man, Cybernetics, Part A 28:5, pp. 1-13, 1998.
20. M. L. Pilat, T. White, Using Genetic Algorithms to optimize ACS-TSP, Proc. Third International Workshop on Ant Algorithms, pp. 282-287, 2002.
21. G. Reinelt, TSPLIB- A travelling Salesman Problem Library for TSP Applications, ORSA Journal of Computing, 3, pp. 376-384, 1991.