查看文章

This paper proposes a route-based model for the Train Platforming and Rescheduling Problem (TPRP). Built on the concept of Degree of Conflict (DOC), the proposed model can accommodate various interlocking mechanisms with an aggregate railway yard representation. Thanks to the topology of a typical yard, such an aggregate representation promises to reduce the size of the optimization problems concerning yard operations. The TPRP model is formulated as a mixed integer linear program, and solved using both a commercial solver and two heuristic algorithms developed based on the idea of rolling horizon. The proposed model and algorithms are validated using several case studies constructed using data collected at a large high-speed railway station in China. We find the proposed TPRP model can produce, with reasonable computation resources, high quality platform/schedule decisions for real-world …