The time-dependent pollution routing problem

A. Franceschetti, D.B.L.P. Honhon, T. Woensel, van, T. Bektas, G. Laporte

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

195 Citaten (Scopus)
2 Downloads (Pure)


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.
Originele taal-2Engels
Pagina's (van-tot)265-293
Aantal pagina's19
TijdschriftTransportation Research. Part B: Methodological
StatusGepubliceerd - 2013

Vingerafdruk Duik in de onderzoeksthema's van 'The time-dependent pollution routing problem'. Samen vormen ze een unieke vingerafdruk.

Citeer dit