Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the Institute of Industrial Engineers Asian Conference 2013 pp 853–859Cite as

Discrete Particle Swarm Optimization with Path-Relinking for Solving the Open Vehicle Routing Problem with Time Windows

Abstract

This paper presents a discrete version of the particle swarm optimization with additional path-relinking procedure for solving the open vehicle routing problem with time windows (OVRPTW). In OVRPTW, a vehicle does not return to the depot after servicing the last costumer on its route. Each customer’s service is required to start within a fixed time window. To deal with the time window constraints, this paper proposed a route refinement procedure. The result of computational study shows that the proposed algorithm effectively solves the OVRPTW.

Keywords

  • Open vehicle routing problem
  • Time windows
  • Discrete particle swarm optimization
  • Path-relinking

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   189.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   249.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   329.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

Learn about institutional subscriptions

References

  • Ioannou G, Kritikos M, Prastacos G (2001) A Greedy Look-Ahead Heuristic for the Vehicle Routing Problem with Time Windows. J Oper Res Soc 52(5):523–537

    CrossRef  MATH  Google Scholar 

  • Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Neural Networks, 1995. Proceedings, IEEE International Conference on Nov/Dec 1995, pp 1942–1948 vol.1944. doi:10.1109/ICNN.1995.488968

  • Repoussis PP, Tarantilis CD, Ioannou G (2006) The open vehicle routing problem with time windows. J Oper Res Soc 58(3):355–367

    CrossRef  Google Scholar 

  • Repoussis PP, Tarantilis CD, Braysy O, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res 37(3):443–455. doi:10.1016/j.cor.2008.11.003

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Sariklis D, Powell S (2000) A heuristic method for the open vehicle routing problem. J Oper Res Soc 51(5):564–573

    MATH  Google Scholar 

  • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35:254–265

    CrossRef  MathSciNet  MATH  Google Scholar 

  • Xiaohui H, Eberhart RC, Yuhui S (2003) Swarm intelligence for permutation optimization: a case study of n-queens problem. In: Swarm Intelligence Symposium, 2003. SIS ‘03. Proceedings of the 2003 IEEE, 24–26 April 2003, pp 243–246. doi:10.1109/SIS.2003.1202275

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Management, National Taiwan University of Science and Technology, Taipei, Taiwan, Republic of China

    A. A. N. Perwira Redi, Meilinda F. N. Maghfiroh & Vincent F. Yu

Authors
  1. A. A. N. Perwira Redi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Meilinda F. N. Maghfiroh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vincent F. Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. A. N. Perwira Redi .

Editor information

Editors and Affiliations

  1. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Yi-Kuei Lin

  2. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Yu-Chung Tsao

  3. and Technology, Department of Industrial Management, National Taiwan University of Science, Taipei, 10607, Taiwan

    Shi-Woei Lin

Rights and permissions

Reprints and Permissions

Copyright information

© 2013 Springer Science+Business Media Singapore

About this paper

Cite this paper

Perwira Redi, A.A.N., Maghfiroh, M.F.N., Yu, V.F. (2013). Discrete Particle Swarm Optimization with Path-Relinking for Solving the Open Vehicle Routing Problem with Time Windows. In: Lin, YK., Tsao, YC., Lin, SW. (eds) Proceedings of the Institute of Industrial Engineers Asian Conference 2013. Springer, Singapore. https://doi.org/10.1007/978-981-4451-98-7_102

Download citation

  • DOI: https://doi.org/10.1007/978-981-4451-98-7_102

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-4451-97-0

  • Online ISBN: 978-981-4451-98-7

  • eBook Packages: EngineeringEngineering (R0)

search

Navigation