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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Multi-Trip Vehicle Routing Problem Based on Fuel Consumption Reduction


    Contributors:
    Peng, Yong (author) / Peng, Jing (author) / Li, Hongbo (author)

    Conference:

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


    Published in:

    ICLEM 2010 ; 2640-2646


    Publication date :

    2010-09-09




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Vehicle routing problem solution considering minimising fuel consumption

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

    Free access

    Vehicle routing problem solution considering minimising fuel consumption

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

    Free access

    Autonomous vehicle trip routing

    KONRARDY BLAKE / CHRISTENSEN SCOTT T / HAYWARD GREGORY et al. | European Patent Office | 2024

    Free access