摘要
通过考虑分析编组站作业流程,根据Petri网理论,将Pr/T_系统扩展为基于时延性的TPr/T_系统,在此基础上,逐步建立编组站TPr/T_系统模型。在模型中,以列车(车列)为元组,解决配流对资源的约束;通过谓词容量限制,解决配流在空间上的约束;通过变迁限制,解决配流对时间的约束。系统以满轴、尽量不晚点为优化目标,根据反向推理思想设计算法,以求得较为合理的配流方案。最后,通过实例,验证提出理论的合理性。
The model of TPr/T_system about marshalling yard is built, by extending Pr/T_system to TPr/T_system,according to Petri net theory and the marshalling yard operation procedure. In the model, regarding train or car row as a tuple to restrain the resource condition to wagon-flow allocation. By restraining the predicate capacity to settle the space constrain, besides, the time constraint is settled by restraining transition. In order to obtain a reasonable scheme about wagon-flow allocation, the full axis departure, as far as possible with the punctual departure, is regarded as the optimization goal in the model. The optimization goal can be realized by using the algorithm based on the backward reasoning thought. Finally, an example is used to verify the rationality of the theory presented by the paper.
出处
《计算机工程与应用》
CSCD
北大核心
2017年第21期219-224,253,共7页
Computer Engineering and Applications
基金
国家自然科学基金(No.61364028)
教育部人文社科规划基金项目(No.15XJAZH002)
兰州市科技局研政产合作支撑计划项目(No.2011-1-111)
