The value of integrating loading and routing

European Journal of Operational Research

Volumn 257, Issue 1, 2017, Pages 89-105

  Cote J F ^a   Guastaroba, G ^b   Speranza, M G ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITY OF BRESCIA   (Italy)

Author keywords

Integration in logistics; Loading constraints; Orthogonal packing; Vehicle routing problems; Worst case analysis

Indexed keywords

BENCHMARKING; INTEGRATED CONTROL; NETWORK ROUTING; PROBLEM SOLVING; VEHICLES;

CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTATIONAL EXPERIMENT; INTEGRATED APPROACH; LOADING CONSTRAINTS; SCIENTIFIC COMMUNITY; VEHICLE ROUTING PROBLEMS; WORST-CASE ANALYSIS; WORST-CASE PERFORMANCE;

LOADING;

EID: 84978943242     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2016.06.072     Document Type: Article

References (41)

1. Adulyasak, Y., Cordeau, J.-F., Jans, R., The production routing problem: a review of formulations and solution algorithms. Computers & Operations Research 55:0 (2015), 141–152.
2. Alvarez-Valdes, R., Parreño, F., Tamarit, J., A branch and bound algorithm for the strip packing problem. OR Spectrum 31:2 (2009), 431–459.
3. Arahori, Y., Imamichi, T., Nagamochi, H., An exact strip packing algorithm based on canonical forms. Computers & Operation Research 39:12 (2012), 2991–3011.
4. Archetti, C., Speranza, M., The value of integration in logistics. Proceedings of the 28th European Conference on Modelling & Simulation, ECMS 2014, 2014, 691–697.
5. Archetti, C., Speranza, M., Vigo, D., Vehicle routing problems with profits. Toth, P., Vigo, D., (eds.) Vehicle routing: problems, methods, and applications, 2nd edition, 2014, SIAM, 273–297.
6. Bektaş, T., Laporte, G., Vigo, D., Integrated vehicle routing problems. Computers & Operations Research, 55(0), 2015, 126.
7. Belov, G., Rohling, H., LP bounds in an interval-graph algorithm for orthogonal-packing feasibility. Operations Research 61:2 (2013), 483–497.
8. Bertazzi, L., Speranza, M., Inventory routing problems: an introduction. EURO Journal on Transportation and Logistics 1:4 (2012), 307–326.
9. Bortfeldt, A., Wäscher, G., Container loading problems - a state-of-the-art review. European Journal of Operational Research 229:1 (2013), 1–20.
10. Boschetti, M., Montaletti, L., An exact algorithm for the two-dimensional strip-packing problem. Operations Research 58:6 (2010), 1774–1791.
11. Caprara, A., Monaci, M., Bidimensional packing by bilinear programming. Mathematical Programming 118:1 (2009), 75–108.
12. Chandra, P., Fisher, M., Coordination of production and distribution planning. European Journal of Operational Research 72:3 (1994), 503–517.
13. Clautiaux, F., Carlier, J., Moukrim, A., A new exact method for the two-dimensional orthogonal packing problem. European Journal of Operational Research 183:3 (2007), 1196–1211.
14. Coelho, L., Cordeau, J.-F., Laporte, G., Thirty years of inventory routing. Transportation Science 48:1 (2013), 1–19.
15. Côté, J.-F., Gendreau, M., Potvin, J.-Y., The vehicle routing problem with stochastic two-dimensional items. Technical report, CIRRELT-2013-84, 2013 Submitted.
16. Côté, J.-F., Gendreau, M., Potvin, J.-Y., An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints. Operations Research 62:5 (2014), 1126–1141.
17. Côté, J.-F., Iori, M., Dell'Amico, M., Combinatorial benders’ cuts for the strip packing problem. Operations Research 62:3 (2014), 643–661.
18. Cuda, R., Guastaroba, G., Speranza, M., A survey on two-echelon routing problems. Computers & Operations Research 55:0 (2015), 185–199.
19. Dominguez, O., Juan, A., Barrios, B., Faulin, J., Agustin, A., Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet. Annals of Operations Research 236:2 (2016), 383–404.
20. Drexl, M., Schneider, M., A survey of variants and extensions of the location-routing problem. European Journal of Operational Research 241:2 (2015), 283–308.
21. Duhamel, C., Lacomme, P., Quilliot, A., Toussaint, H., A multi-start evolutionary local search for the two-dimensional loading capacitated vehicle routing problem. Computers & Operations Research 38:3 (2011), 617–640.
22. Fuellerer, G., Doerner, K., Hartl, R., Iori, M., Ant colony optimization for the two-dimensional loading vehicle routing problem. Computers & Operations Research 36:3 (2009), 655–673.
23. Gendreau, M., Iori, M., Laporte, G., Martello, S., A tabu search algorithm for a routing and container loading problem. Transportation Science 40:3 (2006), 342–350.
24. Gendreau, M., Iori, M., Laporte, G., Martello, S., A tabu search heuristic for the vehicle routing problem with two-dimensional loading constraints. Networks 51:1 (2008), 4–18.
25. Gilmore, P., Gomory, R., A linear programming approach to the cutting-stock problem. Operations Research 9:6 (1961), 849–859.
26. Iori, M., Martello, S., Routing problems with loading constraints. TOP 18:1 (2010), 4–27.
27. Iori, M., Salazar-González, J.-J., Vigo, D., An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Science 41:2 (2007), 253–264.
28. Leung, C., Zhang, D., Kwang, M., A two-stage intelligent search algorithm for the two-dimensional strip packing problem. European Journal of Operational Research 215:1 (2011), 57–69.
29. Leung, S., Zhang, Z., Zhang, D., Hua, X., Lim, M., 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.
30. Leung, S., Zhou, X., Zhang, D., Zheng, J., Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem. Computers & Operations Research 38:1 (2011), 205–215.
31. Lysgaard, J., Letchford, A., Eglese, R., A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100:2 (2004), 423–445.
32. Martello, S., Monaci, M., Vigo, D., An exact approach to the strip-packing problem. INFORMS Journal on Computing 15:3 (2003), 310–319.
33. Prodhon, C., Prins, C., A survey of recent research on location-routing problems. European Journal of Operational Research 238:1 (2014), 1–17.
34. Røpke, S., Pisinger, D., An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation Science 40:4 (2006), 455–472.
35. Salhi, S., Rand, G., The effect of ignoring routes when locating depots. European Journal of Operational Research 39:2 (1989), 150–156.
36. da Silveira, J., Miyazawa, F., Xavier, E., Heuristics for the strip packing problem with unloading constraints. Computer & Operations Research 40:4 (2013), 991–1003.
37. Toth, P., Vigo, D., (eds.) (Trans.) Vehicle routing: problems, methods, and applications, 2nd edition, 2014, SIAM, Philadelphia, PA.
38. Wang, F., Tao, Y., Shi, N., A survey on vehicle routing problem with loading constraints. International Joint Conference on Computational Sciences and Optimization, CSO 2009, 2009, 602–606.
39. Wei, L., Zhang, Z., Zhang, D., Lim, A., A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research 243:3 (2015), 798–814.
40. Zachariadis, E., Tarantilis, C., Kiranoudis, C., A guided tabu search for the vehicle routing problem with two-dimensional loading constraints. European Journal of Operational Research 195:3 (2009), 729–743.
41. Zachariadis, E., Tarantilis, C., Kiranoudis, C., Integrated distribution and loading planning via a compact metaheuristic algorithm. European Journal of Operational Research 228:1 (2013), 56–71.