Skip to main content
SpringerLink
Log in

Discrete Particle Swarm Optimization for Multiple Destination Routing Problems

  • Conference paper
Applications of Evolutionary Computing (EvoWorkshops 2009)

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

Included in the following conference series:

Abstract

This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the traditional heuristics (e.g., the SPH, DNH and ADH) are inefficient in solving it. The particle swarm optimization (PSO) is an efficient global search algorithm and is promising in dealing with complex problems. This paper extends the PSO to a discrete PSO and uses the DPSO to solve the MDR problem. The global search ability and fast convergence ability of the DPSO make it efficient to the problem. Experiments based on the benchmarks from the OR-library show that the DPSO obtains better results when compared with traditional heuristic algorithms, and also outperforms the GA-based algorithm with faster convergence speed.

This work was supported by NSFC Joint Fund with Guangdong, Key Project No. U0835002, NSF of China Project No.60573066 and the Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry, P.R. China.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Leung, Y., Li, G., Xu, Z.B.: A genetic algorithm for the multiple destination routing problems. J. IEEE Trans. Evol. Comput. 2, 150–161 (1998)

    Article  Google Scholar 

  2. Winter, P., Smith, J.M.: Path-Distance heuristics for the Steiner problem in undirected networks. J. Algorithmica 7, 309–327 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proceedings of the IEEE Conference on Neural Networks, Perth, Australia, pp. 1942–1948 (1995)

    Google Scholar 

  4. Kennedy, J., Mendes, R.: Population structure and particle swarm performance. In: Proceedings of the IEEE Congress on Evolutionary Computation, Honolulu, HI, pp. 1671–1676 (1995)

    Google Scholar 

  5. Zhong, W.L., Huang, J., Zhang, J.: A novel particle swarm optimization for the Steiner tree problem in graphs. In: Proceedings of the IEEE Congress on Evolutionary Computation, Hong Kong, pp. 2465–2472 (2008)

    Google Scholar 

  6. Floyd, R.W.: Shortest path. J. Communications of the ACM 5, 345 (1962)

    Article  Google Scholar 

  7. Prim, R.C.: Shortest connection networks and some generalizations. J. Bell System Technical Journal 36, 1389–1401 (1957)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sun Yat-sen university, China, 510275

    Zhi-hui Zhan & Jun Zhang

Authors
  1. Zhi-hui Zhan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Animal Production Epidemiology and Ecology, University of Torino, Via Leonardo da Vinci 44, 10095, Grugliasco, Italy

    Mario Giacobini

  2. Quinn School of Business, Belfield, University College Dublin, Dublin 4, Ireland

    Anthony Brabazon

  3. Department of Computer Engineering, University of Parma, Viale Usberti 181/a, 43100, Parma, Italy

    Stefano Cagnoni

  4. Dalla Molle Institute for Artificial Intelligence (IDSIA), Gallelria 2, 6928, Manno-Lugano, Switzerland

    Gianni A. Di Caro

  5. School of Engineering and Applied Science,Aston Triangle, Aston University, B4 7ET, Birmingham, UK

    Anikó Ekárt

  6. Complex Adaptive Systems Group, Instituto Tecnológico de Informática, Ciudad PolitŽcnica de la Innovacin, Edif. 8G Acceso B, 46022, Valencia, Spain

    Anna Isabel Esparcia-Alcázar

  7. Next Generation Itelligent Networks Research Center (nexGIN RC), National University of Computer and Emerging Sciences (NUCES), Islamabad, Pakistan

    Muddassar Farooq

  8. Faculty of Economics and Social Sciences, Helmut-Schmidt-University, Holstenhofweg 85, 22043, Hamburg, Germany

    Andreas Fink

  9. Department of Informatics Engineering, Polo II - Pinhal de Marrocos, University of Coimbra, 3030 - 290, Coimbra, Portugal

    Penousal Machado

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhan, Zh., Zhang, J. (2009). Discrete Particle Swarm Optimization for Multiple Destination Routing Problems. In: Giacobini, M., et al. Applications of Evolutionary Computing. EvoWorkshops 2009. Lecture Notes in Computer Science, vol 5484. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01129-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-01129-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-01128-3

  • Online ISBN: 978-3-642-01129-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation