Skip to main content

Firefly Algorithm Solving Equal-Task Multiple Traveling Salesman Problem

  • Conference paper

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 472))

Abstract

A kind of equal-task multiple traveling salesman problem (ET-mTSP) was proposed based on the mTSP and its corresponding mathematical model was constructed; Then, a series of discrete operations for firefly algorithm (FA) were conducted to solve this problem; Finally, the results and analysis of experiments showed that the improved algorithm was efficient and suitable for solving such ET-mTSP.

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   39.99
Price excludes VAT (USA)
  • Available as 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dantzig, G.B., Fulkerson, D.R., Johnson, S.M.: On a Liner-Programming, Cmbinatorial Approah to the Traveling Salesman Problem. Operations Research 7(1), 58–66 (1959)

    Article  MathSciNet  Google Scholar 

  2. Lu, H.Q., Wang, Q., Huang, J.: Dividing into Equal Task of MTSP. Systems Engineering 23(2), 19–21 (2005)

    Google Scholar 

  3. Singh, A., Baghel, A.S.: A New Grouping Genetic Algorithm Approach to The Multiple Traveling Salesperson Problem. Soft Computing-A Fusion of Foundations, Methodologies and Applications 13(1), 95–101 (2009)

    Google Scholar 

  4. Liu, W.M., Li, S.J., Zhao, F.G.: An Ant Colony Optimization Algorithm for the Multiple Traveling Salesman Problem. In: Proceedings of 4th IEEE Conference on Industrial Electronics and Applications, pp. 1533–1537. IEEE Press, Xi’an (2009)

    Google Scholar 

  5. Yang, X.S.: Firefly Algorithm, Stochastic Test Functions and Design Optimization. Int. J. Bio-Inspired Computation, 78–84 (2010)

    Google Scholar 

  6. Zeng, B., Li, M.F., Zhang, Y.: Research on Assembly Sequence Planning Based on Firefly Algorithm. Journal of Mechanical Engineering 49(11), 177–184 (2013)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ma, J., Li, M., Zhang, Y., Zhou, H. (2014). Firefly Algorithm Solving Equal-Task Multiple Traveling Salesman Problem. In: Pan, L., Păun, G., Pérez-Jiménez, M.J., Song, T. (eds) Bio-Inspired Computing - Theories and Applications. Communications in Computer and Information Science, vol 472. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45049-9_49

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45049-9_49

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45048-2

  • Online ISBN: 978-3-662-45049-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics