A Train Stop Deployment Planning Algorithm Using a Petri-net-based Modelling Approach
Authors:
- Chikara HiraiCHChikara Hirai
- Taketoshi KunimatsuTKTaketoshi Kunimatsu
- Norio TomiiNTNorio Tomii
- Shigeki KondouSKShigeki Kondou
- Motoshi TakabaMTMotoshi Takaba
- 1 January 2009
- journal article
- Published by Railway Technical Research Institute in Quarterly Report of RTRI
- Vol. 50 (1) , 8-13
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- An Advanced Real-Time Train Dispatching System for Minimizing the Propagation of Delays in a Dispatching Area Under Severe DisturbancesNetworks and Spatial Economics, 2008
- Train Rescheduling Algorithm Which Minimizes Passengers’ Dissatisfaction2005
- A multi-objective train scheduling model and solutionTransportation Research Part B: Methodological, 2004
- Present Situations and Problems of Traffic Control SystemThe Journal of The Institute of Electrical Engineers of Japan, 2004
- Scheduling and platforming trains at busy complex stationsTransportation Research Part A: Policy and Practice, 2003
- A primitive recursive algorithm for the general Petri net reachability problem2002
- A Survey of Optimization Models for Train Routing and SchedulingTransportation Science, 1998
- A method for finding firing sequences for the reachability problem of Petri nets with mathematical programming techniqueIEEJ Transactions on Electronics, Information and Systems, 1996
- Petri nets: Properties, analysis and applicationsProceedings of the IEEE, 1989
- An Algorithm for the General Petri Net Reachability ProblemSIAM Journal on Computing, 1984