Capacitated vehicle routing problem with sequence-based pallet loading and axle weight constraints

EURO Journal on Transportation and Logistics

Volumn 5, Issue 2, 2016, Pages 231-255

  Pollaris, Hanne ^a   Braekers, Kris ^a,b   Caris, An ^a,b   Janssens, Gerrit K ^a   Limbourg, Sabine ^c  

^a HASSELT UNIVERSITY   (Belgium)

^b RESEARCH FOUNDATION FLANDERS FWO   (Belgium)

^c UNIVERSITY OF LIÈGE   (Belgium)

Author keywords

Axle weight restrictions; Loading constraints; Pallet loading; Sequence based loading; Vehicle routing problem

Indexed keywords

AXLES; INTEGER PROGRAMMING; PALLETS; VEHICLE ROUTING; VEHICLES;

AXLE WEIGHTS; CAPACITATED VEHICLE ROUTING PROBLEM; COMPUTATIONAL EXPERIMENT; LOADING CONSTRAINTS; MIXED INTEGER LINEAR PROGRAMMING; ROUTE PLANNING; TRAFFIC SAFETY; VEHICLE ROUTING PROBLEMS;

LOADING;

EID: 85040379524     PISSN: 21924376     EISSN: 21924384     Source Type: Journal    
DOI: 10.1007/s13676-014-0064-2     Document Type: Article

References (19)

1. Alba M, Cordeau J, Dell'Amico M, Iori M (2013) A branch-and-cut algorithm for the double traveling salesman problem with multiple stacks. INFORMS J Comput 25(1):41–55
2. Carrabs F, Cerulli R, Speranza M (2013) A branch-and-bound algorithm for the double travelling salesman problem with two stacks. Networks 61(1):58–75
3. Cordeau J, Iori M, Laporte G, Salazar González J (2010) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with LIFO loading. Networks 55(1):46–59
4. Côté J, Gendreau M, Potvin J (2012a) Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(1):19–30
5. Côté J, Archetti C, Speranza M, Gendreau M, Potvin J (2012b) A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks. Networks 60(4):212–226
6. Doerner K, Fuellerer G, Hartl R, Gronalt M, Iori M (2007) Metaheuristics for the vehicle routing problem with loading constraints. Networks 49(4):294–307
7. Felipe A, Ortuño MT, Tirado G (2009) The double traveling salesman problem with multiple stacks: a variable neighborhood search approach. Comput Oper Res 36(11):2983–2993
8. Felipe A, Ortuño M, Tirado G (2011) Using intermediate infeasible solutions to approach vehicle routing problems with precedence and loading constraints. Eur J Oper Res 211(1):66–75
9. Iori M, Martello S (2010) Routing problems with loading constraints. TOP 18(1):4–27
10. Iori M, Salazar-González J, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transp Sci 41(2):253–264
11. Jacob B, Feypell-de La Beaumelle V (2010) Improving truck safety: potential of weigh-in-motion technology. IATSS Res 34(1):9–15
12. Lim A, Ma H, Qiu C, Zhu W (2013) The single container loading problem with axle weight constraints. Int J Prod Econ 144:358–369
13. Lusby R, Larsen J (2011) Improved exact method for the double TSP with multiple stacks. Networks 58(4):290–300
14. Lusby R, Larsen J, Ehrgott M, Ryan D (2010) An exact method for the double TSP with multiple stacks. Int Trans Oper Res 17(5):637–652
15. Øvstebø B, Hvattum LM, Fagerholt K (2011) Routing and scheduling of roro ships with stowage constraints. Transp Res Part C: Emerg Technol 19(6):1225–1242
16. Petersen H, Madsen O (2009) The double travelling salesman problem with multiple stacks formulation and heuristic solution approaches. Eur J Oper Res 198(1):139–147
17. Petersen H, Archetti C, Speranza M (2010) Exact solutions to the double travelling salesman problem with multiple stacks. Networks 56(4):229–243
18. Toth P, Vigo D (eds) (2002) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia
19. Tricoire F, Doerner K, Hartl R, Iori M (2011) Heuristic and exact algorithms for the multi-pile vehicle routing problem. OR Spectr 33(4):931–959