메뉴 건너뛰기




Volumn 55, Issue , 2015, Pages 167-184

A branch-and-price approach for a multi-period vehicle routing problem

Author keywords

Branch and price; Multi period vehicle routing problem; Seasonality; Tactical planning

Indexed keywords

DYNAMIC PROGRAMMING; GRAPH THEORY; VEHICLE ROUTING; VEHICLES;

EID: 84918784054     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2014.06.004     Document Type: Article
Times cited : (58)

References (43)
  • 1
    • 70449927206 scopus 로고    scopus 로고
    • A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands
    • A. Ak, and A.L. Erera A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands Transp Sci 41 2007 222 237
    • (2007) Transp Sci , vol.41 , pp. 222-237
    • Ak, A.1    Erera, A.L.2
  • 2
    • 34548246394 scopus 로고    scopus 로고
    • Competitive analysis for dynamic multiperiod uncapacitated routing problems
    • E. Angelelli, M. Grazia Speranza, and M.W.P. Savelsbergh Competitive analysis for dynamic multiperiod uncapacitated routing problems Networks 49 4 2007 308 317
    • (2007) Networks , vol.49 , Issue.4 , pp. 308-317
    • Angelelli, E.1    Grazia Speranza, M.2    Savelsbergh, M.W.P.3
  • 4
    • 81455135706 scopus 로고    scopus 로고
    • New route relaxation and pricing strategies for the vehicle routing problem
    • R. Baldacci, A. Mingozzi, and R. Roberti New route relaxation and pricing strategies for the vehicle routing problem Oper Res 59 2011 1269 1283
    • (2011) Oper Res , vol.59 , pp. 1269-1283
    • Baldacci, R.1    Mingozzi, A.2    Roberti, R.3
  • 6
    • 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 Oper Res Lett 2006 58 68
    • (2006) Oper Res Lett , pp. 58-68
    • Boland, N.1    Dethridge, J.2    Dumitrescu, I.3
  • 7
    • 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 Transp Sci 39 1 2005 119 139
    • (2005) Transp Sci , vol.39 , Issue.1 , pp. 119-139
    • Bräysy, O.1    Gendreau, M.2
  • 8
    • 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 Oper Res Lett 35 2007 773 781
    • (2007) Oper Res Lett , vol.35 , pp. 773-781
    • Christiansen, C.H.1    Lysgaard, J.2
  • 9
    • 0041194626 scopus 로고    scopus 로고
    • A tabu search heuristic for periodic and multi-depot vehicle routing problems
    • J.-F. Cordeau, M. Gendreau, and G. Laporte A tabu search heuristic for periodic and multi-depot vehicle routing problems Networks 30 2 1997 105 119
    • (1997) Networks , vol.30 , Issue.2 , pp. 105-119
    • Cordeau, J.-F.1    Gendreau, M.2    Laporte, G.3
  • 11
    • 0001953950 scopus 로고
    • The truck dispatching problem
    • G.B. Dantzig, and J.H. Ramser The truck dispatching problem Manag Sci 6 1 1959
    • (1959) Manag Sci , vol.6 , Issue.1
    • Dantzig, G.B.1    Ramser, J.H.2
  • 12
    • 84916618474 scopus 로고    scopus 로고
    • A column generation approach for a multi-attribute vehicle routing problem
    • Dayarian I, Crainic TG, Gendreau M, Rei W. A column generation approach for a multi-attribute vehicle routing problem. Eur J Oper Res. 2014, 10.1016/j.ejor.2014.09.015
    • (2014) Eur J Oper Res.
    • Dayarian, I.1    Crainic, T.G.2    Gendreau, M.3    Rei, W.4
  • 13
    • 0001549012 scopus 로고
    • Shortest-route methods 1. Reaching, pruning, and buckets
    • E.V. Denardo, and B.L. Fox Shortest-route methods 1. reaching, pruning, and buckets Oper Res 27 1979 161 186
    • (1979) Oper Res , vol.27 , pp. 161-186
    • Denardo, E.V.1    Fox, B.L.2
  • 14
    • 70449635850 scopus 로고    scopus 로고
    • Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows
    • G. Desaulniers, F. Lessard, and A. Hadjar Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows Transp Sci 42 August (3) 2008 387 404
    • (2008) Transp Sci , vol.42 , Issue.AUGUST 3 , pp. 387-404
    • Desaulniers, G.1    Lessard, F.2    Hadjar, A.3
  • 15
    • 0022661837 scopus 로고
    • Stochastic vehicle routing with modified savings algorithm
    • Dror M, Trudeau P. Stochastic vehicle routing with modified savings algorithm. Eur J Oper Res 1986;23.
    • (1986) Eur J Oper Res , vol.23
    • Dror, M.1    Trudeau, P.2
  • 16
    • 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 3 2004 216 229
    • (2004) Networks , vol.44 , Issue.3 , pp. 216-229
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3    Gueguen, C.4
  • 18
    • 84901309035 scopus 로고    scopus 로고
    • A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands
    • ISSN 0305-0548
    • C. Gauvin, G. Desaulniers, and M. Gendreau A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands Comput Oper Res 50 2014 141 153 ISSN 0305-0548
    • (2014) Comput Oper Res , vol.50 , pp. 141-153
    • Gauvin, C.1    Desaulniers, G.2    Gendreau, M.3
  • 19
    • 0030134790 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with stochastic demands and customers
    • M. Gendreau, G. Laporte, and R. Séguin A tabu search heuristic for the vehicle routing problem with stochastic demands and customers Oper Res 44 3 1996 469 477
    • (1996) Oper Res , vol.44 , Issue.3 , pp. 469-477
    • Gendreau, M.1    Laporte, G.2    Séguin, R.3
  • 20
    • 0004215426 scopus 로고    scopus 로고
    • Kluwer Academic Publishers Norwell, MA, USA ISBN 079239965X
    • F. Glover, and M. Laguna Tabu search 1997 Kluwer Academic Publishers Norwell, MA, USA ISBN 079239965X
    • (1997) Tabu Search
    • Glover, F.1    Laguna, M.2
  • 21
    • 70349850344 scopus 로고    scopus 로고
    • The consistent vehicle routing problem
    • C. Groër, B. Golden, and E. Wasil The consistent vehicle routing problem Manuf Serv Oper Manag 11 4 2009 630 643
    • (2009) Manuf Serv Oper Manag , vol.11 , Issue.4 , pp. 630-643
    • Groër, C.1    Golden, B.2    Wasil, E.3
  • 22
    • 56349088499 scopus 로고    scopus 로고
    • A variable neighborhood search heuristic for periodic routing problems
    • V.C. Hemmelmayr, K.F. Doerner, and R.F. Hartl A variable neighborhood search heuristic for periodic routing problems Eur J Oper Res 195 3 2009 791 802
    • (2009) Eur J Oper Res , vol.195 , Issue.3 , pp. 791-802
    • Hemmelmayr, V.C.1    Doerner, K.F.2    Hartl, R.F.3
  • 23
    • 84889973397 scopus 로고    scopus 로고
    • Shortest path problems with resource constraints
    • Springer [chapter 2]
    • Irnich S, Desaulniers G. Shortest path problems with resource constraints. GERAD 25th anniversary series. Springer; 2005. p. 33-65 [chapter 2].
    • (2005) GERAD 25th Anniversary Series , pp. 33-65
    • Irnich, S.1    Desaulniers, G.2
  • 25
    • 0024107816 scopus 로고
    • A priori solution of a traveling salesman problem in which a random subset of the customers are visited
    • P. Jaillet A priori solution of a traveling salesman problem in which a random subset of the customers are visited Oper Res 36 1988 929 936
    • (1988) Oper Res , vol.36 , pp. 929-936
    • Jaillet, P.1
  • 26
  • 28
    • 0000415520 scopus 로고
    • The integer l-shaped method for stochastic integer programs with complete recourse
    • G. Laporte, and F.V. Louveaux The integer l-shaped method for stochastic integer programs with complete recourse Oper Res Lett 13 1993 133 142
    • (1993) Oper Res Lett , vol.13 , pp. 133-142
    • Laporte, G.1    Louveaux, F.V.2
  • 29
    • 0019572333 scopus 로고
    • Complexity of vehicle routing and scheduling problems
    • J.K. Lenstra, and A.H.G. Rinnooy Kan Complexity of vehicle routing and scheduling problems Networks 11 1981 221 227
    • (1981) Networks , vol.11 , pp. 221-227
    • Lenstra, J.K.1    Rinnooy Kan, A.H.G.2
  • 30
    • 0001332760 scopus 로고    scopus 로고
    • A computational study of branch and bound search strategies for mixed integer programming
    • Linderoth JT, Savelsbergh MWP. A computational study of branch and bound search strategies for mixed integer programming. INFORMS J Comput 1999.
    • (1999) INFORMS J Comput
    • Linderoth, J.T.1    Savelsbergh, M.W.P.2
  • 31
    • 84903391961 scopus 로고    scopus 로고
    • Efficient elementary and restricted non-elementary route pricing
    • ISSN 0377-2217
    • R. Martinelli, D. Pecin, and M. Poggi Efficient elementary and restricted non-elementary route pricing Eur J Oper Res 239 1 2014 102 111 ISSN 0377-2217
    • (2014) Eur J Oper Res , vol.239 , Issue.1 , pp. 102-111
    • Martinelli, R.1    Pecin, D.2    Poggi, M.3
  • 32
    • 54449086090 scopus 로고    scopus 로고
    • Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
    • G. Righini, and M. Salani Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming Comput Oper Res 36 4 2009 1191 1203
    • (2009) Comput Oper Res , vol.36 , Issue.4 , pp. 1191-1203
    • Righini, G.1    Salani, M.2
  • 33
    • 61449101310 scopus 로고    scopus 로고
    • Reoptimization approaches for the vehicle-routing problem with stochastic demands
    • N. Secomandi, and F. Margot Reoptimization approaches for the vehicle-routing problem with stochastic demands Oper Res 57 2009 214 230
    • (2009) Oper Res , vol.57 , pp. 214-230
    • Secomandi, N.1    Margot, F.2
  • 34
    • 30244454614 scopus 로고
    • [Ph.D. thesis], Université de Montréal, Canada, Centre de Recherche sur le Transport
    • Séguin R. Problèmes stochastiques de tournées de véhicules [Ph.D. thesis], Université de Montréal, Canada, Centre de Recherche sur le Transport; 1994.
    • (1994) Problèmes Stochastiques de Tournées de Véhicules
    • Séguin, R.1
  • 35
    • 0014534894 scopus 로고
    • Lshaped linear programs with applications to optimal control and stochastic programming
    • R.M. Van Slyke, and R. Wets Lshaped linear programs with applications to optimal control and stochastic programming Siam J Appl Math 17 1969
    • (1969) Siam J Appl Math , vol.17
    • Van Slyke, R.M.1    Wets, R.2
  • 36
    • 77952498599 scopus 로고    scopus 로고
    • A model and algorithm for the courier delivery problem with uncertainty
    • ISSN 1526-5447
    • I. Sungur, Y. Ren, F. Ordóòez, M. Dessouky, and H. Zhong A model and algorithm for the courier delivery problem with uncertainty Transp Sci 44 2 2010 193 205 ISSN 1526-5447
    • (2010) Transp Sci , vol.44 , Issue.2 , pp. 193-205
    • Sungur, I.1    Ren, Y.2    Ordóòez, F.3    Dessouky, M.4    Zhong, H.5
  • 37
    • 82255192239 scopus 로고    scopus 로고
    • A template-based tabu search algorithm for the consistent vehicle routing problem
    • C.D. Tarantilis, F. Stavropoulou, and P.P. Repoussis A template-based tabu search algorithm for the consistent vehicle routing problem Expert Syst Appl 39 4 2012 4233 4239
    • (2012) Expert Syst Appl , vol.39 , Issue.4 , pp. 4233-4239
    • Tarantilis, C.D.1    Stavropoulou, F.2    Repoussis, P.P.3
  • 38
    • 0007615505 scopus 로고
    • The multiple terminal delivery problem with probabilistic demands
    • F.A. Tillman The multiple terminal delivery problem with probabilistic demands Transp Sci 3 1969 192 204
    • (1969) Transp Sci , vol.3 , pp. 192-204
    • Tillman, F.A.1
  • 39
    • 0041791136 scopus 로고    scopus 로고
    • Society for Industrial and Applied Mathematics
    • P. Toth, and D. Vigo The vehicle routing problem vol. 9 2002 Society for Industrial and Applied Mathematics
    • (2002) The Vehicle Routing Problem , vol.9 VOL.
    • Toth, P.1    Vigo, D.2
  • 41
    • 84864700477 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for multidepot and periodic vehicle routing problems
    • T. Vidal, T.G. Crainic, M. Gendreau, N. Lahrichi, and W. Rei A hybrid genetic algorithm for multidepot and periodic vehicle routing problems Oper Res 60 3 2012 611 624
    • (2012) Oper Res , vol.60 , Issue.3 , pp. 611-624
    • Vidal, T.1    Crainic, T.G.2    Gendreau, M.3    Lahrichi, N.4    Rei, W.5
  • 42
    • 75449087618 scopus 로고    scopus 로고
    • The dynamic multi-period vehicle routing problem
    • M. Wen, J.-F. Cordeau, G. Laporte, and J. Larsen The dynamic multi-period vehicle routing problem Comput Oper Res 37 9 2010 1615 1623
    • (2010) Comput Oper Res , vol.37 , Issue.9 , pp. 1615-1623
    • Wen, M.1    Cordeau, J.-F.2    Laporte, G.3    Larsen, J.4
  • 43
    • 0033905257 scopus 로고    scopus 로고
    • Stochastic vehicle routing problem with restocking
    • W. Yang, K. Mathur, and R.H. Ballou Stochastic vehicle routing problem with restocking Transp Sci 34 2000 99 112
    • (2000) Transp Sci , vol.34 , pp. 99-112
    • Yang, W.1    Mathur, K.2    Ballou, R.H.3


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