메뉴 건너뛰기




Volumn 236, Issue 3, 2014, Pages 789-799

Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach

Author keywords

Branch and price; Column generation; Routing; Stochastic travel times

Indexed keywords

COSTS; GRAPH THEORY; INTEGER PROGRAMMING; STOCHASTIC SYSTEMS; TRAVEL TIME; VEHICLE ROUTING;

EID: 84897915068     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.05.024     Document Type: Article
Times cited : (110)

References (32)
  • 1
    • 33748176011 scopus 로고    scopus 로고
    • Travel time reliability in vehicle routing and scheduling with time windows
    • N. Ando, and E. Taniguchi Travel time reliability in vehicle routing and scheduling with time windows Networks and Spatial Economics 6 2006 293 311
    • (2006) Networks and Spatial Economics , vol.6 , pp. 293-311
    • Ando, N.1    Taniguchi, E.2
  • 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
  • 3
    • 28044459377 scopus 로고    scopus 로고
    • Accelerated label setting algorithms for the elementary resource constrained shortest path problem
    • N. Boland, J. Dethridge, and I. Dumitrescu Accelerated label setting algorithms for the elementary resource constrained shortest path problem Operations Research Letters 34 2006 58 68
    • (2006) Operations Research Letters , vol.34 , pp. 58-68
    • Boland, N.1    Dethridge, J.2    Dumitrescu, I.3
  • 4
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, part I: Route construction and local search algorithms
    • O. Bräysy, and M. Gendreau Vehicle routing problem with time windows, part I: route construction and local search algorithms Transportation Science 39 2005 104 118
    • (2005) Transportation Science , vol.39 , pp. 104-118
    • Bräysy, O.1    Gendreau, M.2
  • 5
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, part II: Metaheuristics
    • O. Bräysy, and M. Gendreau Vehicle routing problem with time windows, part II: metaheuristics Transportation Science 39 2005 119 139
    • (2005) Transportation Science , vol.39 , pp. 119-139
    • Bräysy, O.1    Gendreau, M.2
  • 6
    • 32044469861 scopus 로고    scopus 로고
    • Vehicle routing problem with elementary shortest path based column generation
    • A. Chabrier Vehicle routing problem with elementary shortest path based column generation Computers & Operations Research 33 2006 2972 2990
    • (2006) Computers & Operations Research , vol.33 , pp. 2972-2990
    • Chabrier, A.1
  • 7
    • 34748829281 scopus 로고    scopus 로고
    • A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands
    • C.H. Christiansen, and J. Lysgaard A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands Operations Research Letters 35 2007 773 781
    • (2007) Operations Research Letters , vol.35 , pp. 773-781
    • Christiansen, C.H.1    Lysgaard, J.2
  • 8
    • 0034343395 scopus 로고    scopus 로고
    • Push and pull strategies in multi-stage assembly systems
    • N.P. Dellaert, A.G. de Kok, and W. Wei Push and pull strategies in multi-stage assembly systems Statistica Neerlandica 54 2000 175 189
    • (2000) Statistica Neerlandica , vol.54 , pp. 175-189
    • Dellaert, N.P.1    De Kok, A.G.2    Wei, W.3
  • 11
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • M. Desrochers, J. Desrosiers, and M.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.M.3
  • 12
    • 77957089136 scopus 로고
    • Time constrained routing and scheduling
    • M. Ball, T. Magnanti, C. Monma, G. Nemhauser, Handbooks in Operations Research and Management Science North-Holland Amsterdam
    • J. Desrosiers, Y. Dumas, M.M. Solomon, and F. Soumis Time constrained routing and scheduling M. Ball, T. Magnanti, C. Monma, G. Nemhauser, Network Routing Handbooks in Operations Research and Management Science vol. 8 1995 North-Holland Amsterdam 35 139
    • (1995) Network Routing , vol.8 , pp. 35-139
    • Desrosiers, J.1    Dumas, Y.2    Solomon, M.M.3    Soumis, F.4
  • 13
    • 4644250559 scopus 로고    scopus 로고
    • An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
    • 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 2004 216 229
    • (2004) Networks , vol.44 , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4
  • 14
    • 51349115735 scopus 로고    scopus 로고
    • New refinements for the solution of vehicle routing problems with branch and price
    • D. Feillet, M. Gendreau, and L.-M. Rousseau New refinements for the solution of vehicle routing problems with branch and price INFOR 45 2007 239 256
    • (2007) INFOR , vol.45 , pp. 239-256
    • Feillet, D.1    Gendreau, M.2    Rousseau, L.-M.3
  • 15
    • 0028508261 scopus 로고
    • A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs
    • M. Fischetti, P. Toth, and D. Vigo A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs Operations Research 42 1994 846 859
    • (1994) Operations Research , vol.42 , pp. 846-859
    • Fischetti, M.1    Toth, P.2    Vigo, D.3
  • 18
    • 84897915813 scopus 로고    scopus 로고
    • IBM, ILOG CPLEX Optimizer 12.2, 2012
    • IBM, ILOG CPLEX Optimizer 12.2, 2012. < http://www-01.ibm.com/ software/integration/optimization/cplex-optimizer >.
  • 19
    • 33748591592 scopus 로고    scopus 로고
    • The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3
    • S. Irnich, and D. Villeneuve The shortest-path problem with resource constraints and k-cycle elimination for k ≥ 3 INFORMS Journal on Computing 18 2006 391 406
    • (2006) INFORMS Journal on Computing , vol.18 , pp. 391-406
    • Irnich, S.1    Villeneuve, D.2
  • 20
    • 84944319341 scopus 로고    scopus 로고
    • Parallel and hybrid models for multi-objective optimization: Application to the vehicle routing problem
    • J. Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacanas, H.-P. Schwefel, Springer-Verlag Berlin, Heidelberg
    • N. Jozefowiez, F. Semet, and E.-G. Talbi Parallel and hybrid models for multi-objective optimization: application to the vehicle routing problem J. Guervos, P. Adamidis, H.-G. Beyer, J.-L. Fernández-Villacanas, H.-P. Schwefel, Parallel Problem Solving from Nature (PPSN VII), Granada, Spain, LNCS vol. 2439 2002 Springer-Verlag Berlin, Heidelberg 271 280
    • (2002) Parallel Problem Solving from Nature (PPSN VII), Granada, Spain, LNCS , vol.2439 , pp. 271-280
    • Jozefowiez, N.1    Semet, F.2    Talbi, E.-G.3
  • 21
    • 36348987653 scopus 로고    scopus 로고
    • Formulations and exact algorithms for the vehicle routing problem with time windows
    • B. Kallehauge Formulations and exact algorithms for the vehicle routing problem with time windows Computers & Operations Research 35 2008 2307 2330
    • (2008) Computers & Operations Research , vol.35 , pp. 2307-2330
    • Kallehauge, B.1
  • 22
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • G. Laporte The vehicle routing problem: an overview of exact and approximate algorithms European Journal of Operational Research 59 1992 345 358
    • (1992) European Journal of Operational Research , vol.59 , pp. 345-358
    • Laporte, G.1
  • 23
    • 36549015264 scopus 로고    scopus 로고
    • What you should know about the vehicle routing problem
    • G. Laporte What you should know about the vehicle routing problem Naval Research Logistics 54 2007 811 819
    • (2007) Naval Research Logistics , vol.54 , pp. 811-819
    • Laporte, G.1
  • 24
    • 77949568659 scopus 로고    scopus 로고
    • Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm
    • X. Li, P. Tian, and S.C.H. Leung Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm International Journal of Production Economics 125 2010 137 145
    • (2010) International Journal of Production Economics , vol.125 , pp. 137-145
    • Li, X.1    Tian, P.2    Leung, S.C.H.3
  • 26
    • 51349129806 scopus 로고    scopus 로고
    • New dynamic programming algorithms for the resource constrained elementary shortest path problem
    • G. Righini, and M. Salani New dynamic programming algorithms for the resource constrained elementary shortest path problem Networks 51 2008 155 170
    • (2008) Networks , vol.51 , pp. 155-170
    • Righini, G.1    Salani, M.2
  • 28
    • 0032119456 scopus 로고    scopus 로고
    • Drive: Dynamic routing of independent vehicles
    • M. Savelsbergh, and M. Sol Drive: dynamic routing of independent vehicles Operations Research 46 1998 474 490
    • (1998) Operations Research , vol.46 , pp. 474-490
    • Savelsbergh, M.1    Sol, M.2
  • 29
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • M.M. Solomon Algorithms for the vehicle routing and scheduling problems with time window constraints Operations Research 35 1987 254 265
    • (1987) Operations Research , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 30
    • 84866156744 scopus 로고    scopus 로고
    • Vehicle routing problem with stochastic travel times including soft time windows and service costs
    • D. Taş, N. Dellaert, T. van Woensel, and T. de Kok Vehicle routing problem with stochastic travel times including soft time windows and service costs Computers & Operations Research 40 2013 214 224
    • (2013) Computers & Operations Research , vol.40 , pp. 214-224
    • Taş, D.1    Dellaert, N.2    Van Woensel, T.3    De Kok, T.4


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