铁路承认车最优分配模型与算法研究

首先介绍承认车计划审批问题,并在分析各种优化目标和限制条件的基础上,提出自动审批承认车的数学模型,说明问题属于NP完备问题,在目前条件下仅能采用启发式算法。同时由于实例规模过大,一般启发式算法所耗费的时间仍然难以接受,因此结合实例的特性给出了一种特定启发式算法。铁路现场实际使用表明,此算法对实例能够在5 min内得到满意解,所得解的各项指标均符合日常装车方案要求,具有鲜明的实用特点,有效解决了铁路局货运营销中,如何审批承认车可带来最大收益问题。

The Optimum Model and Algorithm for Approved Rail Car Allocation

The paper introduces the problems in car approving. On the basis of analyzing different optimal targets and constraints a mathematical model is raised for approving cars. The problems belong to NP_Complete , and there exists only one way to address the problems at the present conditions, that is the heuristic algorithm. Common heuristic algorithms do not work since they cost too much time to handle the excessive amount of issues, therefore a particular heuristic algorithm is put forward. Site application shows that the algorithm can get one satisfactory solution within 5 minutes and the solution indices meet all requirements of daily car distribution plans. It is effectively solved as to the problem how to approve cars to bring about the maximum incomes in freight marketing.