158
Views
78
CrossRef citations to date
0
Altmetric
Theoretical Paper

Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm

, , &
Pages 588-596 | Received 01 Jul 2003, Accepted 01 Jun 2004, Published online: 21 Dec 2017

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (8)

Mostafa Khatami & Amir Salehipour. (2023) The gradual minimum covering location problem. Journal of the Operational Research Society 74:4, pages 1092-1104.
Read now
Rahma Lahyani, Anne-Lise Gouguenheim & Leandro C. Coelho. (2019) A hybrid adaptive large neighbourhood search for multi-depot open vehicle routing problems. International Journal of Production Research 57:22, pages 6963-6976.
Read now
U Derigs & K Reuter. (2009) A simple and efficient tabu search heuristic for solving the open vehicle routing problem. Journal of the Operational Research Society 60:12, pages 1658-1669.
Read now
X-Y Li, P Tian & S C H Leung. (2009) An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems. Journal of the Operational Research Society 60:7, pages 1012-1025.
Read now
A N Letchford, J Lysgaard & R W Eglese. (2007) A branch-and-cut algorithm for the capacitated open vehicle routing problem. Journal of the Operational Research Society 58:12, pages 1642-1651.
Read now
T Bektaş & Seda Elmastaş. (2007) Solving school bus routing problems through integer programming. Journal of the Operational Research Society 58:12, pages 1599-1604.
Read now
D Aksen, Z Özyurt & N Aras. (2007) Open vehicle routing problem with driver nodes and time deadlines. Journal of the Operational Research Society 58:9, pages 1223-1234.
Read now
P P Repoussis, C D Tarantilis & G Ioannou. (2007) The open vehicle routing problem with time windows. Journal of the Operational Research Society 58:3, pages 355-367.
Read now

Articles from other publishers (70)

