Skip to main content
SpringerLink
Log in

An Improved Discrete Firefly Algorithm Used for Traveling Salesman Problem

  • Conference paper
  • First Online:
Advances in Swarm Intelligence (ICSI 2017)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10385))

Included in the following conference series:

Abstract

In this paper, we propose a novel method based on discrete firefly algorithm for traveling salesman problem. We redefine the distance of firefly algorithm by introducing swap operator and swap sequence to avoid algorithm easily falling into local solution and accelerate convergence speed. In addition, we adopt dynamic mechanism based on neighborhood search algorithm. Finally, the comparison experiment results show that the novel algorithm can search perfect solution within a short time, and greatly improve the effectiveness of solving the traveling salesman problem.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Carrabs, F., Cordeau, J.F., Laporte, G.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. Informs J. Comput. 19(4), 2007 (2015)

    MathSciNet  MATH  Google Scholar 

  2. Yang, X.S.: Cuckoo search and firefly algorithm. Eng. Optim. 516, 1–26 (2014)

    Google Scholar 

  3. Massan, S.U.R., Wagan, A.I., Shaikh, M.M., et al.: Wind turbine micrositing by using the firefly algorithm. Appl. Soft Comput. 27(2), 450–456 (2014)

    Google Scholar 

  4. Li, M., Ma, J., Zhang, Y., et al.: Firefly algorithm solving multiple traveling salesman problem. J. Comput. Theor. Nanosci. 12(7), 1277–1281 (2015)

    Article  Google Scholar 

  5. Meng, M., Shoulin, Y., Xinyuan, H.: A new method used for traveling salesman problem based on discrete artificial bee colony algorithm. TELKOMNIKA 14(1), 342–348 (2016)

    Article  Google Scholar 

  6. Zhang, Y.F., Li, Y.G.: An improve firefly algorithm and its application in nonlinear equation groups. Adv. Mater. Res. 1049(5), 1670–1674 (2014)

    Google Scholar 

  7. Iwata, S., Newman, A., Ravi, R.: Graph-TSP from Steiner cycles. In: Kratsch, D., Todinca, I. (eds.) WG 2014. LNCS, vol. 8747, pp. 312–323. Springer, Cham (2014). doi:10.1007/978-3-319-12340-0_26

    Google Scholar 

  8. Yu, L., Li, M., Yang, Y., et al.: An improved ant colony optimization for vehicle routing problem. In: Logistics: The Emerging Frontiers of Transportation and Development in China, ASCE, pp. 3360–3366 (2015)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Software College, Shenyang Normal University, No. 253, HuangHe Bei Street, HuangGu District, Shenyang, 110034, China

    Liu Jie, Lin Teng & Shoulin Yin

Authors
  1. Liu Jie
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lin Teng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shoulin Yin
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Lin Teng .

Editor information

Editors and Affiliations

  1. Peking University, Beijing, China

    Ying Tan

  2. Kyushu University, Fukuoka, Japan

    Hideyuki Takagi

  3. Southern University of Science and Technology, Shenzhen, China

    Yuhui Shi

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Jie, L., Teng, L., Yin, S. (2017). An Improved Discrete Firefly Algorithm Used for Traveling Salesman Problem. In: Tan, Y., Takagi, H., Shi, Y. (eds) Advances in Swarm Intelligence. ICSI 2017. Lecture Notes in Computer Science(), vol 10385. Springer, Cham. https://doi.org/10.1007/978-3-319-61824-1_64

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-61824-1_64

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-61823-4

  • Online ISBN: 978-3-319-61824-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation