메뉴 건너뛰기




Volumn 47, Issue 3, 2013, Pages 380-396

Branch and price for the time-dependent vehicle routing problem with time windows

Author keywords

Branch and price; Column generation; Time dependent travel times; Vehicle routing problem

Indexed keywords

COSTS; GRAPH THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; LINEAR PROGRAMMING; ROADS AND STREETS; SALES; TRAFFIC CONGESTION; TRAVEL TIME; VEHICLE ROUTING; VEHICLES;

EID: 84882371431     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1120.0445     Document Type: Article
Times cited : (124)

References (48)
  • 1
    • 50849116791 scopus 로고    scopus 로고
    • Solving the multicriteria time-dependent routing and scheduling in a multimodal fixed scheduled network
    • Androutsopoulos KN, Zografos KG (2009) Solving the multicriteria time-dependent routing and scheduling in a multimodal fixed scheduled network. Eur. J. Oper. Res. 192(1):18-28.
    • (2009) Eur. J. Oper. Res. , vol.192 , Issue.1 , pp. 18-28
    • Androutsopoulos, K.N.1    Zografos, K.G.2
  • 2
    • 81455135706 scopus 로고    scopus 로고
    • New route relaxation and pricing strategies for the vehicle routing problem
    • Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269-1283.
    • (2011) Oper. Res. , vol.59 , Issue.5 , pp. 1269-1283
    • Baldacci, R.1    Mingozzi, A.2    Roberti, R.3
  • 3
    • 83955162912 scopus 로고    scopus 로고
    • Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
    • Baldacci R, Mingozzi A, Roberti R (2012) Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1):1-6.
    • (2012) Eur. J. Oper. Res. , vol.218 , Issue.1 , pp. 1-6
    • Baldacci, R.1    Mingozzi, A.2    Roberti, R.3
  • 4
    • 78549273306 scopus 로고    scopus 로고
    • An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows
    • Balseiro SR, Loiseau I, Ramonet J (2011) An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Comput. Oper. Res. 38(6):954-966.
    • (2011) Comput. Oper. Res. , vol.38 , Issue.6 , pp. 954-966
    • Balseiro, S.R.1    Loiseau, I.2    Ramonet, J.3
  • 5
    • 0030092384 scopus 로고    scopus 로고
    • A new generation of vehicle routing research: Robust algorithms, addressing uncertainty
    • Bertsimas DJ, Simchi-Levi D (1996) A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44(2):286-304.
    • (1996) Oper. Res. , vol.44 , Issue.2 , pp. 286-304
    • Bertsimas, D.J.1    Simchi-Levi, D.2
  • 6
    • 0003040355 scopus 로고
    • A stochastic and dynamic vehicle routing problem in the Euclidian plane
    • Bertsimas DJ, van Ryzin G (1991) A stochastic and dynamic vehicle routing problem in the Euclidian plane. Oper. Res. 39(4):601-615.
    • (1991) Oper. Res. , vol.39 , Issue.4 , pp. 601-615
    • Bertsimas, D.J.1    Van Ryzin, G.2
  • 7
    • 0002194173 scopus 로고
    • Stochastic and dynamic vehicle routing problems in the Euclidean plane with multiple capacitated vehicles
    • Bertsimas DJ, van Ryzin G (1993) Stochastic and dynamic vehicle routing problems in the Euclidean plane with multiple capacitated vehicles. Oper. Res. 41(1):60-76.
    • (1993) Oper. Res. , vol.41 , Issue.1 , pp. 60-76
    • Bertsimas, D.J.1    Van Ryzin, G.2
  • 8
    • 79955967127 scopus 로고    scopus 로고
    • A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows
    • Bettinelli A, Ceseli A, Righini G (2011) A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transportation Res. Part C 19(5):723-740.
    • (2011) Transportation Res. Part C , vol.19 , Issue.5 , pp. 723-740
    • Bettinelli, A.1    Ceseli, A.2    Righini, G.3
  • 9
    • 16244364524 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part I: Route construction and local search algorithms
    • Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Sci. 39(1):104-118.
    • (2005) Transportation Sci. , vol.39 , Issue.1 , pp. 104-118
    • Bräysy, O.1    Gendreau, M.2
  • 10
    • 16244404291 scopus 로고    scopus 로고
    • Vehicle routing problem with time windows, Part II: Metaheuristics
    • Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Sci. 39(1): 119-139.
    • (2005) Transportation Sci. , vol.39 , Issue.1 , pp. 119-139
    • Bräysy, O.1    Gendreau, M.2
  • 11
    • 32044469861 scopus 로고    scopus 로고
    • Vehicle routing problem with elementary shortest path based column generation
    • Chabrier A (2006) Vehicle routing problem with elementary shortest path based column generation. Comput. Oper. Res. 33(10): 2972-2990.
    • (2006) Comput. Oper. Res. , vol.33 , Issue.10 , pp. 2972-2990
    • Chabrier, A.1
  • 12
    • 84882446929 scopus 로고    scopus 로고
    • COIN CLP, Accessed October 30, 2012
    • COIN CLP (2011) COIN-OR linear programming solver. Accessed October 30, 2012, https://projects.coin-or.org/Clp.
    • (2011) COIN-OR Linear Programming Solver.
  • 13
    • 3342976993 scopus 로고    scopus 로고
    • A parallel cutting plane algorithm for the vehicle routing problem with time windows
    • Rice University, Houston
    • Cook W, Rich JL (1999) A parallel cutting plane algorithm for the vehicle routing problem with time windows. Technical Report TR99-04, Computational and Applied Mathematics, Rice University, Houston.
    • (1999) Technical Report TR99-04, Computational and Applied Mathematics
    • Cook, W.1    Rich, J.L.2
  • 15
    • 70449635850 scopus 로고    scopus 로고
    • Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows
    • Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transportation Sci. 42(3):387-404.
    • (2008) Transportation Sci. , vol.42 , Issue.3 , pp. 387-404
    • Desaulniers, G.1    Lessard, F.2    Hadjar, A.3
  • 17
    • 85042163696 scopus 로고
    • A new optimization algorithm for the vehicle routing problem with time windows
    • Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle routing problem with time windows. Oper. Res. 40(2):342-354.
    • (1992) Oper. Res. , vol.40 , Issue.2 , pp. 342-354
    • Desrochers, M.1    Desrosiers, J.2    Solomon, M.3
  • 19
    • 4644250559 scopus 로고    scopus 로고
    • An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
    • Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems. Networks 44(3):216-229.
    • (2004) Networks , vol.44 , Issue.3 , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4
  • 21
    • 79952370268 scopus 로고    scopus 로고
    • Solving large-scale vehicle routing problems with time windows: The state of the art
    • CIRRELT, Montreal
    • Gendreau M, Tarantilis CD (2010) Solving large-scale vehicle routing problems with time windows: The state of the art. Technical Report 2010-04, CIRRELT, Montreal.
    • (2010) Technical Report 2010-04
    • Gendreau, M.1    Tarantilis, C.D.2
  • 22
    • 13844276135 scopus 로고    scopus 로고
    • A dynamic vehicle routing problem with time-dependent travel times
    • Haghani A, Jung S (2005) A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res. 32(11): 2959-2986.
    • (2005) Comput. Oper. Res. , vol.32 , Issue.11 , pp. 2959-2986
    • Haghani, A.1    Jung, S.2
  • 23
    • 41149179705 scopus 로고    scopus 로고
    • An iterated local search algorithm for the time-dependent vehicle routing problem with time windows
    • Hashimoto H, Yagiura M, Ibaraki T (2008) An iterated local search algorithm for the time-dependent vehicle routing problem with time windows. Discrete Optim. 5(2):434-456.
    • (2008) Discrete Optim. , vol.5 , Issue.2 , pp. 434-456
    • Hashimoto, H.1    Yagiura, M.2    Ibaraki, T.3
  • 24
    • 0026852084 scopus 로고
    • Modeling intra-city time-dependent travel speeds for vehicle scheduling problems
    • Hill AV, Benton WC (1992) Modeling intra-city time-dependent travel speeds for vehicle scheduling problems. Eur. J. Oper. Res. 43(4):343-351.
    • (1992) Eur. J. Oper. Res. , vol.43 , Issue.4 , pp. 343-351
    • Hill, A.V.1    Benton, W.C.2
  • 25
    • 0037448282 scopus 로고    scopus 로고
    • Vehicle dispatching with time-dependent travel times
    • Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur. J. Oper. Res. 144(2):379-396.
    • (2003) Eur. J. Oper. Res. , vol.144 , Issue.2 , pp. 379-396
    • Ichoua, S.1    Gendreau, M.2    Potvin, J.Y.3
  • 26
    • 0003871857 scopus 로고    scopus 로고
    • A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
    • Ioachim I, Gélinas S, Soumis F, Desrosiers J (1998) A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31(3):193-204.
    • (1998) Networks , vol.31 , Issue.3 , pp. 193-204
    • Ioachim, I.1    Gélinas, S.2    Soumis, F.3    Desrosiers, J.4
  • 27
    • 36148975708 scopus 로고    scopus 로고
    • Resource extension functions: Properties, inversions, and generalization to segments
    • Irnich S (2008) Resource extension functions: Properties, inversions, and generalization to segments. OR Spectrum 30(1):113-148.
    • (2008) OR Spectrum , vol.30 , Issue.1 , pp. 113-148
    • Irnich, S.1
  • 28
    • 84889973397 scopus 로고    scopus 로고
    • Shortest path problems with resource constraints
    • Desaulniers G, Desrosiers J, Solomon MM, eds, Chap. 2. (Springer, New York)
    • Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation, Chap. 2. (Springer, New York), 33-65.
    • (2005) Column Generation , pp. 33-65
    • Irnich, S.1    Desaulniers, G.2
  • 29
    • 33748591592 scopus 로고    scopus 로고
    • The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3
    • Irnich S, Villeneuve D (2006) The shortest path problem with resource constraints and k-cycle elimination for k ≥ 3. INFORMS J. Comput. 18(3):391-406.
    • (2006) INFORMS J. Comput. , vol.18 , Issue.3 , pp. 391-406
    • Irnich, S.1    Villeneuve, D.2
  • 30
    • 70749138692 scopus 로고    scopus 로고
    • Time-dependent vehicle routing subject to time delay perturbations
    • Jabali O, van Woensel T, de Kok AG, Lecluyse C, Permans H (2009) Time-dependent vehicle routing subject to time delay perturbations. IIE Trans. 41(12):1049-1066.
    • (2009) IIE Trans. , vol.41 , Issue.12 , pp. 1049-1066
    • Jabali, O.1    Van Woensel, T.2    De Kok, A.G.3    Lecluyse, C.4    Permans, H.5
  • 31
    • 61449183550 scopus 로고    scopus 로고
    • Subset-row inequalities applied to the vehicle-routing problem with time windows
    • Jespen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2):497-511.
    • (2008) Oper. Res. , vol.56 , Issue.2 , pp. 497-511
    • Jespen, M.1    Petersen, B.2    Spoorendonk, S.3    Pisinger, D.4
  • 32
    • 36348987653 scopus 로고    scopus 로고
    • Formulations and exact algorithms for the vehicle routing problem with time windows
    • Kallehauge B (2008) Formulations and exact algorithms for the vehicle routing problem with time windows. Comput. Oper. Res. 35(7):2307-2330.
    • (2008) Comput. Oper. Res. , vol.35 , Issue.7 , pp. 2307-2330
    • Kallehauge, B.1
  • 34
    • 79151473859 scopus 로고    scopus 로고
    • Optimizing departure times in vehicle routes
    • Kok AL, Hans EW, Schutten JMJ (2011) Optimizing departure times in vehicle routes. Eur. J. Oper. Res. 210(3):579-587.
    • (2011) Eur. J. Oper. Res. , vol.210 , Issue.3 , pp. 579-587
    • Kok, A.L.1    Hans, E.W.2    Schutten, J.M.J.3
  • 35
    • 0026874435 scopus 로고
    • The vehicle routing problem: An overview of exact and approximate algorithms
    • Laporte G (1992) The vehicle routing problem: An overview of exact and approximate algorithms. Eur. J. Oper. Res. 59(3): 345-358.
    • (1992) Eur. J. Oper. Res. , vol.59 , Issue.3 , pp. 345-358
    • Laporte, G.1
  • 36
    • 36549015264 scopus 로고    scopus 로고
    • What you should know about the vehicle routing problem
    • Laporte G (2007) What you should know about the vehicle routing problem. Naval Res. Logist. 54(8):811-819.
    • (2007) Naval Res. Logist. , vol.54 , Issue.8 , pp. 811-819
    • Laporte, G.1
  • 37
    • 79952707496 scopus 로고    scopus 로고
    • A column generation algorithm for the vehicle routing problem with soft time windows
    • Liberatore F, Righini G, Salani M (2011) A column generation algorithm for the vehicle routing problem with soft time windows. 4OR: Quart. J. Oper. 9(1):49-82.
    • (2011) 4OR: Quart. J. Oper. , vol.9 , Issue.1 , pp. 49-82
    • Liberatore, F.1    Righini, G.2    Salani, M.3
  • 38
    • 30344453380 scopus 로고    scopus 로고
    • Selected topics in column generation
    • Lübbecke ME, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007-1023.
    • (2005) Oper. Res. , vol.53 , Issue.6 , pp. 1007-1023
    • Lübbecke, M.E.1    Desrosiers, J.2
  • 39
    • 76849084298 scopus 로고    scopus 로고
    • Vehicle routing and scheduling with time-varying data: A case study
    • Maden W, Eglese R, Black D (2010) Vehicle routing and scheduling with time-varying data: A case study. J. Oper. Res. Soc. 61(3):515-522.
    • (2010) J. Oper. Res. Soc. , vol.61 , Issue.3 , pp. 515-522
    • Maden, W.1    Eglese, R.2    Black, D.3
  • 40
    • 0026904591 scopus 로고
    • Time dependent vehicle routing problems: Formulations, properties, and heuristic algorithms
    • Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: Formulations, properties, and heuristic algorithms. Transportation Sci. 26(3):185-200.
    • (1992) Transportation Sci. , vol.26 , Issue.3 , pp. 185-200
    • Malandraki, C.1    Daskin, M.S.2
  • 41
    • 0030570064 scopus 로고    scopus 로고
    • A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
    • Malandraki C, Dial RB (1996) A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur. J. Oper. Res. 90(1):45-55.
    • (1996) Eur. J. Oper. Res. , vol.90 , Issue.1 , pp. 45-55
    • Malandraki, C.1    Dial, R.B.2
  • 42
    • 35348925315 scopus 로고    scopus 로고
    • A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food
    • Osvald A, Stirn LZ (2008) A vehicle routing algorithm for the distribution of fresh vegetables and similar perishable food. J. Food Engrg. 85(2):285-295.
    • (2008) J. Food Engrg. , vol.85 , Issue.2 , pp. 285-295
    • Osvald, A.1    Stirn, L.Z.2
  • 43
    • 33746329306 scopus 로고    scopus 로고
    • Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
    • Righini G, Salani M (2006) Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints. Discrete Optim. 3(3):255-273.
    • (2006) Discrete Optim. , vol.3 , Issue.3 , pp. 255-273
    • Righini, G.1    Salani, M.2
  • 44
    • 51349129806 scopus 로고    scopus 로고
    • New dynamic programming algorithms for the resource constrained elementary shortest path problem
    • Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):155-170.
    • (2008) Networks , vol.51 , Issue.3 , pp. 155-170
    • Righini, G.1    Salani, M.2
  • 45
    • 0023313252 scopus 로고
    • Algorithms for the vehicle routing and scheduling problems with time window constraints
    • Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2):254-265.
    • (1987) Oper. Res. , vol.35 , Issue.2 , pp. 254-265
    • Solomon, M.M.1
  • 46
    • 63849094897 scopus 로고    scopus 로고
    • Efficient implementation of improvement procedures for vehicle routing with time-dependent travel times
    • Tang H (2008) Efficient implementation of improvement procedures for vehicle routing with time-dependent travel times. Transportation Res. Record 2089:66-75.
    • (2008) Transportation Res. Record , vol.2089 , pp. 66-75
    • Tang, H.1
  • 48


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