一种求解资源约束条件下运输优化问题的启发式方法

Heuristic Algorithm for Solving Resources Constrained Transportation Optimization Problem

介绍了一种求解资源约束条件下的大规模组合优化运输问题的启发式方法。由于现实生活中的运输系统的复杂性,与总运输时间相关的目标函数无法用解析方法给出,在这种条件下它需要通过仿真运行得到,同时运输资源(主要指道路和中转站等)的限制又增加了优化的难度,传统的求解这种瓶颈运输问题的网络流方法无法处理。本文介绍的启发式方法充分利用了仿真模型对于系统的直观描述特性,将资源约束的求解反馈到优化过程中,取得了较好的效果。

This paper introduces a heuristic algorithm to solve a large-scale combinatorial optimization problem for transportation problem with constrained resources. Because of the complexity of the real transportation system, the objective function of its performance about the total transportation time cannot be obtained by analytic method. At the same time, the difficulty in optimization process increased by the constraints of resources about the route and transfer station, so the traditional network method has no way to solve such bottleneck transportation problem. The heuristic algorithm provided in this paper utilizes the property of simulation on real system and the feedback from the constraint to solve this difficulty and demonstrate a satisfied optimization result.