메뉴 건너뛰기




Volumn 238, Issue 3, 2014, Pages 699-710

A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem

Author keywords

Facilities planning and design; Fleet management; Mobile facility; Routing

Indexed keywords

ALGORITHMS; FLEET OPERATIONS; SCHEDULING; STOCHASTIC PROGRAMMING;

EID: 84902110391     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.04.024     Document Type: Article
Times cited : (46)

References (57)
  • 1
    • 55749110891 scopus 로고    scopus 로고
    • The multi-period incremental service facility location problem
    • M. Albareda-Sambola, and E. Fernández et al. The multi-period incremental service facility location problem Computers & Operations Research 36 5 2009 1356 1375
    • (2009) Computers & Operations Research , vol.36 , Issue.5 , pp. 1356-1375
    • Albareda-Sambola, M.1    Fernández, E.2
  • 2
    • 66349122882 scopus 로고    scopus 로고
    • A location model for urban hierarchy planning with population dynamics
    • A. Antunes, and O. Berman et al. A location model for urban hierarchy planning with population dynamics Environment and Planning A 41 4 2009 996 1016
    • (2009) Environment and Planning A , vol.41 , Issue.4 , pp. 996-1016
    • Antunes, A.1    Berman, O.2
  • 3
    • 0001748308 scopus 로고
    • Dynamic warehouse location analysis
    • R.H. Ballou Dynamic warehouse location analysis Journal of Marketing Research 5 3 1968 271 276
    • (1968) Journal of Marketing Research , vol.5 , Issue.3 , pp. 271-276
    • Ballou, R.H.1
  • 4
    • 9644308639 scopus 로고
    • Partitioning procedures for solving mixed-variables programming problems
    • J.F. Benders Partitioning procedures for solving mixed-variables programming problems Numerische Mathematik 4 1962 238 252
    • (1962) Numerische Mathematik , vol.4 , pp. 238-252
    • Benders, J.F.1
  • 6
    • 0030092384 scopus 로고    scopus 로고
    • A new generation of vehicle routing research: Robust algorithms, addressing uncertainty
    • D.J. Bertsimas, and D. Simchi-Levi A new generation of vehicle routing research: Robust algorithms, addressing uncertainty Operations Research 44 2 1996 286 304 (Pubitemid 126669481)
    • (1996) Operations Research , vol.44 , Issue.2 , pp. 286-304
    • Bertsimas, D.J.1    Simchi-Levi, D.2
  • 9
    • 79958854231 scopus 로고    scopus 로고
    • The orienteering problem with stochastic travel and service times
    • A.M. Campbell, and M. Gendreau et al. The orienteering problem with stochastic travel and service times Annals of Operations Research 186 1 2011 61 81
    • (2011) Annals of Operations Research , vol.186 , Issue.1 , pp. 61-81
    • Campbell, A.M.1    Gendreau, M.2
  • 10
    • 0031190317 scopus 로고    scopus 로고
    • Multi-period international facilities location: An algorithm and application
    • C. Canel, and B.M. Khumawala Multi-period international facilities location: An algorithm and application International Journal of Production Research 35 7 1997 1891 1910 (Pubitemid 127549702)
    • (1997) International Journal of Production Research , vol.35 , Issue.7 , pp. 1891-1910
    • Canel, C.1    Khumawala, B.M.2
  • 12
    • 79951885279 scopus 로고    scopus 로고
    • The dynamic uncapacitated hub location problem
    • I. Contreras, and J. Cordeau et al. The dynamic uncapacitated hub location problem Transportation Science 45 1 2011 18 32
    • (2011) Transportation Science , vol.45 , Issue.1 , pp. 18-32
    • Contreras, I.1    Cordeau, J.2
  • 13
    • 71949092423 scopus 로고    scopus 로고
    • Vehicle routing
    • C. Barnhart, G. Laporte, Elsevier Amsterdam
    • J. Cordeau, and G. Laporte et al. Vehicle routing C. Barnhart, G. Laporte, Transportation 2007 Elsevier Amsterdam 367 428
    • (2007) Transportation , pp. 367-428
    • Cordeau, J.1    Laporte, G.2
  • 14
    • 0011916812 scopus 로고
    • Efficient algorithms for solving the shortest covering path problem
    • J. Current, and H. Pirkul et al. Efficient algorithms for solving the shortest covering path problem Transportation Science 28 4 1994 317 327
    • (1994) Transportation Science , vol.28 , Issue.4 , pp. 317-327
    • Current, J.1    Pirkul, H.2
  • 15
    • 0021575026 scopus 로고
    • The shortest covering path problem: An application of locational constraints to network design
    • J. Current, and C. ReVelle et al. The shortest covering path problem: An application of locational constraints to network design Journal of Regional Science 24 2 1984 161
    • (1984) Journal of Regional Science , vol.24 , Issue.2 , pp. 161
    • Current, J.1    Revelle, C.2
  • 16
    • 0022107713 scopus 로고
    • Maximum Covering/shortest Path Problem: A Multiobjective Network Design And Routing Formulation
    • DOI 10.1016/0377-2217(85)90030-X
    • J.R. Current, and C.S. Re Velle et al. The maximum covering/shortest path problem: A multiobjective network design and routing formulation European Journal of Operational Research 21 2 1985 189 199 (Pubitemid 15541765)
    • (1985) European Journal of Operational Research , vol.21 , Issue.2 , pp. 189-199
    • Current, J.R.1    Re Velle, C.S.2    Cohon, J.L.3
  • 18
    • 0028377571 scopus 로고
    • The median tour and maximal covering tour problems: Formulations and heuristics
    • J.R. Current, and D.A. Schilling The median tour and maximal covering tour problems: Formulations and heuristics European Journal of Operational Research 73 1 1994 114 126
    • (1994) European Journal of Operational Research , vol.73 , Issue.1 , pp. 114-126
    • Current, J.R.1    Schilling, D.A.2
  • 19
    • 33750073525 scopus 로고    scopus 로고
    • Capacitated dynamic location problems with opening, closure and reopening of facilities
    • DOI 10.1093/imaman/dpl003
    • J. Dias, and M.E. Captivo et al. Capacitated dynamic location problems with opening, closure and reopening of facilities IMA Journal of Management Mathematics 17 4 2006 317 348 (Pubitemid 44574109)
    • (2006) IMA Journal Management Mathematics , vol.17 , Issue.4 , pp. 317-348
    • Dias, J.1    Eugenia Captivo, M.2    Climaco, J.3
  • 20
  • 21
    • 84874000086 scopus 로고    scopus 로고
    • The orienteering problem with variable profits
    • G. Erdogan, and G. Laporte The orienteering problem with variable profits Networks 61 2 2013 104 116
    • (2013) Networks , vol.61 , Issue.2 , pp. 104-116
    • Erdogan, G.1    Laporte, G.2
  • 22
    • 84886231131 scopus 로고    scopus 로고
    • A two-stage approach to the orienteering problem with stochastic weights
    • L. Evers, and K. Glorie et al. A two-stage approach to the orienteering problem with stochastic weights Computers & Operations Research 43 0 2014 248 260
    • (2014) Computers & Operations Research , vol.43 , Issue.0 , pp. 248-260
    • Evers, L.1    Glorie, K.2
  • 23
    • 19944424824 scopus 로고    scopus 로고
    • Traveling salesman problems with profits
    • DOI 10.1287/trsc.1030.0079
    • D. Feillet, and P. Dejax et al. Traveling salesman problems with profits Transportation Science 39 2 2005 188 205 (Pubitemid 40748589)
    • (2005) Transportation Science , vol.39 , Issue.2 , pp. 188-205
    • Feillet, D.1    Dejax, P.2    Gendreau, M.3
  • 24
    • 0000461093 scopus 로고
    • An exact algorithm for the vehicle routing problem with stochastic demands and customers
    • M. Gendreau, and G. Laporte et al. An exact algorithm for the vehicle routing problem with stochastic demands and customers Transportation Science 29 2 1995 143 155
    • (1995) Transportation Science , vol.29 , Issue.2 , pp. 143-155
    • Gendreau, M.1    Laporte, G.2
  • 27
    • 0015973449 scopus 로고
    • Multicommodity distribution system design by benders decomposition
    • A.M. Geoffrion, and G.W. Graves Multicommodity distribution system design by benders decomposition Management Science 20 5 1974 822 844
    • (1974) Management Science , vol.20 , Issue.5 , pp. 822-844
    • Geoffrion, A.M.1    Graves, G.W.2
  • 28
  • 29
    • 84876151194 scopus 로고    scopus 로고
    • Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits
    • J.C. Goodson, and J.W. Ohlmann et al. Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits Operations Research 61 1 2013 138 154
    • (2013) Operations Research , vol.61 , Issue.1 , pp. 138-154
    • Goodson, J.C.1    Ohlmann, J.W.2
  • 30
    • 0032724285 scopus 로고    scopus 로고
    • Heuristics for the multi-vehicle covering tour problem
    • M. Hachicha, and M. John Hodgson et al. Heuristics for the multi-vehicle covering tour problem Computers & Operations Research 27 1 2000 29 42
    • (2000) Computers & Operations Research , vol.27 , Issue.1 , pp. 29-42
    • Hachicha, M.1    John Hodgson, M.2
  • 31
    • 80051924862 scopus 로고    scopus 로고
    • The mobile facility routing problem
    • R. Halper, and S. Raghavan The mobile facility routing problem Transportation Science 45 3 2011 413 434
    • (2011) Transportation Science , vol.45 , Issue.3 , pp. 413-434
    • Halper, R.1    Raghavan, S.2
  • 32
    • 84883746504 scopus 로고    scopus 로고
    • An iterative three-component heuristic for the team orienteering problem with time windows
    • Q. Hu, and A. Lim An iterative three-component heuristic for the team orienteering problem with time windows European Journal of Operational Research 232 2 2014 276 286
    • (2014) European Journal of Operational Research , vol.232 , Issue.2 , pp. 276-286
    • Hu, Q.1    Lim, A.2
  • 34
    • 0036526019 scopus 로고    scopus 로고
    • A Bayesian approach to a dynamic inventory model under an unknown demand distribution
    • DOI 10.1016/S0305-0548(00)00075-7, PII S0305054800000757
    • K.R. Kamath, and T.P.M. Pakkala A Bayesian approach to a dynamic inventory model under an unknown demand distribution Computers & Operations Research 29 4 2002 403 422 (Pubitemid 33038414)
    • (2002) Computers and Operations Research , vol.29 , Issue.4 , pp. 403-422
    • Kamath K.Rajashree1    Pakkala, T.P.M.2
  • 35
    • 0024162869 scopus 로고
    • The multiobjective vending problem: A generalization of the travelling salesman problem
    • C.P. Keller, and M.F. Goodchild The multiobjective vending problem: A generalization of the travelling salesman problem Environment and Planning B: Planning and Design 15 4 1988 447 460
    • (1988) Environment and Planning B: Planning and Design , vol.15 , Issue.4 , pp. 447-460
    • Keller, C.P.1    Goodchild, M.F.2
  • 36
    • 0036013019 scopus 로고    scopus 로고
    • The sample average approximation method for stochastic discrete optimization
    • A.J. Kleywegt, and A. Shapiro et al. The sample average approximation method for stochastic discrete optimization SIAM Journal on Optimization 12 2 2002 479 502
    • (2002) SIAM Journal on Optimization , vol.12 , Issue.2 , pp. 479-502
    • Kleywegt, A.J.1    Shapiro, A.2
  • 37
    • 84857912301 scopus 로고    scopus 로고
    • The team orienteering problem with time windows: An lp-based granular variable neighborhood search
    • N. Labadie, and R. Mansini et al. The team orienteering problem with time windows: An lp-based granular variable neighborhood search European Journal of Operational Research 220 1 2012 15 27
    • (2012) European Journal of Operational Research , vol.220 , Issue.1 , pp. 15-27
    • Labadie, N.1    Mansini, R.2
  • 38
    • 0000415520 scopus 로고
    • The integer L-shaped method for stochastic integer programs with complete recourse
    • G. Laporte, and F.O.V. Louveaux The integer L-shaped method for stochastic integer programs with complete recourse Operations Research Letters 13 3 1993 133 142
    • (1993) Operations Research Letters , vol.13 , Issue.3 , pp. 133-142
    • Laporte, G.1    Louveaux, F.O.V.2
  • 39
    • 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 Operations Research Letters 13 3 1993 133 142
    • (1993) Operations Research Letters , vol.13 , Issue.3 , pp. 133-142
    • Laporte, G.1    Louveaux, F.V.2
  • 40
    • 0036563024 scopus 로고    scopus 로고
    • An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands
    • G. Laporte, and F.V. Louveaux et al. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands Operations Research 50 3 2002 415 423
    • (2002) Operations Research , vol.50 , Issue.3 , pp. 415-423
    • Laporte, G.1    Louveaux, F.V.2
  • 41
    • 0004873816 scopus 로고
    • The selective travelling salesman problem
    • G. Laporte, and S. Martello The selective travelling salesman problem Discrete Applied Mathematics 26 2-3 1990 193 207
    • (1990) Discrete Applied Mathematics , vol.26 , Issue.23 , pp. 193-207
    • Laporte, G.1    Martello, S.2
  • 42
    • 0033908626 scopus 로고    scopus 로고
    • Computational solution of capacity planning models under uncertainty
    • DOI 10.1016/S0167-8191(99)00118-0
    • S.A. Mir Hassani, and C. Lucas et al. Computational solution of capacity planning models under uncertainty Parallel Computing 26 5 2000 511 538 (Pubitemid 30561052)
    • (2000) Parallel Computing , vol.26 , Issue.5 , pp. 511-538
    • Mirhassani, S.A.1    Lucas, C.2    Mitra, G.3    Messina, E.4    Poojari, C.A.5
  • 43
    • 58149260342 scopus 로고    scopus 로고
    • An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
    • C. Novoa, and R. Storer An approximate dynamic programming approach for the vehicle routing problem with stochastic demands European Journal of Operational Research 196 2 2009 509 515
    • (2009) European Journal of Operational Research , vol.196 , Issue.2 , pp. 509-515
    • Novoa, C.1    Storer, R.2
  • 44
    • 84902117774 scopus 로고    scopus 로고
    • Objective function evaluation methods for the orienteering problem with stochastic travel and service times
    • V. Papapanagiotou, and R. Montemanni et al. Objective function evaluation methods for the orienteering problem with stochastic travel and service times Journal of Applied Operational Research 6 1 2014 16 29
    • (2014) Journal of Applied Operational Research , vol.6 , Issue.1 , pp. 16-29
    • Papapanagiotou, V.1    Montemanni, R.2
  • 45
    • 84877664705 scopus 로고    scopus 로고
    • Integrated dynamic single-facility location and inventory planning problems
    • J. Qiu, and T.C. Sharkey Integrated dynamic single-facility location and inventory planning problems IIE Transactions 45 8 2013 883 895
    • (2013) IIE Transactions , vol.45 , Issue.8 , pp. 883-895
    • Qiu, J.1    Sharkey, T.C.2
  • 46
    • 13544260501 scopus 로고    scopus 로고
    • A stochastic programming approach for supply chain network design under uncertainty
    • DOI 10.1016/j.ejor.2004.01.046, PII S0377221704002292
    • T. Santoso, and S. Ahmed et al. A stochastic programming approach for supply chain network design under uncertainty European Journal of Operational Research 167 1 2005 96 115 (Pubitemid 40220005)
    • (2005) European Journal of Operational Research , vol.167 , Issue.1 , pp. 96-115
    • Santoso, T.1    Ahmed, S.2    Goetschalckx, M.3    Shapiro, A.4
  • 47
    • 84855704931 scopus 로고    scopus 로고
    • A decomposition approach for facility location and relocation problem with uncertain number of future facilities
    • A.D. Sonmez, and G.J. Lim A decomposition approach for facility location and relocation problem with uncertain number of future facilities European Journal of Operational Research 218 2 2012 327 338
    • (2012) European Journal of Operational Research , vol.218 , Issue.2 , pp. 327-338
    • Sonmez, A.D.1    Lim, G.J.2
  • 48
    • 4444239435 scopus 로고    scopus 로고
    • An integer l-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times
    • S.Y. Teng, and H.L. Ong et al. An integer l-shaped algorithm for time-constrained traveling salesman problem with stochastic travel and service times Asia-Pacific Journal of Operational Research 21 02 2004 241 257
    • (2004) Asia-Pacific Journal of Operational Research , vol.21 , Issue.2 , pp. 241-257
    • Teng, S.Y.1    Ong, H.L.2
  • 49
    • 79957533670 scopus 로고    scopus 로고
    • Dynamic-demand capacitated facility location problems with and without relocation
    • J.E. Torres-Soto, and H. Üster Dynamic-demand capacitated facility location problems with and without relocation International Journal of Production Research 49 13 2010 3979 4005
    • (2010) International Journal of Production Research , vol.49 , Issue.13 , pp. 3979-4005
    • Torres-Soto, J.E.1    Üster, H.2
  • 50
    • 81555205850 scopus 로고    scopus 로고
    • The bi-objective stochastic covering tour problem
    • F. Tricoire, and A. Graf et al. The bi-objective stochastic covering tour problem Computers & Operations Research 39 7 2012 1582 1592
    • (2012) Computers & Operations Research , vol.39 , Issue.7 , pp. 1582-1592
    • Tricoire, F.1    Graf, A.2
  • 52
    • 0020190559 scopus 로고
    • A dual-based procedure for dynamic facility location
    • T.J. Van Roy, and D. Erlenkotter A dual-based procedure for dynamic facility location Management Science 28 10 1982 1091 1105
    • (1982) Management Science , vol.28 , Issue.10 , pp. 1091-1105
    • Van Roy, T.J.1    Erlenkotter, D.2
  • 53
    • 0014534894 scopus 로고
    • L-shaped linear programs with applications to optimal control and stochastic programming
    • R.M. Van Slyke, and R. Wets L-shaped linear programs with applications to optimal control and stochastic programming SIAM Journal on Applied Mathematics 17 4 1969 638 663
    • (1969) SIAM Journal on Applied Mathematics , vol.17 , Issue.4 , pp. 638-663
    • Van Slyke, R.M.1    Wets, R.2
  • 55
    • 0015648856 scopus 로고
    • Dynamic facility location
    • G.O. Wesolowsky Dynamic facility location Management Science 19 11 1973 1241 1248
    • (1973) Management Science , vol.19 , Issue.11 , pp. 1241-1248
    • Wesolowsky, G.O.1
  • 56
    • 0016552086 scopus 로고
    • The multiperiod location-allocation problem with relocation of facilities
    • G.O. Wesolowsky, and W.G. Truscott The multiperiod location-allocation problem with relocation of facilities Management Science 22 1 1975 57 65
    • (1975) Management Science , vol.22 , Issue.1 , pp. 57-65
    • Wesolowsky, G.O.1    Truscott, W.G.2
  • 57
    • 0000877462 scopus 로고
    • Two stage linear programming under uncertainty with 0-1 integer first stage variables
    • R.D. Wollmer Two stage linear programming under uncertainty with 0-1 integer first stage variables Mathematical Programming 19 1 1980 279 288
    • (1980) Mathematical Programming , vol.19 , Issue.1 , pp. 279-288
    • Wollmer, R.D.1


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