In open railway access markets, a train service provider (TSP) negotiates with an\ud infrastructure provider (IP) for track access rights. This negotiation has been modeled by a\ud multi-agent system (MAS) in which the IP and TSP are represented by separate software\ud agents. One task of the IP agent is to generate feasible (and preferably optimal) track access\ud rights, subject to the constraints submitted by the TSP agent. This paper formulates an\ud IP-TSP transaction and proposes a branch-and-bound algorithm for the IP agent to identify\ud the optimal track access rights. Empirical simulation results show that the model is able to\ud emulate rational agent behaviors. The simulation results also show good consistency between\ud timetables attained from the proposed methods and those derived by the scheduling principles\ud adopted in practice
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.