直达配送式保障路径优化问题研究

Optimizing Routing Problem in Distribution-mode Support

对配送式保障中装卸混合和任务组合的路径优化问题,文章建立了考虑实际载重量的动态费用计算模型,在运用基本蚁群算法的基础上,改变了常用的以地点为基础的编码方式,取之以具体作业作为编码基础,既简化了这类复杂路径问题的算法设计,也便于算法的编程实现,并在局部作业路径搜索时根据问题特点设计了相应的启发式算法,并通过编程运行实验,证明了该算法的有效性。

As to a kind of routing optimization problem with combined pick up and delivery and task combination in distribution-mode support, a dynamic expenditure coefficient model according to the actual load is established, and based on basic ant colony algorithm the cod ing method is changed from based on site to based on operation. It makes the algorithm design and program easier. In the local operation routing search the corresponding heuristics algorithm is designed. By programming and calculating, an example proves the algorithm is effectual;