We propose a metaheuristic for the Time-Dependent Pollution-Routing Problem, which consists of routing a number of vehicles to serve a set of customers and determining their speed on each route segment with the objective of minimizing the cost of driver’s wage and greenhouse gases emissions. The vehicles face traffic congestion which, at peak periods, significantly restricts vehicle speeds and leads to increased emissions. Our algorithm is based on an adaptive large neighborhood search heuristic and uses new removal and insertion operators which significantly improve the quality of the solution. A previously developed departure time and speed optimization procedure is used as a subroutine to optimize departure times and vehicle speeds. Results from extensive computational experiments demonstrate the effectiveness of our algorithm.


    Access

    Download


    Export, share and cite



    Title :

    A metaheuristic for the time-dependent pollution-routing problem


    Contributors:

    Publication date :

    2017-06-17


    Remarks:

    Franceschetti , A , Demir , E , Honhon , D , van Woensel , T , Laporte , G & Stobbe , M 2017 , ' A metaheuristic for the time-dependent pollution-routing problem ' , European Journal of Operational Research , vol. 259 , no. 3 , pp. 972-991 . https://doi.org/10.1016/j.ejor.2016.11.026



    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Classification :

    DDC:    629



    The time-dependent pollution-routing problem

    Franceschetti, A. / Honhon, D.B.L.P. / Woensel, van, T. et al. | BASE | 2013

    Free access

    The time-dependent pollution-routing problem

    Franceschetti, Anna | Online Contents | 2013



    Solving Practical Vehicle Routing Problem with Time Windows Using Metaheuristic Algorithms

    Filip Taner / Ante Galić / Tonči Carić | DOAJ | 2012

    Free access