A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4525 LNCS, Issue , 2007, Pages 150-160

  Pessoa, Artur ^a   De Aragão, Marcus Poggi ^b   Uchoa, Eduardo ^a  

^a FLUMINENSE FEDERAL UNIVERSITY   (Brazil)

^b PONTIFICAL CATHOLIC UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; POLYNOMIALS; PROBLEM SOLVING; RELAXATION PROCESSES; ROBUST CONTROL;

BRANCH-CUT-AND-PRICE ALGORITHMS; HETEROGENEOUS FLEET VEHICLE ROUTING PROBLEM (HFVRP);

VEHICLE ROUTING;

EID: 37149056347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_12     Document Type: Conference Paper

References (17)

1. Baldacci, R., Bodin, L., Mingozzi, A.: The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Computers and Operation Research 33, 2667-2702 (2006)
2. Choi, E., Tcha, D.-W.: A column generation approach to the heterogeneous fleet vehicle routing problem. Computers and Operations Research 34, 2080-2095 (2007)
3. Christofides, N., Mingozzi, A., Toth, P.: Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Mathematical Programming 20, 255-282 (1981)
4. Dash, S., Fukasawa, R., Gunluk, O.: On the generalized master knapsack polyhedron. To appear LNCS - IPCO 2007 (2007)
5. Gendreau, M., Laporte, C., Musaraganyi, C., Taillard, E.D.: A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Computers and Operations Research 26, 1153-1173 (1999)
6. Golden, B., Assad, A., Levy, L., Gheysens, F.: The fleet size and mix vehicle routing problem. Computers and Operations Research 11, 49-66 (1984)
7. Houck, D., Picard, J., Queyranne, M., Vegamundi, R.: The travelling salesman problem as a constrained shortest path problem. Opsearch 17, 93-109 (1980)
8. Lysgaard, J., Letchford, A., Eglese, R.: A new branch-and-cut algorithm for the capacitated vehicle routing problem. Mathematical Programming 100, 423-445 (2004)
9. Ochi, L., Vianna, D., Filho, A., Drummond, L.: A parallel evolutionary algorithm for the vehicle routing problem with heterogeneous fleet. Future Generation Computer Systems 14, 285-292 (1998)
10. Picard, J., Queyranne, M.: The time-dependant traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Operations Research 26, 86-110 (1978)
11. de, Aragão, M.P., Uchoa, E.: Integer program reformulation for robust branch-andcut-and-price. In: Wolsey, L. (ed.): Annals of Mathematical Programming in Rio, Búzios, Brazil pp. 56-61 (2003)
12. Renaud, J., Boctor, F.F.: A sweep-based algorithm for the fleet size and mix vehicle routing problem. European Journal of Operational Research 140, 618-628 (2002)
13. Taillard, E.D.: A heuristic column generation method for the heterogeneous fleet vrp. RAIRO 33, 1-14 (1999)
14. Uchoa, E., Fukasawa, R., Lysgaard, J., Pessoa, A., de, Aragão, M.P., Andrade, D.: Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation. Mathematical Programming, on-line first (2007)
15. Wassan, N.A., Osman, I.H.: Tabu search variants for the mix fleet vehicle routing problem. Journal of the Operational Research Society 53, 768-782 (2002)
16. Westerlund, A., Göthe-Lundgren, M., Larsson, T.: Mathematical formulations of the heterogeneous fleet vehicle routing problem. In: ROUTE 2003, International Workshop on Vehicle Routing, pp. 1-2 (2003)
17. Yaman, H.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Mathematical Programming 106, 365-390 (2006)