Skip to main content
SpringerLink
Log in

An Exact Algorithm for Multi Depot and Multi Period Vehicle Scheduling Problem

  • Conference paper
Book cover Computational Science and Its Applications – ICCSA 2005 (ICCSA 2005)

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

Included in the following conference series:

Abstract

This study is on the multi period vehicle scheduling problem in a supply chain where a fleet of vehicle delivers single type product from multi depots to multi retailers. The purpose of this model is to design the least costly schedule of vehicles in each depot to minimize transportation costs for product delivery and inventory holding costs at retailers over the planning period. A mixed integer programming formulation and an exact algorithm are suggested. In the exact algorithm, all feasible schedules are generated from each depot to each retailer and set of vehicle schedules are selected optimally by solving the shortest path problem. The effectiveness of the proposed procedure is evaluated by computational experiment.

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 139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

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. Danzig, G.B., Ramser, J.H.: The Truck Dispatching Problem. Management Science 6, 80–91 (1959)

    Article  MathSciNet  Google Scholar 

  2. Malandraki, C., Dial, R.B.: A restricted dynamic programming heuristic algorithm for the traveling salesman problem. European Journal of Operational Research 90, 45–55 (1996)

    Article  MATH  Google Scholar 

  3. Taillard, E., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A parallel tabu search heuristic for the vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies 5, 109–122 (1997)

    Article  Google Scholar 

  4. Liu, F., Shen, S.: A route-neighborhood-based metaheuristic for vehicle routing problem with time windows. European Journal of Operational Research 118, 485–504 (1999)

    Article  MATH  Google Scholar 

  5. Berger, J., Barkaoui, M.: A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Computers and Operations Research 31, 2037–2053 (2004) (Article in press)

    Google Scholar 

  6. Laporte, G.: Integer programming formulations for the multi-depot vehicle routing problem. Comments on a paper by Kulkarni and Bhave. European Journal of Operational Research 38, 228–237 (1989)

    Article  MathSciNet  Google Scholar 

  7. Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multi-depot vehicle routing problem. Computers and Operations Research 23, 229–235 (1996)

    Article  MATH  Google Scholar 

  8. Salhi, S., Sari, M.: A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. European Journal of Operational Research 103, 95–112 (1997)

    Article  MATH  Google Scholar 

  9. Salhi, S., Rand, G.K.: Incorporating vehicle routing into the vehicle fleet composition problem. European Journal of Operational Research 66, 313–330 (1993)

    Article  MATH  Google Scholar 

  10. Ochi, L.S.: A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Generation Computer Systems 14, 285–292 (1998)

    Article  Google Scholar 

  11. Gendreau, M., Laporte, G., Musaraganyi, C., Taillard, E.D.: A tabu search heuristics for the heterogeneous fleet vehicle routing problem. Computers and Operations Research 26, 1153–1173 (1999)

    Article  MATH  Google Scholar 

  12. Mosheiov, G.: Vehicle Routing with Pick-up and Delivery: Tour-Partitioning Heuristics. Computers and Industrial Engineering 34, 669–684 (1998)

    Article  Google Scholar 

  13. Min, H., Zhou, G.: Supply chain modeling: past, present and future. Computers and Industrial Engineering 43, 231–249 (2002)

    Article  Google Scholar 

  14. Kim, J., Kim, Y.: A decomposition approach to a multi-period vehicle scheduling problem. The International Journal of Management Science 27, 421–430 (1999)

    Google Scholar 

  15. Yen, J.Y.: Finding the K shortest loopless paths in a network. Management Science 17, 712–716 (1971)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Industrial and Information Engineering, Yonsei University, 134 Shinchon-Dong, Seodaemoon-Gu, SEOUL, 120-749, Korea

    Kyung Hwan Kang, Young Hoon Lee & Byung Ki Lee

Authors
  1. Kyung Hwan Kang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Young Hoon Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Byung Ki Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Mathematics and Computer Science, University of Perugia, via Vanvitelli, 1, I-06123, Perugia, Italy

    Osvaldo Gervasi

  2. Department of Computer Science, University of Calgary, 2500 University Drive N.W., T2N 1N4, Calgary, AB, Canada

    Marina L. Gavrilova

  3. William Norris Professor, Head of the Computer Science and Engineering Department, University of Minnesota, USA

    Vipin Kumar

  4. Department of Chemistry, University of Perugia, Via Elce di Sotto, 8, I-06123, Perugia, Italy

    Antonio Laganá

  5. Institute of High Performance Computing, IHCP, 1 Science Park Road, 01-01 The Capricorn, Singapore Science Park II, 117528, Singapore

    Heow Pueh Lee

  6. School of Computing, Soongsil University, Seoul, Korea

    Youngsong Mun

  7. Clayton School of IT, Monash University, 3800, Clayton, Australia

    David Taniar

  8. OptimaNumerics Ltd, Belfast, United Kingdom

    Chih Jeng Kenneth Tan

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kang, K.H., Lee, Y.H., Lee, B.K. (2005). An Exact Algorithm for Multi Depot and Multi Period Vehicle Scheduling Problem. In: Gervasi, O., et al. Computational Science and Its Applications – ICCSA 2005. ICCSA 2005. Lecture Notes in Computer Science, vol 3483. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11424925_38

Download citation

  • DOI: https://doi.org/10.1007/11424925_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25863-6

  • Online ISBN: 978-3-540-32309-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation