The time-dependent pollution-routing problem

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

Research output: Book/ReportReportAcademic

467 Downloads (Pure)

Abstract

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 fuel, emission 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 departure time and speed optimization algorithm on a fixed route. Finally, using benchmark instances, we present results on the computational performance of the proposed formulation and on the speed optimization procedure.
Original languageEnglish
Place of PublicationEindhoven
PublisherTechnische Universiteit Eindhoven
Number of pages41
Publication statusPublished - 2013

Publication series

NameBETA publicatie : working papers
Volume409
ISSN (Print)1386-9213

Fingerprint Dive into the research topics of 'The time-dependent pollution-routing problem'. Together they form a unique fingerprint.

Cite this