Intermediate facilities in freight transportation planning: A survey

Transportation Science

Volumn 50, Issue 3, 2016, Pages 763-789

  Guastaroba, G ^a   Speranza, M G ^a   Vigo, D ^b  

^a UNIVERSITY OF BRESCIA   (Italy)

^b UNIVERSITY OF BOLOGNA   (Italy)

Author keywords

Freight transportation planning; Literature review; Service network design problems; Transshipment problems; Vehicle routing problems

Indexed keywords

CRASHWORTHINESS; NETWORK ROUTING; OPERATIONS RESEARCH; SURVEYS; TRANSPORTATION; VEHICLE ROUTING;

LITERATURE REVIEWS; SERVICE NETWORK DESIGNS; TRANSPORTATION PLANNING; TRANSSHIPMENT PROBLEM; VEHICLE ROUTING PROBLEMS;

FREIGHT TRANSPORTATION;

EID: 84984890172     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2015.0631     Document Type: Review

References (103)

1. Agustina D, Lee CKM, Piplani R (2010) A review: Mathematical models for cross docking planning. Internat. J. Engrg. Bus. Management 2(2):47-54.
2. Ala-Risku T, Kärkkäinen M, Holmström J (2003) Evaluating the applicability of merge-in-transit. Internat. J. Logist. Management 14(2):67-82.
3. Ali AI, O'Connor DJ (2010) The impact of distribution system characteristics on computational tractability. Eur. J. Oper. Res. 200(2):323-333.
4. Alumur S, Kara BY (2008) Network hub location problems: The state of the art. Eur. J. Oper. Res. 190(1):1-21.
5. Apte UM, Viswanathan S (2000) Effective cross docking for improving distribution efficiencies. Internat. J. Logist.: Res. Appl. 3(3):291-302.
6. Armacost AP, Barnhart C, Ware K (2002) Composite variable formulations for express shipment service network design. Transportation Sci. 36(1):1-20.
7. Armacost AP, Barnhart C, Ware KA, Wilson AM (2004) UPS optimizes its air network. Interfaces 34(1):15-25.
8. Baldacci R, Mingozzi A, Roberti R, Wolfler Calvo R (2013) An exact algorithm for the two-echelon capacitated vehicle routing problem. Oper. Res. 61(2):298-314.
9. Barnhart C, Schneur RR (1996) Air network design for express shipment service. Oper. Res. 44(6):852-863.
10. Barnhart C, Krishnan N, Kim D, Ware K (2002) Network design for express shipment delivery. Comput. Optim. Appl. 21(3):239-262.
11. Bazaraa MS, Jarvis JJ, Sherali HD (2010) Linear Programming and Network Flows, 4th ed. (John Wiley & Sons, Hoboken, NJ).
12. Berbeglia G, Cordeau J-F, Laporte G (2010) Dynamic pickup and delivery problems. Eur. J. Oper. Res. 202(1):8-15.
13. Berbeglia G, Cordeau J-F, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: A classification scheme and survey. TOP 15(1):1-31.
14. Berman O, Wang Q (2006) Inbound logistic planning: Minimizing transportation and inventory cost. Transportation Sci. 40(3):287-299.
15. Bouros P, Sacharidis D, Dalamagas T, Sellis T (2011) Dynamic pickup and delivery with transfers. Pfoser D, Tao Y, Mouratidis K, Nascimento MA, Mokbel M, Shekhar S, Huang Y, eds. Advances in Spatial and Temporal Databases, Lecture Notes Comput. Sci., Vol. 6849 (Springer-Verlag, Berlin Heidelberg), 112-129.
16. Boysen N (2010) Truck scheduling at zero-inventory cross docking terminals. Comput. Oper. Res. 37(1):32-41.
17. Boysen N, Fliedner M (2010) Cross dock scheduling: Classification, literature review and research agenda. Omega 38(6):413-422.
18. Campbell JF, O'Kelly ME (2012) Twenty-five years of hub location research. Transportation Sci. 46(2):153-169.
19. Chen P, Guo Y, Lim A, Rodrigues B (2006) Multiple crossdocks with inventory and time windows. Comput. Oper. Res. 33(1):43-63.
20. Cheung RK, Muralidharan B (1999) Impact of dynamic decision making on hub-and-spoke freight transportation networks. Ann. Oper. Res. 87:49-71.
21. Cheung RK, Muralidharan B (2000) Dynamic routing for priority shipments in LTL service networks. Transportation Sci. 34(1):86-98.
22. Chopra S, Meindl P (2009) Supply Chain Management: Strategy, Planning, and Operation, 4th ed. (Prentice Hall, Boston).
23. Christofides N, Eilon S (1969) An algorithm for the vehicle-dispatching problem. Oper. Res. Quart. 20(3):309-318.
24. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12(4):568-581.
25. Contreras I (2015) Hub location problems. Laporte G, Nickel S, Saldanha da Gama F, eds. Location Science (Springer-Verlag, Berlin Heidelberg), 311-344.
26. Crainic TG (2000) Service network design in freight transportation. Eur. J. Oper. Res. 122(2):272-288.
27. Crainic TG, Kim KH (2007) Intermodal transportation. Barnhart C, Laporte G, eds. Transportation, Handbooks Oper. Res. Management Sci., Vol. 14 (North-Holland, Amsterdam), 467-537.
28. Crainic TG, Gendron B, Hernu G (2004) A slope scaling/Lagrangean perturbation heuristic with long-term memory for multicommodity capacitated fixed-charge network design. J. Heuristics 10(5):525-545.
29. Crainic TG, Ricciardi N, Storchi G (2009) Models for evaluating and planning city logistics systems. Transportation Sci. 43(4):432-454.
30. Crainic TG, Mancini S, Perboli G, Tadei R (2010) Two-echelon vehicle routing problem: A satellite location analysis. Procedia - Soc. Behavioral Sci. 2(3):5944-5955.
31. Crainic TG, Mancini S, Perboli G, Tadei R (2011) Multi-start heuristics for the two-echelon vehicle routing problem. Merz P, Hao J-K, eds. Evolutionary Computation in Combinatorial Optimization, Lecture Notes Comput. Sci., Vol. 6622 (Springer-Verlag, Berlin Heidelberg), 179-190.
32. Crainic TG, Mancini S, Perboli G, Tadei R (2012) Impact of generalized travel costs on satellite location in the two-echelon vehicle routing problem. Procedia - Soc. Behavioral Sci. 39:195-204.
33. Crainic TG, Mancini S, Perboli G, Tadei R (2013) A GRASP with path-relinking metaheuristic for the two-echelon vehicle routing problem. Di Gaspero L, Schaerf A, Stützle T, eds. Advances in Metaheuristics, Oper. Res./Comput. Sci. Interfaces Series, Vol. 53 (Springer, New York), 113-125.
34. Croxton KL, Gendron B, Magnanti TL (2003) Models and methods for merge-in-transit operations. Transportation Sci. 37(1):1-22.
35. Cuda R, Guastaroba G, Speranza MG (2015) A survey on two-echelon routing problems. Comput. Oper. Res. 55:185-199.
36. Dondo R, Cerdá J (2013) A sweep-heuristic based formulation for the vehicle routing problem with cross-docking. Comput. Chemical Engrg. 48:293-311.
37. Dondo R, Méndez CA, Cerdá J (2009) Managing distribution in supply chain networks. Indust. Engrg. Chemistry Res. 48(22):9961-9978.
38. Dondo R, Méndez CA, Cerdá J (2011) The multi-echelon vehicle routing problem with cross docking in supply chain management. Comput. Chemical Engrg. 35(12):3002-3024.
39. Farahani RZ, Hekmatfar M, Arabani AB, Nikbakhsh E (2013) Hub location problems: A review of models, classification, solution techniques, and applications. Comput. Indust. Engrg. 64(4):1096-1109.
40. Gentry C (2005) Million-dollar savings. Chain Store Age 81(2):54-56.
41. Gillett BE, Miller LR (1974) A heuristic algorithm for the vehicle-dispatch problem. Oper. Res. 22(2):340-349.
42. Gümüş M, Bookbinder JH (2004) Cross-docking and its implications in location-distribution systems. J. Bus. Logist. 25(2):199-228.
43. Hall RW (1987a) Comparison of strategies for routing shipments through transportation terminals. Transportation Res. Part A: General 21(6):421-429.
44. Hall RW (1987b) Direct versus terminal freight routing on a network with concave costs. Transportation Res. Part B: Methodological 21(4):287-298.
45. Hemmelmayr VC, Cordeau J-F, Crainic TG (2012) An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39(12):3215-3228.
46. Hu Z-H, Zhao Y, Choi T-M (2013) Vehicle routing problem for fashion supply chains with cross-docking. Math. Problems Engrg. http://dx.doi.org/10.1155/2013/362980.
47. Jarrah AI, Johnson EL, Neubert LC (2009) Large-scale, less-than-truckload service network design. Oper. Res. 57(3):609-625.
48. Jepsen M, Spoorendonk S, Røpke S (2013) A branch-and-cut algorithm for the symmetric two-echelon capacitated vehicle routing problem. Transportation Sci. 47(1):23-37.
49. Joslin DE, Clements DP (1999) Squeaky wheel optimization. J. Artificial Intelligence Res. 10(5):353-373.
50. Kara BY, Taner MR (2011) Hub location problems: The location of interacting facilities. Eiselt H, Marianov V, eds. Foundations of Location Analysis (Springer, New York), 273-288.
51. Kärkkäinen M, Ala-Risku T, Holmström J (2003) Increasing customer value and decreasing distribution costs with merge-in-transit. Internat. J. Physical Distribution Logist. Management 33(2):132-148.
52. Kim D, Barnhart C, Ware K, Reinhardt G (1999) Multimodal express package delivery: A service network design application. Transportation Sci. 33(4):391-407.
53. Klincewicz JG (1990) Solving a freight transport problem using facility location techniques. Oper. Res. 38(1):99-109.
54. Lapierre SD, Ruiz AB, Soriano P (2004) Designing distribution networks: Formulations and solution heuristic. Transportation Sci. 38(2):174-187.
55. Lee YH, Jung JW, Lee KM (2006) Vehicle routing scheduling for cross-docking in the supply chain. Comput. Indust. Engrg. 51(2):247-256.
56. Leung JMY, Magnanti TL, Singhal V (1990) Routing in point-to-point delivery systems: Formulations and solution heuristics. Transportation Sci. 24(4):245-260.
57. Li X, Lim A, Miao Z, Rodrigues B (2006) Reducing transportation costs in distribution networks. Ali M, Dapoigny R, eds. Advances in Applied Artificial Intelligence, Lecture Notes Comput. Sci., Vol. 4031 (Springer-Verlag, Berlin Heidelberg), 1138-1148.
58. Liao CJ, Lin Y, Shih SC (2010) Vehicle routing with cross-docking in the supply chain. Expert Systems Appl. 37(10):6868-6873.
59. Lim A, Miao Z, Rodrigues B, Xu Z (2005) Transshipment through crossdocks with inventory and time windows. Naval Res. Logist. 52(8):724-733.
60. Lin C-C (2001) The freight routing problem of time-definite freight delivery common carriers. Transportation Res. Part B: Methodological 35(6):525-547.
61. Lin C-C (2004) Load planning with uncertain demands for time-definite freight common carriers. Transportation Res. Record: J. Transportation Res. Board 1873:17-24.
62. Lin C-C, Chen SH (2004) The hierarchical network design problem for time-definite express common carriers. Transportation Res. Part B: Methodological 38(3):271-283.
63. Lin C-C, Chen SH (2008) An integral constrained generalized huband-spoke network design problem. Transportation Res. Part E: Logist. Transportation Rev. 44(6):986-1003.
64. Lin C-C, Lin JS-J (2007) The multistage stochastic integer load planning problem. Transportation Res. Part E: Logist. Transportation Rev. 43(2):143-156.
65. Lin C-C, Wu Y-C (2001) The multiple frequency delivery operations in the time-definite delivery industry. J. Oper. Res. Soc. 52(11):1215-1224.
66. Lin C-C, Lin Y-J, Lin D-Y (2003) The economic effects of centerto-center directs on hub-and-spoke networks for air express common carriers. J. Air Transport Management 9(4):255-265.
67. Liu J, Li CL, Chan CY (2003) Mixed truck delivery systems with both hub-and-spoke and direct shipment. Transportation Res. Part E: Logist. Transportation Rev. 39(4):325-339.
68. Ma H, Miao Z, Lim A, Rodrigues B (2011) Crossdocking distribution networks with setup cost and time window constraint. Omega 39(1):64-72.
69. Marjani MR, Moattar Husseini SM, Karimi B (2012) Bi-objective heuristics for multi-item freights distribution planning problem in crossdocking networks. Internat. J. Advanced Manufacturing Tech. 58(9-12):1201-1216.
70. Miao Z, Fu K, Yang F (2012) A hybrid genetic algorithm for the multiple crossdocks problem. Math. Problems Engrg. http://dx.doi.org/10.1155/2012/316908.
71. Miao Z, Yang F, Fu K, Xu D (2012) Transshipment service through crossdocks with both soft and hard time windows. Ann. Oper. Res. 192(1):21-47.
72. Mitrovć-Minić S, Laporte G (2006) The pickup and delivery problem with time windows and transshipment. INFOR - Inform. Systems Oper. Res. 44(3):217-228.
73. Morais VWC, Mateus GR, Noronha TF (2014) Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Systems Appl. 41(16):7495-7506.
74. Musa R, Arnaout JP, Jung H (2010) Ant colony optimization algorithm to solve for the transportation problem of cross-docking network. Comput. Indust. Engrg. 59(1):85-92.
75. Orden A (1956) The transhipment problem. Management Sci. 2(3):276-285.
76. Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations. J. für Betriebswirtschaft 58(2):81-117.
77. Perboli G, Tadei R, Masoero F (2010) New families of valid inequalities for the two-echelon vehicle routing problem. Electronic Notes Discrete Math. 36:639-646.
78. Perboli G, Tadei R, Vigo D (2011) The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Sci. 45(3):364-380.
79. Petersen H, Røpke S (2011) The pickup and delivery problem with cross-docking opportunity. Böse JW, Hu H, Jahn C, Shi X, Stahlbock R, Voß S, eds. Computational Logistics, Lecture Notes Comput. Sci., Vol. 6971 (Springer-Verlag, Berlin Heidelberg), 101-113.
80. Pisinger D, Røpke S (2007) A general heuristic for vehicle routing problems. Comput. Oper. Res. 34(8):2403-2435.
81. Powell WB (1986) A local improvement heuristic for the design of less-than-truckload motor carrier networks. Transportation Sci. 20(4):246-257.
82. Powell WB, Sheffi Y (1983) The load planning problem of motor carriers: Problem description and a proposed solution approach. Transportation Res. Part A: General 17(6):471-480.
83. Powell WB, Sheffi Y (1989) Design and implementation of an interactive optimization system for network design in the motor carrier industry. Oper. Res. 37(1):12-29.
84. Prins C, Prodhon C, Wolfler Calvo R (2004) Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité. Dolgui A, Dauzère-Pérès S, eds. Modelisation et simulation pour l'analyse et l'optimisation des systèmes industriels et logistiques (MOSIM 2004), Vol. 2 (Lavoisier, Paris), 1115-1122.
85. Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur. J. Oper. Res. 238(1):1-17.
86. Santos FA, da Cunha AS, Mateus GR (2013) Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem. Optim. Lett. 7(7):1537-1547.
87. Santos FA, Mateus GR, da Cunha AS (2011a) A branch-and-price algorithm for a vehicle routing problem with cross-docking. Electronic Notes Discrete Math. 37:249-254.
88. Santos FA, Mateus GR, da Cunha AS (2011b) A novel column generation algorithm for the vehicle routing problem with cross-docking. Pahl J, Reiners T, Voß S, eds. Network Optimization, Lecture Notes Comput. Sci., Vol. 6701 (Springer-Verlag, Berlin Heidelberg), 412-425.
89. Santos FA, Mateus GR, da Cunha AS (2013) The pickup and delivery problem with cross-docking. Comput. Oper. Res. 40(4):1085-1093.
90. Santos FA, Mateus GR, da Cunha AS (2015) A branch-and-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. Transportation Sci. 49(2):355-368.
91. Simchi-Levi D, Kaminsky P, Simchi-Levi E (2007) Designing and Managing the Supply Chain: Concepts, Strategies, and Case Studies, 3rd ed. (Irwin/McGraw-Hill, New York).
92. Song H, Hsu VN, Cheung RK (2008) Distribution coordination between suppliers and customers with a consolidation center. Oper. Res. 56(5):1264-1267.
93. Stalk G, Evans P, Shulman LE (1992) Competing on capabilities: The new rules of corporate strategy. Harvard Bus. Rev. 70(2):57-69.
94. SteadieSeifi M, Dellaert NP, Nuijten W, Van Woensel T, Raoufi R (2014) Multimodal freight transportation planning: A literature review. Eur. J. Oper. Res. 233(1):1-15.
95. Stephan K, Boysen N (2011) Cross-docking. J. Management Control 22(1):129-137.
96. Tarantilis CD (2013) Adaptive multi-restart tabu search algorithm for the vehicle routing problem with cross-docking. Optim. Lett. 7(7):1583-1596.
97. Toth P, Vigo D, eds. (2002) The Vehicle Routing Problem (SIAM, Philadelphia).
98. Toth P, Vigo D, eds. (2014) Vehicle Routing: Problems, Methods, and Applications, 2nd ed. (MOS-SIAM, Philadelphia).
99. Üster H, Agrahari H (2010) An integrated load-planning problem with intermediate consolidated truckload assignments. IIE Transactions 42(7):490-513.
100. Van Belle J, Valckenaers P, Cattrysse D (2012) Cross-docking: State of the art. Omega 40(6):827-846.
101. Wen M, Larsen J, Clausen J, Cordeau J-F, Laporte G (2009) Vehicle routing with cross-docking. J. Oper. Res. Soc. 60(12):1708-1718.
102. Wieberneit N (2008) Service network design for freight transportation: A review. OR Spectrum 30(1):77-112.
103. Zäpfel G, Wasner M (2002) Planning and optimization of huband-spoke transportation networks of cooperative third-party logistics providers. Internat. J. Production Econom. 78(2):207-220.