Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Proceedings of the Ninth International Conference on Soft Computing and Pattern Recognition (SoCPaR 2017) (SoCPaR 2017)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 737))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM (JACM) 45, 753–782 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. 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. Dorigo, M., Birattari, M.: Ant colony optimization. In: Encyclopedia of Machine Learning. Springer (2010)

    Google Scholar 

  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. Kennedy, J.: Particle swarm optimization. In: Encyclopedia of Machine Learning, pp. 760-766. Springer, US (2011)

    Google Scholar 

  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)

    Article  MATH  Google Scholar 

  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. 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)

    Article  MathSciNet  MATH  Google Scholar 

  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. 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. Reinelt, G.: TSPLIB—A traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LAROSERI Laboratory, Department of Computer Science, Chouaib Doukkali University, El Jadida, Morocco

    Morad Bouzidi & Mohammed Essaid Riffi

  2. Department of Mathematics, Chouaib Doukkali University, El Jadida, Morocco

    Ahmed Serhir

Authors
  1. Morad Bouzidi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammed Essaid Riffi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ahmed Serhir
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Morad Bouzidi .

Editor information

Editors and Affiliations

  1. Machine Intelligence Research Labs , Auburn, Washington, USA

    Ajith Abraham

  2. Faculty of Sciences and Techniques, Hassan 1st University, Settat, Morocco

    Abdelkrim Haqiq

  3. Faculty of Information and Communication Technology, Universiti Teknikal Malaysia Melaka , Durian Tunggal, Melaka, Malaysia

    Azah Kamilah Muda

  4. Machine Intelligence Research Labs , Auburn, Washington, USA

    Niketa Gandhi

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bouzidi, M., Riffi, M.E., Serhir, A. (2018). Discrete Particle Swarm Optimization for Travelling Salesman Problems: New Combinatorial Operators. In: Abraham, A., Haqiq, A., Muda, A., Gandhi, N. (eds) Proceedings of the Ninth International Conference on Soft Computing and Pattern Recognition (SoCPaR 2017). SoCPaR 2017. Advances in Intelligent Systems and Computing, vol 737. Springer, Cham. https://doi.org/10.1007/978-3-319-76357-6_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-76357-6_14

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-76356-9

  • Online ISBN: 978-3-319-76357-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation