Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context

European Journal of Operational Research

Volumn 183, Issue 2, 2007, Pages 564-577

  Zhu, Xiaoyan ^a   Wilhelm, Wilbert E ^b  

^a UNIVERSITY OF TENNESSEE   (United States)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

(T) Graph theory; (T) Integer programming; Column generation; Discrete optimization; Multiple choice knapsack problem; Multiple resource; Resource constrained shortest path problem; Shortest path problem with resource windows

Indexed keywords

CONSTRAINT THEORY; GRAPH THEORY; INTEGER PROGRAMMING; OPERATIONS RESEARCH; OPTIMIZATION; SUPPLY CHAINS;

COLUMN-GENERATION; DISCRETE OPTIMIZATION; MULTIPLE-CHOICE KNAPSACK PROBLEM; RESOURCE-CONSTRAINED SHORTEST-PATH PROBLEM;

PROBLEM SOLVING;

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

References (45)

1. Aneja Y.P., Aggarwal V., and Nair K.P.K. Shortest chain subject to side constraints. Networks 13 (1983) 295-302
2. Avella P., Boccia M., and Sforza A. A penalty function heuristic for the resource constrained shortest path problem. European Journal of Operational Research 142 (2002) 221-230
3. Balakrishnan N. Simple heuristics for the vehicle routing problem with soft time windows. Journal of Operational Research Society 44 (1993) 279-287
4. Beasley J.E., and Christofides N. An algorithm for the resource constrained shortest path problem. Networks 19 (1989) 379-394
5. Boland N., Dethridge J., and Dumitrescu I. Accelerated label setting algorithms for the elementary resource constrained shortest path problem. Operations Research Letters 34 1 (2006) 58-68
6. Bramel J., and Simchi Levi D. Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows. Operations Research 44 (1996) 501-509
7. Desrochers, M., 1988. An algorithm for the shortest path problem with resource constraints. Technical Report G-88-27, GEARD, Ecole des H.E.C., Montreal, Canada.
8. Desrochers M., and Soumis F. A reoptimization algorithm for the shortest path problem with time windows. European Journal of Operational Research 35 (1988) 242-254
9. Desrochers M., and Soumis F. A generalized permanent labeling algorithm for the shortest path problem with time windows. INFOR 26 (1988) 193-214
10. Desrochers M., and Soumis F. A column generation approach to the urban transit crew scheduling problem. Transportation Science 23 (1989) 1-13
11. Desrochers M., Desrosiers J., and Solomon M. A new optimization algorithm for the vehicle routing problem with time windows. Operations Research 40 2 (1992) 342-354
12. Desrosiers J., Soumis F., and Desrochers M. Routing with time windows by column generation. Networks 14 (1984) 545-565
13. Desrosiers J., Dumas Y., and Soumis F. The multiple vehicle dial-a-ride problem. Computer-Aided Transit Scheduling. Lecture Notes in Economics and Mathematical System vol. 308 (1988), Springer, Berlin 15-27
14. Dror M. Note on the complexity of the shortest path models for column generation in VRPTW. Operations Research 42 5 (1994) 977-978
15. Dudzinski K., and Walukiewicz S. Exact methods for knapsack problem and its generalizations. European Journal of Operational Research 28 (1987) 3-21
16. Dumitrescu I., and Boland N. Algorithm for the weight constrained shortest path problem. International Transactions in Operational Research 8 (2001) 15-30
17. Dumitrescu I., and Boland N. Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42 3 (2003) 135-153
18. Eppstein D. Finding the k shortest paths. SIAM Journal on Computing 28 2 (1998) 652-673
19. Feillet D., Dejax P., Gendreau M., and Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44 3 (2004) 216-229
20. Fisher M.L. The Lagrangian relaxation method for solving integer programming problems. Management Science 27 (1981) 1-18
21. Gallo G., and Pallottino S. Shortest path methods: A unifying approach. Mathematical Programming Study 26 (1986) 38-64
22. Garey M.R., and Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness (1979), Freeman, San Francisco
23. Handler G.Y., and Zang I. A dual algorithm for the constrained shortest path problem. Networks 10 (1980) 293-310
24. Hassin R. Approximation schemas for the restricted shortest path problems. Mathematics of Operations Research 17 1 (1992) 36-42
25. Holmberg K., and Yuan D. A multicommodity network-flow problem with side constraints on paths solved by column generation. Informs Journal of Computing 15 1 (2003) 42-57
26. Jaffe J.M. Algorithms for finding paths with multiple constraints. Networks 14 (1984) 95-116
27. Joksch H.C. The shortest route problem with constraints. Journal of Mathematical Analysis and Applications 14 (1966) 191-197
28. Katoh N., Ibaraki T., and Mine H. An efficient algorithm for k shortest simple paths. Networks 12 (1982) 411-427
29. Kolen A., Rinnooy Kan A., and Trienekens H. Vehicle routing with time windows. Operations Research 35 (1987) 266-273
30. Lawler E.L. Combinatorial Optimization: Networks and Matroids (1976), Holt, Rinehart & Winston, New York
31. Lorenz D.H., and Raz D. A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters 28 (2001) 213-219
32. Mehlhorn K., and Ziegelmann M. Resource Constrained shortest paths. In: Paterson M. (Ed). 7th Annual European Symposium on Algorithms (ESA 2000). LNCS vol. 1879 (2000), Springer-Verlag, Berlin Heidelberg 326-337
33. Mingozzi A., Boschetti M.A., Ricciardelli S., and Bianco L. A set partitioning approach to the crew scheduling problem. Operations Research 47 6 (1999) 873-888
34. Nauss R.M. The 0-1 knapsack problem with multiple choice constraint. European Journal of Operational Research 2 (1978) 125-131
35. Pisinger, D., 1994. A minimal algorithm for the multiple-choice knapsack problem. Technical Report 94/25, DIKU, University of Copenhagen, Denmark.
36. Russell R.A. Hybrid heuristics for the vehicle-routing problem with time windows. Transportation Sciences 29 (1995) 156-166
37. Sinha A., and Zoltners A.A. The multiple-choice knapsack problem. Operations Research 27 (1979) 503-515
38. Wilhelm W.E., Damodaran P., and Li J. Prescribing the content and timing of product upgrades. IIE Transactions 35 7 (2003) 647-664
39. Wilhelm W.E., Liang D., Rao B., Warrier D., Zhu X., and Bulusu S. Design of International Assembly Systems and their supply chains under NAFTA. Transportation Research E 41 (2005) 467-493
40. Wilhelm, W.E., Choudhry, N.D., Damodaran, P., 2006a. A model to optimize placement operations on dual-head placement machines. Discrete Optimization, in press.
41. Wilhelm W.E., Arambula I., and Choudhry N.N. A model to optimize picking operations on dual-head placement machines. IEEE Transactions on Automation Science and Engineering 3 1 (2006) 1-15
42. Yen J.Y. Finding the k shortest loopless paths in a network. Management Science 17 (1971) 712-716
43. Zhu, X., Wilhelm, E.W., 2005a. A three-stage approach for the resource-constrained shortest-path problem on an acyclic graph. Working paper, Industrial Engineering Department, Texas A&M University.
44. Zhu, X., Wilhelm, E.W., 2005b. Computational evaluation on a three-stage approach for the resource-constrained shortest-path problem on an acyclic graph. Working paper, Industrial Engineering Department, Texas A&M University.
45. Zhu, X., Wilhelm, E.W., 2005c. Implementation of a three-stage approach for the resource-constrained shortest-path problem in column generation and branch-and-bound. Working paper, Industrial Engineering Department, Texas A&M University.