A hybrid particle swarm optimization algorithm for combinatorial optimization problems

2010 IEEE World Congress on Computational Intelligence, WCCI 2010 - 2010 IEEE Congress on Evolutionary Computation, CEC 2010

Volumn , Issue , 2010, Pages

  Rosendo, Matheus ^a   Pozo, Aurora ^a  

^a FEDERAL UNIVERSITY OF PARANÁ   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION PROBLEMS; CONTINUOUS OPTIMIZATION PROBLEMS; DISCRETE PROBLEMS; HYBRID PARTICLE SWARM OPTIMIZATION ALGORITHM; HYBRID PSO; INTELLIGENT BEHAVIOR; LOCAL SEARCH; PARTICLE SWARM OPTIMIZATION ALGORITHM; PATH RELINKING; PATH RELINKING ALGORITHMS; PSO ALGORITHMS; SWARM INTELLIGENCE;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; CELLULAR AUTOMATA; COMBINATORIAL OPTIMIZATION; TRAVELING SALESMAN PROBLEM;

PARTICLE SWARM OPTIMIZATION (PSO);

EID: 79959390413     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2010.5586178     Document Type: Conference Paper

References (31)

1. J. Kennedy and R. C. Eberhart, "Particle swarm optimization," in Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, USA, 1995, pp. 1942-1948.
2. -, "A discrete binary version of the particle swarm algorithm," Systems, Man, and Cybernetics, 1997. 'Computational Cybernetics and Simulation'., 1997 IEEE International Conference on, vol. 5, pp. 4104-4108 vol.5, 1997.
3. X. Hu, R. C. Eberhart, and Y. Shi, "Swarm intelligence for permutation optimization: a case study on n-queens problem," in Proceedings of the IEEE Swarm Intelligence Symposium 2003, 2003, pp. 243-246.
4. C.-J. Liao, C.-T. Tseng, and P. Luarn, "A discrete version of particle swarm optimization for flowshop scheduling problems," Computers and Operations Research, vol. 34, no. 10, pp. 3099-3111, 2007.
5. C. Blum and A. Roli, "Metaheuristics in combinatorial optimization: Overview and conceptual comparison," ACM Computing Surveys (CSUR), vol. 35, no. 3, pp. 268-308, 2003.
6. S. Johnson, Emergence: The Connected Lives of Ants, Brains, Cities, and Software. Scribner, 2001.
7. M. Reyes-Sierra and C. A. Coello, "Multi-objective particle swarm optimizers: A survey of'the state-of-the-art," International Journal of Computational Intelligence Research, 2006.
8. A. B. de Carvalho, "Otimizção por nuvem de partículas multiobjetivo no aprendizado indutivo de regras: extensões e aplicacações," Master's thesis, Universidade Federal do Paraná, 2008.
9. J. S. Vesterstrm and J. Riget, "Particle swarms: Extensions for improved local, multi-modal, dynamic search in numerical optimization," Master's thesis, Faculty of Science, Aarhus Universitet, 2002.
10. A. Torácio, "Aprendizado de regras de classificaç ão com otimização por nuvem de partículas multiobjetivo," Master's thesis, Universidade Federal do Paraná, 2008.
11. M. Clerc, "Discrete particle swarm optimization, illustrated by the traveling salesman problem," in New Optimization Techniques in Engineering, Springer, 2004, pp. 219-239.
12. Y. Marinakis and M. Marinaki, "A particle swarm optimization algorithm with path relinking for the location routing problem," Journal of Mathematical Modelling and Algorithms, 2008.
13. E. F. G. Goldbarg, G. R. de Souza, and M. C. Goldbarg, "Particle swarm for the traveling salesman problem," in EvoCOP, 2006, pp. 99-110.
14. W.-N. Chen, J. Zhang, H. S. H. Chung, W.-L. Zhong, W.-G. Wu, and Y.-h. Shi, "A novel set-based particle swarm optimization method for discrete optimization problems," Evolutionary Computation, IEEE, 2009.
15. D. B. West, Introduction to Graph Theory (2nd Edition). Prentice Hall, August 2000.
16. Z. Michalewicz and D. B. Fogel, How to Solve It: Modern Heuristics. Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2004.
17. F. Glover and M. Laguna, Tabu search. Boston, MA: Kluwer Academic Publishers. xix, 1997.
18. -, "Fundamentals of scatter search and path relinking," Control and Cybernetics, vol. 29, no. 3, pp. 653-684, 2000.
19. R. P. Beausoleil, G. Baldoquin, and R. A. Montejo, "Multi-start and path relinking methods to deal with multiobjective knapsack problems," Annals of Operations Research, vol. 157, pp. 105-133, 2007.
20. S. Ronald, "More distance functions for order-based encodings," in Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on, May 1998, pp. 558-563.
21. K. G. Murty, Linear and Combinatorial Programming. Robert E. Krieger: Florida, 1985.
22. S. Lin and B. W. Kernighan, "An effective heuristic algorithm for the traveling-salesman problem," Operations Research, vol. 21, no. 2, pp. 498-516, 1973.
23. D. Applegate, R. Bixby, V. Chvtal, and W. Cook, "Finding tours in the tsp," in Institute for Discrete Mathematics, Universitat Bonn, 1999.
24. D. S. Johnson and L. A. McGeoch, "Experimental analysis of heuristics for the stsp," in Local Search in Combinatorial Optimization. Wiley & Sons, 2001.
25. Y. Shi and R. Eberhart, "A modified particle swarm optimizer," in Evolutionary Computation Proceedings, 1998. IEEE World Congress on Computational Intelligence., The 1998 IEEE International Conference on, May 1998, pp. 69-73.
26. X. Li, P. Tian, J. Hua, and N. Zhong, "A hybrid discrete particle swarm optimization for the traveling salesman problem," in Simulated Evolution and Learning, vol. 4247, 2006, pp. 181-188.
27. T. Machado and H. Lopes, Adaptive and Natural Computing Algorithms. Springer Vienna, 2005, ch. A hybrid particle swarm optimization model for the traveling salesman problem, pp. 255-258.
28. K.-P. Wang, L. Huang, C.-G. Zhou, and W. Pang, "Particle swarm optimization for traveling salesman problem," in Proceedings of the 2003 International Conference on Machine Learning and Cybernetics, 2003, pp. 1583-1585.
29. X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu, and Q. X. Wang, "Particle swarm optimization-based algorithms for tsp and generalized tsp," Inf. Process. Lett., vol. 103, no. 5, pp. 169-176, 2007.
30. J. Liang, A. Qin, P. Suganthan, and S. Baskar, "Comprehensive learning particle swarm optimizer for global optimization of multimodal functions," Evolutionary Computation, IEEE Transactions on, vol. 10, no. 3, pp. 281-295, June 2006.
31. M. Dorigo and L. M. Gambardella, "Ant colony system: A cooperative learning approach to the traveling salesman problem," TR/IRIDIA/1996-5 Universit Libre de Bruxelles Belgium, 1996.