Skip to main content
SpringerLink
Log in

Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses

  • Original Paper
  • Published:
Central European Journal of Operations Research Aims and scope Submit manuscript

Abstract

We examine three interesting cases of the single vehicle routing problem with a predefined client sequence and two load replenishment warehouses. Given the location and demand of the clients, we seek the minimal cost route, which includes optimal load replenishment visits to the warehouses in order to fully satisfy the client demand. The cases studied vary with respect to inventory availability at each warehouse and are of increasing complexity. We have developed solution algorithms that address this complexity, ranging from a standard dynamic programming algorithm for the simplest case, to labeling algorithms and a new partitioning heuristic. The efficiency of these algorithms has been studied by solving a wide range of problem instances, and by comparing the results with those obtained from a state-of-the-art MILP solver.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Bard J, Huang L, Dror M, Jaillet P (1998) A branch and cut algorithm for the VRP with satellite facilities. IIE Trans Opers Eng 30(9):821–834

    Google Scholar 

  • Bianchi L, Birattari M, Chiarandini M, Manfrin M, Mastrolilli M, Paquete L, Rossi-Doria O, Schiavinotto T (2006) Hybrid metaheuristics for the vehicle routing problem with stochastic demands. J Math Model Algorithms 5:91–110

    Article  Google Scholar 

  • Chabrier A (2006) Vehicle routing problem with elementary shortest path based column generation. Comput Oper Res 33:2972–2990

  • Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper Res 40:342–354

    Article  Google Scholar 

  • Dijkstra WE (1959) A note on two problems in connexion with graphs. Numer Math 1:269–271

    Article  Google Scholar 

  • Dikas G, Minis I, Mamassis K (2012) Single vehicle routing with predefined client sequence and multiple warehouse returns: The case of two warehouses Mathematical formulations and suitable dynamic programming algorithms. Laboratory report Design, Operations and Production Systems Laboratory, Department of Financial and Management Engineering, University of the Aegean. http://labs.fme.aegean.gr/deopsys/node/167

  • Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Network 44:216–229

    Article  Google Scholar 

  • Graves G, McBride R, Gershkoff I, Anderson D (1993) Flight crew scheduling. Manag Sci 39:657–682

    Article  Google Scholar 

  • Lavoie S, Minoux M, Odier E (1988) A new approach for crew pairing problems by column generation with an application to air transportation. Eur J Oper Res 35:45–58

    Article  Google Scholar 

  • Li JQ, Mirchandani PB, Borenstein D (2009a) A Lagrangian heuristic for the real-time vehicle rescheduling problem. Transp Res Part E Lod Transp Rev 45(3):419–433

    Article  Google Scholar 

  • Li JQ, Mirchandani PB, Borenstein D (2009b) Real-time vehicle rerouting problems with time windows. Eur J Oper Res 194(3):711–727

    Article  Google Scholar 

  • Mamassis K, Minis I, Dikas I (2013) Managing vehicle breakdown incidents during urban distribution of a common product. J Oper Res Soc. doi:10.1057/jors.2012.93

  • Minis I, Tatarakis A (2011) Stochastic single vehicle routing problem with delivery and pick up and a predefined customer sequence. Eur J Oper Res 213:37–51

    Article  Google Scholar 

  • Mu Q, Fu Q, Lysgaard J, Eglese R (2011) Disruption management of the vehicle routing problem with vehicle breakdown. J Oper Res Soc. doi:10.1057/jors.2010.19

  • Tatarakis A, Minis I (2009) Stohastic single vehicle routing with a predefined customer sequence and multi depot returns. Eur J Oper Res 197:557–571

    Article  Google Scholar 

  • Tsirimpas P, Tatarakis A, Minis I, Kyriakidis E (2007) Single vehicle routing with a predifined customer sequence and multiple depot returns. Eur J Oper Res 187:483–495

    Article  Google Scholar 

  • Yang W, Mathur K, Ballou R (2000) Stochastic vehicle routing problem with restocking. Transp Sci 34:99–112

Download references

Acknowledgments

This research has been co-financed by the European Union (European Social Fund—ESF) and Greek national funds through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF)—Research Funding Program: Heracleitus II. Investing in knowledge society through the European Social Fund.

Author information

Authors and Affiliations

  1. Design, Operations and Production Systems Laboratory, Department of Financial and Management Engineering, University of the Aegean, 41, Kountourioti Street, 82100, Chios, Greece

    G. Dikas, I. Minis & K. Mamassis

Authors
  1. G. Dikas
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. I. Minis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. K. Mamassis
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. Minis.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Dikas, G., Minis, I. & Mamassis, K. Single vehicle routing with predefined client sequence and multiple warehouse returns: the case of two warehouses. Cent Eur J Oper Res 24, 709–730 (2016). https://doi.org/10.1007/s10100-015-0382-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10100-015-0382-y

Keywords

Search

Navigation