Abstract In the standard, capacitated vehicle routing problem (VRP), a homogeneous fleet of vehicles services a set of customers from a single depot. Each vehicle has a fixed capacity that cannot be exceeded and each customer has a known demand that must be satisfied. Each customer must be serviced by exactly one visit of a single vehicle and each vehicle must leave and return to the depot. There may be route-length restrictions that limit the distance traveled by each vehicle. The objective is to generate a sequence of deliveries for each vehicle so that all customers are serviced and the total distance traveled by the fleet is minimized.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    The Impact of Metaheuristics on Solving the Vehicle Routing Problem: Algorithms, Problem Sets, and Computational Results


    Beteiligte:
    Golden, Bruce L. (Autor:in) / Wasil, Edward A. (Autor:in) / Kelly, James P. (Autor:in) / Chao, I-Ming (Autor:in)


    Erscheinungsdatum :

    1998-01-01


    Format / Umfang :

    24 pages




    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

    Braysy, O. / Gendreau, M. | British Library Online Contents | 2005


    Metaheuristics for the Generalised Periodic Electric Vehicle Routing Problem

    Kouider, Tayeb Oulad / Cherif-Khettaf, Wahiba Ramdane / Oulamara, Ammar | British Library Conference Proceedings | 2019


    Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands

    Bianchi, L. / Birattari, M. / Chiarandini, M. et al. | British Library Online Contents | 2006


    Algorithms for Solving the Vehicle Routing Problem with Drones

    Schermer, Daniel / Moeini, Mahdi / Wendt, Oliver | British Library Conference Proceedings | 2018