Skip to main content
SpringerLink
Log in

The Analysis of Migrating Birds Optimization Algorithm with Neighborhood Operator on Traveling Salesman Problem

  • Conference paper
  • First Online:
Book cover Intelligent and Evolutionary Systems

Part of the book series: Proceedings in Adaptation, Learning and Optimization ((PALO,volume 5))

Abstract

Migrating birds optimization (MBO) algorithm is a new meta-heuristic algorithm inspired from behaviors of migratory birds during migration. Basic MBO algorithm is designed for quadratic assignment problems (QAP) which are known as discrete problems, and the performance of MBO algorithm for solving QAP is shown successfully. But MBO algorithm could not achieve same performance for some other benchmark problems like traveling salesman problem (TSP) and asymmetric traveling salesman problem (ATSP). In order to deal with these kinds of problems, neighborhood operators of MBO is focused in this paper. The performance of MBO algorithm is evaluated with seven varieties of neighborhood operators on symmetric and asymmetric TSP problems. Experimental results show that the performance of MBO algorithm is improved up to 36% by utilizing different neighborhood operators.

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 169.00
Price excludes VAT (USA)
  • Available as 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
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Karabulut, K., Tasgetiren, M.F.: A discrete artificial bee colony algorithm for the traveling salesman problem with time windows. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1–7 (2012)

    Google Scholar 

  2. Yang, J., Shi, X., Marchese, M., Liang, Y.: An Ant Colony Optimization Method For Generalized Tsp Problem. Prog. Nat. Sci. 18(11), 1417–1422 (2008)

    Article  MathSciNet  Google Scholar 

  3. Gu, J., Huang, X.: Efficient Local Search with Search Space Smoothing: A Case Study of the Traveling Salesman Problem (TSP). IEEE Trans. Syst. Man. Cybern. 24(5), 728–735 (1994)

    Article  Google Scholar 

  4. Hui, W.: Comparison of Several Intelligent Algorithms for Solving TSP Problem in Industrial Engineering. Syst. Eng. Procedia 4, 226–235 (2012)

    Article  Google Scholar 

  5. Yan, X., Liu, H., Yan, J., Wu, Q.: A fast evolutionary algorithm for traveling salesman problem. In: Third International Conference on Natural Computation (ICNC 2007), vol. 4, pp. 85–90 (2007)

    Google Scholar 

  6. Tao, Z.: TSP problem solution based on improved genetic algorithm. In: 2008 Fourth International Conference on Natural Computation, vol. 1, pp. 686–690 (2008)

    Google Scholar 

  7. Mrida-Casermeiro, E., Galn-Marn, G., Muoz-Prez, J.: An Efficient Multivalued Hopfield Network for the Traveling Salesman Problem. Neural Process. Lett. 14(3), 203–216 (2001)

    Article  Google Scholar 

  8. Zhu, Q., Chen, S.: A new ant evolution algorithm to resolve TSP problem. In: Sixth International Conference on Machine Learning and Applications (ICMLA 2007), pp. 62–66 (2007)

    Google Scholar 

  9. Yan, L., Kongyu, Y.: Immunity genetic algorithm based on elitist strategy and its application to the TSP problem. In: 2008 International Symposium on Intelligent Information Technology Application Workshops, pp. 3–6 (2008)

    Google Scholar 

  10. Pang, W., Wang, K.P., Zhou, C.G., Dong, L.J.: Fuzzy discrete particle swarm optimization for solving traveling salesman problem. In: The Fourth International Conference onComputer and Information Technology, CIT 2004, 796–800 (2004)

    Google Scholar 

  11. Duman, E., Uysal, M., Alkaya, A.F.: Migrating Birds Optimization A new Metaheuristic Approach and its Performance on Quadratic Assignment Problem. Inf. Sci. 217, 65–77 (2012)

    Article  MathSciNet  Google Scholar 

  12. Kıran, M.S., Işcan, H., Gündüz, M.: The Analysis of Discrete Artificial Bee Colony Algorithm with Neighborhood Operator on Traveling Salesman Problem. Neural Comput. Appl. 23(1), 9–21 (2012)

    Article  Google Scholar 

  13. Güner, E., Altıparmak, F.: A Heuristic Approach for the Secondary Criterion Scheduling Problem on a Single Machine. In: Gazi Universitesi Mühendislik-Mimarlık Fakültesi Derg., Vol. 18(3), pp. 27–42 (2003)

    Google Scholar 

  14. TSP library for benchmark TSP problems. http://elib.zib.de/pub/mp-testdata/tsp/tsplib/tsplib.html (Accessed 22.07.2014)

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Faculty of Engineering and Architecture, Necmettin Erbakan University, Konya, Turkey

    Vahit Tongur

  2. Department of Computer Engineering, Faculty of Engineering, Selçuk University, Konya, Turkey

    Erkan Ülker

Authors
  1. Vahit Tongur
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Erkan Ülker
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Vahit Tongur .

Editor information

Editors and Affiliations

  1. School of Information Technology, King Mongkut’s University of Technology Thonburi, Bangkok, Thailand

    Kittichai Lavangnananda

  2. School of Computing and Informatics, Institut Teknologi Brunei, Gadong, Brunei Darussalam

    Somnuk Phon-Amnuaisuk

  3. School of Information Technology, King Mongkut’s University of Technology Thonburi, Bangkok, Thailand

    Worrawat Engchuan

  4. School of Information Technology, King Mongkut’s University of Technology Thonburi, Bangkok, Thailand

    Jonathan H. Chan

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Tongur, V., Ülker, E. (2016). The Analysis of Migrating Birds Optimization Algorithm with Neighborhood Operator on Traveling Salesman Problem. In: Lavangnananda, K., Phon-Amnuaisuk, S., Engchuan, W., Chan, J. (eds) Intelligent and Evolutionary Systems. Proceedings in Adaptation, Learning and Optimization, vol 5. Springer, Cham. https://doi.org/10.1007/978-3-319-27000-5_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27000-5_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-26999-3

  • Online ISBN: 978-3-319-27000-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation