A branch-cut-and-price algorithm for the energy minimization vehicle routing problem

Transportation Science

Volumn 50, Issue 1, 2016, Pages 23-34

  Fukasawa, Ricardo ^a   He, Qie ^b   Song, Yongjia ^c  

^a UNIVERSITY OF WATERLOO   (Canada)

^b University of Minnesota   (United States)

^c VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

Author keywords

Branch cut and price; Column generation; Green transportation; Integer programming; Vehicle routing problem

Indexed keywords

ALGORITHMS; COSTS; NETWORK ROUTING; ROUTING ALGORITHMS; STRAIN MEASUREMENT; VEHICLES;

BRANCH CUTS; BRANCH-CUT-AND-PRICE ALGORITHM; CAPACITATED VEHICLE ROUTING PROBLEM; COLUMN GENERATION; GREEN TRANSPORTATIONS; LINEAR PROGRAMMING RELAXATION; MIXED INTEGER LINEAR PROGRAMMING; VEHICLE ROUTING PROBLEMS;

INTEGER PROGRAMMING;

EID: 84957717019     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.2015.0593     Document Type: Article

References (33)

1. Abeledo H, Fukasawa R, Pessoa A, Uchoa E (2013) The time dependent traveling salesman problem: Polyhedra and algorithm. Math. Programming Comput. 5(1):27-55.
2. Afrati F, Cosmadakis S, Papadimitriou C, Papageorgiou G, Papakostantinou N (1986) The complexity of the travelling repairman problem. Theoret. Informatics Appl. 20(1):79-87.
3. Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math. Programming 120(2):347-380.
4. Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269-1283.
5. Bektaş T, Laporte G (2011) The pollution-routing problem. Transportation Res. Part B: Methodological 45(8):1232-1250.
6. Bianco L, Mingozzi A, Ricciardelli S (1993) The traveling salesman problem with cumulative costs. Networks 23(2):81-91.
7. Blum A, Chalasani P, Coppersmith D, Pulleyblank B, Raghavan P, Sudan M (1994) The minimum latency problem. Proc. Twenty-Sixth Annual ACM Sympos. Theory Comput. (ACM, New York), 163-171.
8. Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim. 12:129-146.
9. Demir E, Bektaş T, Laporte G (2014) A review of recent research on green road freight transportation. Eur. J. Oper. Res. 237(3):775-793.
10. Fakcharoenphol J, Harrelson C, Rao S (2003) The k-traveling repairman problem. Proc. Fourteenth Annual ACM-SIAM Sympos. Discrete Algorithms (SIAM, Philadelphia), 655-664.
11. Fischetti M, Laporte G, Martello S (1993) The delivery man problem and cumulative matroids. Oper. Res. 41(6):1055-1064.
12. Fox KR, Gavish B, Graves SC (1980) Technical note-An n-constraint formulation of the (time-dependent) traveling salesman problem. Oper. Res. 28(4):1018-1021.
13. Fukasawa R, Longo H, Lysgaard J, de Aragão MP, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math. Programming 106(3):491-511.
14. Gaur DR, Mudgal A, Singh RR (2013) Routing vehicles to minimize fuel consumption. Oper. Res. Lett. 41(6):576-580.
15. Golden B, Raghavan S, Wasil E, eds. (2008) The Vehicle Routing Problem: Latest Advances and New Challenges, Vol. 43 (Springer, New York).
16. Gouveia L (1995) A 2n constraint formulation for the capacitated minimal spanning tree problem. Oper. Res. 43(1):130-141.
17. Irnich S, Villeneuve D (2006) The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS J. Comput. 18(3):391-406.
18. Kara İ, Kara BY, Yetiş MK (2007) Energy minimizing vehicle routing problem. Dress A, Xu Y, Zhu B, eds. Combinatorial Optimization and Applications (Springer, Berlin), 62-71.
19. Kara İ, Kara BY, Yetiş MK (2008) Cumulative vehicle routing problems. Caric T, Gold H, eds. Vehicle Routing Problem (I-Tech Education and Publishing, Vienna), 85-98.
20. Koç Ç, Bektaş T, Jabali O, Laporte G (2014) The fleet size and mix pollution-routing problem. Transportation Res. Part B: Methodological 70:239-254.
21. Kramer R, Subramanian A, Vidal T, Cabral LAF (2015) A matheuristic approach for the pollution-routing problem. Eur. J. Oper. Res. 243(2):523-529.
22. Laporte G (2009) Fifty years of vehicle routing. Transportation Sci. 43(4):408-416.
23. Letchford AN, Salazar-González J-J (2006) Projection results for vehicle routing. Math. Programming 105(2-3):251-274.
24. Lysgaard J (2003) CVRPSEP: A package of separation routines for the capacitated vehicle routing problem. Working Paper 03-04, Department of Management Science and Logistics, Aarhus School of Business, Aarhus, Denmark. www.hha.dk/~lys.
25. Lysgaard J, Wøhlk S (2014) A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem. Eur. J. Oper. Res. 236(3):800-810.
26. Lysgaard J, Letchford AN, Eglese RW (2003) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math. Programming 100(2):423-445.
27. Pecin D, Pessoa A, de Aragão MP, Uchoa E (2014) Improved branch-cut-and-price for capacitated vehicle routing. Lee J, Vygen J, eds. Proc. 17th Conf. Integer Programming and Combinatorial Optim. (Springer, New York), 393-403.
28. Pessoa A, de Aragão MP, Uchoa E (2008) Robust branch-cut-and-price algorithms for vehicle routing problems. Golden B, Raghavan S, Wasil E, eds. The Vehicle Routing Problem: Latest Advances and New Challenges, Vol. 43 (Springer, New York), 297-325.
29. Picard J-C, Queyranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper. Res. 26(1):86-110.
30. Toth P, Vigo D (2001) The Vehicle Routing Problem (SIAM, Philadelphia).
31. Uchoa E (2011) Cuts over extended formulations by flow discretization. Mahjoub AR, ed. Progress in Combinatorial Optimization (Wiley, Hoboken, NJ), 255-282.
32. Uchoa E, Fukasawa R, Lysgaard J, Pessoa A, de Aragão MP, Andrade D (2008) Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Math. Programming 112(2):443-472.
33. Zachariadis E, Tarantilis C, Kiranoudis C (2015) The load-dependent vehicle routing problem and its pick-up and delivery extension. Transportation Res. Part B: Methodological 71:158-181.