Column generation algorithms for the capacitated m-ring-star problem

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

Volumn 5092 LNCS, Issue , 2008, Pages 631-641

  Hoshino, Edna A ^a   De Souza, Cid C ^b  

^a FEDERAL UNIVERSITY OF MATO GROSSO DO SUL   (Brazil)

^b UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BACKPROPAGATION ALGORITHMS; COLUMNS (STRUCTURAL); INTEGER PROGRAMMING; MATHEMATICAL PROGRAMMING; VEHICLE ROUTING; VEHICLES;

A-PRIORI; BRANCH-AND-CUT; BRANCH-AND-PRICE; CAPACITATED VEHICLE ROUTING PROBLEM; COLUMN GENERATION; COMBINATORICS; CONNECTION COSTS; CONNECTION POINTS; EXACT APPROACH; INTERNATIONAL CONFERENCES; PRICING ALGORITHM; SET COVERING MODELS;

SET THEORY;

EID: 48249090776     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69733-6_62     Document Type: Conference Paper

References (17)

1. Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Englewood Cliffs (1993)
2. Baldacci, R., Dell'Amico, M., Salazar, J.: The Capacitated m-Ring Star Problem. Operations Research 55, 1147-1162 (2007)
3. Beasley, J., Nascimento, E.: The Vehicle Routing-Allocation Problem: A Unifying Framework. Trabajos de OPerativa 4, 65-86 (1996)
4. 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)
5. Dell'Amico, M., Maffioli, F., Varbrand, P.: On Prize-Collecting Tours and the Asymmetric Travelling Salesman Problem. International Transactions in Operational Research 2(3), 297-308 (1995)
6. Feillet, D., Dejax, P., Gendreau, M.: Traveling Salesman Problems with Profits. Transportation Science 39(2), 188-205 (2005)
7. Fukasawa, R., Longo, H., Lysgaard, J., de Aragão, M.P., Reis, M., Uchoa, E., Werneck, R.: Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing problem. Mathematical Programming 106(3), 491-511 (2006)
8. Houck, D., Picard, J., Queyranne, M., Vemuganti, R.: The Travelling Salesman Problem as a Constrained Shortest Path Problem: Theory and Computational Experience. Opsearch 17, 93-109 (1980)
9. Irnich, S., Desaulniers, G.: Shortest Path Problems with Resource Constraints. In: Column Generation, pp. 33-65. Springer, Heidelberg (2005)
10. Irnich, S., Villeneuve, D.: The Dhortest Path Problem with Tesource Vonstraints and k-Cycle Elimination for k ≥ 3. INFORMS J. on Computing 18(3), 391-406 (2006)
11. Labbé, M., Laporte, G., Martín, I.R., González, J.S.: The Ring-Star Problem: Polyhedral Analysis and Exact Algorithm. Networks 43, 117-189 (2004)
12. Lasdon, L.: Optimization Theory for Large Systems. Macmillan, Basingstoke (1970)
13. Lysgaard, J., Letchford, A., Eglese, R.: A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing problem. Mathematical Programming 100(2), 423-445 (2004)
14. Mauttone, A., Nesmachnow, S., Olivera, A., Robledo, F.: A Hybrid Metaheuristic Algorithm to Solve the Capacitated m-Ring Star Problem. In: International Network Optimization Conference (2007)
15. TSPLIB, http://www.iwr.uni-heidelberg.de/groups/comopt/software/TSPLIB95/ tsp/
16. Wolsey, L.A.: Integer Programming. Wiley-Interscience, Chichester (1998)
17. Xpress-Optimizer. Dash Optimization (2007)