The time-dependent pollution-routing problem
The time-dependent pollution-routing problem
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.
vehicle routing, fuel consumption, CO2 emissions, congestion, integer programming
265-293
Franceschetti, A.
2a869cd5-69ad-4ffc-be49-ad3ef36a6e18
Honhon, D.
634da1d0-3b11-4de8-b0d2-bb2673cac45c
Van Woensel, T.
90fb9e4c-4d09-4b19-b698-5d7723938fbc
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Laporte, G.
2cd560e2-79a4-4ee7-b883-ec02bc880328
October 2013
Franceschetti, A.
2a869cd5-69ad-4ffc-be49-ad3ef36a6e18
Honhon, D.
634da1d0-3b11-4de8-b0d2-bb2673cac45c
Van Woensel, T.
90fb9e4c-4d09-4b19-b698-5d7723938fbc
Bektas, T.
0db10084-e51c-41e5-a3c6-417e0d08dac9
Laporte, G.
2cd560e2-79a4-4ee7-b883-ec02bc880328
Franceschetti, A., Honhon, D., Van Woensel, T., Bektas, T. and Laporte, G.
(2013)
The time-dependent pollution-routing problem.
Transportation Research Part B: Methodological, 56, .
(doi:10.1016/j.trb.2013.08.008).
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.
This record has no associated files available for download.
More information
Published date: October 2013
Additional Information:
Beta Working Paper, 409
Keywords:
vehicle routing, fuel consumption, CO2 emissions, congestion, integer programming
Organisations:
Centre of Excellence for International Banking, Finance & Accounting
Identifiers
Local EPrints ID: 350203
URI: http://eprints.soton.ac.uk/id/eprint/350203
ISSN: 0191-2615
PURE UUID: eeef32f1-28b7-4002-a3fc-abfa8f2622bc
Catalogue record
Date deposited: 19 Mar 2013 16:38
Last modified: 14 Mar 2024 13:22
Export record
Altmetrics
Contributors
Author:
A. Franceschetti
Author:
D. Honhon
Author:
T. Van Woensel
Author:
T. Bektas
Author:
G. Laporte
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics