摘要： 调机路径规划的核心是合理编排各台编组(解体)调机的移动路径以完成编组(解体)任务。但目前的编制工作仍以人工为主,存在编制作业的工作量大、计划编制不及时、计划调整困难等问题。为此,给出基于回答集程序(ASP)与有限域约束逻辑程序(CLP(FD)) 的设计方法。在轨道规模增大的情况下,讨论2种方法在求解不同问题规模时的时间效率以及对应求解器的运行规律。实验结果表明,ASP在解决调机路径规划问题时比CLP(FD)表现更优,能快速地得到路径编排结果,对应的DLV求解器能更有效地克服轨道数目增减带来的影响。

关键词: 调机路径规划, 回答集程序, 有限域的约束逻辑程序, 求解器, 逻辑程序

Abstract: The core of the shunting engine path planning is to arrange the moving path of each group (disintegration) to complete the grouping(disintegration) task.But the current preparation work is still man-mode,there is big workload,planning is not timely and difficult to adjust.Therefore,a logic programming method based on Answer Set Program(ASP) and Constraint Logic Program over Finite Domains(CLP(FD)) is given.In the case of increasing orbital scale,the time efficiency of the two methods in solving different problem scales and the operation of the corresponding solver are discussed.Experimental results show that ASP is better than CLP(FD) in solving this kind of problem,and the results of path scheduling can be obtained quickly.The corresponding DLV solver can overcome the influence of increasing or decreasing the number of tracks.

Key words: shunting engine path planning, Answer Set Program(ASP), Constraint Logic Program over Finite Domains (CLP (FD)), solver, logic program

中图分类号: 

• TPTP311