메뉴 건너뛰기




Volumn 34, Issue 3, 2007, Pages 817-834

Stabilized column generation for highly degenerate multiple-depot vehicle scheduling problems

Author keywords

Column generation; Degeneracy; Multiple Depot Vehicle Scheduling Problem; Stabilization

Indexed keywords

LINEAR PROGRAMMING; OPERATIONS RESEARCH; PROBLEM SOLVING; STABILIZATION;

EID: 33748453338     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.05.011     Document Type: Article
Times cited : (62)

References (19)
  • 1
    • 33748465007 scopus 로고    scopus 로고
    • Ben Amor H, Desrosiers J. A proximal trust-region algorithm for column generation stabilization. Computers & Operations Research, 2004, to appear.
  • 2
    • 0017916279 scopus 로고
    • UCOST: a micro approach to a transit planning problem
    • Bodin L., Rosenfield D., and Kydes A. UCOST: a micro approach to a transit planning problem. Journal of Urban Anal. 5 (1978) 46-69
    • (1978) Journal of Urban Anal. , vol.5 , pp. 46-69
    • Bodin, L.1    Rosenfield, D.2    Kydes, A.3
  • 4
    • 84986980023 scopus 로고
    • On some matching problems arising in vehicle scheduling models
    • Bertossi A.A., Carraresi P., and Gallo G. On some matching problems arising in vehicle scheduling models. Networks 17 (1987) 271-281
    • (1987) Networks , vol.17 , pp. 271-281
    • Bertossi, A.A.1    Carraresi, P.2    Gallo, G.3
  • 5
    • 84986938630 scopus 로고
    • A branch and bound algorithm for the multiple vehicle scheduling problem
    • Carpaneto G., Della'Amico M., Fischetti M., and Toth P. A branch and bound algorithm for the multiple vehicle scheduling problem. Networks 19 (1989) 531-548
    • (1989) Networks , vol.19 , pp. 531-548
    • Carpaneto, G.1    Della'Amico, M.2    Fischetti, M.3    Toth, P.4
  • 6
    • 0027927228 scopus 로고
    • A column generation approach to the multiple depot vehicle scheduling problem
    • Ribeiro C.C., and Soumis F. A column generation approach to the multiple depot vehicle scheduling problem. Operations Research 42 1 (1994) 41-52
    • (1994) Operations Research , vol.42 , Issue.1 , pp. 41-52
    • Ribeiro, C.C.1    Soumis, F.2
  • 7
    • 0028712062 scopus 로고
    • A set partitioning approach to the multiple depot vehicle scheduling problem
    • Bianco L., Mingozzi A., and Ricciardelli S. A set partitioning approach to the multiple depot vehicle scheduling problem. Optimization Methods and Software 3 (1994) 163-194
    • (1994) Optimization Methods and Software , vol.3 , pp. 163-194
    • Bianco, L.1    Mingozzi, A.2    Ricciardelli, S.3
  • 9
    • 0032298664 scopus 로고    scopus 로고
    • Vehicle scheduling in public transit and lagrangean pricing
    • Löbel A. Vehicle scheduling in public transit and lagrangean pricing. Management Science 44 (1998) 1637-1649
    • (1998) Management Science , vol.44 , pp. 1637-1649
    • Löbel, A.1
  • 10
    • 33748457191 scopus 로고    scopus 로고
    • Hadjar A, Marcotte O, Soumis F. A branch-and-cut algorithm for the multiple-depot vehicle scheduling problem. Operations Research, 2001, to appear.
  • 11
    • 0002127739 scopus 로고    scopus 로고
    • A unified framework for deterministic time constrained vehicle routing and crew scheduling problems
    • Crainic T.G., and Laporte G. (Eds), Kluwer, Boston
    • Desaulniers G., Desrosiers J., Ioachim I., Solomon M.M., Soumis F., and Villeneuve D. A unified framework for deterministic time constrained vehicle routing and crew scheduling problems. In: Crainic T.G., and Laporte G. (Eds). Fleet management and logistics (1998), Kluwer, Boston 57-93
    • (1998) Fleet management and logistics , pp. 57-93
    • Desaulniers, G.1    Desrosiers, J.2    Ioachim, I.3    Solomon, M.M.4    Soumis, F.5    Villeneuve, D.6
  • 12
    • 10844287617 scopus 로고    scopus 로고
    • Lagrangian relaxation
    • Jünger M., and Naddef D. (Eds), Springer, Heidelberg
    • Lemaréchal C. Lagrangian relaxation. In: Jünger M., and Naddef D. (Eds). Computational Combinatorial Optimization (2001), Springer, Heidelberg 115-160
    • (2001) Computational Combinatorial Optimization , pp. 115-160
    • Lemaréchal, C.1
  • 15
    • 0016630723 scopus 로고
    • The use of Boxstep method in discrete optimization
    • Martsen R.E. The use of Boxstep method in discrete optimization. Mathematical Programming Study 3 (1975) 127-144
    • (1975) Mathematical Programming Study , vol.3 , pp. 127-144
    • Martsen, R.E.1
  • 16
    • 0000091855 scopus 로고    scopus 로고
    • A version of the bundle idea for minimizing a nonsmooth function: conceptual idea convergence analysis, numerical results
    • Schramm H., and Zowe J. A version of the bundle idea for minimizing a nonsmooth function: conceptual idea convergence analysis, numerical results. SIAM Journal on Optimization 2 (1998) 121-152
    • (1998) SIAM Journal on Optimization , vol.2 , pp. 121-152
    • Schramm, H.1    Zowe, J.2
  • 17
    • 33748441265 scopus 로고    scopus 로고
    • Neame P. Nonsmooth methods in integer programming, PhD dissertation, University of Melbourne, Australia, 1999.
  • 19
    • 33748471012 scopus 로고    scopus 로고
    • Ben Amor H, Desrosiers J, Frangionni A. Stabilization in column generation. Les Cahiers du GERAD, G-2004-62, HEC Montréal, Canada, 2003.


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