Central European Journal of Operations Research

, Volume 25, Issue 3, pp 545–560 | Cite as

Probabilistic time-dependent vehicle routing problem

  • Tomáš Režnar
  • Jan Martinovič
  • Kateřina Slaninová
  • Ekaterina Grakova
  • Vít Vondrák
Original Paper

Abstract

The probabilistic time-dependent vehicle routing problem is presented in this paper. It is a novel variant of the vehicle routing problem. The variant is a problem of finding optimal routes for a fleet of vehicles visiting customers in order to proceed delivery or pick-up. All customers must be visited in designated times with given probabilities and services must begin within the given time windows. Each vehicle has a given capacity, which must not be exceeded. The travel time between each two locations is dependent on a vehicle departure time. The paper also contains examples and solution results of testing data sets using the adaptive large neighbourhood search algorithm.

Keywords

Vehicle routing Probabilistic time-dependent vehicle routing problem Probability of arrival 

References

  1. Ando N, Taniguchi E (2006) Travel time reliability in vehicle routing and scheduling with time windows. Netw Spat Econ 6:293–311. doi:10.1007/s11067-006-9285-8 CrossRefGoogle Scholar
  2. Cacchiani V, Hemmelmayr V, Tricoire F (2014) A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Appl Math 163:53–64. doi:10.1016/j.dam.2012.08.032 CrossRefGoogle Scholar
  3. Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim 12:129–146. doi:10.1016/j.disopt.2014.03.001 CrossRefGoogle Scholar
  4. Dantzig G, Ramser J (1959) The truck dispatching problem. Manag Sci 6:80–91. doi:10.1287/mnsc.6.1.80 CrossRefGoogle Scholar
  5. Fan J (2011) The vehicle routing problem with simultaneous pickup and delivery based on customer satisfaction. Proc Eng 15:5284–5289. doi:10.1016/j.proeng.2011.08.979 CrossRefGoogle Scholar
  6. Ghannadpour SF, Noori S, Tavakkoli-Moghaddam R, Ghoseiri K (2014) A multi-objective dynamic vehicle routing problem with fuzzy time windows: model, solution and application. Appl Soft Comput 14:504–527CrossRefGoogle Scholar
  7. Goetschalckx M, Jacobs-Blecha C (1989) The vehicle routing problem with backhauls. Eur J Oper Res 42(1):39–51CrossRefGoogle Scholar
  8. Golasowski M, Tomis R, Martinovič J, Slaninová K, Rapant L (2016) Performance evaluation of probabilistic time-dependent travel time computation. In: Proceedings of the 15th international conference on computer information systems and industrial management, CISIM 2016Google Scholar
  9. Kek AG, Cheu RL, Meng Q (2008) Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots. Math Comput Model 47:140–152. doi:10.1016/j.mcm.2007.02.007 CrossRefGoogle Scholar
  10. Kok A, Hans E, Schutten J, Zijm W (2010) A dynamic programming heuristic for vehicle routing with time-dependent travel times and required breaks. Flex Serv Manuf J 22(1–2):83–108CrossRefGoogle Scholar
  11. Laporte G, Nobert Y (1987) Exact algorithms for the vehicle routing problem. N-Holl Math Stud 132:147–184CrossRefGoogle Scholar
  12. Laporte G, Desrochers M, Nobert Y (1984) Two exact algorithms for the distance-constrained vehicle routing problem. Networks 14(1):161–172CrossRefGoogle Scholar
  13. Little JD, Murty KG, Sweeney DW, Karel C (1963) An algorithm for the traveling salesman problem. Oper Res 11(6):972–989CrossRefGoogle Scholar
  14. Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp Sci 26(3):185–200. doi:10.1287/trsc.26.3.185 CrossRefGoogle Scholar
  15. Montané FAT, Galvao RD (2006) A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput Oper Res 33(3):595–619CrossRefGoogle Scholar
  16. Mourgaya M, Vanderbeck F (2006) The periodic vehicle routing problem: classification and heuristic. Rairo-Oper Res 40(2):169–194CrossRefGoogle Scholar
  17. Mu D, Wang C, Zhao F, Sutherland JW (2016) Solving vehicle routing problem with simultaneous pickup and delivery using parallel simulated annealing algorithm. Int J Ship Transp Logist 8(1):81–106CrossRefGoogle Scholar
  18. Nagarajan V, Ravi R (2012) Approximation algorithms for distance constrained vehicle routing problems, 59th edn. Wiley, New York, pp 209–214. doi:10.1002/net.20435 Google Scholar
  19. Poggi M, Uchoa E (2014) New exact algorithms for the capacitated vehicle routing problem. Veh Routing Probl Methods Appl 18:59CrossRefGoogle Scholar
  20. Pullen H, Webb M (1967) A computer application to a transport scheduling problem. Comput J 10(1):10–13CrossRefGoogle Scholar
  21. Renaud J, Laporte G, Boctor FF (1996) A tabu search heuristic for the multi-depot vehicle routing problem. Comput Oper Res 23(3):229–235CrossRefGoogle Scholar
  22. Ropke S, Pisinger D (2006) An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp Sci 40(4):455–472CrossRefGoogle Scholar
  23. Schrimpf G, Schneider J, Stamm-Wilbrandt H, Dueck G (2000) Record breaking optimization results using the ruin and recreate principle. J Comput Phys 159(2):139–171CrossRefGoogle Scholar
  24. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265CrossRefGoogle Scholar
  25. Tan K, Lee LH, Zhu QL, Ou K (2000) Heuristic methods for vehicle routing problem with time windows. Artif Intell Eng 15:281–295CrossRefGoogle Scholar
  26. Taş D, Dellaert N, van Woensel T, de Kok T (2014) The time-dependent vehicle routing problem with soft time windows and stochastic travel times. Transp Res Part C Emerg Technol 48:66–83CrossRefGoogle Scholar
  27. Toth P, Vigo D (2002) Models, relaxations and exact approaches for the capacitated vehicle routing problem. Discrete Appl Math 123:487–512. doi:10.1016/S0166-218X(01)00351-1 CrossRefGoogle Scholar
  28. Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications, 2nd ed. MOS-SIAM series on optimization, SIAM. https://books.google.cz/books?id=AoTTBQAAQBAJ
  29. Tzoreff TE, Granot D, Granot F, Sošić G (2002) The vehicle routing problem with pickups and deliveries on some special graphs. Discrete Appl Math 116:193–229. doi:10.1016/S0166-218X(00)00283-3 CrossRefGoogle Scholar
  30. Wassan NA, Nagy G (2014) Vehicle routing problem with deliveries and pickups: modelling issues and meta-heuristics solution approaches. Int J Transp 2:95–110. doi:10.14257/ijt.2014.2.1.06 CrossRefGoogle Scholar
  31. Weise T, Podlich A, Gorldti C (2009) Solving real-world vehicle routing problems with evolutionary algorithms, 250th edn. Springer, Berlin, pp 29–53. doi:10.1007/978-3-642-04039-9_2 Google Scholar
  32. Zachariadis EE, Tarantilis CD, Kiranoudis CT (2015) The load-dependent vehicle routing problem and its pick-up and delivery extension. Transp Res Part B Methodol 71(C):158–181CrossRefGoogle Scholar
  33. Zhang J, Lam W, Chen B (2013) A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service. Netw Spat Econ 13:471–496CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  1. 1.IT4InnovationsVŠB - Technical University of OstravaOstravaCzech Republic

Personalised recommendations