Models and algorithms for the pollution-routing problem and its variations
Models and algorithms for the pollution-routing problem and its variations
This thesis is positioned within the field of green logistics with respect to CO2 emissions in road freight transportation. In order to examine the different aspects of CO2 emissions of freight transportation, three related, but different research questions are studied. Because CO2 emissions are proportional to the amount of the fuel consumed by vehicles, the first goal of the thesis is to review and compare several available fuel emission models. The results of extensive computational experiments show that all emission models tested are sensitive to changes in load, speed and acceleration. Second, the dissertation studies the Pollution-Routing Problem (PRP), an extension of the classical Vehicle Routing Problem with Time Windows (VRPTW). The PRP consists of routing a number of vehicles to serve a set of customers within preset time windows, and determining their speed on each route segment, so as to minimise a function comprising fuel, emission and driver costs. A mathematical formulation of this problem cannot be solved to optimality for medium to large scale instances. For this reason, the thesis describes an adaptive large neighbourhood search (ALNS) based algorithm to solve the PRP. The algorithm iterates between a VRPTW and a speed optimisation problem, where the former is solved through an enhanced ALNS and the latter is solved using a polynomial time speed optimisation algorithm (SOA). The third question relates to the PRP and the two important objectives that should be taken into account, namely minimisation of fuel consumption and total driving time. Computational results on a large set of PRP instances show that the algorithm is both effective and efficient in solving instances of up to 200 nodes. The thesis therefore studies the bi-objective PRP where one of the objectives is related to the environment, namely fuel consumption (hence CO2 emissions), and the other to driving time. An enhanced ALNS algorithm is described to solve the bi-objective PRP. The algorithm integrates the classical ALNS scheme with a specialized SOA. The results show that one need not compromise greatly in terms of driving time in order to achieve a significant reduction in fuel consumption and CO2 emissions.
Demir, Emrah
eab6035c-0f98-4506-b5d0-ddb9eea88c32
July 2012
Demir, Emrah
eab6035c-0f98-4506-b5d0-ddb9eea88c32
Bektas, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9
Demir, Emrah
(2012)
Models and algorithms for the pollution-routing problem and its variations.
University of Southampton, School of Management, Doctoral Thesis, 165pp.
Record type:
Thesis
(Doctoral)
Abstract
This thesis is positioned within the field of green logistics with respect to CO2 emissions in road freight transportation. In order to examine the different aspects of CO2 emissions of freight transportation, three related, but different research questions are studied. Because CO2 emissions are proportional to the amount of the fuel consumed by vehicles, the first goal of the thesis is to review and compare several available fuel emission models. The results of extensive computational experiments show that all emission models tested are sensitive to changes in load, speed and acceleration. Second, the dissertation studies the Pollution-Routing Problem (PRP), an extension of the classical Vehicle Routing Problem with Time Windows (VRPTW). The PRP consists of routing a number of vehicles to serve a set of customers within preset time windows, and determining their speed on each route segment, so as to minimise a function comprising fuel, emission and driver costs. A mathematical formulation of this problem cannot be solved to optimality for medium to large scale instances. For this reason, the thesis describes an adaptive large neighbourhood search (ALNS) based algorithm to solve the PRP. The algorithm iterates between a VRPTW and a speed optimisation problem, where the former is solved through an enhanced ALNS and the latter is solved using a polynomial time speed optimisation algorithm (SOA). The third question relates to the PRP and the two important objectives that should be taken into account, namely minimisation of fuel consumption and total driving time. Computational results on a large set of PRP instances show that the algorithm is both effective and efficient in solving instances of up to 200 nodes. The thesis therefore studies the bi-objective PRP where one of the objectives is related to the environment, namely fuel consumption (hence CO2 emissions), and the other to driving time. An enhanced ALNS algorithm is described to solve the bi-objective PRP. The algorithm integrates the classical ALNS scheme with a specialized SOA. The results show that one need not compromise greatly in terms of driving time in order to achieve a significant reduction in fuel consumption and CO2 emissions.
Text
Final_PhD_Thesis-Emrah_Demir-July_2012[1]
- Version of Record
More information
Published date: July 2012
Organisations:
University of Southampton, Southampton Business School
Identifiers
Local EPrints ID: 343584
URI: http://eprints.soton.ac.uk/id/eprint/343584
PURE UUID: 47783958-9a0f-475d-9327-a7f06d540144
Catalogue record
Date deposited: 22 Nov 2012 15:16
Last modified: 14 Mar 2024 12:05
Export record
Contributors
Author:
Emrah Demir
Thesis advisor:
Tolga Bektas
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