2007 | OriginalPaper | Buchkapitel
A Hybrid Metaheuristic for a Real Life Vehicle Routing Problem
verfasst von : Panagiotis P. Repoussis, Christos D. Tarantilis, George Ioannou
Erschienen in: Numerical Methods and Applications
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper presents a solution methodology to tackle a new realistic vehicle routing problem that incorporates heterogeneous fleet, multiple commodities and multiple vehicle compartments. The objective is to find minimum cost routes for a fleet of heterogeneous vehicles without violating capacity, loading and time window constraints. The solution methodology hybridizes in a reactive fashion systematic diversification mechanisms of Greedy Randomized Adaptive Search Procedures with Variable Neighborhood Search for intensification local search. Computational results reported justify the applicability of the methodology.