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

DOI10.1057/PALGRAVE.JORS.2601848MaRDI QIDQ5464434zbMATH OpenOpenAlexFDO

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

Publication date 17 August 2005

Published in The 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

distributionlogisticstransportationvehicle routeing

Mathematics Subject Classification ID

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

Recommendations

• An ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems
• A threshold accepting approach to the Open Vehicle Routing problem
• A heuristic method for the open vehicle routing problem
• A variable neighbourhood search algorithm for the open vehicle routing problem
• A hybrid evolution strategy for the open vehicle routing problem

Cited in

(18)

• A hybrid evolution strategy for the open vehicle routing problem
• An open vehicle routing problem metaheuristic for examining wide solution neighborhoods
• The open vehicle routing problem with decoupling points
• The close-open mixed vehicle routing problem
• A memory-based iterated local search algorithm for the multi-depot open vehicle routing problem
• A variable neighbourhood search algorithm for the open vehicle routing problem
• A hybrid genetic algorithm for the multi-depot open vehicle routing problem
• Integrating multi-product production and distribution in newspaper logistics
• 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 ant colony optimization metaheuristic hybridized with tabu search for open vehicle routing problems
• Solving the multi‐objective bike routing problem by meta‐heuristic algorithms
• Approximating split delivery path routing problems
• A hybrid simulated annealing and variable neighborhood search algorithm for the close-open electric vehicle routing problem
• 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

This page was built for publication: Solving the open vehicle routeing problem via a single parameter metaheuristic algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5464434)