Skip to main content
SpringerLink
Log in
Book cover

Computational Methods pp 1063–1068Cite as

A DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM FOR TRAVELLING SALESMAN PROBLEM

  • Conference paper

Abstract

A discrete particle swarm optimization (PSO)-based algorithm for travelling salesman problem (TSP) is presented by re-designing the ‘subtraction’ operator. To accelerate the convergence speed, a crossover eliminating technique is also added. Numerical results of some benchmark instances show that the size of solved problems could be increased by using the proposed algorithm compared with those of the existing PSO-based algorithms.

This is a preview of subscription content, 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   259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   329.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. J. Kennedy and R.C. Eberhart (1995), Particle swarm optimization. In: Proceedings of the IEEE International Conference on Neural Networks, Perth, Australia, IEEE Service Center, Piscataway, NJ, 4, pp. 1942–1948.

    Chapter  Google Scholar 

  2. P.J. Angeline (1998), Evolutionary optimization versus particle swarm optimization: philosophy and performance differences. Evolutionary Programming, 7, pp. 601–610.

    Article  Google Scholar 

  3. M. Clerc and J. Kennedy (2002), The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6, pp. 58–73.

    Article  Google Scholar 

  4. J. Kennedy and R.C. Eberhart (1997), Discrete binary version of the particle swarm algorithm. In: Proceedings of the IEEE International Conference on Systems, Man and Cybernetics, Orlando, Florida, USA, 5, pp. 4104–4108.

    Google Scholar 

  5. D.E. Goldberg (1989), Messy genetic algorithms: motivation, analysis, and first results. Complex Systems, 3, pp. 493–530.

    MATH  MathSciNet  Google Scholar 

  6. J. Bentner, G. Bauer, G.M. Obermair, I. Morgenstern and J. Schneider (2001), Optimization of the time-dependent traveling salesman problem with Monte Carlo methods. Physical Review E, 64, 036701.

    Article  Google Scholar 

  7. L. Huang, C.G. Zhou and K.P. Wang (2003), Hybrid ant colony algorithm for traveling salesman problem. Progress in Natural Science, 4, 13, pp. 295–299.

    MathSciNet  Google Scholar 

  8. T. Hendlass (2003), Preserving diversity in particle swarm optimization. Lecture Notes in Computer Science, 2718, pp. 4104–4108.

    Google Scholar 

  9. K.P. Wang, L. Huang, C.G. Zhou and W. Pang (2003), Particle swarm optimization for traveling salesman problem. International Conference on Machine Learning and Cybernetics, 3, pp. 1583–1585.

    Google Scholar 

  10. G. Reinelt (1991), TSPLIB—A traveling salesman problem library. ORSA Journal on Computing, 3, 4, pp. 376–384.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. College of Computer Science, Jilin University, Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education, Changchun, 130012, China

    X.H. Shi, Y. Zhou, L.M. Wang, Q.X. Wang & Y.C. Liang

  2. Department of Computer Science and Technology, Changchun Taxation College, Changchun, 130021, China

    L.M. Wang

Authors
  1. X.H. Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Y. Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. L.M. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Q.X. Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Y.C. Liang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. National University of Singapore, Singapore

    G.R. LIU

  2. National University of Singapore, Singapore

    V.B.C. TAN

  3. Hunan University, P.R. China

    X. HAN

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer

About this paper

Cite this paper

Shi, X., Zhou, Y., Wang, L., Wang, Q., Liang, Y. (2006). A DISCRETE PARTICLE SWARM OPTIMIZATION ALGORITHM FOR TRAVELLING SALESMAN PROBLEM. In: LIU, G., TAN, V., HAN, X. (eds) Computational Methods. Springer, Dordrecht. https://doi.org/10.1007/978-1-4020-3953-9_8

Download citation

  • DOI: https://doi.org/10.1007/978-1-4020-3953-9_8

  • Publisher Name: Springer, Dordrecht

  • Print ISBN: 978-1-4020-3952-2

  • Online ISBN: 978-1-4020-3953-9

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation