The green vehicle routing and scheduling problem (GVRSP) aims to minimize green-house gas emissions in logistics systems through better planning of deliveries/pickups made by a fleet of vehicles. We define a new mixed integer liner programming (MIP) model which considers heterogeneous vehicles, time-varying traffic congestion, customer/vehicle time window constraints, the impact of vehicle loads on emissions, and vehicle capacity/range constraints in the GVRSP. The proposed model allows vehicles to stop on arcs, which is shown to reduce emissions up to additional 8% on simulated data. A hybrid algorithm of MIP and iterated neighborhood search is proposed to solve the problem.


    Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion


    Contributors:


    Publication date :

    2016




    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English



    Classification :

    BKL:    85.00 / 55.82 Güterverkehr



    Heterogeneous Fleets for Green Vehicle Routing Problem With Traffic Restrictions

    Wang, Heng / Li, Menghan / Wang, Zhenyu et al. | IEEE | 2023



    Solving the Dynamic Vehicle Routing Problem Under Traffic Congestion

    Kim, Gitae / Ong, Yew Soon / Cheong, Taesu et al. | IEEE | 2016


    Heterogeneous fleet green vehicle routing problem: a literature review

    Normasari, Nur Mayke Eka / Lathifah, Nurul | BASE | 2021

    Free access

    Time-Dependent Green Vehicle Routing Problem

    Masghati-Amoli, Golnush / Haghani, Ali | Springer Verlag | 2020