Multiobjective Routing and Transportation Problems

ResearchSpace/Manakin Repository

Show simple item record

dc.contributor.advisor Associate Professor Matthias Ehrgott en
dc.contributor.advisor Dr. Stuart Mitchell en
dc.contributor.advisor Dr. Judith Y.T. Wang en
dc.contributor.author Raith, Andrea en
dc.date.accessioned 2009-12-21T03:42:20Z en
dc.date.available 2009-12-21T03:42:20Z en
dc.date.issued 2009 en
dc.identifier.citation Thesis (PhD--Engineering Science)--University of Auckland, 2008. en
dc.identifier.uri http://hdl.handle.net/2292/5612 en
dc.description.abstract Real life decision making takes into account multiple, often conflicting, criteria. This gives rise to multi-objective optimisation. We discuss a range of different bi-objective routing or transportation problems, in particular the shortest path, integer minimum cost flow, and traffic assignment problems. The first part of this thesis is dedicated to the bi-objective shortest path problem. The problem is presented together with several well-known solution algorithms, namely bi-objective labelling, ranking, and the Two Phase method. Computational experiments highlight the strengths and weaknesses of the algorithms for different types of problem instances. We introduce new variations of the algorithms above and propose an easily implemented improvement for bi-objective labelling. Cyclist route choice in road networks is presented as a new application of the bi-objective shortest path problem, where cyclists aim to reach their destination in minimal travel time, but also along a safe route. For the bi-objective integer minimum cost flow problem, we introduce one of the first solution algorithms based on the Two Phase method and demonstrate its performance based on different types of problem instances. An improvement of the algorithm for the transportation problem, a special case, is also discussed. Finally, multi-objective traffic assignment is discussed. Traffic assignment is the process of modelling route choice of users of a (road) network in order to determine the total traffic on each road of the network. This is an equilibrium problem as the route choice of one traveller affects other travellers. We show how, traditionally, multiple objectives are treated in traffic assignment, often by combining them into a generalised cost function which may entail strong assumptions on road user behaviour. Instead, we suggest to explicitly distinguish the objectives in a multi-objective framework. We discuss existing literature, which is of mainly theoretical nature, and comment on several articles presenting erroneous results. We contribute to the understanding of the theoretical concepts of vector equilibrium, vector variational inequalities, and vector optimisation. For the solution of bi-objective traffic assignment, we propose novel heuristic algorithms based on bi-objective shortest path algorithms as an important building block. en
dc.publisher ResearchSpace@Auckland en
dc.relation.ispartof PhD Thesis - University of Auckland en
dc.relation.isreferencedby UoA1941811 en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.rights.uri http://creativecommons.org/licenses/by-nc-sa/3.0/nz/ en
dc.title Multiobjective Routing and Transportation Problems en
dc.type Thesis en
thesis.degree.discipline Engineering Science en
thesis.degree.grantor The University of Auckland en
thesis.degree.level Doctoral en
thesis.degree.name PhD en
dc.date.updated 2009-12-21T03:42:20Z en
dc.rights.holder Copyright: The author en
pubs.local.anzsrc 09 - Engineering en
pubs.org-id Faculty of Engineering en


Full text options

This item appears in the following Collection(s)

Show simple item record

http://creativecommons.org/licenses/by-nc-sa/3.0/nz/ Except where otherwise noted, this item's license is described as http://creativecommons.org/licenses/by-nc-sa/3.0/nz/

Share

Search ResearchSpace


Advanced Search

Browse