|
[1]
|
E. E. Bischoff and M. S. W. Ratcliff, Issues in the development of approaches to container loading, Omega, 23 (1995), 377-390.
doi: 10.1016/0305-0483(95)00015-G.
|
|
[2]
|
A. Bortfeldt, A hybrid algorithm for the capacitated vehicle routing problem with three-dimensional loading constraints, Computers & Operations Research, 39 (2012), 2248-2257.
doi: 10.1016/j.cor.2011.11.008.
|
|
[3]
|
A. Bortfeldt and J. Homberger, Packing first routing second-a heuristic for the vehicle routing and loading problem, Computers & Operations Research, 40 (2013), 873-885.
doi: 10.1016/j.cor.2012.09.005.
|
|
[4]
|
A. Bortfeldt and J. Yi, The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints, European Journal of Operational Research, 282 (2020), 545-558.
doi: 10.1016/j.ejor.2019.09.024.
|
|
[5]
|
S. Ceschia, A. Schaerf and T. Stützle, Local search techniques for a routing-packing problem, Computers & Industrial Engineering, 66 (2013), 1138-1149.
doi: 10.1016/j.cie.2013.07.025.
|
|
[6]
|
J.-F. Cordeau, G. Laporte, P. Legato and L. Moccia, Models and tabu search heuristics for the berth-allocation problem, Transportation Science, 39 (2005), 443-556.
doi: 10.1287/trsc.1050.0120.
|
|
[7]
|
G. B. Dantzig and J. H. Ramser, The Truck Dispatching Problem, Management Science, 6 (1959), 80-91.
doi: 10.1287/mnsc.6.1.80.
|
|
[8]
|
M. Dror and P. Trudeau, Savings by split delivery routing, Transportation Science, 23 (1989), 141-145.
|
|
[9]
|
L. Fanjul-Peyro, R. Ruiz and F. Perea, Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times, Computers & Operations Research, 101 (2019), 173-182.
doi: 10.1016/j.cor.2018.07.007.
|
|
[10]
|
G. Fuellerer, K. F. Doerner, R. F. Hartl and M. Iori, Metaheuristics for vehicle routing problems with three-dimensional loading constraints, European Journal of Operational Research, 201 (2010), 751-759.
doi: 10.1016/j.ejor.2009.03.046.
|
|
[11]
|
M. Gendreau, M. Iori, G. Laporte and S. Martello, A tabu search algorithm for a routing and container loading problem, Transportation Science, 40 (2006), 342-350.
|
|
[12]
|
J. A. George and D. F. Robinson, A heuristic for packing boxes into a container, Computers & Operations Research, 7 (1980), 147-156.
doi: 10.1016/0305-0548(80)90001-5.
|
|
[13]
|
Z.-H. Hu, Y. Zhao, S. Tao and Z.-H. Sheng, Finished-vehicle transporter routing problem solved by loading pattern discovery, Ann Oper Res, 234 (2015), 37-56.
doi: 10.1007/s10479-014-1777-1.
|
|
[14]
|
T. Ibaraki, S. Imahori, M. Kubo, T. Masuda, T. Uno and M. Yagiura, Effective local search algorithms for routing and scheduling problems with general time-window constraints, Transportation Science, 39 (2005), 206-232.
doi: 10.1287/trsc.1030.0085.
|
|
[15]
|
L. Junqueira, J. F. Oliveira and R. Morabito, An optimization model for the vehicle routing problem with practical three-dimensional loading constraints, International Transactions in Operational Research, 20 (2013), 645-666.
doi: 10.1111/j.1475-3995.2012.00872.x.
|
|
[16]
|
K. Kang, I. Moon and H. Wang, A hybrid genetic algorithm with a new packing strategy for the three-dimensional bin packing problem, Applied Mathematics and Computation, 219 (2012), 1287-1299.
doi: 10.1016/j.amc.2012.07.036.
|
|
[17]
|
S. P. Ladany and A. Mehrez, Optimal routing of a single vehicle with loading and unloading constraints, Transportation Planning and Technology, 8 (1984), 301-306.
doi: 10.1080/03081068408717261.
|
|
[18]
|
B. Mahvash, A. Awasthi and S. Chauhan, A column generation based heuristic for the capacitated vehicle routing problem with three-dimensional loading constraints, International Journal of Production Research, 55 (2017), 1730-1747.
|
|
[19]
|
D. Männel and A. Bortfeldt, Solving the pickup and delivery problem with three-dimensional loading constraints and reloading ban, European Journal of Operational Research, 264 (2018), 119-137.
doi: 10.1016/j.ejor.2017.05.034.
|
|
[20]
|
A. Moura, A model-based heuristic to the vehicle routing and loading problem, International Transactions in Operational Research, 26 (2019), 888-907.
doi: 10.1111/itor.12586.
|
|
[21]
|
A. Moura and J. F. Oliveira, An integrated approach to the vehicle routing and container loading problems, OR Spectrum, 31 (2009), 775-800.
doi: 10.1007/s00291-008-0129-4.
|
|
[22]
|
S. Pace, A. Turky, I. Moser and A. Aleti, Distributing fibre boards: A practical application of the heterogeneous fleet vehicle routing problem with time windows and three-dimensional loading constraints, Procedia Computer Science, 51 (2015), 2257-2266.
doi: 10.1016/j.procs.2015.05.382.
|
|
[23]
|
H. Pollaris, K. Braekers, A. Caris, G. K. Janssens and S. Limbourg, Iterated local search for the capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints, Networks, 69 (2017), 304-316.
doi: 10.1002/net.21738.
|
|
[24]
|
M. Rajaei, G. Moslehi and M. Reisi-Nafchi, The split heterogeneous vehicle routing problem with three-dimensional loading constraints on a large scale, European Journal of Operational Research, 299 (2022), 706-721.
doi: 10.1016/j.ejor.2021.08.025.
|
|
[25]
|
S. Reil, A. Bortfeldt and L. Mönch, Heuristics for vehicle routing problems with backhauls time windows and 3D loading constraints, European Journal of Operational Research, 266 (2018), 877-894.
doi: 10.1016/j.ejor.2017.10.029.
|
|
[26]
|
S. Ropke and D. Pisinger, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows, Transportation Science, 40 (2006), 455-472.
doi: 10.1287/trsc.1050.0135.
|
|
[27]
|
P. Shaw, Using Constraint Programming and Local Search Methods to Solve Vehicle Routing, Problems, Springer, Berlin, Heidelberg, 1999.
doi: 10.1007/3-540-49481-2_30.
|
|
[28]
|
M. M. Solomon, Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints, Operations Research, 35 (1987), 254-265.
doi: 10.1287/opre.35.2.254.
|
|
[29]
|
M. Tang, B. Ji, X. Fang and S. S. Yu, Discretization-Strategy-Based Solution for Berth Allocation and Quay Crane Assignment Problem, Journal of Marine Science and Engineering, 10 (2022), 495.
doi: 10.3390/jmse10040495.
|
|
[30]
|
Y. Tao and F. Wang, An effective tabu search approach with improved loading algorithms for the 3L-CVRP, Computers & Operations Research, 55 (2015), 127-140.
doi: 10.1016/j.cor.2013.10.017.
|
|
[31]
|
C. A. Vega-Mejía, J. R. Montoya-Torres and S. M. N. Islam, A nonlinear optimization model for the balanced vehicle routing problem with loading constraints, International Transactions in Operational Research, 26 (2019), 794-835.
doi: 10.1111/itor.12570.
|
|
[32]
|
L. Wei, Z. Zhang and A. Lim, An adaptive variable neighborhood search for a heterogeneous fleet vehicle routing problem with three-dimensional loading constraints, IEEE Computational Intelligence Magazine, 9 (2014), 18-30.
doi: 10.1109/MCI.2014.2350933.
|
|
[33]
|
J. Yi and A. Bortfeldt, The capacitated vehicle routing problem with three-dimensional loading constraints and split delivery-a case study, Operations Research Proceedings, 282 (2020), 545-558.
doi: 10.1016/j.ejor.2019.09.024.
|
|
[34]
|
E. E. Zachariadis, C. D. Tarantilis and C. T. Kiranoudis, The Pallet-Packing Vehicle Routing Problem, Transportation Science, 4 (2012), 341-358.
doi: 10.1287/trsc.1110.0373.
|
|
[35]
|
D. Zhang, S. Cai, F. Ye, Y.-W. Si and T. T. Nguyen, A hybrid algorithm for a vehicle routing problem with realistic constraints, Information Sciences, 394/395 (2017), 167-182.
doi: 10.1016/j.ins.2017.02.028.
|
|
[36]
|
Z. Zhang, L. Wei and A. Lim, An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints, Transportation Research Part B: Methodological, 82 (2015), 20-35.
doi: 10.1016/j.trb.2015.10.001.
|
Download:
{{journal.titleEn}} 
