The vehicle routing problem is a classical problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be incompatible. This paper summarizes the first methods developed for this extension called the VRPC (Vehicle Routing Problem with Conicts). This study presents a mathematical model, heuristics, metaheuristics (an iterated local search) and a greedy randomized adaptive search procedure - evolutionary local search. A lower bound is also introduced in this article.


    Zugriff

    Zugriff über TIB

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The vehicle routing problem with conflicts


    Beteiligte:


    Erscheinungsdatum :

    2011


    Format / Umfang :

    6 Seiten, 4 Tabellen, 19 Quellen




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Datenträger


    Sprache :

    Englisch




    Vehicle Routing Problem

    Wang, Yong / Ma, Xiaolei / Lao, Yunteng et al. | Transportation Research Record | 2013


    Vehicle Routing Problem Models

    Tonči Carić / Senka Pašagić / Zdenko Lanović | DOAJ | 2004

    Freier Zugriff

    Stochastic Vehicle Routing Problem with Restocking

    Yang, Wen-Huei | Online Contents | 2000


    The vehicle routing problem

    Toth, Paolo ;Vigo, Daniele | SLUB | 2002


    Vehicle routing problem with steep roads

    Brunner, Carlos / Giesen, Ricardo / Klapp, Mathias A. et al. | Elsevier | 2021