A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem

DOI10.1007/978-3-540-70942-8_29zbMath1137.65363OpenAlexW1491932480MaRDI QIDQ5756193

Panagiotis P. Repoussis, Christos D. Tarantilis, George Ioannou

Publication date: 3 September 2007

Published in: Numerical Methods and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-70942-8_29

zbMATH Keywords

vehicle routingcomputational resultsVariable Neighborhood Searchminimum cost routesGreedy Randomized Adaptive Search Procedures

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Related Items (4)

Variable neighbourhood search: methods and applications ⋮ A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands ⋮ Multi-compartment vehicle routing problems: state-of-the-art, modeling framework and future directions ⋮ Variable neighbourhood search: Methods and applications

This page was built for publication: A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem