The University of Southampton
University of Southampton Institutional Repository

Routing products or people: single and multiobjective constrained shortest path and related problems

Routing products or people: single and multiobjective constrained shortest path and related problems
Routing products or people: single and multiobjective constrained shortest path and related problems
The aim of this thesis is to define, model and solve three research questions at the tactical and operational levels of decision making, the former arising in the context of intermodal service network design and the latter two in passenger transportation, by using integer programming, dynamic programming and heuristics. The first research question concerns intermodal freight transportation, which is concerned with the shipment of commodities from their origin to destination using combinations of transport modes. Traditional logistics models have concentrated on minimising transportation costs by appropriately determining the service network and the transportation routing. The first chapter considers an intermodal transportation problem with a detailed consideration of greenhouse gas emissions and intermodal transfers. Two mathematical models, one time-invariant and the other time-dependent, are described for the problem, which are both in the form of a non-linear integer programming formulation, but which are linearised.

A hypothetical but realistic case study of the UK forms the test instances for our investigation, where uni-modal with multimodal transportation options are compared using a range of fixed costs. The second and third research questions concern the multiobjective shortest path problem (MSPP) and the constrained multiobjective shortest path problem (CMSPP), extensions of the classical shortest path problem, with a wide range of practical applications particularly in passenger transportation. The second and third research questions are studied in two different chapters. The first of these presents several labelling algorithms for the MSPP and the CMSPP. Extensive testing is performed on different types of networks, including randomly generated and grid networks. The results show that label correcting algorithms are more efficient than label setting algorithms for solving both the MSPP and the CMSPP. The second of these two chapters proposes two fast local search algorithms for the MSPP. Four performance indicators are used to evaluate the local search solutions. Computational results demonstrate that local search algorithms are faster than all heuristic methods for the MSPP presented in literature, and able to produce reasonably good-quality solutions.
Qu, Yi
9a8897ba-7fd5-4d64-9ff1-9fa7e2a452a4
Qu, Yi
9a8897ba-7fd5-4d64-9ff1-9fa7e2a452a4
Bektas, Tolga
0db10084-e51c-41e5-a3c6-417e0d08dac9

(2016) Routing products or people: single and multiobjective constrained shortest path and related problems. University of Southampton, Southampton Business School, Doctoral Thesis, 168pp.

Record type: Thesis (Doctoral)

Abstract

The aim of this thesis is to define, model and solve three research questions at the tactical and operational levels of decision making, the former arising in the context of intermodal service network design and the latter two in passenger transportation, by using integer programming, dynamic programming and heuristics. The first research question concerns intermodal freight transportation, which is concerned with the shipment of commodities from their origin to destination using combinations of transport modes. Traditional logistics models have concentrated on minimising transportation costs by appropriately determining the service network and the transportation routing. The first chapter considers an intermodal transportation problem with a detailed consideration of greenhouse gas emissions and intermodal transfers. Two mathematical models, one time-invariant and the other time-dependent, are described for the problem, which are both in the form of a non-linear integer programming formulation, but which are linearised.

A hypothetical but realistic case study of the UK forms the test instances for our investigation, where uni-modal with multimodal transportation options are compared using a range of fixed costs. The second and third research questions concern the multiobjective shortest path problem (MSPP) and the constrained multiobjective shortest path problem (CMSPP), extensions of the classical shortest path problem, with a wide range of practical applications particularly in passenger transportation. The second and third research questions are studied in two different chapters. The first of these presents several labelling algorithms for the MSPP and the CMSPP. Extensive testing is performed on different types of networks, including randomly generated and grid networks. The results show that label correcting algorithms are more efficient than label setting algorithms for solving both the MSPP and the CMSPP. The second of these two chapters proposes two fast local search algorithms for the MSPP. Four performance indicators are used to evaluate the local search solutions. Computational results demonstrate that local search algorithms are faster than all heuristic methods for the MSPP presented in literature, and able to produce reasonably good-quality solutions.

PDF
Final PhD thesis - Yi Qu.pdf - Other
Download (2MB)

More information

Submitted date: February 2016
Organisations: University of Southampton, Southampton Business School

Identifiers

Local EPrints ID: 388122
URI: http://eprints.soton.ac.uk/id/eprint/388122
PURE UUID: 8bf48cb7-c5a0-4d06-b312-36d49e4b2417
ORCID for Tolga Bektas: ORCID iD orcid.org/0000-0003-0634-144X

Catalogue record

Date deposited: 01 Mar 2016 12:21
Last modified: 01 Mar 2019 05:01

Export record

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×