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

DOI10.1057/palgrave.jors.2601848zbMath1095.90016MaRDI QIDQ5464434

Christos D. Tarantilis, Chris T. Kiranoudis, George Ioannou, Gregory P. Prastacos

Publication date: 17 August 2005

Published in: Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1057/palgrave.jors.2601848

zbMATH Keywords

transportation; distribution; logistics; vehicle routeing

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B06: Transportation, logistics and supply chain management

90C59: Approximation methods and heuristics in mathematical programming

Related Items

An optimization approach for communal home meal delivery service: A case study, A flexible adaptive memory-based algorithm for real-life transportation operations: two case studies from dairy and construction sector, The open vehicle routing problem: algorithms, large-scale test problems, and computational results, An ILP improvement procedure for the open vehicle routing problem, A hybrid evolution strategy for the open vehicle routing problem, An open vehicle routing problem metaheuristic for examining wide solution neighborhoods, The close-open mixed vehicle routing problem, A variable neighbourhood search algorithm for the open vehicle routing problem, Integrating multi-product production and distribution in newspaper logistics