메뉴 건너뛰기




Volumn 33, Issue 10, 2006, Pages 2972-2990

Vehicle Routing Problem with elementary shortest path based column generation

Author keywords

Branch and Price; Elementary shortest path; Vehicle routing

Indexed keywords

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; ROUTERS; VEHICLES;

EID: 32044469861     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.02.029     Document Type: Article
Times cited : (150)

References (25)
  • 1
    • 0029362478 scopus 로고
    • Probabilistic diversification and intensification in local search for vehicle routing
    • Y. Rochat, and E. Taillard Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1995 147 167
    • (1995) Journal of Heuristics , vol.1 , pp. 147-167
    • Rochat, Y.1    Taillard, E.2
  • 3
    • 12944272148 scopus 로고    scopus 로고
    • Two evolutionary metaheuristics for the vehicle routing problem with time windows
    • J. Homberger, and H. Gehring Two evolutionary metaheuristics for the vehicle routing problem with time windows INFOR 37 1999 297 318
    • (1999) INFOR , vol.37 , pp. 297-318
    • Homberger, J.1    Gehring, H.2
  • 4
    • 0001834106 scopus 로고    scopus 로고
    • MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows
    • D. Corne M. Dorigo F. Glover McGraw-Hill London
    • L.M. Gambardella, É. Taillard, and G. Agazzi MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows D. Corne M. Dorigo F. Glover New ideas in optimization 1999 McGraw-Hill London 63 76
    • (1999) New Ideas in Optimization , pp. 63-76
    • Gambardella, L.M.1    Taillard, É.2    Agazzi, G.3
  • 5
    • 0034272145 scopus 로고    scopus 로고
    • Solving vehicle routing problems using constraint programming and metaheuristics
    • B. De Backer, V. Furnon, P. Shaw, Ph. Kilby, and P. Prosser Solving vehicle routing problems using constraint programming and metaheuristics Journal of Heuristics 6 2000 501 523
    • (2000) Journal of Heuristics , vol.6 , pp. 501-523
    • De Backer, B.1    Furnon, V.2    Shaw, P.3    Kilby, Ph.4    Prosser, P.5
  • 7
    • 84957372764 scopus 로고    scopus 로고
    • Using constraint programming and local search methods to solve vehicle routing problems
    • Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Principles and practice of constraint programming, 1998. p. 417-31.
    • (1998) Principles and Practice of Constraint Programming , pp. 417-431
    • Shaw, P.1
  • 8
    • 0034288470 scopus 로고    scopus 로고
    • A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints
    • Ph. Kilby, P. Prosser, and P. Shaw A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints Constraints 5 4 2000 389 414
    • (2000) Constraints , vol.5 , Issue.4 , pp. 389-414
    • Kilby, Ph.1    Prosser, P.2    Shaw, P.3
  • 9
    • 0037912125 scopus 로고    scopus 로고
    • A two-stage hybrid local search for the vehicle routing problem with time windows
    • Brown University, September
    • Bent R, Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Technical report CS-01-06, Brown University, September 2001.
    • (2001) Technical Report , vol.CS-01-06
    • Bent, R.1    Van Hentenryck, P.2
  • 10
    • 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 Operations Research 40 1992 342 354
    • (1992) Operations Research , vol.40 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 11
    • 3342976993 scopus 로고    scopus 로고
    • A parallel cutting-plane algorithm for the vehicle routing problem with time windows
    • Department of Computational and Applied Mathematics, Rice University, May
    • Cook W, Rich JL. A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Technical report TR99-04, Department of Computational and Applied Mathematics, Rice University, May 1999.
    • (1999) Technical Report , vol.TR99-04
    • Cook, W.1    Rich, J.L.2
  • 13
    • 30344484961 scopus 로고    scopus 로고
    • Lagrangean duality and non-differentiable optimization applied on routing with time window - Experimental results
    • Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, August
    • Kallehauge B, Larsen J, Madsen OBG. Lagrangean duality and non-differentiable optimization applied on routing with time window - experimental results. Technical report IMM-TR-2001-9, Department of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark, August 2001.
    • (2001) Technical Report , vol.IMM-TR-2001-9
    • Kallehauge, B.1    Larsen, J.2    Madsen, O.B.G.3
  • 14
    • 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 Operations Research 42 1994 977 978
    • (1994) Operations Research , vol.42 , pp. 977-978
    • Dror, M.1
  • 17
    • 0001391104 scopus 로고
    • Decomposition principle for linear programs
    • G.B. Dantzig, and P. Wolfe Decomposition principle for linear programs Operations Research 8 1960 101 111
    • (1960) Operations Research , vol.8 , pp. 101-111
    • Dantzig, G.B.1    Wolfe, P.2
  • 19
  • 24
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problem with time window constraints
    • M.M. Solomon Algorithms for the vehicle routing and scheduling problem with time window constraints Operations Research 35 1987 254 265
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.M.1


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