Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/9065
Title: Optimal track access rights allocation for agent negotiation in an open railway market
Authors: Tsang, CW
Ho, TK
Keywords: Agent negotiation
Branch-and-bound (BNB) algorithm
Open railway markets
Track access rights
Issue Date: 2008
Publisher: Institute of Electrical and Electronics Engineers
Source: IEEE transactions on intelligent transportation systems, 2008, v. 9, no. 1, 4459096, p. 68-82 How to cite?
Journal: IEEE transactions on intelligent transportation systems 
Abstract: In open railway access markets, a train service provider (TSP) negotiates with an infrastructure provider (IP) for track access rights. This negotiation has been modeled by a multiagent system in which the IP and the TSP are represented by separate software agents. One of the tasks of the IP agent is to generate feasible (and preferably optimal) track access rights, subject to the constraints submitted by the TSP agent. This paper formulates an IP-TSP transaction and proposes a branch-and-bound algorithm for the IP agent to identify the optimal track access rights. Empirical simulation results show that the model is able to emulate rational agent behaviors. The simulation results also show good consistency between the timetables that were attained from the proposed methods and those that were derived by the scheduling principles adopted in practice.
URI: http://hdl.handle.net/10397/9065
ISSN: 1524-9050
EISSN: 1558-0016
DOI: 10.1109/TITS.2007.908143
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

12
Last Week
0
Last month
0
Citations as of Sep 15, 2017

WEB OF SCIENCETM
Citations

8
Last Week
0
Last month
0
Citations as of Sep 22, 2017

Page view(s)

26
Last Week
0
Last month
Checked on Sep 18, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.