The vehicle routing problem: State of the art classification and review

Computers and Industrial Engineering

Volumn 99, Issue , 2016, Pages 300-313

  Braekers, Kris ^a,b   Ramaekers, Katrien ^a   Van Nieuwenhuyse, Inneke ^c  

^a HASSELT UNIVERSITY   (Belgium)

^b RESEARCH FOUNDATION FLANDERS FWO   (Belgium)

^c UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Dynamic vehicle routing; Literature review; Taxonomy; Time dependent vehicle routing; Vehicle routing

Indexed keywords

NETWORK ROUTING; ROUTING ALGORITHMS; TAXONOMIES; VEHICLE ROUTING;

ACADEMIC LITERATURE; DYNAMIC VEHICLE ROUTING; LEVEL OF DETAIL; LITERATURE REVIEWS; STATE OF THE ART; TIME DEPENDENT; VEHICLE ROUTING PROBLEM; VEHICLE ROUTING PROBLEMS;

VEHICLES;

EID: 84953425772     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2015.12.007     Document Type: Short Survey

References (309)

1. Abdallah, K.S., Jang, J., An exact solution for vehicle routing problems with semi-hard resource constraints. Computers & Industrial Engineering 76 (2014), 366–377, 10.1016/j.cie.2014.08.011.
2. Agra, A., Christiansen, M., Figueiredo, R., Hvattum, L.M., Poss, M., Requejo, C., The robust vehicle routing problem with time windows. Computers & Operations Research 40:3 (2013), 856–866.
3. Ai, T.J., Kachitvichyanukul, V., A particle swarm optimization for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research 36:5 (2009), 1693–1702, 10.1016/j.cor.2008.04.003.
4. Ai, T.J., Kachitvichyanukul, V., Particle swarm optimization and two solution representations for solving the capacitated vehicle routing problem. Computers & Industrial Engineering 56:1 (2009), 380–387.
5. Alabas-Uslu, C., Dengiz, B., A self-adaptive local search algorithm for the classical vehicle routing problem. Expert Systems with Applications 38:7 (2011), 8990–8998, 10.1016/j.eswa.2011.01.116.
6. Albareda-Sambola, M., Fernández, E., Laporte, G., The dynamic multiperiod vehicle routing problem with probabilistic information. Computers & Operations Research 48 (2014), 31–39, 10.1016/j.cor.2014.02.010.
7. Allahviranloo, M., Chow, J.Y.J., Recker, W.W., Selective vehicle routing problems under uncertainty without recourse. Transportation Research Part E: Logistics and Transportation Review 62 (2014), 68–88, 10.1016/j.tre.2013.12.004.
8. Allahyari, S., Salari, M., Vigo, D., A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem. European Journal of Operational Research 242:3 (2015), 756–768, 10.1016/j.ejor.2014.10.048.
9. Almoustafa, S., Hanafi, S., Mladenovic, N., New exact method for large asymmetric distance-constrained vehicle routing problem. European Journal of Operational Research 226:3 (2013), 386–394.
10. Amorim, P., Almada-Lobo, B., The impact of food perishability issues in the vehicle routing problem. Computers & Industrial Engineering 67 (2014), 223–233, 10.1016/j.cie.2013.11.006.
11. Anbuudayasankar, S.P., Ganesh, K., Lenny Koh, S.C., Ducq, Y., Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls. Expert Systems with Applications 39:3 (2012), 2296–2305, 10.1016/j.eswa.2011.08.009.
12. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J., The traveling salesman problem: A computational study. 2011, Princeton University Press.
13. Aras, N., Aksen, D., Tuğrul Tekin, M., Selective multi-depot vehicle routing problem with pricing. Transportation Research Part C: Emerging Technologies 19:5 (2011), 866–884, 10.1016/j.trc.2010.08.003.
14. Archetti, C., Bianchessi, N., Speranza, M.G., Branch-and-cut algorithms for the split delivery vehicle routing problem. European Journal of Operational Research 238:3 (2014), 685–698, 10.1016/j.ejor.2014.04.026.
15. Archetti, C., Bouchard, M., Desaulniers, G., Enhanced Branch and price and cut for vehicle routing with split deliveries and time windows. Transportation Science 45:3 (2011), 285–298, 10.1287/trsc.1100.0363.
16. Archetti, C., Speranza, M.G., Vehicle routing problems with split deliveries. International Transactions in Operational Research 19:1–2 (2012), 3–22, 10.1111/j.1475-3995.2011.00811.x.
17. Avci, M., Topaloglu, S., An adaptive local search algorithm for vehicle routing problem with simultaneous and mixed pickups and deliveries. Computers & Industrial Engineering 83 (2015), 15–29, 10.1016/j.cie.2015.02.002.
18. Avella, P., Boccia, M., Vasilyev, I., Lifted and local reachability cuts for the vehicle routing problem with time windows. Computers & Operations Research 40:8 (2013), 2004–2010, 10.1016/j.cor.2013.03.008.
19. Azi, N., Gendreau, M., Potvin, J.-Y., An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. European Journal of Operational Research 202:3 (2010), 756–763, 10.1016/j.ejor.2009.06.034.
20. Azi, N., Gendreau, M., Potvin, J.-Y., An adaptive large neighborhood search for a vehicle routing problem with multiple routes. Computers & Operations Research 41 (2014), 167–173, 10.1016/j.cor.2013.08.016.
21. Baldacci, R., Bartolini, E., Mingozzi, A., Valletta, A., An exact algorithm for the period routing problem. Operations Research, 2011 Retrieved from < http://pubsonline.informs.org/doi/10.1287/opre.1100.0875>.
22. Baldacci, R., Mingozzi, A., A unified exact method for solving different classes of vehicle routing problems. Mathematical Programming 120:2 (2009), 347–380, 10.1007/s10107-008-0218-9.
23. Baldacci, R., Mingozzi, A., Roberti, R., New route relaxation and pricing strategies for the vehicle routing problem. Operations Research 59:5 (2011), 1269–1283, 10.1287/opre.1110.0975.
24. Baldacci, R., Mingozzi, A., Roberti, R., Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. European Journal of Operational Research 218:1 (2012), 1–6, 10.1016/j.ejor.2011.07.037.
25. Baldacci, R., Mingozzi, A., Roberti, R., Calvo, R.W., An exact algorithm for the two-echelon capacitated vehicle routing problem. Operations Research 61:2 (2013), 298–314 Retrieved from < http://pubsonline.informs.org/doi/abs/10.1287/opre.1120.1153>.
26. Baldacci, R., Toth, P., Vigo, D., Exact algorithms for routing problems under vehicle capacity constraints. Annals of Operations Research 175:1 (2010), 213–245, 10.1007/s10479-009-0650-0.
27. Balseiro, S.R., Loiseau, I., Ramonet, J., An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Computers & Operations Research 38:6 (2011), 954–966, 10.1016/j.cor.2010.10.011.
28. Baños, R., Ortega, J., Gil, C., Fernández, A., de Toro, F., A simulated annealing-based parallel multi-objective approach to vehicle routing problems with time windows. Expert Systems with Applications 40:5 (2013), 1696–1707.
29. Baños, R., Ortega, J., Gil, C., Márquez, A.L., de Toro, F., A hybrid meta-heuristic for multi-objective vehicle routing problems with time windows. Computers & Industrial Engineering 65:2 (2013), 286–296, 10.1016/j.cie.2013.01.007.
30. Barkaoui, M., Gendreau, M., An adaptive evolutionary approach for real-time vehicle routing and dispatching. Computers & Operations Research 40:7 (2013), 1766–1776, 10.1016/j.cor.2013.01.022.
31. Battarra, M., Erdoğan, G., Vigo, D., Exact algorithms for the clustered vehicle routing problem. Operations Research 62:1 (2014), 58–71, 10.1287/opre.2013.1227.
32. Battarra, M., Monaci, M., Vigo, D., An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Computers & Operations Research 36:11 (2009), 3041–3050, 10.1016/j.cor.2009.02.008.
33. Bektas, T., Erdogan, G., Ropke, S., Formulations and branch-and-cut algorithms for the generalized vehicle routing problem. Transportation Science 45:3 (2011), 299–316, 10.1287/trsc.1100.0352.
34. Bektaş, T., Laporte, G., The pollution-routing problem. Transportation Research Part B: Methodological 45:8 (2011), 1232–1250, 10.1016/j.trb.2011.02.004.
35. Belfiore, P., Yoshizaki, H.T.Y., Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil. European Journal of Operational Research 199:3 (2009), 750–758, 10.1016/j.ejor.2008.08.003.
36. Belfiore, P., Yoshizaki, H.T.Y., Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Computers & Industrial Engineering 64:2 (2013), 589–601.
37. Belhaiza, S., Hansen, P., Laporte, G., A hybrid variable neighborhood tabu search heuristic for the vehicle routing problem with multiple time windows. Computers & Operations Research 52 (2014), 269–281, 10.1016/j.cor.2013.08.010.
38. Benjamin, A.M., Beasley, J.E., Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities. Computers & Operations Research 37:12 (2010), 2270–2280.
39. Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G., Static pickup and delivery problems: A classification scheme and survey. TOP 15:1 (2007), 1–31, 10.1007/s11750-007-0009-0.
40. Bertazzi, L., Golden, B., Wang, X., Min-max vs. min-sum vehicle routing: A worst-case analysis. European Journal of Operational Research 240:2 (2015), 372–381, 10.1016/j.ejor.2014.07.025.
41. Bertazzi, L., Savelsbergh, M., Speranza, M.G., Inventory routing. Golden, B., Raghavan, S., Wasil, E., (eds.) The Vehicle routing problem: Latest advances and new challenges, Vol. 43, 2008, Springer Science+Business Media, New York, 49–72, 10.1007/978-0-387-77778-8.
42. Bettinelli, A., Ceselli, A., Righini, G., A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Research Part C: Emerging Technologies 19:5 (2011), 723–740, 10.1016/j.trc.2010.07.008.
43. Bhusiri, N., Qureshi, A.G., Taniguchi, E., The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem. Transportation Research Part E: Logistics and Transportation Review 62 (2014), 1–22, 10.1016/j.tre.2013.12.003.
44. Bolduc, M.-C., Laporte, G., Renaud, J., Boctor, F.F., A tabu search heuristic for the split delivery vehicle routing problem with production and demand calendars. European Journal of Operational Research 202:1 (2010), 122–130, 10.1016/j.ejor.2009.05.008.
45. Brandão, J., A deterministic tabu search algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research 195:3 (2009), 716–728, 10.1016/j.ejor.2007.05.059.
46. Brandão, J., A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Computers & Operations Research 38:1 (2011), 140–151, 10.1016/j.cor.2010.04.008.
47. Brar, G. S., & Saini, G. (2011). Milk run logistics: Literature Review and directions. In Proceedings of the world congress on engineering (Vol. 1, pp. 797–801). London, England.
48. Bräysy, O., Gendreau, M., Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Science 39:1 (2005), 104–118, 10.1287/trsc.1030.0056.
49. Bräysy, O., Gendreau, M., vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science 39:1 (2005), 119–139, 10.1287/trsc.1030.0057.
50. Bräysy, O., Porkka, P.P., Dullaert, W., Repoussis, P.P., Tarantilis, C.D., A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows. Expert Systems with Applications 36:4 (2009), 8460–8475, 10.1016/j.eswa.2008.10.040.
51. Cacchiani, V., Hemmelmayr, V.C., Tricoire, F., A set-covering based heuristic algorithm for the periodic vehicle routing problem. Discrete Applied Mathematics (Amsterdam, Netherlands: 1988) 163:Pt 1 (2014), 53–64, 10.1016/j.dam.2012.08.032.
52. Campbell, A.M., Wilson, J.H., Forty years of periodic vehicle routing. Networks 63:1 (2014), 2–15, 10.1002/net.21527.
53. Cao, E., Lai, M., The open vehicle routing problem with fuzzy demands. Expert Systems with Applications 37:3 (2010), 2405–2411, 10.1016/j.eswa.2009.07.021.
54. Cao, E., Lai, M., Yang, H., Open vehicle routing problem with demand uncertainty and its robust strategies. Expert Systems with Applications 41:7 (2014), 3569–3575, 10.1016/j.eswa.2013.11.004.
55. Çatay, B., A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications 37:10 (2010), 6809–6817, 10.1016/j.eswa.2010.03.045.
56. Cattaruzza, D., Absi, N., Feillet, D., Vidal, T., A memetic algorithm for the multi trip vehicle routing problem. European Journal of Operational Research 236:3 (2014), 833–848, 10.1016/j.ejor.2013.06.012.
57. Cattaruzza, D., Absi, N., Feillet, D., Vigo, D., An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows. Computers & Operations Research 51 (2014), 257–267, 10.1016/j.cor.2014.06.006.
58. Ceselli, A., Righini, G., Salani, M., A column generation algorithm for a rich vehicle-routing problem. Transportation Science 43:1 (2009), 56–69, 10.1287/trsc.1080.0256.
59. Chardy, M., Klopfenstein, O., Handling uncertainties in vehicle routing problems through data preprocessing. Transportation Research Part E: Logistics and Transportation Review 48:3 (2012), 667–683, 10.1016/j.tre.2011.12.001.
60. Chen, X., Feng, L., Soon Ong, Y., A self-adaptive memeplexes robust search scheme for solving stochastic demands vehicle routing problem. International Journal of Systems Science 43:7 (2012), 1347–1366, 10.1080/00207721.2011.618646.
61. Chen, H.-K., Hsueh, C.-F., Chang, M.-S., Production scheduling and vehicle routing with time windows for perishable food products. Computers & Operations Research 36:7 (2009), 2311–2319, 10.1016/j.cor.2008.09.010.
62. Chen, P., Huang, H., Dong, X.-Y., Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Systems with Applications 37:2 (2010), 1620–1627, 10.1016/j.eswa.2009.06.047.
63. Chen, Q., Li, K., Liu, Z., Model and algorithm for an unpaired pickup and delivery vehicle routing problem with split loads. Transportation Research Part E: Logistics and Transportation Review 69 (2014), 218–235, 10.1016/j.tre.2014.06.010.
64. Cheng, C.-B., Wang, K.-P., Solving a vehicle routing problem with time windows by a decomposition technique and a genetic algorithm. Expert Systems with Applications 36:4 (2009), 7758–7763, 10.1016/j.eswa.2008.09.001.
65. Chiang, T.-C., Hsu, W.-H., A knowledge-based evolutionary algorithm for the multiobjective vehicle routing problem with time windows. Computers & Operations Research 45 (2014), 25–37, 10.1016/j.cor.2013.11.014.
66. Ćirović, G., Pamučar, D., Božanić, D., Green logistic vehicle routing problem: Routing light delivery vehicles in urban areas using a neuro-fuzzy model. Expert Systems with Applications 41:9 (2014), 4245–4258, 10.1016/j.eswa.2014.01.005.
67. Clarke, G., Wright, J.W., Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12:4 (1964), 568–582, 10.1287/opre.12.4.568.
68. Coelho, L.C., Cordeau, J.-F., Laporte, G., Thirty years of inventory routing. Transportation Science 48:1 (2014), 1–19, 10.1287/trsc.2013.0472.
69. Cordeau, J.-F., Maischberger, M., A parallel iterated tabu search heuristic for vehicle routing problems. Computers & Operations Research 39:9 (2012), 2033–2050, 10.1016/j.cor.2011.09.021.
70. Cortés, C.E., Matamala, M., Contardo, C., The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. European Journal of Operational Research 200:3 (2010), 711–724, 10.1016/j.ejor.2009.01.022.
71. Dabia, S., Ropke, S., van Woensel, T., De Kok, T., Branch and price for the time-dependent vehicle routing problem with time windows. Transportation Science 47:3 (2013), 380–396, 10.1287/trsc.1120.0445.
72. Dantzig, G.B., Ramser, J.H., The truck dispatching problem. Management Science 6:1 (1959), 80–92, 10.1287/mnsc.6.1.80.
73. Dayarian, I., Crainic, T.G., Gendreau, M., Rei, W., A branch-and-price approach for a multi-period vehicle routing problem. Computers & Operations Research 55 (2015), 167–184, 10.1016/j.cor.2014.06.004.
74. Dayarian, I., Crainic, T.G., Gendreau, M., Rei, W., A column generation approach for a multi-attribute vehicle routing problem. European Journal of Operational Research 241:3 (2015), 888–906, 10.1016/j.ejor.2014.09.015.
75. Demir, E., Bektaş, T., Laporte, G., An adaptive large neighborhood search heuristic for the pollution-routing problem. European Journal of Operational Research 223:2 (2012), 346–359, 10.1016/j.ejor.2012.06.044.
76. Demir, E., Bektaş, T., Laporte, G., The bi-objective pollution-routing problem. European Journal of Operational Research 232:3 (2014), 464–478, 10.1016/j.ejor.2013.08.002.
77. Derigs, U., Pullmann, M., Vogel, U., A short note on applying a simple LS/LNS-based metaheuristic to the rollon–rolloff vehicle routing problem. Computers & Operations Research 40:3 (2013), 867–872.
78. Derigs, U., Pullmann, M., Vogel, U., Truck and trailer routing—Problems, heuristics and computational experience. Computers & Operations Research 40:2 (2013), 536–546, 10.1016/j.cor.2012.08.007.
79. Desaulniers, G., Branch-and-Price-and-cut for the split-delivery vehicle routing problem with time windows. Operations Research 58:1 (2010), 179–192, 10.1287/opre.1090.0713.
80. Drexl, M., Rich vehicle routing in theory and practice. Logistics Research 5:1–2 (2012), 47–63.
81. Drexl, M., Synchronization in vehicle routing – A survey of VRPs with multiple synchronization constraints. Transportation Science 46:3 (2012), 297–316, 10.1287/trsc.1110.0400.
82. Drexl, M., Applications of the vehicle routing problem with trailers and transshipments. European Journal of Operational Research 227:2 (2013), 275–284, 10.1016/j.ejor.2012.12.015.
83. Eksioglu, B., Vural, A.V., Reisman, A., The vehicle routing problem: A taxonomic review. Computers & Industrial Engineering 57:4 (2009), 1472–1483, 10.1016/j.cie.2009.05.009.
84. Erdoğan, S., Miller-Hooks, E., A green vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review 48:1 (2012), 100–114, 10.1016/j.tre.2011.08.001.
85. Erera, A.L., Morales, J.C., Savelsbergh, M., The vehicle routing problem with stochastic demand and duration constraints. Transportation Science 44:4 (2010), 474–492, 10.1287/trsc.1100.0324.
86. Felipe, Á., Ortuño, M.T., Righini, G., Tirado, G., A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges. Transportation Research Part E: Logistics and Transportation Review 71 (2014), 111–128, 10.1016/j.tre.2014.09.003.
87. Felipe, Á., Ortuño, M.T., Tirado, G., Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints. European Journal of Operational Research 211:1 (2011), 66–75, 10.1016/j.ejor.2010.11.011.
88. Ferrucci, F., Bock, S., Gendreau, M., A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods. European Journal of Operational Research 225:1 (2013), 130–141, 10.1016/j.ejor.2012.09.016.
89. Figliozzi, M.A., Planning approximations to the average length of vehicle routing problems with time window constraints. Transportation Research Part B: Methodological 43:4 (2009), 438–447, 10.1016/j.trb.2008.08.004.
90. Figliozzi, M.A., An iterative route construction and improvement algorithm for the vehicle routing problem with soft time windows. Transportation Research Part C: Emerging Technologies 18:5 (2010), 668–679, 10.1016/j.trc.2009.08.005.
91. Figliozzi, M.A., The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics. Transportation Research Part E: Logistics and Transportation Review 48:3 (2012), 616–636, 10.1016/j.tre.2011.11.006.
92. Fleming, C.L., Griffis, S.E., Bell, J.E., The effects of triangle inequality on the vehicle routing problem. European Journal of Operational Research 224:1 (2013), 1–7, 10.1016/j.ejor.2012.07.005.
93. Fleszar, K., Osman, I.H., Hindi, K.S., A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research 195:3 (2009), 803–809, 10.1016/j.ejor.2007.06.064.
94. Gajpal, Y., Abad, P., An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Computers & Operations Research 36:12 (2009), 3215–3223, 10.1016/j.cor.2009.02.017.
95. Gajpal, Y., Abad, P.L., Multi-ant colony system (MACS) for a vehicle routing problem with backhauls. European Journal of Operational Research 196:1 (2009), 102–117, 10.1016/j.ejor.2008.02.025.
96. Garcia-Najera, A., Bullinaria, J.A., An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows. Computers & Operations Research 38:1 (2011), 287–300, 10.1016/j.cor.2010.05.004.
97. Gauvin, C., Desaulniers, G., Gendreau, M., A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Computers & Operations Research 50 (2014), 141–153, 10.1016/j.cor.2014.03.028.
98. Gendreau, M., & Tarantilis, C. D. (2010). Solving large-scale vehicle routing problems with time windows: The state-of-the-art. Montreal.
99. Gendreau, M., Potvin, J.-Y., Bräysy, O., Hasle, G., Lokketangen, A., Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. Golden, B., Raghavan, S., Wasil, E., (eds.) The vehicle routing problem: Latest advances and new challenges. Operations research/computer science interfaces series, Vol. 43, 2008, Springer, 143–169.
100. Ghoseiri, K., Ghannadpour, S.F., Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Applied Soft Computing 10:4 (2010), 1096–1107, 10.1016/j.asoc.2010.04.001.
101. Glover, F., Future paths for integer programming and links to artificial intelligence. Computers & Operations Research 13:5 (1986), 533–549, 10.1016/0305-0548(86)90048-1.
102. Goel, A., Vehicle scheduling and routing with drivers’ working hours. Transportation Science 43:1 (2009), 17–26, 10.1287/trsc.1070.0226.
103. Goksal, F.P., Karaoglan, I., Altiparmak, F., A hybrid discrete particle swarm optimization for vehicle routing problem with simultaneous pickup and delivery. Computers & Industrial Engineering 65:1 (2013), 39–53, 10.1016/j.cie.2012.01.005.
104. Golden, B., Raghavan, S., Wasil, E., The vehicle routing problem: Latest advances and new challenges Operations research/computer science interfaces series, Vol. 43, 2008, Springer.
105. Goodson, J.C., Ohlmann, J.W., Thomas, B.W., Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. European Journal of Operational Research 217:2 (2012), 312–323, 10.1016/j.ejor.2011.09.023.
106. Gounaris, C.E., Wiesemann, W., Floudas, C.A., The robust capacitated vehicle routing problem under demand uncertainty. Operations Research 61:3 (2013), 677–693, 10.1287/opre.1120.1136.
107. Groër, C., Golden, B., Wasil, E., The consistent vehicle routing problem. Manufacturing & Service Operations Management 11:4 (2009), 630–643, 10.1287/msom.1080.0243.
108. Gulczynski, D., Golden, B., Wasil, E., The split delivery vehicle routing problem with minimum delivery amounts. Transportation Research Part E: Logistics and Transportation Review 46:5 (2010), 612–626, 10.1016/j.tre.2009.12.007.
109. Gulczynski, D., Golden, B., Wasil, E., The multi-depot split delivery vehicle routing problem: An integer programming-based heuristic, new test problems, and computational results. Computers & Industrial Engineering 61:3 (2011), 794–804, 10.1016/j.cie.2011.05.012.
110. Gulczynski, D., Golden, B., Wasil, E., The period vehicle routing problem: New heuristics and real-world variants. Transportation Research Part E: Logistics and Transportation Review 47:5 (2011), 648–668, 10.1016/j.tre.2011.02.002.
111. Gutiérrez-Jarpa, G., Desaulniers, G., Laporte, G., Marianov, V., A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows. European Journal of Operational Research 206:2 (2010), 341–349, 10.1016/j.ejor.2010.02.037.
112. Gutin, G., Punnen, A.P., The traveling salesman problem and its variations. Springer, 2007, 10.1007/b101971.
113. Hà, M.H., Bostel, N., Langevin, A., Rousseau, L.-M., An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size. Computers & Operations Research 43 (2014), 9–19, 10.1016/j.cor.2013.08.017.
114. Han, J., Lee, C., Park, S., A robust scenario approach for the vehicle routing problem with uncertain travel times. Transportation Science 48:3 (2014), 373–390, 10.1287/trsc.2013.0476.
115. Hemmelmayr, V.C., Cordeau, J.-F., Crainic, T.G., An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers & Operations Research 39:12 (2012), 3215–3228.
116. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F., A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research 195:3 (2009), 791–802, 10.1016/j.ejor.2007.08.048.
117. Hoff, A., Gribkovskaia, I., Laporte, G., Løkketangen, A., Lasso solution strategies for the vehicle routing problem with pickups and deliveries. European Journal of Operational Research 192:3 (2009), 755–766, 10.1016/j.ejor.2007.10.021.
118. Hong, L., An improved LNS algorithm for real-time vehicle routing problem with time windows. Computers & Operations Research 39:2 (2012), 151–163, 10.1016/j.cor.2011.03.006.
119. Hu, Z.-H., Sheu, J.-B., Zhao, L., Lu, C.-C., A dynamic closed-loop vehicle routing problem with uncertainty and incompatible goods. Transportation Research Part C: Emerging Technologies 55 (2015), 273–297, 10.1016/j.trc.2015.01.010.
120. Hu, X., Sun, L., Liu, L., A PAM approach to handling disruptions in real-time vehicle routing problems. Decision Support Systems 54:3 (2013), 1380–1393.
121. Ichoua, S., Gendreau, M., Potvin, J.-Y., Vehicle dispatching with time-dependent travel times. European Journal of Operational Research 144:2 (2003), 379–396, 10.1016/S0377-2217(02)00147-9.
122. Imran, A., Salhi, S., Wassan, N.A., A variable neighborhood-based heuristic for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research 197:2 (2009), 509–518, 10.1016/j.ejor.2008.07.022.
123. 2 emissions in time-dependent vehicle routing. Production and Operations Management 21:6 (2012), 1060–1074, 10.1111/j.1937-5956.2012.01338.x.
124. Janssens, G.K., Caris, A., Ramaekers, K., Time Petri nets as an evaluation tool for handling travel time uncertainty in vehicle routing solutions. Expert Systems with Applications 36:3 (2009), 5987–5991, 10.1016/j.eswa.2008.07.001.
125. Janssens, J., Van den Bergh, J., Sörensen, K., Cattrysse, D., Multi-objective microzone-based vehicle routing for courier companies: From tactical to operational planning. European Journal of Operational Research 242:1 (2015), 222–231, 10.1016/j.ejor.2014.09.026.
126. Jiang, J., Ng, K.M., Poh, K.L., Teo, K.M., Vehicle routing problem with a heterogeneous fleet and time windows. Expert Systems with Applications 41:8 (2014), 3748–3760, 10.1016/j.eswa.2013.11.029.
127. Jin, J., Crainic, T.G., Løkketangen, A., A parallel multi-neighborhood cooperative tabu search for capacitated vehicle routing problems. European Journal of Operational Research 222:3 (2012), 441–451, 10.1016/j.ejor.2012.05.025.
128. Jin, J., Crainic, T.G., Løkketangen, A., A cooperative parallel metaheuristic for the capacitated vehicle routing problem. Computers & Operations Research 44 (2014), 33–41, 10.1016/j.cor.2013.10.004.
129. Jozefowiez, N., Semet, F., Talbi, E.-G., An evolutionary algorithm for the vehicle routing problem with route balancing. European Journal of Operational Research 195:3 (2009), 761–769, 10.1016/j.ejor.2007.06.065.
130. Juan, A.A., Faulin, J., Caceres-Cruz, J., Barrios, B.B., Martinez, E., A successive approximations method for the heterogeneous vehicle routing problem: Analysing different fleet configurations. European Journal of Industrial Engineering 8:6 (2014), 762–788, 10.1504/EJIE.2014.066934.
131. Juan, A., Faulin, J., Grasman, S., Riera, D., Marull, J., Mendez, C., Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands. Transportation Research Part C: Emerging Technologies 19:5 (2011), 751–765, 10.1016/j.trc.2010.09.007.
132. Karlaftis, M.G., Kepaptsoglou, K., Sambracos, E., Containership routing with time deadlines and simultaneous deliveries and pick-ups. Transportation Research Part E: Logistics and Transportation Review 45:1 (2009), 210–221, 10.1016/j.tre.2008.05.001.
133. Ke, L., Feng, Z., A two-phase metaheuristic for the cumulative capacitated vehicle routing problem. Computers & Operations Research 40:2 (2013), 633–638.
134. Kergosien, Y., Lenté, C., Billaut, J.-C., Perrin, S., Metaheuristic algorithms for solving two interconnected vehicle routing problems in a hospital complex. Computers & Operations Research 40:10 (2013), 2508–2518, 10.1016/j.cor.2013.01.009.
135. Khouadjia, M.R., Sarasola, B., Alba, E., Jourdan, L., Talbi, E.-G., A comparative study between dynamic adapted PSO and VNS for the vehicle routing problem with dynamic requests. Applied Soft Computing 12:4 (2012), 1426–1439, 10.1016/j.asoc.2011.10.023.
136. Kim, H., Yang, J., Lee, K.-D., Vehicle routing in reverse logistics for recycling end-of-life consumer electronic goods in South Korea. Transportation Research Part D: Transport and Environment 14:5 (2009), 291–299, 10.1016/j.trd.2009.03.001.
137. Kirkpatrick, S., Gelatt, C.D. Jr., Vecchi, M.P., Optimization by simulated annealing. Science 220:4598 (1983), 671–680, 10.1126/science.220.4598.671.
138. Kok, A.L., Hans, E.W., Schutten, J.M.J., Vehicle routing under time-dependent travel times: The impact of congestion avoidance. Computers & Operations Research 39:5 (2012), 910–918, 10.1016/j.cor.2011.05.027.
139. Kok, A.L., Meyer, C.M., Kopfer, H., Schutten, J.M.J., A Dynamic programming heuristic for the vehicle routing problem with time windows and european community social legislation. Transportation Science 44:4 (2010), 442–454, 10.1287/trsc.1100.0331.
140. Krichen, S., Faiz, S., Tlili, T., Tej, K., Tabu-based GIS for solving the vehicle routing problem. Expert Systems with Applications 41:14 (2014), 6483–6493, 10.1016/j.eswa.2014.03.028.
141. Küçükoğlu, İ., Öztürk, N., A differential evolution approach for the vehicle routing problem with backhauls and time windows. Journal of Advanced Transportation 48:8 (2014), 942–956, 10.1002/atr.1237.
142. Kuo, Y., Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem. Computers & Industrial Engineering 59:1 (2010), 157–165, 10.1016/j.cie.2010.03.012.
143. Kuo, Y., Wang, C.-C., A variable neighborhood search for the multi-depot vehicle routing problem with loading cost. Expert Systems with Applications 39:8 (2012), 6949–6954, 10.1016/j.eswa.2012.01.024.
144. Kuo, Y., Wang, C.-C., Chuang, P.-Y., Optimizing goods assignment and the vehicle routing problem with time-dependent travel speeds. Computers & Industrial Engineering 57:4 (2009), 1385–1392, 10.1016/j.cie.2009.07.006.
145. Kuo, R.J., Zulvia, F.E., Suryadi, K., Hybrid particle swarm optimization with genetic algorithm for solving capacitated vehicle routing problem with fuzzy demand – A case study on garbage collection system. Applied Mathematics and Computation 219:5 (2012), 2574–2588.
146. Kwon, Y.-J., Choi, Y.-J., Lee, D.-H., Heterogeneous fixed fleet vehicle routing considering carbon emission. Transportation Research Part D: Transport and Environment 23 (2013), 81–89, 10.1016/j.trd.2013.04.001.
147. Lahyani, R., Coelho, L.C., Khemakhem, M., Laporte, G., Semet, F., A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia. Omega 51 (2015), 1–10, 10.1016/j.omega.2014.08.007.
148. Lahyani, R., Khemakhem, M., Semet, F., Rich vehicle routing problems: From a taxonomy to a definition. European Journal of Operational Research 241:1 (2015), 1–14, 10.1016/j.ejor.2014.07.048.
149. Laporte, G., Fifty years of vehicle routing. Transportation Science 43:4 (2009), 408–416, 10.1287/trsc.1090.0301.
150. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B., The traveling salesman problem: A guided tour of combinatorial optimization. 1985, Wiley.
151. Lei, H., Laporte, G., Guo, B., The capacitated vehicle routing problem with stochastic demands and time windows. Computers & Operations Research 38:12 (2011), 1775–1783, 10.1016/j.cor.2011.02.007.
152. Lenstra, J.K., Rinnooy Kan, A.H.G., Complexity of vehicle routing and scheduling problems. Networks 11:2 (1981), 221–227.
153. Letchford, A.N., Nasiri, S.D., Oukil, A., Pricing routines for vehicle routing with time windows on road networks. Computers & Operations Research 51 (2014), 331–337, 10.1016/j.cor.2014.06.022.
154. Leung, S.C.H., Zhang, Z., Zhang, D., Hua, X., Lim, M.K., A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. European Journal of Operational Research 225:2 (2013), 199–210, 10.1016/j.ejor.2012.09.023.
155. Li, X., Leung, S.C.H., Tian, P., A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Systems with Applications 39:1 (2012), 365–374, 10.1016/j.eswa.2011.07.025.
156. Li, J., Pardalos, P.M., Sun, H., Pei, J., Zhang, Y., Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. Expert Systems with Applications 42:7 (2015), 3551–3561, 10.1016/j.eswa.2014.12.004.
157. Li, X., Tian, P., Aneja, Y.P., An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review 46:6 (2010), 1111–1127, 10.1016/j.tre.2010.02.004.
158. Li, X., Tian, P., Leung, S.C.H., Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm. International Journal of Production Economics 125:1 (2010), 137–145, 10.1016/j.ijpe.2010.01.013.
159. Liao, T.-Y., Hu, T.-Y., An object-oriented evaluation framework for dynamic vehicle routing problems under real-time information. Expert Systems with Applications 38:10 (2011), 12548–12558, 10.1016/j.eswa.2011.04.041.
160. Liao, C.-J., Lin, Y., Shih, S.C., Vehicle routing with cross-docking in the supply chain. Expert Systems with Applications 37:10 (2010), 6868–6873, 10.1016/j.eswa.2010.03.035.
161. Lin, S., Computer solutions of the traveling salesman problem. Bell System Technical Journal 44:10 (1965), 2245–2269, 10.1002/j.1538-7305.1965.tb04146.x.
162. Lin, C.K.Y., A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources. Computers & Operations Research 38:11 (2011), 1596–1609, 10.1016/j.cor.2011.01.021.
163. Lin, C., Choy, K.L., Ho, G.T.S., Chung, S.H., Lam, H.Y., Survey of green vehicle routing problem: Past and future trends. Expert Systems with Applications 41:4 (2014), 1118–1138, 10.1016/j.eswa.2013.07.107.
164. Lin, S.-W., Lee, Z.-J., Ying, K.-C., Lee, C.-Y., Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Systems with Applications 36:2 (2009), 1505–1512, 10.1016/j.eswa.2007.11.060.
165. Lin, S.-W., Yu, V.F., Chou, S.-Y., Solving the truck and trailer routing problem based on a simulated annealing heuristic. Computers & Operations Research 36:5 (2009), 1683–1692, 10.1016/j.cor.2008.04.005.
166. Liu, S., A hybrid population heuristic for the heterogeneous vehicle routing problems. Transportation Research Part E: Logistics and Transportation Review 54 (2013), 67–78, 10.1016/j.tre.2013.03.010.
167. Liu, S., Huang, W., Ma, H., An effective genetic algorithm for the fleet size and mix vehicle routing problems. Transportation Research Part E: Logistics and Transportation Review 45:3 (2009), 434–445, 10.1016/j.tre.2008.10.003.
168. Liu, R., Jiang, Z., The close–open mixed vehicle routing problem. European Journal of Operational Research 220:2 (2012), 349–360, 10.1016/j.ejor.2012.01.061.
169. Liu, R., Jiang, Z., Fung, R.Y.K., Chen, F., Liu, X., Two-phase heuristic algorithms for full truckloads multi-depot capacitated vehicle routing problem in carrier collaboration. Computers & Operations Research 37:5 (2010), 950–959, 10.1016/j.cor.2009.08.002.
170. Liu, R., Xie, X., Augusto, V., Rodriguez, C., Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care. European Journal of Operational Research 230:3 (2013), 475–486, 10.1016/j.ejor.2013.04.044.
171. López-Sánchez, A.D., Hernández-Díaz, A.G., Vigo, D., Caballero, R., Molina, J., A multi-start algorithm for a balanced real-world open vehicle routing problem. European Journal of Operational Research 238:1 (2014), 104–113, 10.1016/j.ejor.2014.04.008.
172. Lorini, S., Potvin, J.-Y., Zufferey, N., Online vehicle routing and scheduling with dynamic travel times. Computers & Operations Research 38:7 (2011), 1086–1090, 10.1016/j.cor.2010.10.019.
173. Lu, C., Yu, V.F., Data envelopment analysis for evaluating the efficiency of genetic algorithms on solving the vehicle routing problem with soft time windows. Computers & Industrial Engineering 63:2 (2012), 520–529.
174. Luo, J., Chen, M.-R., Improved shuffled frog leaping algorithm and its multi-phase model for multi-depot vehicle routing problem. Expert Systems with Applications 41:5 (2014), 2535–2545, 10.1016/j.eswa.2013.10.001.
175. Luo, Z., Qin, H., Che, C., Lim, A., On service consistency in multi-period vehicle routing. European Journal of Operational Research 243:3 (2015), 731–744, 10.1016/j.ejor.2014.12.019.
176. Lysgaard, J., The pyramidal capacitated vehicle routing problem. European Journal of Operational Research 205:1 (2010), 59–64, 10.1016/j.ejor.2009.11.029.
177. Lysgaard, J., Wøhlk, S., A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. European Journal of Operational Research 236:3 (2014), 800–810, 10.1016/j.ejor.2013.08.032.
178. Ma, H., Cheang, B., Lim, A., Zhang, L., Zhu, Y., An investigation into the vehicle routing problem with time windows and link capacity constraints. Omega 40:3 (2012), 336–347, 10.1016/j.omega.2011.08.003.
179. Macedo, R., Alves, C., Valério de Carvalho, J.M., Clautiaux, F., Hanafi, S., Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. European Journal of Operational Research 214:3 (2011), 536–545, 10.1016/j.ejor.2011.04.037.
180. Maden, W., Eglese, R., Black, D., Vehicle routing and scheduling with time-varying data: A case study. Journal of the Operational Research Society 61:3 (2010), 515–522, 10.1057/jors.2009.116.
181. Marinakis, Y., Multiple phase neighborhood search-GRASP for the capacitated vehicle routing problem. Expert Systems with Applications 39:8 (2012), 6807–6815, 10.1016/j.eswa.2012.01.015.
182. Marinakis, Y., Iordanidou, G.-R., Marinaki, M., Particle swarm optimization for the vehicle routing problem with stochastic demands. Applied Soft Computing 13:4 (2013), 1693–1704, 10.1016/j.asoc.2013.01.007.
183. Marinakis, Y., Marinaki, M., A hybrid genetic – Particle swarm optimization algorithm for the vehicle routing problem. Expert Systems with Applications 37:2 (2010), 1446–1455, 10.1016/j.eswa.2009.06.085.
184. Marinakis, Y., Marinaki, M., Dounias, G., A hybrid particle swarm optimization algorithm for the vehicle routing problem. Engineering Applications of Artificial Intelligence 23:4 (2010), 463–472, 10.1016/j.engappai.2010.02.002.
185. Mattos Ribeiro, G., Laporte, G., An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem. Computers & Operations Research 39:3 (2012), 728–735, 10.1016/j.cor.2011.05.005.
186. McNabb, M.E., Weir, J.D., Hill, R.R., Hall, S.N., Testing local search move operators on the vehicle routing problem with split deliveries and time windows. Computers & Operations Research 56 (2015), 93–109, 10.1016/j.cor.2014.11.007.
187. Mendoza, J.E., Castanier, B., Guéret, C., Medaglia, A.L., Velasco, N., A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers & Operations Research 37:11 (2010), 1886–1898, 10.1016/j.cor.2009.06.015.
188. Mendoza, J.E., Castanier, B., Guéret, C., Medaglia, A.L., Velasco, N., Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transportation Science 45:3 (2011), 346–363, 10.1287/trsc.1100.0353.
189. Mendoza, J.E., Medaglia, A.L., Velasco, N., An evolutionary-based decision support system for vehicle routing: The case of a public utility. Decision Support Systems 46:3 (2009), 730–742, 10.1016/j.dss.2008.11.019.
190. Michallet, J., Prins, C., Amodeo, L., Yalaoui, F., Vitry, G., Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services. Computers & Operations Research 41 (2014), 196–207, 10.1016/j.cor.2013.07.025.
191. Minis, I., Tatarakis, A., Stochastic single vehicle routing problem with delivery and pick up and a predefined customer sequence. European Journal of Operational Research 213:1 (2011), 37–51, 10.1016/j.ejor.2011.03.011.
192. MirHassani, S.A., Abolghasemi, N., A particle swarm optimization algorithm for open vehicle routing problem. Expert Systems with Applications 38:9 (2011), 11547–11551, 10.1016/j.eswa.2011.03.032.
193. Moghaddam, B.F., Ruiz, R., Sadjadi, S.J., Vehicle routing problem with uncertain demands: An advanced particle swarm algorithm. Computers & Industrial Engineering 62:1 (2012), 306–317, 10.1016/j.cie.2011.10.001.
194. Montoya-Torres, J.R., Lopez France, J., Nieto Isaza, S., Felizzola Jimenez, H., Herazo-Padilla, N., A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering 79 (2015), 115–129, 10.1016/j.cie.2014.10.029.
195. Moon, I., Lee, J., Seong, J., Vehicle routing problem with time windows considering overtime and outsourcing vehicles. Expert Systems with Applications 39:18 (2012), 13202–13213.
196. Morais, V.W.C., Mateus, G.R., Noronha, T.F., Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Systems with Applications 41:16 (2014), 7495–7506, 10.1016/j.eswa.2014.06.010.
197. Moretti Branchini, R., Amaral Armentano, V., Løkketangen, A., Adaptive granular local search heuristic for a dynamic vehicle routing problem. Computers & Operations Research 36:11 (2009), 2955–2968, 10.1016/j.cor.2009.01.014.
198. Mouthuy, S., Massen, F., Deville, Y., Van Hentenryck, P., A multistage very large-scale neighborhood search for the vehicle routing problem with soft time windows. Transportation Science 49:2 (2015), 223–238, 10.1287/trsc.2014.0558.
199. Müller, J., Approximative solutions to the bicriterion vehicle routing problem with time windows. European Journal of Operational Research 202:1 (2010), 223–231, 10.1016/j.ejor.2009.04.029.
200. Muter, I., Cordeau, J.-F., Laporte, G., A branch-and-price algorithm for the multidepot vehicle routing problem with interdepot routes. Transportation Science., 2014 Retrieved from < http://pubsonline.informs.org/doi/10.1287/trsc.2013.0489>.
201. Muyldermans, L., Pang, G., On the benefits of co-collection: Experiments with a multi-compartment vehicle routing algorithm. European Journal of Operational Research 206:1 (2010), 93–103, 10.1016/j.ejor.2010.02.020.
202. Nagata, Y., Bräysy, O., Dullaert, W., A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research 37:4 (2010), 724–737, 10.1016/j.cor.2009.06.022.
203. Nagy, G., Wassan, N.A., Speranza, M.G., Archetti, C., The vehicle routing problem with divisible deliveries and pickups. Transportation Science 49:2 (2015), 271–294, 10.1287/trsc.2013.0501.
204. Nazif, H., Lee, L.S., Optimised crossover genetic algorithm for capacitated vehicle routing problem. Applied Mathematical Modelling 36:5 (2012), 2110–2117, 10.1016/j.apm.2011.08.010.
205. Ngueveu, S.U., Prins, C., Wolfler Calvo, R., An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Computers & Operations Research 37:11 (2010), 1877–1885, 10.1016/j.cor.2009.06.014.
206. Nguyen, P.K., Crainic, T.G., Toulouse, M., A tabu search for time-dependent multi-zone multi-trip vehicle routing problem with time windows. European Journal of Operational Research 231:1 (2013), 43–56, 10.1016/j.ejor.2013.05.026.
207. Norouzi, N., Tavakkoli-Moghaddam, R., Ghazanfari, M., Alinaghian, M., Salamatbakhsh, A., A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization. Networks and Spatial Economics 12:4 (2012), 609–633, 10.1007/s11067-011-9169-4.
208. Novoa, C., Storer, R., An approximate dynamic programming approach for the vehicle routing problem with stochastic demands. European Journal of Operational Research 196:2 (2009), 509–515, 10.1016/j.ejor.2008.03.023.
209. Osaba, E., Carballedo, R., Diaz, F., Perallos, A., Discussion related to “Wang, C.-H., & Lu, J.-Z. (2009). A hybrid genetic algorithm that optimizes capacitated vehicle routing problem. Expert Systems with Applications, 36(2), 2921–2936”. Expert Systems with Applications 40:14 (2013), 5425–5426, 10.1016/j.eswa.2013.04.008.
210. Palhazi Cuervo, D., Goos, P., Sörensen, K., Arráiz, E., An iterated local search algorithm for the vehicle routing problem with backhauls. European Journal of Operational Research 237:2 (2014), 454–464, 10.1016/j.ejor.2014.02.011.
211. Pandelis, D.G., Karamatsoukis, C.C., Kyriakidis, E.G., Finite and infinite-horizon single vehicle routing problems with a predefined customer sequence and pickup and delivery. European Journal of Operational Research 231:3 (2013), 577–586, 10.1016/j.ejor.2013.05.050.
212. Pandelis, D.G., Kyriakidis, E.G., Dimitrakos, T.D., Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands. European Journal of Operational Research 217:2 (2012), 324–332, 10.1016/j.ejor.2011.09.027.
213. Pang, K.-W., An adaptive parallel route construction heuristic for the vehicle routing problem with time windows constraints. Expert Systems with Applications 38:9 (2011), 11939–11946, 10.1016/j.eswa.2011.03.088.
214. Partyka, J., Hall, R., Vehicle routing software survey: VR delivers the goods. ORMS-Today, 41(1), 2014 Retrieved from < https://www.informs.org/ORMS-Today/Public-Articles/February-Volume-41-Number-1/Vehicle-Routing-Software-Survey-VR-delivers-the-goods>.
215. Penna, P.H.V., Subramanian, A., Ochi, L.S., An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. Journal of Heuristics 19:2 (2013), 201–232, 10.1007/s10732-011-9186-y.
216. Pillac, V., Gendreau, M., Guéret, C., Medaglia, A.L., A review of dynamic vehicle routing problems. European Journal of Operational Research 225:1 (2013), 1–11, 10.1016/j.ejor.2012.08.015.
217. Pillac, V., Guéret, C., Medaglia, A.L., An event-driven optimization framework for dynamic vehicle routing. Decision Support Systems 54:1 (2012), 414–423, 10.1016/j.dss.2012.06.007.
218. Polat, O., Kalayci, C.B., Kulak, O., Günther, H.-O., A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit. European Journal of Operational Research 242:2 (2015), 369–382, 10.1016/j.ejor.2014.10.010.
219. Pollaris, H., Braekers, K., Caris, A., Janssens, G.K., Limbourg, S., Vehicle routing problems with loading constraints: State-of-the-art and future directions. OR Spectrum 37:2 (2015), 297–330, 10.1007/s00291-014-0386-3.
220. Pop, P.C., Matei, O., Sitar, C.P., An improved hybrid algorithm for solving the generalized vehicle routing problem. Neurocomputing 109 (2013), 76–83, 10.1016/j.neucom.2012.03.032.
221. Pradenas, L., Oportus, B., Parada, V., Mitigation of greenhouse gas emissions in vehicle routing problems with backhauling. Expert Systems with Applications 40:8 (2013), 2985–2991.
222. Prescott-Gagnon, E., Desaulniers, G., Drexl, M., Rousseau, L.-M., European driver rules in vehicle routing with time windows. Transportation Science 44:4 (2010), 455–473, 10.1287/trsc.1100.0328.
223. Prescott-Gagnon, E., Desaulniers, G., Rousseau, L.-M., A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54:4 (2009), 190–204, 10.1002/net.20332.
224. Prins, C., Two memetic algorithms for heterogeneous fleet vehicle routing problems. Engineering Applications of Artificial Intelligence 22:6 (2009), 916–928, 10.1016/j.engappai.2008.10.006.
225. Prins, C., Lacomme, P., Prodhon, C., Order-first split-second methods for vehicle routing problems: A review. Technologies 40 (2014), 179–200, 10.1016/j.trc.2014.01.011.
226. Prodhon, C., Prins, C., A survey of recent research on location-routing problems. European Journal of Operational Research 238:1 (2014), 1–17, 10.1016/j.ejor.2014.01.005.
227. Psaraftis, H.N., Dynamic vehicle routing: Status and prospects. Annals of Operations Research 61:1 (1995), 143–164.
228. Pureza, V., Morabito, R., Reimann, M., Vehicle routing with multiple deliverymen: Modeling and heuristic approaches for the VRPTW. European Journal of Operational Research 218:3 (2012), 636–647, 10.1016/j.ejor.2011.12.005.
229. Qi, M., Lin, W.-H., Li, N., Miao, L., A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows. Transportation Research Part E: Logistics and Transportation Review 48:1 (2012), 248–257, 10.1016/j.tre.2011.07.001.
230. Qureshi, A.G., Taniguchi, E., Yamada, T., An exact solution approach for vehicle routing and scheduling problems with soft time windows. Transportation Research Part E: Logistics and Transportation Review 45:6 (2009), 960–977, 10.1016/j.tre.2009.04.007.
231. Rahimi-Vahed, A., Crainic, T.G., Gendreau, M., Rei, W., Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Computers & Operations Research 53 (2015), 9–23, 10.1016/j.cor.2014.07.004.
232. Rancourt, M.-E., Cordeau, J.-F., Laporte, G., Long-haul vehicle routing and scheduling with working hour rules. Transportation Science 47:1 (2013), 81–107.
233. Rasmussen, M.S., Justesen, T., Dohn, A., Larsen, J., The home care crew scheduling problem: Preference-based visit clustering and temporal dependencies. European Journal of Operational Research 219:3 (2012), 598–610, 10.1016/j.ejor.2011.10.048.
234. Rei, W., Gendreau, M., Soriano, P., A hybrid Monte Carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transportation Science 44:1 (2010), 136–146, 10.1287/trsc.1090.0295.
235. Ren, Y., Dessouky, M., Ordóñez, F., The multi-shift vehicle routing problem with overtime. Computers & Operations Research 37:11 (2010), 1987–1998, 10.1016/j.cor.2010.01.016.
236. Repoussis, P.P., Tarantilis, C.D., Solving the fleet size and mix vehicle routing problem with time windows via adaptive memory programming. Transportation Research Part C: Emerging Technologies 18:5 (2010), 695–712, 10.1016/j.trc.2009.08.004.
237. Repoussis, P.P., Tarantilis, C.D., Bräysy, O., Ioannou, G., A hybrid evolution strategy for the open vehicle routing problem. Computers & Operations Research 37:3 (2010), 443–455, 10.1016/j.cor.2008.11.003.
238. Rodríguez, A., Ruiz, R., A study on the effect of the asymmetry on real capacitated vehicle routing problems. Computers & Operations Research 39:9 (2012), 2142–2151, 10.1016/j.cor.2011.10.023.
239. Ropke, S., Cordeau, J.-F., Branch and cut and price for the pickup and delivery problem with time windows. Transportation Science 43:3 (2009), 267–286, 10.1287/trsc.1090.0272.
240. Salani, M., Vacca, I., Branch and price for the vehicle routing problem with discrete split deliveries and time windows. European Journal of Operational Research 213:3 (2011), 470–477, 10.1016/j.ejor.2011.03.023.
241. Salari, M., Toth, P., Tramontani, A., An ILP improvement procedure for the open vehicle routing problem. Computers & Operations Research 37:12 (2010), 2106–2120, 10.1016/j.cor.2010.02.010.
242. Salhi, S., Imran, A., Wassan, N.A., The multi-depot vehicle routing problem with heterogeneous vehicle fleet: Formulation and a variable neighborhood search implementation. Computers & Operations Research 52 (2014), 315–325, 10.1016/j.cor.2013.05.011.
243. Salhi, S., Wassan, N., Hajarat, M., The fleet size and mix vehicle routing problem with backhauls: Formulation and set partitioning-based heuristics. Transportation Research Part E: Logistics and Transportation Review 56 (2013), 22–35, 10.1016/j.tre.2013.05.005.
244. Santos, L., Coutinho-Rodrigues, J., Antunes, C.H., A web spatial decision support system for vehicle routing using Google Maps. Decision Support Systems 51:1 (2011), 1–9, 10.1016/j.dss.2010.11.008.
245. Schneider, M., Sand, B., Stenger, A., A note on the time travel approach for handling time windows in vehicle routing problems. Computers & Operations Research 40:10 (2013), 2564–2568, 10.1016/j.cor.2013.02.002.
246. Schneider, M., Stenger, A., Goeke, D., The electric vehicle-routing problem with time windows and recharging stations. Transportation Science 48:4 (2014), 500–520, 10.1287/trsc.2013.0490.
247. Secomandi, N., Margot, F., Reoptimization approaches for the vehicle-routing problem with stochastic demands. Operations Research 57:1 (2009), 214–230, 10.1287/opre.1080.0520.
248. Silva, M.M., Subramanian, A., Ochi, L.S., An iterated local search heuristic for the split delivery vehicle routing problem. Computers & Operations Research 53 (2015), 234–249, 10.1016/j.cor.2014.08.005.
249. Sörensen, K., Schittekat, P., Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem. Computers & Operations Research 40:12 (2013), 3197–3205, 10.1016/j.cor.2013.02.005.
250. Stenger, A., Vigo, D., Enz, S., Schwind, M., An adaptive variable neighborhood search algorithm for a vehicle routing problem arising in small package shipping. Transportation Science 47:1 (2013), 64–80, 10.1287/trsc.1110.0396.
251. Subramanian, A., Drummond, L.M.A., Bentes, C., Ochi, L.S., Farias, R., A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Computers & Operations Research 37:11 (2010), 1899–1911, 10.1016/j.cor.2009.10.011.
252. Subramanian, A., Penna, P.H.V., Uchoa, E., Ochi, L.S., A hybrid algorithm for the heterogeneous fleet vehicle routing problem. European Journal of Operational Research 221:2 (2012), 285–295, 10.1016/j.ejor.2012.03.016.
253. Subramanian, A., Uchoa, E., Ochi, L.S., A hybrid algorithm for a class of vehicle routing problems. Computers & Operations Research 40:10 (2013), 2519–2531, 10.1016/j.cor.2013.01.013.
254. Szeto, W.Y., Wu, Y., Ho, S.C., An artificial bee colony algorithm for the capacitated vehicle routing problem. European Journal of Operational Research 215:1 (2011), 126–135, 10.1016/j.ejor.2011.06.006.
255. Tang, J., Ma, Y., Guan, J., Yan, C., A max–min ant system for the split delivery weighted vehicle routing problem. Expert Systems with Applications 40:18 (2013), 7468–7477, 10.1016/j.eswa.2013.06.068.
256. Tang, J., Yu, Y., Li, J., An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport. Transportation Research Part E: Logistics and Transportation Review 73 (2015), 114–132, 10.1016/j.tre.2014.11.001.
257. Tang, J., Zhang, J., Pan, Z., A scatter search algorithm for solving vehicle routing problem with loading cost. Expert Systems with Applications 37:6 (2010), 4073–4083, 10.1016/j.eswa.2009.11.027.
258. Tarantilis, C.D., Anagnostopoulou, A.K., Repoussis, P.P., Adaptive path relinking for vehicle routing and scheduling problems with product returns. Transportation Science 47:3 (2013), 356–379, 10.1287/trsc.1120.0439.
259. Tarantilis, C.D., Stavropoulou, F., Repoussis, P.P., A template-based tabu search algorithm for the consistent vehicle routing problem. Expert Systems with Applications 39:4 (2012), 4233–4239, 10.1016/j.eswa.2011.09.111.
260. Taş, D., Dellaert, N., van Woensel, T., de Kok, T., Vehicle routing problem with stochastic travel times including soft time windows and service costs. Computers & Operations Research 40:1 (2013), 214–224.
261. Taş, D., Dellaert, N., van Woensel, T., de Kok, T., The time-dependent vehicle routing problem with soft time windows and stochastic travel times. Transportation Research Part C: Emerging Technologies 48 (2014), 66–83, 10.1016/j.trc.2014.08.007.
262. Taş, D., Gendreau, M., Dellaert, N., van Woensel, T., de Kok, A.G., Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach. European Journal of Operational Research 236:3 (2014), 789–799, 10.1016/j.ejor.2013.05.024.
263. Taş, D., Jabali, O., Van Woensel, T., A vehicle routing problem with flexible time windows. Computers & Operations Research 52 (2014), 39–54, 10.1016/j.cor.2014.07.005.
264. Tasan, A.S., Gen, M., A genetic algorithm based approach to vehicle routing problem with simultaneous pick-up and deliveries. Computers & Industrial Engineering 62:3 (2012), 755–761, 10.1016/j.cie.2011.11.025.
265. Toth, P., Vigo, D., The vehicle routing problem. 2002, MOS-SIAM Series on Optimization, SIAM, 10.1137/1.9780898718515.
266. Toth, P., Vigo, D., Vehicle routing: Problems, methods, and applications. 2nd ed., 2014, MOS-SIAM Series on Optimization, SIAM, Philadelphia.
267. Tu, W., Fang, Z., Li, Q., Shaw, S.-L., Chen, B., A bi-level Voronoi diagram-based metaheuristic for a large-scale multi-depot vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review 61 (2014), 84–97, 10.1016/j.tre.2013.11.003.
268. Ullrich, C.A., Integrated machine scheduling and vehicle routing with time windows. European Journal of Operational Research 227:1 (2013), 152–165, 10.1016/j.ejor.2012.11.049.
269. Valle, C.A., Martinez, L.C., da Cunha, A.S., Mateus, G.R., Heuristic and exact algorithms for a min–max selective vehicle routing problem. Computers & Operations Research 38:7 (2011), 1054–1065, 10.1016/j.cor.2010.10.010.
270. Vidal, T., Battarra, M., Subramanian, A., Erdogan, G., Hybrid metaheuristics for the clustered vehicle routing problem. Computers & Operations Research 58 (2015), 87–99, 10.1016/j.cor.2014.10.019.
271. Vidal, T., Crainic, T.G., Gendreau, M., Lahrichi, N., Rei, W., A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Operations Research 60:3 (2012), 611–624, 10.1287/opre.1120.1048.
272. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C., A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Computers & Operations Research 40:1 (2013), 475–489.
273. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C., Heuristics for multi-attribute vehicle routing problems: A survey and synthesis. European Journal of Operational Research 231:1 (2013), 1–21, 10.1016/j.ejor.2013.02.053.
274. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C., A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research 234:3 (2014), 658–673, 10.1016/j.ejor.2013.09.045.
275. Vidal, T., Crainic, T.G., Gendreau, M., Prins, C., Implicit depot assignments and rotations in vehicle routing heuristics. European Journal of Operational Research 237:1 (2014), 15–28, 10.1016/j.ejor.2013.12.044.
276. Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N., A GRASP with evolutionary path relinking for the truck and trailer routing problem. Computers & Operations Research 38:9 (2011), 1319–1334, 10.1016/j.cor.2010.11.011.
277. Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N., A matheuristic for the truck and trailer routing problem. European Journal of Operational Research 230:2 (2013), 231–244, 10.1016/j.ejor.2013.04.026.
278. Wang, C.-H., Lu, J.-Z., A hybrid genetic algorithm that optimizes capacitated vehicle routing problems. Expert Systems with Applications 36:2 (2009), 2921–2936, 10.1016/j.eswa.2008.01.072.
279. Wang, C., Mu, D., Zhao, F., Sutherland, J.W., A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup–delivery and time windows. Computers & Industrial Engineering 83 (2015), 111–122, 10.1016/j.cie.2015.02.005.
280. Wen, M., Cordeau, J.-F., Laporte, G., Larsen, J., The dynamic multi-period vehicle routing problem. Computers & Operations Research 37:9 (2010), 1615–1623, 10.1016/j.cor.2009.12.002.
281. Wy, J., Kim, B.-I., A hybrid metaheuristic approach for the rollon–rolloff vehicle routing problem. Computers & Operations Research 40:8 (2013), 1947–1952, 10.1016/j.cor.2013.03.006.
282. Wy, J., Kim, B.-I., Kim, S., The rollon–rolloff waste collection vehicle routing problem with time windows. European Journal of Operational Research 224:3 (2013), 466–476, 10.1016/j.ejor.2012.09.001.
283. Xiao, L., Lo, H.K., Adaptive vehicle routing for risk-averse travelers. Transportation Research Part C: Emerging Technologies 36 (2013), 460–479, 10.1016/j.trc.2013.06.015.
284. Xu, J., Yan, F., Li, S., Vehicle routing optimization with soft time windows in a fuzzy random environment. Transportation Research Part E: Logistics and Transportation Review 47:6 (2011), 1075–1091, 10.1016/j.tre.2011.04.002.
285. Yan, S., Wang, S., Wu, M., A model with a solution algorithm for the cash transportation vehicle routing and scheduling problem. Computers & Industrial Engineering 63:2 (2012), 464–473.
286. Yao, B., Hu, P., Zhang, M., Wang, S., Artificial bee colony algorithm with scanning strategy for the periodic vehicle routing problem. Simulation 89:6 (2013), 762–770, 10.1177/0037549713481503.
287. Yazgı Tütüncü, G., An interactive GRAMPS algorithm for the heterogeneous fixed fleet vehicle routing problem with and without backhauls. European Journal of Operational Research 201:2 (2010), 593–600, 10.1016/j.ejor.2009.03.044.
288. Yazgı Tütüncü, G., Carreto, C.A., Baker, B.M., A visual interactive approach to classical and mixed vehicle routing problems with backhauls☆. Omega 37:1 (2009), 138–154, 10.1016/j.omega.2006.11.001.
289. Yu, S., Ding, C., Zhu, K., A hybrid GA–TS algorithm for open vehicle routing optimization of coal mines material. Expert Systems with Applications 38:8 (2011), 10568–10573, 10.1016/j.eswa.2011.02.108.
290. Yu, M., Qi, X., A vehicle routing problem with multiple overlapped batches. Transportation Research Part E: Logistics and Transportation Review 61 (2014), 40–55, 10.1016/j.tre.2013.10.004.
291. Yu, B., Yang, Z.Z., An ant colony optimization model: The period vehicle routing problem with time windows. Transportation Research Part E: Logistics and Transportation Review 47:2 (2011), 166–181, 10.1016/j.tre.2010.09.010.
292. Yu, B., Yang, Z.-Z., Xie, J.-X., A parallel improved ant colony optimization for multi-depot vehicle routing problem. Journal of the Operational Research Society 62:1 (2011), 183–188, 10.1057/jors.2009.161.
293. Yu, B., Yang, Z.Z., Yao, B., An improved ant colony optimization for vehicle routing problem. European Journal of Operational Research 196:1 (2009), 171–176, 10.1016/j.ejor.2008.02.028.
294. Yu, B., Yang, Z.Z., Yao, B., A hybrid algorithm for vehicle routing problem with time windows. Expert Systems with Applications 38:1 (2011), 435–441, 10.1016/j.eswa.2010.06.082.
295. Yücenur, G.N., Demirel, N.Ç., A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Systems with Applications 38:9 (2011), 11859–11865, 10.1016/j.eswa.2011.03.077.
296. Yurtkuran, A., Emel, E., A new hybrid electromagnetism-like algorithm for capacitated vehicle routing problems. Expert Systems with Applications 37:4 (2010), 3427–3433, 10.1016/j.eswa.2009.10.005.
297. Zachariadis, E.E., Kiranoudis, C.T., A strategy for reducing the computational complexity of local search-based methods for the vehicle routing problem. Computers & Operations Research 37:12 (2010), 2089–2105, 10.1016/j.cor.2010.02.009.
298. Zachariadis, E.E., Kiranoudis, C.T., An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Computers & Operations Research 37:4 (2010), 712–723, 10.1016/j.cor.2009.06.021.
299. Zachariadis, E.E., Kiranoudis, C.T., An effective local search approach for the vehicle routing problem with backhauls. Expert Systems with Applications 39:3 (2012), 3174–3184, 10.1016/j.eswa.2011.09.004.
300. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T., A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Systems with Applications 36:2 (2009), 1070–1081, 10.1016/j.eswa.2007.11.005.
301. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T., An adaptive memory methodology for the vehicle routing problem with simultaneous pick-ups and deliveries. European Journal of Operational Research 202:2 (2010), 401–411, 10.1016/j.ejor.2009.05.015.
302. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T., Designing vehicle routes for a mix of different request types, under time windows and loading constraints. European Journal of Operational Research 229:2 (2013), 303–317, 10.1016/j.ejor.2013.02.056.
303. Zachariadis, E.E., Tarantilis, C.D., Kiranoudis, C.T., The load-dependent vehicle routing problem and its pick-up and delivery extension. Transportation Research Part B: Methodological 71 (2015), 158–181, 10.1016/j.trb.2014.11.004.
304. Zhang, T., Chaovalitwongse, W.A., Zhang, Y., Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries. Computers & Operations Research 39:10 (2012), 2277–2290, 10.1016/j.cor.2011.11.021.
305. Zhang, Z., Che, O., Cheang, B., Lim, A., Qin, H., A memetic algorithm for the multiperiod vehicle routing problem with profit. European Journal of Operational Research 229:3 (2013), 573–584, 10.1016/j.ejor.2012.11.059.
306. Zhang, J., Lam, W.H.K., Chen, B.Y., A stochastic vehicle routing problem with travel time uncertainty: Trade-off between cost and customer service. Networks and Spatial Economics 13:4 (2013), 471–496, 10.1007/s11067-013-9190-x.
307. Zhang, S., Lee, C.K.M., Choy, K.L., Ho, W., Ip, W.H., Design and development of a hybrid artificial bee colony algorithm for the environmental vehicle routing problem. Transportation Research Part D: Transport and Environment 31 (2014), 85–99, 10.1016/j.trd.2014.05.015.
308. Zhang, Z., Qin, H., Zhu, W., Lim, A., The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach. European Journal of Operational Research 220:2 (2012), 295–304, 10.1016/j.ejor.2012.01.035.
309. Zhu, L., Rousseau, L.-M., Rei, W., Li, B., Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands. Computers & Operations Research 50 (2014), 1–13, 10.1016/j.cor.2014.03.027.