Abstract
The multi-depot open vehicle routing problem (MDOVRP) is a recent hard combinatorial optimization problem that belongs to the vehicle routing problem family. In the MDOVRP, the vehicles depart from several depots and once they have delivered the goods to the last customers in their routes they are not required to return to the depots. In this work, we propose a new mixed integer programming formulation for the MDOVRP by improving some constraints from the literature and proposing new ones. The computational experience carried out over problem instances from the literature indicates that our proposed model outperforms the existing one.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brandão J (2004) A tabu search algorithm for the open vehicle routing problem. Eur J Oper Res 157(3):552–564
Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105–119
Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80–91
Desrochers M, Laporte G (1991) Improvements and extensions to the Miller–Tucker–Zemlin subtour elimination constraints. Oper Res Lett 10(1):27–36
Hooker J (2011) Logic-based methods for optimization: combining optimization and constraint satisfaction, vol 2. Wiley, New York
Kara I, Laporte G, Bektas T (2004) A note on the lifted Miller–Tucker–Zemlin subtour elimination constraints for the capacitated vehicle routing problem. Eur J Oper Res 158(3):793–795
Letchford A, Lysgaard J, Eglese R (2007) A branch-and-cut algorithm for the capacitated open vehicle routing problem. J Oper Res Soc 58(12):1642–1651
Li F, Golden B, Wasil E (2007) The open vehicle routing problem: algorithms, large-scale test problems, and computational results. Comput Oper Res 34(10):2918–2930
Liu R, Jiang Z, Geng N (2014) A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR Spectr 36(2):401–421
Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J ACM 7(4):326–329
Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403–2435
Repoussis PP, Tarantilis CD, Bräysy O, Ioannou G (2010) A hybrid evolution strategy for the open vehicle routing problem. Comput Oper Res 37(3):443–455
Russell R, Chiang WC, Zepeda D (2008) Integrating multi-product production and distribution in newspaper logistics. Comput Oper Res 35(5):1576–1588
Sariklis D, Powell S (2000) A heuristic method for the open vehicle routing problem. J Oper Res Soc 51(5):564–573
Schrage L (1981) Formulation and structure of more complex/realistic routing and scheduling problems. Networks 11(2):229–232
Tarantilis CD, Kiranoudis CT (2002) Distribution of fresh meat. J Food Eng 51(1):85–91
Acknowledgments
This work has been partially funded by the Spanish Ministry of Economy and Competitiveness (Project TIN2012-32608). Eduardo Lalla-Ruiz and Christopher Expósito-Izquierdo thank the Canary Government for the financial support they receive through their post-graduate grants.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Lalla-Ruiz, E., Expósito-Izquierdo, C., Taheripour, S. et al. An improved formulation for the multi-depot open vehicle routing problem. OR Spectrum 38, 175–187 (2016). https://doi.org/10.1007/s00291-015-0408-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-015-0408-9