论述客运专线客运站中列车到发线和进路占用时间范围的确定方法,并在充分考虑客运站咽喉能力的限制和旅客的换乘要求的基础上,建立到发线运用计划编制的0~1整数规划模型。然后根据软约束和硬约束的不同影响,设计一种适应于上述0~1规划模型的启发式算法,此算法将每次的搜索空间限制为可用到发线集,大大减小搜索空间,提高搜索效率。最后利用此算法对实例进行验证。 Discusses the method of determining the train arrival time and the occupation time range of passenger train line in passenger dedicated railway line, and establishes the route to railway line of 0 ~ 1 integer programming model. Then, according to the different influences of soft constraints and hard constraints, a heuristic algorithm that adapts to the above 0 ~ 1 programming model is designed. This algorithm limits each search space to the available hairline set, greatly reduces the search space and increases Search efficiency. Finally use this algorithm to verify the instance.