Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Electrical Engineering | en_US |
| dc.creator | Tsang, Chi-wai | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/2869 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Modelling negotiations in open railway access market for resource allocation | en_US |
| dcterms.abstract | An open railway access market usually consists of an infrastructure provider (IP) and a group of train service providers (TSPs). Through disintegration and distribution, the managerial responsibilities on railway resources are allocated to these stakeholders. To harmonise the interrelated resource allocation processes, negotiation among the stakeholders is an important and inevitable process to resolve the operational conflicts. This study aims to develop a software platform to enable such negotiations and investigate the behaviour of the stakeholders in negotiations. To address the distributed nature of the stakeholders and their behaviour during negotiation, a Multi-Agent System for Open Railway Access Market (MAS-ORAM) is established. MAS-ORAM is a virtual market where each stakeholder is represented by a software agent. With this system, the study focuses on modelling three major negotiations among the stakeholders (i.e. IP vs. TSP, IP vs. multiple TSPs, and TSP vs. TSP). Such representations of the open market and the subsequent study on the interactions between the stakeholders in railway management, particularly for open access markets, are the novelty of this research work. To facilitate rational decision-making by agents, not only has the study employed algorithms of standard optimisation techniques, but also of artificial intelligence approaches. The former includes Branch-and-Bound and Lemke’s Complementary Pivoting algorithms, while the latter involves the solving of a Prioritised Fuzzy Constraint Satisfaction problem. In addition, two policies on sequencing multiple negotiations by an IP and three negotiation strategies for TSPs have been devised. The performances of these algorithms and negotiation behaviours have been thoroughly examined through extensive simulation studies and statistical analysis. | en_US |
| dcterms.abstract | Simulation results have shown that software agents can be set up to represent railway stakeholders of different operation objectives. During negotiation, these agents exhibit rational behaviour in making concession. Results have also confirmed that the setup of MAS-ORAM is able to derive Pareto-optimal resource plans. The system, with proper enhancements and adaptation to a specific railway market, may thus be deployed by the open railway access market stakeholders as an analytical tool before the actual negotiations are conducted in practice. The research also demonstrates the feasibility of applying agent modelling in railway management. | en_US |
| dcterms.extent | xviii, 242, [21] p. : ill. ; 31 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2007 | en_US |
| dcterms.educationalLevel | All Doctorate | en_US |
| dcterms.educationalLevel | Ph.D. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations. | en_US |
| dcterms.LCSH | Resource allocation. | en_US |
| dcterms.LCSH | Railroads -- Management. | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b20940427.pdf | For All Users | 3.36 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/2869