论文部分内容阅读
首先介绍承认车计划审批问题,并在分析各种优化目标和限制条件的基础上,提出自动审批承认车的数学模型,说明问题属于NP完备问题,在目前条件下仅能采用启发式算法。同时由于实例规模过大,一般启发式算法所耗费的时间仍然难以接受,因此结合实例的特性给出了一种特定启发式算法。铁路现场实际使用表明,此算法对实例能够在5 min内得到满意解,所得解的各项指标均符合日常装车方案要求,具有鲜明的实用特点,有效解决了铁路局货运营销中,如何审批承认车可带来最大收益问题。
First of all, it introduces the approval of car plan. Based on the analysis of various optimization objectives and constraints, it proposes a mathematical model that automatically approves and admits vehicles, indicating that the problem belongs to the NP complete problem. Only the heuristic algorithm can be used under the current conditions. At the same time, due to the large size of the instance, the time spent by the general heuristic algorithm is still unacceptable. Therefore, a specific heuristic algorithm is given based on the characteristics of the instance. The actual use of the railway site shows that this algorithm can be satisfactorily solved within 5 min for each instance, and all the indexes obtained are in line with the requirements of daily loading plan. It has distinct practical features and effectively solves the problem of how to approve Recognize that the car can bring the biggest gains.