메뉴 건너뛰기




Volumn 17, Issue 1, 2017, Pages 41-68

A Multi-Trip Split-Delivery Vehicle Routing Problem with Time Windows for Inventory Replenishment Under Stochastic Travel Times

Author keywords

Heuristic; Multi trip split delivery; Stochastic travel time; Time space network; Vehicle routing problem with time windows

Indexed keywords

COMPLEX NETWORKS; COMPUTATIONAL COMPLEXITY; NETWORK ROUTING; ROUTING ALGORITHMS; STOCHASTIC SYSTEMS; SUPPLY CHAINS; TRAVEL TIME; VEHICLE ROUTING; VEHICLES;

EID: 84952005390     PISSN: 1566113X     EISSN: 15729427     Source Type: Journal    
DOI: 10.1007/s11067-015-9317-3     Document Type: Article
Times cited : (21)

References (45)
  • 1
    • 44849106364 scopus 로고    scopus 로고
    • A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
    • Alonso F, Alvarez MJ, Beasley JE (2008) A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions. J Oper Res Soc 59(7):963–976
    • (2008) J Oper Res Soc , vol.59 , Issue.7 , pp. 963-976
    • Alonso, F.1    Alvarez, M.J.2    Beasley, J.E.3
  • 2
    • 33748176011 scopus 로고    scopus 로고
    • Travel time reliability in vehicle routing and scheduling with time windows
    • Ando N, Taniguchi E (2006) Travel time reliability in vehicle routing and scheduling with time windows. Netw Spat Econ 6:293–311
    • (2006) Netw Spat Econ , vol.6 , pp. 293-311
    • Ando, N.1    Taniguchi, E.2
  • 3
    • 33751113046 scopus 로고    scopus 로고
    • An exact algorithm for a single-vehicle routing problem with time windows and multiple routes
    • Azi N, Gendreau M, Potvin JY (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178(3):755–766
    • (2007) Eur J Oper Res , vol.178 , Issue.3 , pp. 755-766
    • Azi, N.1    Gendreau, M.2    Potvin, J.Y.3
  • 4
    • 70350564194 scopus 로고    scopus 로고
    • An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles
    • Azi N, Gendreau M, Potvin JY (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur J Oper Res 202(3):756–763
    • (2010) Eur J Oper Res , vol.202 , Issue.3 , pp. 756-763
    • Azi, N.1    Gendreau, M.2    Potvin, J.Y.3
  • 5
    • 0031186464 scopus 로고    scopus 로고
    • A tabu search algorithm for the multi-trip vehicle routing and scheduling problem
    • Brandão JCS, Mercer A (1997) A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur J Oper Res 100(1):180–191
    • (1997) Eur J Oper Res , vol.100 , Issue.1 , pp. 180-191
    • Brandão, J.C.S.1    Mercer, A.2
  • 6
    • 0032141410 scopus 로고    scopus 로고
    • The multi-trip vehicle routing problem
    • Brandão JCS, Mercer A (1998) The multi-trip vehicle routing problem. J Oper Res Soc 49(8):799–805
    • (1998) J Oper Res Soc , vol.49 , Issue.8 , pp. 799-805
    • Brandão, J.C.S.1    Mercer, A.2
  • 7
    • 77249153242 scopus 로고    scopus 로고
    • Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
    • Desaulniers G (2010) Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows. Oper Res 58(1):179–192
    • (2010) Oper Res , vol.58 , Issue.1 , pp. 179-192
    • Desaulniers, G.1
  • 8
    • 84865710106 scopus 로고    scopus 로고
    • Modelization of time-dependent urban freight problems by using a multiple number of distribution centers
    • Escuín D, Millán C, Larrodé E (2012) Modelization of time-dependent urban freight problems by using a multiple number of distribution centers. Netw Spat Econ 12(3):321–336
    • (2012) Netw Spat Econ , vol.12 , Issue.3 , pp. 321-336
    • Escuín, D.1    Millán, C.2    Larrodé, E.3
  • 10
    • 0029342706 scopus 로고
    • The split delivery vehicle scheduling problem with time windows and grid network distances
    • Frizzell PW, Giffin JW (1995) The split delivery vehicle scheduling problem with time windows and grid network distances. Comput Oper Res 22(6):655–667
    • (1995) Comput Oper Res , vol.22 , Issue.6 , pp. 655-667
    • Frizzell, P.W.1    Giffin, J.W.2
  • 13
    • 84907719406 scopus 로고    scopus 로고
    • A robust scenario approach for the vehicle routing problem with uncertain travel times
    • Han J, Lee C, Park S (2014) A robust scenario approach for the vehicle routing problem with uncertain travel times. Transp Sci 48(3):373–390
    • (2014) Transp Sci , vol.48 , Issue.3 , pp. 373-390
    • Han, J.1    Lee, C.2    Park, S.3
  • 14
    • 2642574102 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with time windows and split deliveries
    • Ho SC, Haugland D (2004) A tabu search heuristic for the vehicle routing problem with time windows and split deliveries. Comput Oper Res 31(12):1947–1964
    • (2004) Comput Oper Res , vol.31 , Issue.12 , pp. 1947-1964
    • Ho, S.C.1    Haugland, D.2
  • 16
    • 0037294747 scopus 로고    scopus 로고
    • Stochastic vehicle routing with random travel times
    • Kenyon A, Morton DP (2003) Stochastic vehicle routing with random travel times. Transp Sci 37:69–82
    • (2003) Transp Sci , vol.37 , pp. 69-82
    • Kenyon, A.1    Morton, D.P.2
  • 17
    • 73349128424 scopus 로고    scopus 로고
    • Fifty years of vehicle routing
    • Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43:408–416
    • (2009) Transp Sci , vol.43 , pp. 408-416
    • Laporte, G.1
  • 18
    • 77949568659 scopus 로고    scopus 로고
    • Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm
    • Li X, Tian P, Leung SCH (2010a) Vehicle routing problems with time windows and stochastic travel and service times: models and algorithm. Int J Prod Econ 125:137–145
    • (2010) Int J Prod Econ , vol.125 , pp. 137-145
    • Li, X.1    Tian, P.2    Leung, S.C.H.3
  • 19
    • 77956408909 scopus 로고    scopus 로고
    • An activity-based approach for scheduling multimodal transit services
    • Li Z-C, Lam WHK, Wong SC, Sumalee A (2010b) An activity-based approach for scheduling multimodal transit services. Transportation 37:751–774
    • (2010) Transportation , vol.37 , pp. 751-774
    • Li, Z.-C.1    Lam, W.H.K.2    Wong, S.C.3    Sumalee, A.4
  • 21
    • 84871187974 scopus 로고    scopus 로고
    • Integrated scheduling of production and delivery with time windows
    • Low C, Li R-K, Chang C-M (2013) Integrated scheduling of production and delivery with time windows. Int J Prod Res 51(3):897–909
    • (2013) Int J Prod Res , vol.51 , Issue.3 , pp. 897-909
    • Low, C.1    Li, R.-K.2    Chang, C.-M.3
  • 22
    • 84877989560 scopus 로고    scopus 로고
    • An exact algorithm for the multitrip vehicle routing problem
    • Mingozzi A, Roberti R, Toth P (2013) An exact algorithm for the multitrip vehicle routing problem. INFORMS J Comput 25(2):193–207
    • (2013) INFORMS J Comput , vol.25 , Issue.2 , pp. 193-207
    • Mingozzi, A.1    Roberti, R.2    Toth, P.3
  • 23
    • 84949319086 scopus 로고    scopus 로고
    • Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows. Networks and Spatial Economics
    • Mirmohammadsadeghi S, Ahmed S (2015) Memetic heuristic approach for solving truck and trailer routing problems with stochastic demands and time windows. Networks and Spatial Economics, online first
    • (2015) online first
    • Mirmohammadsadeghi, S.1    Ahmed, S.2
  • 24
    • 0000937493 scopus 로고
    • A new scenario decomposition method for large-scale stochastic optimization
    • Mulvery JM, Ruszczynski A (1995) A new scenario decomposition method for large-scale stochastic optimization. Oper Res 43(3):477–490
    • (1995) Oper Res , vol.43 , Issue.3 , pp. 477-490
    • Mulvery, J.M.1    Ruszczynski, A.2
  • 25
    • 85108976174 scopus 로고
    • Robust optimization of large-scale systems
    • Mulvery JM, Vanderbei RJ, Zenios SA (1995) Robust optimization of large-scale systems. Oper Res 43:254–281
    • (1995) Oper Res , vol.43 , pp. 254-281
    • Mulvery, J.M.1    Vanderbei, R.J.2    Zenios, S.A.3
  • 26
    • 84871172230 scopus 로고    scopus 로고
    • A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization
    • Norouzi N, Tavakkoli-Moghaddam R, Ghazanfari M, Alinaghian M, Salamatbakhsh A (2012) A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization. Netw Spat Econ 12(4):321–336
    • (2012) Netw Spat Econ , vol.12 , Issue.4 , pp. 321-336
    • Norouzi, N.1    Tavakkoli-Moghaddam, R.2    Ghazanfari, M.3    Alinaghian, M.4    Salamatbakhsh, A.5
  • 27
    • 33746267205 scopus 로고    scopus 로고
    • Adaptive memory programming for the vehicle routing problem with multiple trips
    • Olivera A, Viera O (2007) Adaptive memory programming for the vehicle routing problem with multiple trips. Comput Oper Res 34(1):28–47
    • (2007) Comput Oper Res , vol.34 , Issue.1 , pp. 28-47
    • Olivera, A.1    Viera, O.2
  • 28
    • 0242366703 scopus 로고    scopus 로고
    • A multi-phase constructive heuristic for the vehicle routing problem with multiple trips
    • Petch RJ, Salhi S (2003) A multi-phase constructive heuristic for the vehicle routing problem with multiple trips. Discret Appl Math 133(1):69–92
    • (2003) Discret Appl Math , vol.133 , Issue.1 , pp. 69-92
    • Petch, R.J.1    Salhi, S.2
  • 29
    • 79957704545 scopus 로고    scopus 로고
    • Branch and price for the vehicle routing problem with discrete split deliveries and time windows
    • Salani M, Vacca I (2011) Branch and price for the vehicle routing problem with discrete split deliveries and time windows. Eur J Oper Res 213:470–477
    • (2011) Eur J Oper Res , vol.213 , pp. 470-477
    • Salani, M.1    Vacca, I.2
  • 30
    • 36549063541 scopus 로고    scopus 로고
    • A GA based heuristic for the vehicle routing problem with multiple trips
    • Salhi S, Petch RJ (2007) A GA based heuristic for the vehicle routing problem with multiple trips. J Math Model Algoritm 6(4):591–613
    • (2007) J Math Model Algoritm , vol.6 , Issue.4 , pp. 591-613
    • Salhi, S.1    Petch, R.J.2
  • 31
    • 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:254–265
    • (1987) Oper Res , vol.35 , pp. 254-265
    • Solomon, M.M.1
  • 33
    • 0030216724 scopus 로고    scopus 로고
    • Vehicle routeing with multiple use of vehicles
    • Taillard ED, Laporte G, Gendreau M (1996) Vehicle routeing with multiple use of vehicles. J Oper Res Soc 47(8):1065–1070
    • (1996) J Oper Res Soc , vol.47 , Issue.8 , pp. 1065-1070
    • Taillard, E.D.1    Laporte, G.2    Gendreau, M.3
  • 34
    • 0031139685 scopus 로고    scopus 로고
    • A tabu search heuristic for the vehicle routing problem with soft time windows
    • Taillard ED, Badeau P, Gendreau M, Guertin F, Potvin JY (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170–186
    • (1997) Transp Sci , vol.31 , Issue.2 , pp. 170-186
    • Taillard, E.D.1    Badeau, P.2    Gendreau, M.3    Guertin, F.4    Potvin, J.Y.5
  • 35
    • 84916898832 scopus 로고    scopus 로고
    • An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport
    • Tang J, Yu Y, Li J (2015) An exact algorithm for the multi-trip vehicle routing and scheduling problem of pickup and delivery of customers to the airport. Transp Res E:Logist Trans Rev 73:114–132
    • (2015) Transp Res E:Logist Trans Rev , vol.73 , pp. 114-132
    • Tang, J.1    Yu, Y.2    Li, J.3
  • 36
    • 85015648698 scopus 로고    scopus 로고
    • Routing strategies under demand uncertainty, networks and spatial economics
    • Tarhini H, Bish DR (2015) Routing strategies under demand uncertainty, networks and spatial economics. online first
    • (2015) online first
    • Tarhini, H.1    Bish, D.R.2
  • 37
    • 84866156744 scopus 로고    scopus 로고
    • Vehicle routing problem with stochastic travel times including soft time windows and service costs
    • Tas D, Dellaert N, van Woensel T, de Kok T (2013) Vehicle routing problem with stochastic travel times including soft time windows and service costs. Comput Oper Res 40(1):214–224
    • (2013) Comput Oper Res , vol.40 , Issue.1 , pp. 214-224
    • Tas, D.1    Dellaert, N.2    van Woensel, T.3    de Kok, T.4
  • 38
    • 65749096620 scopus 로고    scopus 로고
    • An integrated framework for inter-city bus scheduling under stochastic bus travel time
    • Yan S, Tang CH (2008) An integrated framework for inter-city bus scheduling under stochastic bus travel time. Transp Sci 42:318–335
    • (2008) Transp Sci , vol.42 , pp. 318-335
    • Yan, S.1    Tang, C.H.2
  • 39
    • 33645923128 scopus 로고    scopus 로고
    • Inter-city bus routing and timetable setting under stochastic demands
    • Yan S, Chi CJ, Tang CH (2006) Inter-city bus routing and timetable setting under stochastic demands. Transp Res E:Logist Trans Rev 40:572–586
    • (2006) Transp Res E:Logist Trans Rev , vol.40 , pp. 572-586
    • Yan, S.1    Chi, C.J.2    Tang, C.H.3
  • 40
    • 41149144242 scopus 로고    scopus 로고
    • An airline scheduling model and solution algorithms under stochastic demands
    • Yan S, Tang CH, Fu TC (2008) An airline scheduling model and solution algorithms under stochastic demands. Eur J Oper Res 190:22–39
    • (2008) Eur J Oper Res , vol.190 , pp. 22-39
    • Yan, S.1    Tang, C.H.2    Fu, T.C.3
  • 41
    • 84859264856 scopus 로고    scopus 로고
    • Solution methods for the taxi pooling problem
    • Yan S, Chen C-Y, Wu C-C (2012) Solution methods for the taxi pooling problem. Transportation 39(3):723–748
    • (2012) Transportation , vol.39 , Issue.3 , pp. 723-748
    • Yan, S.1    Chen, C.-Y.2    Wu, C.-C.3
  • 42
    • 84930946536 scopus 로고    scopus 로고
    • A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows
    • Yan S, Chu JC, Hsiao F-Y, Huang H-J (2015a) A planning model and solution algorithm for multi-trip split-delivery vehicle routing and scheduling problems with time windows. Comput Ind Eng 87:383–393
    • (2015) Comput Ind Eng , vol.87 , pp. 383-393
    • Yan, S.1    Chu, J.C.2    Hsiao, F.-Y.3    Huang, H.-J.4
  • 43
    • 85015619281 scopus 로고    scopus 로고
    • Inter-school bus scheduling under stochastic travel times, networks and spatial economics
    • Yan S, Hsiao F-Y, Chen Y-C (2015b) Inter-school bus scheduling under stochastic travel times, networks and spatial economics. online first
    • (2015) online first
    • Yan, S.1    Hsiao, F.-Y.2    Chen, Y.-C.3
  • 44
    • 84888433635 scopus 로고    scopus 로고
    • A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service
    • Zhang J, Lam WHK, Chen BY (2013) A stochastic vehicle routing problem with travel time uncertainty: trade-off between cost and customer service. Netw Spat Econ 13(4):471–496
    • (2013) Netw Spat Econ , vol.13 , Issue.4 , pp. 471-496
    • Zhang, J.1    Lam, W.H.K.2    Chen, B.Y.3
  • 45
    • 8144230385 scopus 로고    scopus 로고
    • A vehicle routing problem with backhauls and time windows: a guided local search solution
    • Zhong Y, Cole MH (2005) A vehicle routing problem with backhauls and time windows: a guided local search solution. Transp Res E 41(2):131–144
    • (2005) Transp Res E , vol.41 , Issue.2 , pp. 131-144
    • Zhong, Y.1    Cole, M.H.2


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