.png){kind=icon}
返回
Solving the Curfew Planning Problem
.png){kind=icon}
PRE
AI
DOI：10.1287/trsc.1100.0323.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the curfew planning problem (CPP) encountered by railroads for the maintenance of their railway tracks. The CPP is to design an optimal annual timetable to complete a given set of repairs and replacement jobs (rail work and tie work) on the railway tracks for a set of crews specialized in rail work (rail crew) or tie work (tie crew). We develop the work schedule for each crew such that the disruptions in train routes because of subdivision curfews are minimized. A subdivision is said to be under curfew if any crew is working in it. The solution to the problem must also satisfy several operational and regulatory requirements such as the crew continuity, time windows, the maximum interproject distance travelled by crews, etc. Our paper presents four solution approaches for the CPP: (i) time-space network model (TSNM), (ii) duty-generation model (DGM), (iii) column-generation model (CGM), and (iv) decomposition-based heuristics. We solve each model using CPLEX and present the computational results based on real-life instances.
Keyword:
curfew planning
timetabling
track maintenance
column generation
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.8
论文数:
1.9K
被引数:
8.4K
机构
引用论文
Representing software usage models with stochastic automata networks.png)
Proceedings of the 14th international conference on Software engineering and knowledge engineering
Proceedings of the 14th international conference on Software engineering and knowledge engineeringIF0
PREAI
分享收藏Vimentin-positive Cells in the Epithelium of Rabbit Ileal Villi Represent Cup Cells but not M-cells
OAAI
OAAI分享收藏 没有更多内容
没有更多内容