Skip to main content

Hybrid Penguins Search Optimization Algorithm and Genetic Algorithm Solving Traveling Salesman Problem

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 25))

Abstract

This paper is to present a hybrid technique of two metaheuristic algorithm Penguins Search optimization Algorithm (PeSOA) and the genetic algorithm (GA) called HPeSOA, which was proposed to solve the combinatorial optimization problem NP-hard Traveling salesman problem. In this algorithm, we improve the population of the solutions by the integration of the genetic operators, namely the crossover and the mutation in the algorithm PeSOA. The experimental results of the application of HPeSOA algorithm on the instances TSPLIB are reported and compared, with the results of Penguins Search optimization Algorithm and the genetic algorithm.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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

Learn about institutional subscriptions

References

  1. Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44(10), 2245–2269 (1965)

    Article  MATH  MathSciNet  Google Scholar 

  2. Johnson, D.S.: Local optimization and the traveling salesman problem. In: International Colloquium on Automata, Languages, and Programming, pp. 446–461. Springer, Berlin (1990)

    Google Scholar 

  3. Bayram, H., Şahin, R.: A new simulated annealing approach for travelling salesman problem. Math. Comput. Appl. 18(3), 313–322 (2013)

    MathSciNet  Google Scholar 

  4. Fiechter, C.N.: A parallel tabu search algorithm for large traveling salesman problems. Discrete Appl. Math. 51(3), 243–267 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chatterjee, S., Carrera, C., Lynch, L.A.: Genetic algorithms and traveling salesman problems. Eur. J. Oper. Res. 93(3), 490–510 (1996)

    Article  MATH  Google Scholar 

  6. Ahmed, Z.H.: Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. Int. J. Biometrics Bioinf. (IJBB) 3(6), 96 (2010)

    Google Scholar 

  7. Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Biosystems 43(2), 73–81 (1997)

    Article  Google Scholar 

  8. Wang, K.P., Huang, L., Zhou, C.G., Pang, W.: Particle swarm optimization for traveling salesman problem. In: The 2003 International Conference on Machine Learning and Cybernetics, pp. 1583–1585. IEEE Press, Xi’an(2003)

    Google Scholar 

  9. Wong, L.P., Low, M.Y.H., Chong, C.S.: A bee colony optimization algorithm for traveling salesman problem. In: 2008 Second Asia International Conference on Modelling & Simulation (AICMS), pp. 818–823. IEEE Press, Kuala Lumpur (2008)

    Google Scholar 

  10. Mzili, I., Riffi, M.E.: Discrete penguins search optimization algorithm to solve the traveling salesman problem. J. Theor. Appl. Inf. Technol. 72(3), 331–336 (2015)

    Google Scholar 

  11. Mzili, I., Bouzidi, M., Riffi, M.E.: A novel hybrid penguins search optimization algorithm to solve travelling salesman problem. In: 2015 Third World Conference on Complex Systems (WCCS), pp. 1–5. IEEE Press, Marrakech (2015)

    Google Scholar 

  12. Yugay, O., Kim, I., Kim, B., Ko, F.I.: Hybrid genetic algorithm for solving traveling salesman problem with sorted population. In: Third International Conference on Convergence and Hybrid Information Technology(ICCIT 2008), pp. 1024–1028. IEEE Press, Busan (2008)

    Google Scholar 

  13. Fang, L., Chen, P., Liu, S.: Particle swarm optimization with simulated annealing for TSP. In: Proceedings of the 6th WSEAS International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases (AIKED 2007), Corfu Island, Greece, pp. 206–210 (2007)

    Google Scholar 

  14. Geng, X., Chen, Z., Yang, W., Shi, D., Zhao, K.: Solving the traveling salesman problem based on an adaptive simulated annealing algorithm with greedy search. Appl. Soft Comput. 11(4), 3680–3689 (2011)

    Article  Google Scholar 

  15. Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge (1992)

    Google Scholar 

  16. Gheraibia, Y., Moussaoui, A.: Penguins search optimization algorithm (PeSOA). In: International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, pp. 222–231. Springer, Heidelberg (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Ilyass Mzili .

Editor information

Editors and Affiliations

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

Mzili, I., Riffi, M.E., Benzekri, F. (2018). Hybrid Penguins Search Optimization Algorithm and Genetic Algorithm Solving Traveling Salesman Problem. In: Ezziyyani, M., Bahaj, M., Khoukhi, F. (eds) Advanced Information Technology, Services and Systems. AIT2S 2017. Lecture Notes in Networks and Systems, vol 25. Springer, Cham. https://doi.org/10.1007/978-3-319-69137-4_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-69137-4_41

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-69136-7

  • Online ISBN: 978-3-319-69137-4

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics