TY - BOOK

T1 - The time-dependent pollution-routing problem

AU - Franceschetti, A.

AU - Honhon, D.B.L.P.

AU - Woensel, van, T.

AU - Bektas, T.

AU - Laporte, G.

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

M3 - Report

T3 - BETA publicatie : working papers

BT - The time-dependent pollution-routing problem

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -