Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/4986
Full metadata record
DC FieldValueLanguage
dc.contributor.authorBasra, R-
dc.contributor.authorLü, K-
dc.contributor.authorRzevski, G-
dc.date.accessioned2011-04-08T13:29:46Z-
dc.date.available2011-04-08T13:29:46Z-
dc.date.issued2005-
dc.identifier.citationHolonic and Multi-Agent Systems for Manufacturing; Lecture Notes in Compter Science, Volume 3593/2005, 188-196en_US
dc.identifier.urihttp://bura.brunel.ac.uk/handle/2438/4986-
dc.descriptionThe published version of this article may be accessed from the link below - Copyright @ 2005 Springer-Verlagen_US
dc.description.abstractWe consider the scheduling issues for The London Underground (LU), which spans the entire city, and is a vast network of inter-related railway lines. By its very nature, it is a dynamic, complex and unpredictable environment; operating or being maintained 24 hours-a-day. This paper reports on an investigation into how a Multi-Agent System (MAS) may be used for resolving scheduling issues for LU. It is a previously unexplored domain. A prototype system MASLU is developed through the use of MAS technology, in an innovative and unique manner, with a view to resolving the London Undergrounds scheduling issues in real time.en_US
dc.language.isoenen_US
dc.publisherSpringer-Verlagen_US
dc.subjectArtificial intelligence (AI)en_US
dc.subjectMulti-agent systems (MAS)en_US
dc.subjectIntelligent agents (IA)en_US
dc.subjectLondon Undergrounden_US
dc.subjectRailway schedulingen_US
dc.subjectAgent-based systemsen_US
dc.subjectTube networken_US
dc.subjectLogisticsen_US
dc.subjectIntelligent systemsen_US
dc.subjectIntelligent schedulingen_US
dc.titleResolving scheduling issues of the London Underground using a multi-agent systemen_US
dc.typeResearch Paperen_US
dc.identifier.doihttp://dx.doi.org/10.1007/11537847_17-
Appears in Collections:Business and Management
Brunel Business School Research Papers

Files in This Item:
There are no files associated with this item.


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