A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems

References

• Atefi, R., M. Salari, L. C. Coelho, and J. Renaud. 2018. “The Open Vehicle Routing Problem with Decoupling Points.” European Journal of Operational Research 265 (1): 316–327. doi: 10.1016/j.ejor.2017.07.033
   Web of Science ®Google Scholar
• Bai, R., J. Blazewicz, E. K. Burke, G. Kendall, and B. McCollum. 2012. “A Simulated Annealing Hyper-Heuristic Methodology for Flexible Decision Support.” 4OR 10 (1): 43–66. doi: 10.1007/s10288-011-0182-8
   Web of Science ®Google Scholar
• Bakkehaug, R., J. G. Rakke, K. Fagerholt, and G. Laporte. 2016. “An Adaptive Large Neighborhood Search Heuristic for Fleet Deployment Problems with Voyage Separation Requirements.” Transportation Research Part C: Emerging Technologies 70: 129–141. doi: 10.1016/j.trc.2015.06.019
   Web of Science ®Google Scholar
• Barrena, E., D. Canca, L. C. Coelho, and G. Laporte. 2014. “Single-line Rail Rapid Transit Timetabling Under Dynamic Passenger Demand.” Transportation Research Part B: Methodological 70: 134–150. doi: 10.1016/j.trb.2014.08.013
   Web of Science ®Google Scholar
• Belo-Filho, M. A. F., P. Amorim, and B. Almada-Lobo. 2015. “An Adaptive Large Neighbourhood Search for the Operational Integrated Production and Distribution Problem of Perishable Products.” International Journal of Production Research 53 (20): 6040–6058. doi: 10.1080/00207543.2015.1010744
   Web of Science ®Google Scholar
• Bodin, L., B. L. Golden, A. Assad, and M. Ball. 1983. “Routing and Scheduling of Vehicles and Crews: The State of the Art.” Computers & Operations Research 10 (2): 63–211. doi: 10.1016/0305-0548(83)90030-8
   Web of Science ®Google Scholar
• Briskorn, D., and E. Pesch. 2013. “Variable Very Large Neighbourhood Algorithms for Truck Sequencing at Transshipment Terminals.” International Journal of Production Research 51 (23–24): 7140–7155. doi: 10.1080/00207543.2013.849825
   Web of Science ®Google Scholar
• Chabot, T., R. Lahyani, L. C. Coelho, and J. Renaud. 2017. “Order Picking Problems Under Weight, Fragility and Category Constraints.” International Journal of Production Research 55 (21): 6361–6379. doi: 10.1080/00207543.2016.1251625
   Web of Science ®Google Scholar
• Coelho, L. C., J.-F. Cordeau, and G. Laporte. 2012. “Consistency in Multi-Vehicle Inventory-Routing.” Transportation Research Part C: Emerging Technologies 24: 270–287. doi: 10.1016/j.trc.2012.03.007
   Web of Science ®Google Scholar
• Coelho, L. C., J.-F. Cordeau, and G. Laporte. 2012. “The Inventory-Routing Problem with Transshipment.” Computers & Operations Research 39: 2537–2548. doi: 10.1016/j.cor.2011.12.020
   Web of Science ®Google Scholar
• Cordeau, J.-F., M. Gendreau, and G. Laporte. 1997. “A Tabu Search for Periodic and Multi-depot Vehicle Routing Problems.” Networks 30: 105–119. doi: 10.1002/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G
   Web of Science ®Google Scholar
• Şevkli, A. Z., and B. Güler. 2017. “A Multi-phase Oscillated Variable Neighbourhood Search Algorithm for a Real-world Open Vehicle Routing Problem.” Applied Soft Computing 58: 128–144. doi: 10.1016/j.asoc.2017.04.045
   Web of Science ®Google Scholar
• Fu, Z., R. Eglese, and L. Y. Li. 2005. “A New Tabu Search Heuristic for the Open Vehicle Routing Problem.” Journal of the Operational Research Society 56: 267–274. doi: 10.1057/palgrave.jors.2601817
   Web of Science ®Google Scholar
• Grangier, P., M. Gendreau, F. Lehuédé, and L.-M. Rousseau.: 2016. An Adaptive Large Neighborhood Search for the Ywo-echelon Multiple-trip Vehicle Routing Problem with Satellite Synchronization. European Journal of Operational Research, 254(1): 80–91, doi: 10.1016/j.ejor.2016.03.040
   Web of Science ®Google Scholar
