This chapter discusses Vehicle Routing Problem by finding optimal vehicle routes that visit a set of jobs in a given region. Depending on the situation, a job can be a service provided on‐site, a delivery of goods, or a collection of components. Strongly relying on Coindreau et al. and Gallay and Zuffrey, it describes how car sharing and independent loops (traveled by foot or electric kick scooter) allow for more sustainable transportation activities. To accurately measure the relevance of park‐and‐loop and car sharing, the chapter investigates two intermediate vehicle routing formulations leading to problem and denoted here as (A) and (B). (A) corresponds to the classical VRP situation where each worker has to use her/his single assigned car to move from one job to the other. (B) is a relaxation of (A) where park‐and‐loop is allowed.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    A Ruin and Recreate Solution Method for a Lexicographic Vehicle Routing Problem Integrating Park‐and‐Loop and Car Sharing


    Beteiligte:
    Besbes, Walid (Herausgeber:in) / Dhouib, Diala (Herausgeber:in) / Wassan, Niaz (Herausgeber:in) / Marrekchi, Emna (Herausgeber:in)

    Erschienen in:

    Erscheinungsdatum :

    2019-12-16


    Format / Umfang :

    18 pages




    Medientyp :

    Aufsatz/Kapitel (Buch)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch





    Improving paratransit scheduling using ruin and recreate methods

    Häll, Carl H. / Peterson, Anders | Taylor & Francis Verlag | 2013


    Integrating Traffic Safety in Vehicle Routing Solution

    Sahnoon, Iyad / Shawky, Mohamed / Al-Ghafli, Abdulla | Springer Verlag | 2017


    Solving the park-and-loop routing problem by branch-price-and-cut

    Cabrera, Nicolás / Cordeau, Jean-François / Mendoza, Jorge E. | Elsevier | 2023