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

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

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

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

transportationdistributionlogisticsvehicle routeing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A new multi-objective competitive open vehicle routing problem solved by particle swarm optimization ⋮ A multi-start algorithm for a balanced real-world open vehicle routing problem ⋮ An optimization approach for communal home meal delivery service: A case study ⋮ A variable neighbourhood search algorithm for the open vehicle routing problem ⋮ 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 ⋮ A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem ⋮ The close-open mixed vehicle routing problem ⋮ The open vehicle routing problem with decoupling points ⋮ A hybrid genetic algorithm for the multi-depot open vehicle routing problem ⋮ Integrating multi-product production and distribution in newspaper logistics ⋮ 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