Abstract
This paper deals with a robust location-arc routing problem with uncertainty on demand and traversing cost parameters. In this regard, a deterministic mathematical model is presented inspired by those available in the related literature and then, a robust optimization approach is used to deal with uncertainty. Due to the complexity of the deterministic and uncertain mathematical models, this paper finds the lower and upper bounds of the solutions to estimate a suitable range in which the optimum values exist. The lower and upper bounds are obtained by modifying the developed mathematical models and developing a two-phase heuristic algorithm, respectively. Furthermore, three single-solution-based meta-heuristics, called hill climbing, late acceptance hill climbing, and Tabu search are employed to enhance the upper bounds. According to the robust optimization approach, the paper on hand proposes a manual sorting method to approximate the value of uncertain parameters to be used in the heuristics and meta-heuristics. Finally, the paper evaluates the models, manually sorting method, heuristic, and meta-heuristic algorithms using some numerical examples and finds that all of them works appropriately.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Adarang H, Bozorgi-Amiri A, Khalili-Damghani K, Tavakkoli-Moghaddam R (2020) A robust bi-objective location-routing model for providing emergency medical services. J Humanit Logist Supply Chain Manag 10(3):285–319. https://doi.org/10.1108/JHLSCM-11-2018-0072
Adulyasak Y, Jaillet P (2016) Models and algorithms for stochastic and robust vehicle routing with deadlines. Transp Sci 50:608–626. https://doi.org/10.1287/trsc.2014.0581
Ahmadi G, Tavakkoli-Moghaddam R, Baboli A, Najafi M (2020) A decision support model for robust allocation and routing of search and rescue resources after earthquake: a case study. Oper Res Int J. https://doi.org/10.1007/s12351-020-00591-5 ((ArticleinPress))
Amini A, Tavakkoli-Moghaddam R, Ebrahimnejad S (2018) Scenario-based location arc routing problems: introducing mathematical models. In: Xu J, Gen M, Hajiyev A, Cooke F (eds) Proceedings of the eleventh international conference on management science and engineering management (ICMSEM). Springer, Cham, Japan, pp. 511–521. https://doi.org/10.1007/978-3-319-59280-0_41
Amini A, Tavakkoli-Moghaddam R, Ebrahimnejad S (2019) A bi-objective transportation-location arc routing problem. Transp Lett 00:1–15. https://doi.org/10.1080/19427867.2019.1679405
Amiri M, Amin SH, Tavakkoli-Moghaddam R (2019a) A Lagrangean decomposition approach for a novel two-echelon node-based location-routing problem in an offshore oil and gas supply chain. Transp Res Part E Logist Transp Rev 128:96–114. https://doi.org/10.1016/j.tre.2019.05.014
Amiri M, Sadjadi SJ, Tavakkoli-Moghaddam R, Jabbarzadeh A (2019b) Optimal fleet composition and mix periodic location-routing problem with time windows in an offshore oil and gas industry: a case study of National Iranian Oil Company. Sci Iran 26:522–537. https://doi.org/10.24200/sci.2018.20412
Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton
Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52:35–53. https://doi.org/10.1287/opre.1030.0065
Braaten S, Gjønnes O, Hvattum LM, Tirado G (2017) Heuristics for the robust vehicle routing problem with time windows. Expert Syst Appl 77:136–147. https://doi.org/10.1016/j.eswa.2017.01.038
Burke EK, Bykov Y (2017) The late acceptance hill-climbing heuristic. Eur J Oper Res 258:70–78. https://doi.org/10.1016/j.ejor.2016.07.012
Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput Oper Res 28:803–826. https://doi.org/10.1016/S0305-0548(00)00009-5
Emami S, Moslehi G, Sabbagh M (2017) A Benders decomposition approach for order acceptance and scheduling problem: a robust optimization approach. Comput Appl Math 36:1471–1515. https://doi.org/10.1007/s40314-015-0302-8
Fathollahi-Fard AM, Hajiaghaei-Keshteli M, Tavakkoli-Moghaddam R (2018) A bi-objective green home health care routing problem. J Clean Prod 200:423–443. https://doi.org/10.1016/j.jclepro.2018.07.258
Fazel Zarandi MH, Hemmati A, Davari S, Burhan Turksen I (2013) Capacitated location-routing problem with time windows under uncertainty. Knowl Based Syst 37:480–489. https://doi.org/10.1016/j.knosys.2012.09.007
Fernández E, Laporte G, Rodríguez-pereira J (2019) Exact solution of several families of location-arc routing problems. Transp Sci 53:1313–1333. https://doi.org/10.1287/trsc.2018.0881
Ghiani G, Laporte G (2001) Location-arc routing problems. Opserach 38:151–159. https://doi.org/10.1007/BF03399222
Glover F (1989) Tabu search—part I. ORSA J Comput 1:190–206. https://doi.org/10.1287/ijoc.1.3.190
Goel A, Irnich S (2016) An exact method for vehicle routing and truck driver scheduling problems. Transp Sci 51:1–18. https://doi.org/10.1287/trsc.2016.0678
Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper Res 61:677–693. https://doi.org/10.1287/opre.1120.1136
Habibzadeh Boukani F, Farhang Moghaddam B, Pishvaee MS (2016) Robust optimization approach to capacitated single and multiple allocation hub location problems. Comput Appl Math 35:45–60. https://doi.org/10.1007/s40314-014-0179-y
Hasani Goodarzi A, Tavakkoli-Moghaddam R, Amini A (2020) A new bi-objective vehicle routing-scheduling problem with cross-docking: mathematical model and algorithms. Comput Ind Eng 149:106832. https://doi.org/10.1016/j.cie.2020.106832
Hashemi Doulabi SH, Seifi A (2013) Lower and upper bounds for location-arc routing problems with vehicle capacity constraints. Eur J Oper Res 224:189–208. https://doi.org/10.1016/j.ejor.2012.06.015
Hervert-escobar L, Alexandrov V (2018) Territorial design optimization for business sales plan. J Comput Appl Math 340:501–507. https://doi.org/10.1016/j.cam.2018.02.010
Hoffman KL (2000) Combinatorial optimization: current successes and directions for the future. J Comput Appl Math 124:341–360. https://doi.org/10.1016/S0377-0427(00)00430-1
Levy L, Bodin L (1989) The arc oriented location routing problem. INFOR Inf Syst Oper Res 27:74–94. https://doi.org/10.1080/03155986.1989.11732083
Liu Y, Lei H, Zhang D, Wu Z (2018) Robust optimization for relief logistics planning under uncertainties in demand and transportation time. Appl Math Model 55:262–280. https://doi.org/10.1016/j.apm.2017.10.041
Lopes RB, Plastria F, Ferreira C, Santos BS (2014) Location-arc routing problem: heuristic approaches and test instances. Comput Oper Res 43:309–317. https://doi.org/10.1016/j.cor.2013.10.003
Mei Y, Tang K, Yao X (2010) Capacitated arc routing problem in uncertain environments. In: IEEE congress on evolutionary computation. Spain, pp 1–8. https://doi.org/10.1109/CEC.2010.5586031
Mirzaei-khafri S, Bashiri M, Soltani R (2019) A mathematical model for the capacitated location-arc routing problem with deadlines and heterogeneous fleet. Transport. https://doi.org/10.3846/transport.2019.11145
Mousavi SM, Tavakkoli-Moghaddam R, Jolai F (2013) A possibilistic programming approach for the location problem of multiple cross-docks and vehicle routing scheduling under uncertainty problem of multiple cross-docks and vehicle routing. Eng Optim. https://doi.org/10.1080/0305215X.2012.729053
Mulvey JM, Vanderbei RJ, Zenios SA (1995) Robust optimization of large-scale systems. Oper Res 43:264–281. https://doi.org/10.1287/opre.43.2.264
Nadizadeh A, Kafash B (2019) Fuzzy capacitated location-routing problem with simultaneous pickup and delivery demands. Transp Lett 7867:1–19. https://doi.org/10.1080/19427867.2016.1270798
Nadizadeh A, Hosseini Nasab H, Sadeghieh A, Fakhrzad MB (2014) A location-routing problem model with multiple periods and fuzzy demands. Data Envel Anal Decis Sci 2014:1–24. https://doi.org/10.5899/2014/dea-00063
Nagy G, Salhi S (2006) Location-routing: Issues, models and methods. Eur J Oper Res 177:649–672. https://doi.org/10.1016/j.ejor.2006.04.004
Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur J Oper Res 238:1–17. https://doi.org/10.1016/j.ejor.2014.01.005
Riquelme-Rodríguez JP, Gamache M, Langevin A (2016) Location arc routing problem with inventory constraints. Comput Oper Res 76:84–94. https://doi.org/10.1016/j.cor.2016.06.012
Schneider M, Drexl M (2017) A survey of the standard location-routing problem. Ann Oper Res 259:389–414. https://doi.org/10.1007/s10479-017-2509-0
Solano-Charris EL, Prins C, Santos AC (2014) A robust optimization approach for the vehicle routing problem with uncertain travel cost. In: Proceedings of international conference on control, decision and information technologies (CoDIT). IEEE, France, pp 98–103. https://doi.org/10.1109/CoDIT.2014.6996875
Solano-Charris EL, Prins C, Santos AC (2016) Solving the bi-objective robust vehicle routing problem with uncertain costs and demands. RAIRO Oper Res 50:689–714. https://doi.org/10.1051/ro/2016048
Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21:1154–1157. https://doi.org/10.1287/opre.21.5.1154
Sungur I, Ordóñez F, Dessouky M (2008) A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty. IIE Trans 40:509–523. https://doi.org/10.1080/07408170701745378
Tajik N, Tavakkoli-Moghaddam R, Vahdani B, Meysam Mousavi S (2014) A robust optimization approach for pollution routing problem with pickup and delivery under uncertainty. J Manuf Syst 33:277–286. https://doi.org/10.1016/j.jmsy.2013.12.009
Tavakkoli-Moghaddam R, Amini A, Ebrahimnejad S (2018) A new mathematical model for a multi-product location-arc routing problem. In: 4th international conference on optimization and applications (ICOA). IEEE, Morocco, pp 1–5. https://doi.org/10.1109/ICOA.2018.8370551
Tayebi-Araghi ME, Tavakkoli-Moghaddam R, Jolai F, Haji Molana SM (2020) A green multi-facilities open location-routing problem with planar facility locations and uncertain customer. J Clean Prod. https://doi.org/10.1016/j.jclepro.2020.124343
Tirkolaee EB, Mahdavi I, Seyyed Esfahani M (2018) A robust periodic capacitated arc routing problem for urban waste collection considering drivers and crew’s working time. Waste Manag 76:138–146. https://doi.org/10.1016/j.wasman.2018.03.015
Xiao Y, Konak A (2017) A genetic algorithm with exact dynamic programming for the green vehicle routing and scheduling problem. J Clean Prod 167:1450–1463. https://doi.org/10.1016/j.jclepro.2016.11.115
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Gabriel Haeser.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Amini, A., Tavakkoli-Moghaddam, R. & Ebrahimnejad, S. A robust location-arc routing problem under uncertainty: mathematical model with lower and upper bounds. Comp. Appl. Math. 39, 318 (2020). https://doi.org/10.1007/s40314-020-01349-7
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s40314-020-01349-7