Abstract The basic problem of vehicle routing is a classical operations research problem, known to be NP-hard Leung et al., Eur J Op Res 225(2): 199–210, 2013, [64] and called the vehicle routing problem (VRP) or capacitated VRP (CVRP).It consists in determining a least-cost set of routes from a depot for a fleet of capacitated vehicles in order to meet the demands of a set of customers.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Metaheuristics for Vehicle Routing Problems


    Contributors:

    Published in:

    Publication date :

    2016-01-01


    Size :

    31 pages




    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English





    ACO-NSGAII: A Novel Metaheuristics for Bi-Objective Electric Vehicle Routing Problems

    Al-Nassar, Suzan / van Stein, Niki / Fan, Yingjie | IEEE | 2024



    Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

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


    Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands

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