메뉴 건너뛰기




Volumn 39, Issue 2, 2012, Pages 164-178

A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation

Author keywords

Column generation; Integer programming; Pseudo polynomial time; Resource constrained shortest path problem; Three stage solution approach

Indexed keywords

ACYCLIC GRAPHS; ALGORITHM COMPLEXITY; ARC COSTS; COLUMN GENERATION; COMPUTATIONAL TESTS; ITERATIVE SOLUTIONS; LABEL-SETTING ALGORITHM; MULTIPLE RESOURCES; OPTIMIZATION SOFTWARE; PSEUDO-POLYNOMIAL TIME; RESOURCE LIMITATIONS; RESOURCE-CONSTRAINED; SHORTEST PATH; SHORTEST PATH PROBLEM; SOLUTION APPROACH; THREE-STAGE SOLUTION APPROACH;

EID: 79958108676     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.03.008     Document Type: Article
Times cited : (38)

References (33)
  • 1
    • 0020765680 scopus 로고
    • Shortest chain subject to side constraints
    • Y.P. Aneja, V. Aggarwal, and K.P.K. Nair Shortest chain subject to side constraints Networks 13 1983 295 302 (Pubitemid 13558786)
    • (1983) Networks , vol.13 , Issue.2 , pp. 295-302
    • Aneja, Y.P.1    Aggarwal, V.2    Nair, K.P.K.3
  • 2
    • 84986992097 scopus 로고
    • An algorithm for the resource constrained shortest path problem
    • J.E. Beasley, and N. Christofides An algorithm for the resource constrained shortest path problem Networks 19 1989 379 394
    • (1989) Networks , vol.19 , pp. 379-394
    • Beasley, J.E.1    Christofides, N.2
  • 4
    • 4644268001 scopus 로고
    • An algorithm for the shortest path problem with resource constraints
    • GEARD, Ecole des H.E.C., Montreal, Canada
    • Desrochers M. An algorithm for the shortest path problem with resource constraints. Technical Report G-88-27. GEARD, Ecole des H.E.C., Montreal, Canada, 1988
    • (1988) Technical Report G-88-27
    • Desrochers, M.1
  • 5
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • M. Desrochers, J. Desrosiers, and M. Solomon A new optimization algorithm for the vehicle routing problem with time windows Oper Res 40 2 1992 342 354
    • (1992) Oper Res , vol.40 , Issue.2 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 6
    • 0024011365 scopus 로고
    • Reoptimization algorithm for the shortest path problem with time windows
    • DOI 10.1016/0377-2217(88)90034-3
    • M. Desrochers, and F. Soumis A reoptimization algorithm for the shortest path problem with time windows Eur J Oper Res 35 1988 242 254 (Pubitemid 18606302)
    • (1988) European Journal of Operational Research , vol.35 , Issue.2 , pp. 242-254
    • Desrochers Martin1    Soumis Francois2
  • 7
    • 0002144209 scopus 로고
    • A generalized permanent labeling algorithm for the shortest path problem with time windows
    • M. Desrochers, and F. Soumis A generalized permanent labeling algorithm for the shortest path problem with time windows INFOR 26 1988 193 214
    • (1988) INFOR , vol.26 , pp. 193-214
    • Desrochers, M.1    Soumis, F.2
  • 8
    • 34147120474 scopus 로고
    • A note on two problems in connection with graphs
    • E.W. Dijkstra A note on two problems in connection with graphs Numer. Math. 1 1959 269 271
    • (1959) Numer. Math. , vol.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 9
    • 25144474660 scopus 로고    scopus 로고
    • A special case of transfer lines balancing by graph approach
    • DOI 10.1016/j.ejor.2004.07.025, PII S0377221704004825, Balancing Assembly and Transfer Lines
    • A. Dolgui, N. Guschinsky, and G. Levin A special case of transfer lines balancing by graph approach Eur J Oper Res 168 2006 732 746 (Pubitemid 41336589)
    • (2006) European Journal of Operational Research , vol.168 , Issue.3 , pp. 732-746
    • Dolgui, A.1    Guschinsky, N.2    Levin, G.3
  • 10
    • 0001661962 scopus 로고
    • Note on the complexity of the shortest path models for column generation in VRPTW
    • M. Dror Note on the complexity of the shortest path models for column generation in VRPTW Oper Res 42 5 1994 977 978
    • (1994) Oper Res , vol.42 , Issue.5 , pp. 977-978
    • Dror, M.1
  • 11
    • 0012574470 scopus 로고    scopus 로고
    • Algorithm for the weight constrained shortest path problem
    • I. Dumitrescu, and N. Boland Algorithm for the weight constrained shortest path problem Int Trans Oper Res 8 2001 15 30
    • (2001) Int Trans Oper Res , vol.8 , pp. 15-30
    • Dumitrescu, I.1    Boland, N.2
  • 12
    • 2142673126 scopus 로고    scopus 로고
    • Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem
    • I. Dumitrescu, and N. Boland Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem Networks 42 3 2003 135 153
    • (2003) Networks , vol.42 , Issue.3 , pp. 135-153
    • Dumitrescu, I.1    Boland, N.2
  • 13
    • 0036175855 scopus 로고    scopus 로고
    • Constraint programming based column generation for crew assignment
    • DOI 10.1023/A:1013613701606
    • T. Fahle, U. Junker, S.E. Karisch, N. Kohl, M. Sellmann, and B. Vaaben Constraint programming based column generation for crew assignment J Heuristics 8 1 2002 59 81 (Pubitemid 34172763)
    • (2002) Journal of Heuristics , vol.8 , Issue.1 , pp. 59-81
    • Fahle, T.1    Junker, U.2    Karisch, S.E.3    Kohl, N.4    Sellmann, M.5    Vaaben, B.6
  • 14
    • 4644250559 scopus 로고    scopus 로고
    • An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
    • DOI 10.1002/net.20033
    • D. Feillet, P. Dejax, M. Gendreau, and C. Gueguen An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems Networks 44 3 2004 216 229 (Pubitemid 39301560)
    • (2004) Networks , vol.44 , Issue.3 , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4
  • 15
    • 26444447488 scopus 로고    scopus 로고
    • Shorter path constraints for the resource constrained shortest path problem. CP-AI-OR 2005
    • Gellermann T, Sellmann M, Wright R. Shorter path constraints for the resource constrained shortest path problem. CP-AI-OR 2005, Lecture notes in computer science, vol. 3524. p. 20116.
    • Lecture Notes in Computer Science , vol.3524 , pp. 201-216
    • Gellermann, T.1    Sellmann, M.2    Wright, R.3
  • 16
    • 84987047540 scopus 로고
    • A dual algorithm for the constrained shortest path problem
    • G.Y. Handler, and I. Zang A dual algorithm for the constrained shortest path problem Networks 10 1980 293 310
    • (1980) Networks , vol.10 , pp. 293-310
    • Handler, G.Y.1    Zang, I.2
  • 17
    • 0002777817 scopus 로고
    • Approximation schemas for the restricted shortest path problems
    • R. Hassin Approximation schemas for the restricted shortest path problems Math Oper Res 17 1 1992 36 42
    • (1992) Math Oper Res , vol.17 , Issue.1 , pp. 36-42
    • Hassin, R.1
  • 18
    • 0942281491 scopus 로고    scopus 로고
    • A multicommodity network-flow problem with side constraints on paths solved by column generation
    • DOI 10.1287/ijoc.15.1.42.15151
    • K. Holmberg, and D. Yuan A multicommodity network-flow problem with side constraints on paths solved by column generation Informs J Comput 15 1 2003 42 57 (Pubitemid 39042732)
    • (2003) INFORMS Journal on Computing , vol.15 , Issue.1 , pp. 42-57
    • Holmberg, K.1    Yuan, D.2
  • 19
    • 0003871857 scopus 로고    scopus 로고
    • A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
    • I. Ioachim, S. Gélinas, F. Soumis, and J. Desrosiers A dynamic programming algorithm for the shortest path problem with time windows and linear node costs Networks 31 1998 193 204
    • (1998) Networks , vol.31 , pp. 193-204
    • Ioachim, I.1    Gélinas, S.2    Soumis, F.3    Desrosiers, J.4
  • 20
    • 0021392471 scopus 로고
    • Algorithms for finding paths with multiple constraints
    • J.M. Jaffe Algorithms for finding paths with multiple constraints Networks 14 1984 95 116
    • (1984) Networks , vol.14 , pp. 95-116
    • Jaffe, J.M.1
  • 22
    • 0035364530 scopus 로고    scopus 로고
    • A simple efficient approximation scheme for the restricted shortest path problem
    • DOI 10.1016/S0167-6377(01)00069-4, PII S0167637701000694
    • D.H. Lorenz, and D. Raz A simple efficient approximation scheme for the restricted shortest path problem Oper Res Lett 28 2001 213 219 (Pubitemid 32651191)
    • (2001) Operations Research Letters , vol.28 , Issue.5 , pp. 213-219
    • Lorenz, D.H.1    Raz, D.2
  • 23
    • 84927133516 scopus 로고    scopus 로고
    • Resource Constrained shortest paths
    • Paterson M, editor Lecture notes in computer science Berlin: Springer-Verlag
    • Mehlhorn K, Ziegelmann M. Resource Constrained shortest paths: in: Paterson M, editor. 7th annual European Symposium on Algorithms (ESA 2000). Lecture notes in computer science, vol. 1879. Berlin: Springer-Verlag. p. 32637.
    • 7th Annual European Symposium on Algorithms (ESA 2000) , vol.1879 , pp. 326-337
    • Mehlhorn, K.1    Ziegelmann, M.2
  • 26
    • 34248572417 scopus 로고    scopus 로고
    • Cost-based filtering for shorter path constraints
    • DOI 10.1007/s10601-006-9006-4
    • M. Sellmann, T. Gellermann, and R. Wright Cost-based filtering for shorter path constraints Constraints 12 2 2007 207 238 (Pubitemid 46752060)
    • (2007) Constraints , vol.12 , Issue.2 , pp. 207-238
    • Sellmann, M.1    Gellermann, T.2    Wright, R.3
  • 27
    • 0032651420 scopus 로고    scopus 로고
    • A column-generation approach for the assembly system design problem with tool changes
    • W.E. Wilhelm A column-generation approach for the assembly system design problem with tool changes Int J Flexible Manuf Syst 11 1999 177 205
    • (1999) Int J Flexible Manuf Syst , vol.11 , pp. 177-205
    • Wilhelm, W.E.1
  • 28
    • 0038580048 scopus 로고    scopus 로고
    • A technical review of column generation in integer programming
    • W.E. Wilhelm A technical review of column generation in integer programming Optim Eng 2 2001 159 200
    • (2001) Optim Eng , vol.2 , pp. 159-200
    • Wilhelm, W.E.1
  • 30
    • 79958166620 scopus 로고    scopus 로고
    • A model to optimize placement operations on dual-head placement machines
    • W.E. Wilhelm, N.D. Choudhry, and P. Damodaran A model to optimize placement operations on dual-head placement machines Discrete Optim 182 2007 626 639
    • (2007) Discrete Optim , vol.182 , pp. 626-639
    • Wilhelm, W.E.1    Choudhry, N.D.2    Damodaran, P.3
  • 31
    • 0038817875 scopus 로고    scopus 로고
    • Prescribing the content and timing of product upgrades
    • W.E. Wilhelm, P. Damodaran, and J. Li Prescribing the content and timing of product upgrades IIE Trans 35 7 2003 647 664
    • (2003) IIE Trans , vol.35 , Issue.7 , pp. 647-664
    • Wilhelm, W.E.1    Damodaran, P.2    Li, J.3
  • 33
    • 77951258097 scopus 로고    scopus 로고
    • Enabling flexibility on a dual head placement machine by optimizing platform-tray-feeder picking operations
    • W.E. Wilhelm, and X. Zhu Enabling flexibility on a dual head placement machine by optimizing platform-tray-feeder picking operations Flex Serv Manuf J 21 1-2 2009 1 30
    • (2009) Flex Serv Manuf J , vol.21 , Issue.12 , pp. 1-30
    • Wilhelm, W.E.1    Zhu, X.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.