Advertisement

Discrete Particle Swarm Optimization for Travelling Salesman Problems: New Combinatorial Operators

  • Morad Bouzidi
  • Mohammed Essaid Riffi
  • Ahmed Serhir
Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 737)

Abstract

The Particle Swarm Optimization is one of the most famous nature inspired algorithm that belongs to the swarm optimization family. It has already been used successfully in the continuous problem. However, this algorithm has not been explored enough for the discrete domain. In this work we introduce new operators that are dedicated to combinatorial research that we implemented on a modified discrete particle swarm optimization called DPSO-CO to solve travelling salesman problem. The experimental results on a set of different instances, and the comparison study with others adaptations show that adopting new ways, combinations and operators gives birth to a really competitive efficient algorithm in operational research.

Keywords

Combinatorial research Discrete operators Particle swarm optimization Travelling salesman problem 

References

  1. 1.
    Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM (JACM) 45, 753–782 (1998)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Grefenstette, J., Gopal, R., Rosmaita, B., Van Gucht, D.: Genetic algorithms for the traveling salesman problem. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications. Lawrence Erlbaum, Hillsdale (1985)Google Scholar
  3. 3.
    Bouzidi, M., Riffi, M.E.: Adaptation of the harmony search algorithm to solve the travelling salesman problem. J. Theor. Appl. Inf. Technol. 62(1) (2014)Google Scholar
  4. 4.
    Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: 2003 International Conference on Machine Learning and Cybernetics (2003)Google Scholar
  5. 5.
    Dorigo, M., Birattari, M.: Ant colony optimization. In: Encyclopedia of Machine Learning. Springer (2010)Google Scholar
  6. 6.
    Wong, L.P., Low, M.Y.H., Chong, C.S.: A bee colony optimization algorithm for traveling salesman problem. In: Modeling & Simulation, AICMS 2008 (2008)Google Scholar
  7. 7.
    Kennedy, J.: Particle swarm optimization. In: Encyclopedia of Machine Learning, pp. 760-766. Springer, US (2011)Google Scholar
  8. 8.
    Chen, A.L., Yang, G.K., Wu, Z.M.: Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J. Zhejiang Univ.-Sci. A 7(4), 607–614 (2006)CrossRefzbMATHGoogle Scholar
  9. 9.
    Kennedy, J., Eberhart, R.C.: A discrete binary version of the particle swarm algorithm. In: Systems, Man, and Cybernetics, 1997. Computational Cybernetics and Simulation (1997)Google Scholar
  10. 10.
    Pan, Q.K., Tasgetiren, M.F., Liang, Y.C.: A discrete particle swarm optimization algorithm for the no-wait flowshop scheduling problem. Comput. Oper. Res. 35(9), 2807–2839 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Clerc, M.: Discrete particle swarm optimization, illustrated by the traveling salesman problem. In: New Optimization Techniques in Engineering, pp. 219–239 (2004)Google Scholar
  12. 12.
    Eberhart, R., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Science (1995)Google Scholar
  13. 13.
    Reinelt, G.: TSPLIB—A traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Mahi, M., Baykan, Ö.K., Kodaz, H.: A new hybrid method based on particle swarm optimization, ant colony optimization and 3-opt algorithms for traveling salesman problem. Appl. Soft Comput. 30, 484–490 (2015)CrossRefGoogle Scholar
  15. 15.
    Ouaarab, A., Ahiod, B., Yang, X.S.: Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput. Appl. 24(7–8), 1659–1669 (2014)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  • Morad Bouzidi
    • 1
  • Mohammed Essaid Riffi
    • 1
  • Ahmed Serhir
    • 2
  1. 1.LAROSERI Laboratory, Department of Computer ScienceChouaib Doukkali UniversityEl JadidaMorocco
  2. 2.Department of MathematicsChouaib Doukkali UniversityEl JadidaMorocco

Personalised recommendations