• Lahyani, R., M. Khemakhem, and F. Semet. 2015. “Rich Vehicle Routing Problems: From a Taxonomy to a Definition.” European Journal of Operational Research 241 (1): 1–14. doi: 10.1016/j.ejor.2014.07.048
   Web of Science ®Google Scholar
• Lahyani, R., M. Khemakhem, and F. Semet. 2017. “A Unified Metaheuristic for Solving Multi-constrained Traveling Salesman Problems with Profits.” EURO Journal on Computational Optimization 5 (3): 393–422. doi: 10.1007/s13675-016-0071-1
   Web of Science ®Google Scholar
• Lalla-Ruiz, E., C. Expósito-Izquierdo, S. Taheripour, and S. Voß. 2015. “An Improved Formulation for the Multi-depot Open Vehicle Routing Problem.” OR Spectrum 38 (1): 175–187. doi: 10.1007/s00291-015-0408-9
   Web of Science ®Google Scholar
• Lalla-Ruiz, E., and S. Voß. A Note on a Hybrid Genetic Algorithm for the Multi-depot Open Vehicle Routing Problem. Institute of Information Systems, University of Hamburg. https://www.bwl.uni-hamburg.de/en/iwi/forschung/projekte/papernote.pdf.
   Google Scholar
• Letchford, A. N., J. Lysgaard, and R. W. Eglese. 2007. “A Branch-and-cut Algorithm for the Capacitated Open Vehicle Routing Problem.” Journal of the Operational Research Society 58 (12): 1642–1651. doi: 10.1057/palgrave.jors.2602345
   Web of Science ®Google Scholar
• Li, Y., H. Chen, and C. Prins. 2016. “Adaptive Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Profits, and Reserved Requests.” European Journal of Operational Research 252 (1): 27–38. doi: 10.1016/j.ejor.2015.12.032
   Web of Science ®Google Scholar
• Li, F., B. L. Golden, and E. A. Wasil. 2007. “The Open Vehicle Routing Problem: Algorithms, Large-scale Test Problems, and Computational Results.” Computers & Operations Research 34: 2918–2930. doi: 10.1016/j.cor.2005.11.018
   Web of Science ®Google Scholar
• Liu, R., Z. Jiang, and N. Geng. 2014. “A Hybrid Genetic Algorithm for the Multi-depot Open Vehicle Routing Problem.” OR Spectrum 36: 401–421. doi: 10.1007/s00291-012-0289-0
   Web of Science ®Google Scholar
• Marinakis, Y., and M. Marinaki. 2014. “A Bumble Bees Mating Optimization Algorithm for the Open Vehicle Routing Problem.” Swarm and Evolutionary Computation 15: 80–94. doi: 10.1016/j.swevo.2013.12.003
   Web of Science ®Google Scholar
• Mauri, G. R., G. M. Ribeiro, L. A. N. Lorena, and G. Laporte. 2016. “An Adaptive Large Neighborhood Search for the Discrete and Continuous Berth Allocation Problem.” Computers & Operations Research70: 140–154. doi: 10.1016/j.cor.2016.01.002
   Web of Science ®Google Scholar
• Niu, Y., Z. Yang, P. Chen, and J. Xiao. 2018. “Optimizing the Green Open Vehicle Routing Problem with Time Windows by Minimizing Comprehensive Routing Cost.” Journal of Cleaner Production 171: 962–971. doi: 10.1016/j.jclepro.2017.10.001
   Web of Science ®Google Scholar
• Parragh, S. N., and J.-F. Cordeau. 2017. “Branch-and-price and Adaptive Large Neighborhood Search for the Truck and Trailer Routing Problem with Time Windows.” Computers & Operations Research83: 28–44. doi: 10.1016/j.cor.2017.01.020
   Web of Science ®Google Scholar
• Pereira, M. A., L. C. Coelho, L. A. N. Lorena, and L. C. de Souza. 2015. “A Hybrid Method for the Probabilistic Maximal Covering Location–Allocation Problem.” Computers & Operations Research 57: 51–59. doi: 10.1016/j.cor.2014.12.001
   Web of Science ®Google Scholar
• Pessoa, A., M. V. S. Poggi de Aragão, and E. Uchoa. 2008. “Robust Branch-cut-and-price Algorithms for Vehicle Routing Problems.” In The Vehicle Routing Problem: Latest Advances and New Challenges, edited by B.L. Golden, S. Raghavan, and E.A. Wasil, 297–325. New York: Springer.
   Google Scholar
• Pisinger, D., and S. Ropke. 2007. “A General Heuristic for Vehicle Routing Problems.” Computers & Operations Research 34 (8): 2403–2435. doi: 10.1016/j.cor.2005.09.012
   Web of Science ®Google Scholar
