The Time-Dependent Pollution-Routing Problem (TDPRP) consists of routing a fleet of vehicles in order to serve a set of customers and determining the speeds on each leg of the routes. The cost function includes emissions and driver costs, taking into account traffic congestion which, at peak periods, significantly restricts vehicle speeds and increases emissions. We describe an integer linear programming formulation of the TDPRP and provide illustrative examples to motivate the problem and give insights about the tradeoffs it involves. We also provide an analytical characterization of the optimal solutions for a single-arc version of the problem, identifying conditions under which it is optimal to wait idly at certain locations in order to avoid congestion and to reduce the cost of emissions. Building on these analytical results we describe a novel departure time and speed optimization algorithm for the cases when the route is fixed. Finally, using benchmark instances, we present results on the computational performance of the proposed formulation and on the speed optimization procedure. © 2013 Elsevier Ltd.
https://doi.org/10.1016/j.trb.2013.08.008Cite as:
@article{Franceschetti_2013,
doi = {10.1016/j.trb.2013.08.008},
url = {https://doi.org/10.1016%2Fj.trb.2013.08.008},
year = 2013,
month = {oct},
publisher = {Elsevier {BV}},
volume = {56},
pages = {265--293},
author = {Anna Franceschetti and Doroth{'{e}}e Honhon and Tom Van Woensel and Tolga Bekta{c{s}} and Gilbert Laporte},
title = {The time-dependent pollution-routing problem},
journal = {Transportation Research Part B: Methodological}
}