Skip to main content

Advertisement

Springer Nature Link
Log in

Multi-depot vehicle routing problem with time windows under shared depot resources

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

A new variant of multi-depot vehicle routing problem with time windows is studied. In the new variant, the depot where the vehicle ends is flexible, namely, it is not entirely the same as the depot that it starts from. An integer programming model is formulated with the minimum total traveling cost under the constrains of time window, capacity and route duration of the vehicle, the fleet size and the number of parking spaces of each depot. As the problem is an NP-Hard problem, a hybrid genetic algorithm with adaptive local search is proposed to solve it. Finally, the computational results show that the proposed method is competitive in terms of solution quality. Compared with the classic MDVRPTW, allowing flexible choice of the stop depot can further reduce total traveling cost.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Abbreviations

\(D\) :

The depot set

\(C\) :

The customer set

\(V\) :

The vertex set

\(A\) :

The arc set

\(K\) :

The vehicle set

\(K_{d }\) :

The set of vehicles at depot \(d\)

\(q_{i}\) :

The demand of customer \(i\)

\(s_{i}\) :

The service time of customer \(i\)

\(e_{i}\) :

The earliest start time at customer \(i\)

\(l_{i}\) :

The latest start time at customer \(i\)

\(c_{ij}\) :

The distance between customer \(i\) and \(j\)

\(Q_{k}\) :

The capacity of the vehicle \(k\)

\(T_{k}\) :

The maximum duration of vehicle \(k\)

\(L\) :

The number of vehicles

\({\vert }P_{d}{\vert }\) :

The number of parking spaces at the depot \(d\)

\({\vert }K_{d}{\vert }\) :

The number of vehicles in \(K_{d }\) set

\(x_{kij}\) :

Is the 0-1 decision variable, if vehicle \(k\) travels directly from node \(i\) to node \(j\), then \(x_{kij}=1\), otherwise, \(x_{kij}=0\)

\(a_{ki}\) :

The arrival time of vehicle \(k\) at node \(i\)

\(b_{ki}\) :

The start service time of vehicle \(k\) at node \(i\)

\(\pi _k \) :

The working duration of vehicle \(k\)

References

  • Bräysy O (2003) A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J Comput 15:347–368

    Article  MathSciNet  MATH  Google Scholar 

  • Chakhlevitch K, Cowling P (2008) Hyperheuristics: recent developments. In: Cotta C et al (eds) Adaptive and multilevel metaheuristics SCI 136. Springer, Heidelberg, pp 3–29

    Chapter  Google Scholar 

  • Clarke G, Wright J (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581

    Article  Google Scholar 

  • Cordeau JF, Larporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52:928–936

    Article  MATH  Google Scholar 

  • Cordeau JF, Larporte G, Mercier A (2004) Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J Oper Res Soc 55:542–546

    Article  MATH  Google Scholar 

  • Cordeau JF, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Oper Res 39:2033–2050

    Article  Google Scholar 

  • Hashimoto H, Yagiura M, Imahori S, Ibaraki T (2013) Recent progress of local search in handling the time window constraints of the vehicle routing problem. Ann Oper Res 204:171–187

    Article  MathSciNet  MATH  Google Scholar 

  • Holland JH (1975) Adaptation in natural and artificial systems. The University of Michigan Press, Ann Arbor, MI

    Google Scholar 

  • Irnich S (2008) A unified modeling and solution framework for vehicle routing and local search-based metaheuristics. INFORMS J Comput 20:270–287

    Article  MathSciNet  MATH  Google Scholar 

  • Juan AA, Faulin J, Ferrer A, Lourenço HR, Barrios B (2013) MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems. Top 21:109–132

    Article  MathSciNet  MATH  Google Scholar 

  • Li F, Golden B, Wasil E (2007) The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34:2918–2930

    Article  MATH  Google Scholar 

  • Moccia L, Cordeau JF, Laporte G (2012) A Incremental tabu search heuristic for the generalized Vehicle routing problem with time windows. J Oper Res Soc 63:232–244

    Article  Google Scholar 

  • Nagata Y, Bräysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37:724–737

    Article  MATH  Google Scholar 

  • Noori S, Ghannadpour SF (2012) High-level relay hybrid metaheuristic method for multi-depot vehicle routing problem with time windows. J Math Modell Algorithms 11:159–179

    Article  MathSciNet  MATH  Google Scholar 

  • Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34:2403–2435

    Article  MathSciNet  MATH  Google Scholar 

  • Polacek M, Harlt RF, Doerner KF (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10:613–627

    Article  Google Scholar 

  • Polacek M, Benkner S, Doerner KF, Hartl RF (2008) A cooperative and adaptive variable neighborhood search for the multi depot vehicle routing problem with time windows. BuR-Bus Res 1:207–218

    Article  Google Scholar 

  • Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31:1985–2002

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  • Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40:455–472

    Article  Google Scholar 

  • Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4:146–154

    Article  MATH  Google Scholar 

  • Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. Department of Computer Science, University of Strathclyde, Scotland, Technical report

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  • Tansini L, Viera O (2006) New measures of proximity for the assignment algorithms in the MDVRPTW. J Oper Res Soc 57:241–249

    Article  MATH  Google Scholar 

  • Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time windows. Comput Oper Res 40:475–489

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The authors gratefully acknowledge valuable comments of three anonymous referees. This work was supported by Research Grant from National Natural Science Foundation of China (No. 71001053) and partially supported by LATNA Laboratory, NRU HSE, RF government Grant (ag. 11.G34.31.0057).

Author information

Authors and Affiliations

  1. College of Engineering, Nanjing Agricultural University, P.O. Box 64, 40 Dianjiangtai Road, Pukou district, Nanjing , 210031, China

    Jian Li & Yang Li

  2. Department of Industrial and Systems Engineering, Center for Applied Optimization, University of Florida, 303 Weil Hall, Gainesville, FL , 32611, USA

    Panos M. Pardalos

  3. Laboratory of Algorithms and Technologies for Network Analysis, National Research University Higher School of Economics, Moscow, Russia

    Panos M. Pardalos

Authors
  1. Jian Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Yang Li
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Panos M. Pardalos
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding authors

Correspondence to Jian Li or Panos M. Pardalos.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Li, J., Li, Y. & Pardalos, P.M. Multi-depot vehicle routing problem with time windows under shared depot resources. J Comb Optim 31, 515–532 (2016). https://doi.org/10.1007/s10878-014-9767-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-014-9767-4

Keywords