• Repoussis, P. P., D. C. Paraskevopoulos, G. Zobolas, C. D. Tarantilis, and G. Ioannou. 2009. “A Web-based Decision Support System for Waste Lube Oils Collection and Recycling.” European Journal of Operational Research 195 (3): 676–700. doi: 10.1016/j.ejor.2007.11.004
   Web of Science ®Google Scholar
• Ropke, S., and D. Pisinger. 2006. “An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows.” Transportation Science 40 (4): 455–472. doi: 10.1287/trsc.1050.0135
   Web of Science ®Google Scholar
• Salari, M., P. Toth, and A. Tramontani. 2010. “An ILP Improvement Procedure for the Open Vehicle Routing Problem.” Computers & Operations Research 37: 2106–2120. doi: 10.1016/j.cor.2010.02.010
   Web of Science ®Google Scholar
• Sariklis, D., and S. Powell. 2000. “A Heuristic Method for the Open Vehicle Routing Problem.” Journal of the Operational Research Society 51 (5): 564–573. doi: 10.1057/palgrave.jors.2600924
   Web of Science ®Google Scholar
• Schrage, L. 1981. “Formulation and Structure of More Complex/Realistic Routing and Scheduling Problems.” Networks 11 (2): 229–232. doi: 10.1002/net.3230110212
   Web of Science ®Google Scholar
• Schrimpf, G., J. Schneider, H. Stamm-Wilbrandt, and G. Dueck. 2000. “Record Breaking Optimization Results Using the Ruin and Recreate Principle.” Journal of Computational Physics 159 (2): 139–171. doi: 10.1006/jcph.1999.6413
   Web of Science ®Google Scholar
• Shaw, P. 1997. A New Local Search Algorithm Providing High Quality Solutions to Vehicle Routing Problems. Technical report, Department of Computer Science, University of Strathclyde, Scotland.
   Google Scholar
• Soto, M., M. Sevaux, A. Rossi, and A. Reinholz. 2017. “Multiple Neighborhood Search, Tabu Search and Ejection Chains for the Multi-depot Open Vehicle Routing Problem.” Computers & Industrial Engineering 107: 211–222. doi: 10.1016/j.cie.2017.03.022
   Web of Science ®Google Scholar
• Tarantilis, C. D., D. Diakoulaki, and C. T. Kiranoudis. 2004. “Combination of Geographical Information System and Efficient Routing Algorithms for Real Life Distribution Operations.” European Journal of Operational Research 152 (2): 437–453. doi: 10.1016/S0377-2217(03)00035-3
   Web of Science ®Google Scholar
• Tarantilis, C. D., G. Ioannou, and C. T. Kiranoudis. 2005. “Solving the Open Vehicle Routing Problem via a Single Parameter Metaheuristic Algorithm.” Journal of the Operational Research Society 56: 588–596. doi: 10.1057/palgrave.jors.2601848
   Web of Science ®Google Scholar
• Tarantilis, C. D., G. Ioannou, C. T. Kiranoudis, and G. P. Prastacos. 2004. “A Threshold Accepting Approach to the Open Vehicle Routing Problem.” RAIRO-Operations Research 38 (4): 345–360. doi: 10.1051/ro:2004029
   Web of Science ®Google Scholar
• Tarantilis, C. D., and C. T. Kiranoudis. 2001. “A Meta-heuristic Algorithm for the Efficient Distribution of Perishable foods.” Journal of Food Engineering 50 (1): 1–9. doi: 10.1016/S0260-8774(00)00187-4
   Web of Science ®Google Scholar
• Tarantilis, C. D., and C. T. Kiranoudis. 2002. “Distribution of Fresh Meat.” Journal of Food Engineering21: 85–91. doi: 10.1016/S0260-8774(01)00040-1
   Web of Science ®Google Scholar
• Zachariadis, E. E., and C. T. Kiranoudis. 2010. “An Open Vehicle Routing Problem Metaheuristic for Examining Wide Solution Neighborhoods.” Computers & Operations Research 37 (4): 712–723. doi: 10.1016/j.cor.2009.06.021
   Web of Science ®Google Scholar
• Žulj, I., S. Kramer, and M. Schneider. 2018. “A Hybrid of Adaptive Large Neighborhood Search and Tabu Search for the Order-batching Problem.” European Journal of Operational Research 264 (2): 653–664. doi: 10.1016/j.ejor.2017.06.056
   Web of Science ®Google Scholar