This paper discussed one multi trip vehicle routing problem based on fuel consumption reduction. A GA-BFD heuristic algorithm was developed to find the solution. The numerical example showed that the optimal vehicle routing schedule would change when a vehicle would be used for multi trips with a driving distance limit. The new vehicle routing schedule would increase fuel consumption. However, if we take account of the vehicle's lease cost, the total cost might decrease.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Multi-Trip Vehicle Routing Problem Based on Fuel Consumption Reduction


    Beteiligte:
    Peng, Yong (Autor:in) / Peng, Jing (Autor:in) / Li, Hongbo (Autor:in)

    Kongress:

    International Conference of Logistics Engineering and Management (ICLEM) 2010 ; 2010 ; Chengdu, China


    Erschienen in:

    ICLEM 2010 ; 2640-2646


    Erscheinungsdatum :

    09.09.2010




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch




    Vehicle routing problem solution considering minimising fuel consumption

    Yao, Enjian / Lang, Zhifeng / Yang, Yang et al. | Wiley | 2015

    Freier Zugriff

    Vehicle routing problem solution considering minimising fuel consumption

    Yao, Enjian / Lang, Zhifeng / Yang, Yang et al. | IET | 2015

    Freier Zugriff

    Autonomous vehicle trip routing

    KONRARDY BLAKE / CHRISTENSEN SCOTT T / HAYWARD GREGORY et al. | Europäisches Patentamt | 2024

    Freier Zugriff


    The Multi-Trip Vehicle Routing Problem with Time Windows and Release Dates

    Cattaruzza, Diego / Absi, Nabil / Feillet, Dominique | British Library Online Contents | 2016