Optimal allocation of buffer times to increase train schedule robustness
详细信息 查看全文
- 作者：Predrag Jovanović ; a ; p.jovanovic@sf.bg.ac.rs" class="auth_mail" title="E-mail the corresponding author ; Pavle Kecmanb ; pavle.kecman@liu.se" class="auth_mail" title="E-mail the corresponding author ; Neboj&scaron ; a Bojovića ; nb.bojovic@sf.bg.ac.rs" class="auth_mail" title="E-mail the corresponding author ; Dragomir Mandića ; drama@sf.bg.ac.rs" class="auth_mail" title="E-mail the corresponding author
- 关键词：Buffer times ; Capacity ; Knapsack problem ; Timetable robustness
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：1 January 2017
- 年：2017
- 卷：256
- 期：1
- 页码：44-54
- 全文大小：1123 K
文摘
- class="listitem" id="list_celist0003">
- class="label">•
A knapsack problem based approach is proposed for computing the optimal allocation of buffer times.
- class="label">•
The priority of each candidate is determined with respect to its delay sensitivity and delay impact to all other events.
- class="label">•
The optimal amount of buffer for each minimum headway time is determined.