A Quick Algorithm for Railroad Car Rearrangement

摘要：

The problem of railroad car rearrangement is a frequent question in the actual production. Through the analysis of the problem, this paper designed a algorithm to solve the problem by using the stack structure, and produced an algorithm analysis, determined O(kn) as its time complexity. So it is quick algorithm to solve the problem.

关键词： stack holding track LIFO

作者: Lu LIU

作者单位: College of Mathematics and Computer Science, Hengshui University Hengshui,Hebet,China

会议类型: 国际会议

会议名称: The Third International Conference on Modelling and Simulation(第三届国际建模、计算、仿真、优化及其应用学术会议 ICMS 2010)

会议地点: 无锡

会议语种:英文

页码: 190-193

在线出版日期: 2010-06-04（万方平台首次上网日期，不代表论文的发表时间）