Anzeige
Erschienen in:
2014 | OriginalPaper | Buchkapitel
A Variable Neighborhood Search Approach for Solving the Generalized Vehicle Routing Problem
verfasst von : Petrică C. Pop, Levente Fuksz, Andrei Horvat Marc
Erschienen in: Hybrid Artificial Intelligence Systems
Verlag: Springer International Publishing
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
Variable Neighborhood Search (VNS) is quite a recent metaheuristic used for solving optimization problems based on a systematic change of the neighborhoods structures within the search in order to avoid local optima. In this paper, we propose a VNS based heuristic for solving the generalized vehicle routing problem (GVRP) that uses different neighborhood structures which are adapted for the problem. Computational results for an often used collection of benchmark instances show that our proposed heuristic delivered competitive results compared to the existing state-of-the-art algorithms for solving the GVRP.