Nodal aggregation of resource constraints in a shortest path problem

European Journal of Operational Research

Volumn 172, Issue 2, 2006, Pages 500-514

  Nagih, Anass ^a   Soumis, François ^b  

^a UNIVERSITÉ PARIS 13   (France)

^b GERAD   (Canada)

Author keywords

Column generation; Dynamic programming; Lagrangian relaxation; Resource aggregation; Resource constraints; Shortest path; Surrogate relaxation

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COST EFFECTIVENESS; DYNAMIC PROGRAMMING; LAGRANGE MULTIPLIERS; MATRIX ALGEBRA;

RESOURCE AGGREGATION; RESOURCE CONSTRAINTS; SHORTEST PATH;

CONSTRAINT THEORY;

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

References (24)

1. T.S. Abdul-Razak, and C.N. Potts Dynamic programming state-space relaxation for single-machine scheduling Journal of the Operational Research Society 39 2 1988 141 152
2. Y.P. Aneja, V. Aggarwal, and K.P.K. Nair Shortest chain subject to side constraints Networks 13 1983 295 302
3. L. Bianco, and S. Ricciardelli Dynamic programming strategies for the traveling salesman problem with time window and precedence constraints Operations Research 45 3 1997 365 377
4. P.M. Camerini, L. Fratta, and F. Maffioli On improving relaxation methods by modified gradient techniques Mathematical Programming Studies 3 1975 26 34
5. N. Christofides, A. Mingozzi, and P. Toth Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations Mathematical Programming 20 1981 255 282
6. G. Desaulniers, and D. Villeneuve The shortest path problem with time windows and linear waiting costs Transportation Science 34 3 2000 312 319
7. G. Desaulniers, J. Desrosiers, M. Gamache, and F. Soumis Crew scheduling in air transportation T. Crainic G. Laporte Fleet Management and Logistics 1998 Kluwer 169 185
8. Desrochers, M., 1986. La fabrication d'horaires de travail pour les conducteurs d'autobus par une méthode de génération de colonnes. Ph.D. thesis, Université de Montréal, Montréal, Canada.
9. M. Desrochers, and F. Soumis A generalized permanent labelling algorithm for the shortest path problem with time windows INFOR 26 1988 191 212
10. M. Desrochers, and F. Soumis A reoptimization algorithm for the shortest path problem with time windows European Journal of Operational Research 35 1988 242 254
11. J. Desrosiers, P. Pelletier, and F. Soumis Plus court chemin avec contraintes d'horaires RAIRO Recherche Opérationnelle 17 4 1983 357 377
12. J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis Time constrained routing and scheduling M.O. Ball Network Routing, Handbook in Operations Research and Management Science 8 1995 Elsevier Science Amsterdam 35 139
13. Goffin, J.L., Vial, J.P., 1998. Multiple cuts in the analytic center cutting plane method. Les Cahiers du GERAD G-98-26, revised April 1999.
14. J.L. Goffin, A. Haurie, and J.P. Vial Decomposition and nondifferentiable optimization with the projective algorithm Management Science 38 1992 284 302
15. G.Y. Handler, and I. Zang A dual algorithm for the constrained shortest path problem Networks 10 1980 293 310
16. M.I. Henig The shortest path problem with two objective functions European Journal of Operational Research 25 1985 281 291
17. J.M. Jaffe Algorithms for finding paths with multiple constraints Networks 14 1984 95 116
18. A.W. Kolen, A.H.G. Rinnooy Kan, and H.W.J.M. Trienekens Vehicle routing with time windows Operations Research 35 2 1987 266 273
19. N. Maculan, and J.J.C. Salles A lower bound for the shortest Hamiltonian path in directed graphs OR Spektrum 13 1991 99 102
20. M. Minoux Plus court chemin avec contraintes: Algorithmes et applications Annales des télécommunications, tome 30 1975 326 329
21. Nagih, A., Soumis, F. L'agrégation des contraintes de ressources dans un problème de plus court chemin avec contraintes de ressources. Les Cahiers du GERAD G-99-02, février, 1999.
22. M.M. Solomon Algorithms for the vehicle routing and scheduling problem with time windows constraints Operations Research 35 2 1987 254 265
23. A. Warburton Approximation of pareto optima in multiple-objective shortest-path problems Operations Research 35 1 1987 70 79
24. D.J. White The set of efficient solutions for multiple objective shortest path problems Computers and Operations Research 9 2 1982 101 107