The shortest path problem with forbidden paths

European Journal of Operational Research

Volumn 165, Issue 1, 2005, Pages 97-107

  Villeneuve, Daniel ^a   Desaulniers, Guy ^a  

^a ÉCOLE POLYTECHNIQUE DE MONTRÉAL   (Canada)

Author keywords

Forbidden paths; Network flows; Shortest paths

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COSTS; FUNCTIONS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING;

FORBIDDEN PATHS; NETWORK FLOWS; NON-TERMINATING ALGORITHM; SHORTEST PATH PROBLEM;

OPERATIONS RESEARCH;

EID: 12344326719     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2004.01.032     Document Type: Article

References (25)

1. Aho A.V., Corasick M.J. Efficient string matching: An aid to bibliographic search. Journal of the ACM. 18(6):1975;333-340
2. Arunapuram S., Mathur K., Solow D. Vehicle routing and scheduling with full truck loads. Transportation Science. 37:2003;170-182
3. Bellman R.E. On a routing problem. Quarterly Applied Mathematics. 16:1958;87-90
4. Chauny, F., Ratsirahonana, L., Savard, G., 2000. A model and column generation algorithm for the aircraft loading problem. Les Cahiers du GERAD G-2000-68, École des Hautes Études Commerciales, Montréal, 2000
5. Desaulniers G., Desrosiers J., Ioachim I., Solomon M.M., Soumis F., Villeneuve D. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. Crainic T.G., Laporte G. Fleet Management and Logistics. 1998;57-93 Kluwer, Norwell, MA
6. Desaulniers G., Desrosiers J., Solomon M.M., Soumis F. The VRP with time windows. Toth P., Vigo D. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. vol. 9:2002;157-193 SIAM, Philadelphia
7. Desaulniers, G., Langevin, A., Riopel, D., Villeneuve, B., 2002b. Dispatching and conflict-free routing of automated guided vehicles: An exact approach. Les Cahiers du GERAD G-2002-31, École des Hautes Études Commerciales, Montréal. International Journal of Flexible Manufacturing Systems, in press
8. Desrochers M., Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR. 26:1988;191-212
9. Desrosiers J., Dumas Y., Solomon M., Soumis F. Time constrained routing and scheduling. Ball, et al. Handbooks in Operations Research and Management Science: Network Routing. vol. 8:1995;35-139 Elsevier, Amsterdam
10. Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research. 42(5):1994;977-978
11. Dumas Y., Desrosiers J., Soumis F. The pickup and delivery problem with time windows. European Journal of Operational Research. 54:1991;7-22
12. Eppstein D. Finding the. k shortest paths SIAM Journal on Computing. 28(2):1998;652-673
13. Fredman M.L., Tarjan R.E. Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the ACM. 34:1987;596-615
14. Gilmore P.C., Gomory R.E. A linear programming approach to the cutting-stock problem. Operations Research. 9:1961;849-859
15. Gusfield D.M. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. 1997;Cambridge University Press, New York
16. Gustafsson, T., 1999. A heuristic approach to column generation for airline crew scheduling. Licentiate thesis, Chalmers University of Technology and Göteborg University, S-412 96 Göteborg, Sweden
17. Hansen P., Jaumard B., de Aragão M.P. Un algorithme primal de programmation linéaire généralisée pour les programmes mixtes. Comptes Rendus de l'Académie des Sciences. 313:1991;557-560. (in French)
18. Houck D.J. Jr., Picard J.C., Queyranne M., Vemuganti R.R. The traveling salesman problem as a constrained shortest path problem: Theory and computational experience. Opsearch. 17:1980;93-109
19. Ioachim I., Gélinas S., Desrosiers J., Soumis F. A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks. 31:1998;193-204
20. Lawler E.L. A procedure for computing the. k best solutions to discrete optimization problems and its application to the shortest path problem Management Science. 18:1972;401-405
21. Lawler E.L. Combinatorial Optimization: Networks and Matroids. 1976;Holt, Rinehart and Winston, New York
22. Martins E.Q.V. An algorithm for ranking paths that may contain cycles. European Journal of Operational Research. 18:1984;123-130
23. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization. 1988;John Wiley and Sons, New York
24. Vanderbeck F., Wolsey L.A. An exact algorithm for IP column generation. Operations Research Letters. 19:1996;151-160
25. Villeneuve, D., Desaulniers, G., 2002. The shortest path problem with forbidden paths. Les Cahiers du GERAD G-2002-41, École des Hautes Études Commerciales, Montréal