Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Performance Comparison of Discrete Particle Swarm Optimizations in Sequencing Problems

순서화 문제에서 01산적 Particle Swarm Optimization들의 성능 비교

  • Yim, D.S. (Dept. of Industrial and Management Engineering, Hannam University)
  • 임동순 (한남대학교 산업경영공학과)
  • Received : 2010.09.01
  • Accepted : 2010.09.28
  • Published : 2010.12.31
Download PDF
⟨ Previous Next ⟩

Abstract

Particle Swarm Optimization (PSO) which has been well known to solve continuous problems can be applied to discrete combinatorial problems. Several DPSO (Discrete Particle Swarm Optimization) algorithms have been proposed to solve discrete problems such as traveling salesman, vehicle routing, and flow shop scheduling problems. They are different in representation of position and velocity vectors, operation mechanisms for updating vectors. In this paper, the performance of 5 DPSOs is analyzed by applying to traditional Traveling Salesman Problems. The experiment shows that DPSOs are comparable or superior to a genetic algorithm (GA). Also, hybrid PSO combined with local optimization (i.e., 2-OPT) provides much improved solutions. Since DPSO requires more computation time compared with GA, however, the performance of hybrid DPSO is not better than hybrid GA.

Keywords

References

  1. Anghinolfi, D. and Paolucci, M.; "A new discrete particle swarm optimization approach for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times," European Journal of Operations Research, 193 : 73-85. 2009. https://doi.org/10.1016/j.ejor.2007.10.044
  2. Chandrasekaran, S., Ponnambalam, S. G., Suresh, R. K., and Vijayakumar, N.; "An Application of particle swarm optimization algorithm to permutation flow shop scheduling problems to minimize makespan, total flowtime and completion time variance," 2006 IEEE International Conference on Automation Science and Engineering, 513-518, 2006.
  3. Cunkas, M and Ozsaglam, M. A.; "A Comparative Study on Particle Swarm Optimization and Genetic Algorithms for Traveling Salesman Problems," Cybernetics and Systems : An International Journal 40 : 490-507, 2009. https://doi.org/10.1080/01969720903068435
  4. Davis, L.; "Applying Adaptive Algorithms to Epistatic Domains," Proceedings of the International Joint Conference on Artificial Intelligence, 162-164, 1985.
  5. Goldberg, D. E. and Lingle, R.; "Alleles, Loci, and the TSP," Proceedings of the First International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, 154-159, 1985.
  6. Hu, X., Eberhart, R. C., and Shi, Y.; "Swarm Intelligence for Permutation Optimization : A Case Study of n-Queens Problem," 2003 IEEE Swarm Intelligence Symposium, 243-246, 2003.
  7. Johnson, D. S. and McGeoch, L. A.; "The Traveling Salesman Problem : A Case Study in Local Optimization," Local Search in Combinatorial Optimization, Aarts, EHL and Lenstra, JK(Ed.) John Whiley and Sons, London, 215-310, 1997.
  8. Kennedy, J. and Eberhart, R. C.; "Particle Swarm Optimization," Proceeding of the 1995 IEEE International Conference on Neural Networks, 1942-1948, 1995.
  9. Liao, Ching-Jong, Tseng, Chao-Tang, and Luarn, Pin; "A discrete version of particle swarm optimization for flowshop scheduling problems," Computers and OR 34 : 3099-3111, 2007. https://doi.org/10.1016/j.cor.2005.11.017
  10. Marinakis, Y. and Marinaki, M.; "A Hybrid geneticParticle Swarm Optimization Algorithms for the Vehicle Routing Problem," Expert Systems with Applications, 37 : 1446-1455, 2010. https://doi.org/10.1016/j.eswa.2009.06.085
  11. Oliver, I. M., Smith, D. J., and Holland, J. R. C.; "A Study of Permutation Crossover Operators on the traveling Salesman Problem," Proceedings of the Second International Conference on Genetic Algorithms, Lawrence Erlbaum Associates, Hillsdale, NJ, 224-230, 1987.
  12. Pang W., Wang K., Zhou C., Dong L.; "Fuzzy discrete particle swarm optimization for traveling salesman problem," Proceedings of the fourth international conference on computing and information technology(CIT'04), 796-800, 2004.
  13. Potvin, J. Y.; "Genetic Algorithms for the Traveling Salesman Problem," Annals of Operations Research, 63 : 339-370, 1996.
  14. Shi, X. H., Liang, Y. C., Lee, H. P., Lu, C., and Wang, Q. X.; "Particle Swarm Optimization-based algorithms for TSP and generalized TSP ," Information Processing Letters, 103 : 169-176, 2007. https://doi.org/10.1016/j.ipl.2007.03.010
  15. Tasgetiren, F., Sevkli, M., Lian, Y. C., and Gencyilmaz, G.; "Particle Swarm Optimization algorithm for single machine weighted tardiness problem," Proceedings IEEE congress on evolutionary computation, 1412-1419, 2004.
  16. Zhong, Wei-Liang, Zhang, Jung, and Chen, Wei-Neng; "A novel discrete particle swarm optimization to solve traveling salesman problem," Proceedings IEEE Congress on Evolutionary Computation, 3283-3287, 2007.
  17. TSPLIB: http://comopt.ifi.uni-heidelberg.de/sofiware/TSPLIB95/.