Themistoklis Stamadianos, Nikolaos A. Kyriakakis, Magdalene Marinaki & Yannis Marinakis. (2023) A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem. Annals of Mathematics and Artificial Intelligence.
Crossref
Huo Chai, Ruichun He, Ronggui Kang, Xiaoyan Jia & Cunjie Dai. (2023) Solving Bi-Objective Vehicle Routing Problems with Driving Risk Consideration for Hazardous Materials Transportation. Sustainability 15:9, pages 7619.
Crossref
Erdener Ozcetin & Gurkan Ozturk. (2022) A variable neighborhood search for Open Vehicle Routing Problem . Concurrency and Computation: Practice and Experience 35:7.
Crossref
Hande Öztop. 2023. Towards Industry 5.0. Towards Industry 5.0 345 356 .
Yunyun Niu, Zehua Yang, Rong Wen, Jianhua Xiao & Shuai Zhang. (2022) Solving the Green Open Vehicle Routing Problem Using a Membrane-Inspired Hybrid Algorithm. Sustainability 14:14, pages 8661.
Crossref
Ergül KISA, Kazım Barış ATICI & Aydın ULUCAN. (2022) İKI-AŞAMALI ARAÇ ROTALAMA PROBLEMİ: TEMEL YAKLAŞIMLAR VE KONVANSİYONEL ARAÇ ROTALAMA PROBLEMİ İLE KARŞILAŞTIRMALARTWO-ECHELON VEHICLE ROUTING PROBLEM: REVIEW AND COMPARISONS WITH CONVENTIONAL VEHICLE ROUTING PROBLEM. Hacettepe Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi 40:2, pages 368-403.
Crossref
Joydeep Dutta, Partha Sarathi Barma, Samarjit Kar & Tanmay De. 2021. Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms. Research Anthology on Multi-Industry Uses of Genetic Programming and Algorithms 403 425 .
Agárdi Anita, Kovács László & Bányai Tamás. (2021) Using Time Series and Classification in Vehicle Routing Problem. International Journal of Performability Engineering 17:1, pages 14.
Crossref
Gözde Alp & Ali Fuat Alkaya. 2021. Proceedings of the 12th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2020). Proceedings of the 12th International Conference on Soft Computing and Pattern Recognition (SoCPaR 2020) 43 52 .
Anthika Lekburapa, Aua-aree Boonperm & Wutiphol Sintunavarat. 2021. Intelligent Computing and Optimization. Intelligent Computing and Optimization 287 296 .
Binhui Chen, Rong Qu, Ruibin Bai & Wasakorn Laesanklang. (2020) A variable neighborhood search algorithm with reinforcement learning for a real-life periodic vehicle routing problem with time windows and open routes. RAIRO - Operations Research 54:5, pages 1467-1494.
Crossref
José Brandão. (2020) A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem. European Journal of Operational Research 284:2, pages 559-571.
Crossref
Jesús Sánchez-Oro, Ana D. López-Sánchez & J. Manuel Colmenar. (2017) A general variable neighborhood search for solving the multi-objective open vehicle routing problem. Journal of Heuristics 26:3, pages 423-452.
Crossref
Valeria Soto-Mendoza, Irma García-Calvillo, Efraín Ruiz-y-Ruiz & Jaime Pérez-Terrazas. (2020) A Hybrid Grasshopper Optimization Algorithm Applied to the Open Vehicle Routing Problem. Algorithms 13:4, pages 96.
Crossref
Bapi Raju Vangipurapu, Rambabu Govada & Narayana Rao Kandukuri. 2020. Innovative Product Design and Intelligent Manufacturing Systems. Innovative Product Design and Intelligent Manufacturing Systems 897 906 .
Reza Tavakkoli-Moghaddam, Mohammadreza Meskini, Hadi Nasseri & Haed Tavakkoli-Moghaddam. (2019) A Multi-Depot Close and Open Vehicle Routing Problem with Heterogeneous Vehicles. A Multi-Depot Close and Open Vehicle Routing Problem with Heterogeneous Vehicles.
Evi Ramadhani, Herman Mawengkang, Sutarman & Marwan Ramli. (2019) Mixed Integer Program for Tackling Process Control Demand in The Capacitated Open Vehicle Routing Problems. Journal of Physics: Conference Series 1255:1, pages 012089.
Crossref
Dame Ifa Sihombing, S. Sitompul Opim, Sutarman & Ester Nababan. (2019) Chance Constrained Programming for Capacitated Open Vehicle Routing Problems. Journal of Physics: Conference Series 1255:1, pages 012048.
Crossref
Efrain Ruiz, Valeria Soto-Mendoza, Alvaro Ernesto Ruiz Barbosa & Ricardo Reyes. (2019) Solving the open vehicle routing problem with capacity and distance constraints with a biased random key genetic algorithm. Computers & Industrial Engineering 133, pages 207-219.
Crossref
A Imran. (2019) Two-Stage Algorithm for the Open Vehicle Routing Problem. IOP Conference Series: Materials Science and Engineering 532:1, pages 012006.
Crossref
Joydeep Dutta, Partha Sarathi Barma, Samarjit Kar & Tanmay De. (2019) A Modified Kruskal's Algorithm to Improve Genetic Search for Open Vehicle Routing Problem. International Journal of Business Analytics 6:1, pages 55-76.
Crossref
Uri Lipowezky, Boris Korenfeld & Ianir Ideses. (2018) Solving the Capacitated Open Vehicle Routing Problem Algorithm, Based on Probability Distribution Modelling of Saving Matrix. Solving the Capacitated Open Vehicle Routing Problem Algorithm, Based on Probability Distribution Modelling of Saving Matrix.
Yangkun Xia & Zhuo Fu. (2018) An Adaptive Tabu Search Algorithm for the Open Vehicle Routing Problem with Split Deliveries by Order. Wireless Personal Communications 103:1, pages 595-609.
Crossref
José Brandão. (2018) Iterated local search algorithm with ejection chains for the open vehicle routing problem with time windows. Computers & Industrial Engineering 120, pages 146-159.
Crossref
Reza Atefi, Majid Salari, Leandro C. Coelho & Jacques Renaud. (2018) The open vehicle routing problem with decoupling points. European Journal of Operational Research 265:1, pages 316-327.
Crossref
María Soto, Marc Sevaux, André Rossi & Andreas Reinholz. (2017) Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem. Computers & Industrial Engineering 107, pages 211-222.
Crossref
Ping Chen, Xingye Dong & Jianhua Xiao. (2016) Study on split delivery open vehicle routing problem within two splits. Study on split delivery open vehicle routing problem within two splits.
Shi-hua Zhan, Juan Lin, Ze-jun Zhang & Yi-wen Zhong. (2016) List-Based Simulated Annealing Algorithm for Traveling Salesman Problem. Computational Intelligence and Neuroscience 2016, pages 1-12.
Crossref
Kristian Schopka & Herbert Kopfer. 2016. Logistics Management. Logistics Management 243 257 .
J. Brito, F.J. Martínez, J.A. Moreno & J.L. Verdegay. (2015) An ACO hybrid metaheuristic for close–open vehicle routing problems with time windows and fuzzy constraints. Applied Soft Computing 32, pages 154-163.
Crossref
Wei Gu, Yong Liu, Lirong Wei & Bingkun Dong. 2015. LISS 2014. LISS 2014 1641 1646 .
Bekir Güler & Aişe Zülal Şevkli. 2015. Neural Information Processing. Neural Information Processing 182 189 .
A.D. López-Sánchez, A.G. Hernández-Díaz, D. Vigo, R. Caballero & J. Molina. (2014) A multi-start algorithm for a balanced real-world Open Vehicle Routing Problem. European Journal of Operational Research 238:1, pages 104-113.
Crossref
Yannis Marinakis & Magdalene Marinaki. (2014) A Bumble Bees Mating Optimization algorithm for the Open Vehicle Routing Problem. Swarm and Evolutionary Computation 15, pages 80-94.
Crossref
Ran Liu, Zhibin Jiang & Na Geng. (2012) A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR Spectrum 36:2, pages 401-421.
Crossref
Robert Russell. (2013) A constraint programming approach to designing a newspaper distribution system. International Journal of Production Economics 145:1, pages 132-138.
Crossref
Sayda Ben Sghaier, Najeh Ben Guedria & Rafaa Mraihi. (2013) Solving School Bus Routing Problem with genetic algorithm. Solving School Bus Routing Problem with genetic algorithm.
Richard Y.K. Fung, Ran Liu & Zhibin Jiang. (2013) A memetic algorithm for the open capacitated arc routing problem. Transportation Research Part E: Logistics and Transportation Review 50, pages 53-67.
Crossref
N. Norouzi, R. Tavakkoli-Moghaddam, M. Ghazanfari, M. Alinaghian & A. Salamatbakhsh. (2011) A New Multi-objective Competitive Open Vehicle Routing Problem Solved by Particle Swarm Optimization. Networks and Spatial Economics 12:4, pages 609-633.
Crossref
Ge Jinhui, Xiomg Ying & Wang Hongzhen. (2012) An Improved TS for the Open Vehicle Routing Problem with Soft Time Windows. An Improved TS for the Open Vehicle Routing Problem with Soft Time Windows.
Jin Ling GuoShi Wei Yu. (2012) A Hybrid Algorithm for Open Vehicle Routing Optimization of Coal Mines Material. Applied Mechanics and Materials 197, pages 455-461.
Crossref
Ran Liu & Zhibin Jiang. (2012) The close–open mixed vehicle routing problem. European Journal of Operational Research 220:2, pages 349-360.
Crossref
Xiangyong Li, Stephen C.H. Leung & Peng Tian. (2012) A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem. Expert Systems with Applications 39:1, pages 365-374.
Crossref
Yannis Marinakis & Magdalene Marinaki. 2012. Swarm Intelligence. Swarm Intelligence 180 187 .
Shiwei Yu, Chang Ding & Kejun Zhu. (2011) A hybrid GA–TS algorithm for open vehicle routing optimization of coal mines material. Expert Systems with Applications 38:8, pages 10568-10573.
Crossref
Yannis Marinakis & Magdalene Marinaki. (2011) A honey bees mating optimization algorithm for the open vehicle routing problem. A honey bees mating optimization algorithm for the open vehicle routing problem.
Chun Yu Ren. (2011) Study on Hybrid Genetic Algorithm for Multi-Type Vehicle Open Vehicle Routing Problem. Advanced Materials Research 204-210, pages 1287-1290.
Crossref
Ran Liu, Zhibin Jiang, Hongtao Hu & Shiqing Yao. (2010) A memetic algorithm for the close-open mixed Vehicle Routing Problem. A memetic algorithm for the close-open mixed Vehicle Routing Problem.
Majid Salari, Paolo Toth & Andrea Tramontani. (2010) An ILP improvement procedure for the Open Vehicle Routing Problem. Computers & Operations Research 37:12, pages 2106-2120.
Crossref
Fengjun Hu & Fan Wu. (2010) Diploid hybrid Particle swarm optimization with differential evolution for Open Vehicle Routing Problem. Diploid hybrid Particle swarm optimization with differential evolution for Open Vehicle Routing Problem.
Emmanouil E. Zachariadis & Chris T. Kiranoudis. (2010) An open vehicle routing problem metaheuristic for examining wide solution neighborhoods. Computers & Operations Research 37:4, pages 712-723.
Crossref
Yan Wei Zhao, J.L. Zhang & D.J. Peng. (2010) Open Vehicle Routing Problem Using Quantum Evolutionary Algorithm. Advanced Materials Research 102-104, pages 807-812.
Crossref
P.P. Repoussis, C.D. Tarantilis, O. Bräysy & G. Ioannou. (2010) A hybrid evolution strategy for the open vehicle routing problem. Computers & Operations Research 37:3, pages 443-455.
Crossref
Li Guiyun. (2009) An Improved Ant Colony Algorithm for Open Vehicle Routing Problem with Time Windows. An Improved Ant Colony Algorithm for Open Vehicle Routing Problem with Time Windows.
Guiyun Li. (2009) Research on Open Vehicle Routing Problem with Time Windows Based on Improved Genetic Algorithm. Research on Open Vehicle Routing Problem with Time Windows Based on Improved Genetic Algorithm.
Wen-Chyuan Chiang, Robert Russell, Xiaojing Xu & David Zepeda. (2009) A simulation/metaheuristic approach to newspaper production and distribution supply chain problems. International Journal of Production Economics 121:2, pages 752-767.
Crossref
Olli Bräysy, Pentti Nakari, Wout Dullaert & Pekka Neittaanmäki. (2009) An optimization approach for communal home meal delivery service: A case study. Journal of Computational and Applied Mathematics 232:1, pages 46-53.
Crossref
Yong Peng & Haiying Zhu. (2009) Optimization of Open Vehicle Route to Reduce Fuel Consumption Based on Genetic Algorithm. Optimization of Open Vehicle Route to Reduce Fuel Consumption Based on Genetic Algorithm.
Jingling Zhang, Yanwei Zhao, Dianjun Peng & Wanliang Wang. (2009) A hybrid Quantum-Inspired Evolutionary Algorithm for open vehicle routing problem. A hybrid Quantum-Inspired Evolutionary Algorithm for open vehicle routing problem.
Krzysztof Fleszar, Ibrahim H. Osman & Khalil S. Hindi. (2009) A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research 195:3, pages 803-809.
Crossref
Panagiotis P. Repoussis, Christos D. Tarantilis & George Ioannou. 2009. Bio-inspired Algorithms for the Vehicle Routing Problem. Bio-inspired Algorithms for the Vehicle Routing Problem 55 75 .
Ping Chen, Youli Qu, Houkuan Huang & Xingye Dong. (2008) A New Hybrid Iterated Local Search for the Open Vehicle Routing Problem. A New Hybrid Iterated Local Search for the Open Vehicle Routing Problem.
Robert Russell, Wen-Chyuan Chiang & David Zepeda. (2008) Integrating multi-product production and distribution in newspaper logistics. Computers & Operations Research 35:5, pages 1576-1588.
Crossref
Pengfei Zhou, Xiangqun Song & Zijian Guo. (2007) A Container Vehicle Routing Problem with Soft Time Window. A Container Vehicle Routing Problem with Soft Time Window.
Feiyue Li, Bruce Golden & Edward Wasil. (2007) The open vehicle routing problem: Algorithms, large-scale test problems, and computational results. Computers & Operations Research 34:10, pages 2918-2930.
Crossref
Pengfei Zhou. (2007) Container Forwarder Operational Planning: A Local Vehicle Routing Model with Simultaneous Pick up and Delivery Service. Container Forwarder Operational Planning: A Local Vehicle Routing Model with Simultaneous Pick up and Delivery Service.
Shengqiang Wen & Pengfei Zhou. (2007) A Container Vehicle Routing Model with Variable Traveling Time. A Container Vehicle Routing Model with Variable Traveling Time.
C.D. Tarantilis & C.T. Kiranoudis. (2007) A flexible adaptive memory-based algorithm for real-life transportation operations: Two case studies from dairy and construction sector. European Journal of Operational Research 179:3, pages 806-822.
Crossref
Deniz Aksen & Necati Aras. 2006. Operations Research Proceedings 2005. Operations Research Proceedings 2005 37 42 .
Xiangyong Li & Peng Tian. 2006. Ant Colony Optimization and Swarm Intelligence. Ant Colony Optimization and Swarm Intelligence 356 363 .

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.