摘要
动态灾害环境下多对多物资配送路径规划问题具有重大的现实意义,它需要在路径规划的同时应对路网环境随时间的变化,并找到不同应急物资储备点、配送点之间的最佳对应关系,同时保证求解的时效性和成功率。目前的静态预案规划方法(SPO)和动态路径规划方法(DPO)难以确保动态灾害环境下求解效果的理论最优性,甚至可能导致部分配送点不能及时获得应急物质的配送。通过对基于涟漪扩散算法(RSA)的协同进化路径优化(CEPO)方法的修改将其扩展到动态灾害环境下多对多问题的求解,实现通过一次离线运算得到动态灾害环境下多对多路径优化问题的理论最优解。并通过实验验证了该方法的可行性和优越性。
Under the dynamic disaster environment, the route planning problem of many-to-many materials distribution has great practical significance. It needs to deal with the change of road network environment with time while planning the path, find the optimal correspondence between different materials reserve sites and residential areas, and guarantee the timeliness and success rate of solution. The current static plan optimization(SPO)and dynamic path optimization(DPO)method is difficult to ensure the theoretical optimality of the solution effect in the dynamic disaster environment, and may even lead to the failure of some residential areas to obtain the distribution of materials in time. By modifying the method of co-evolutionary path optimization(CEPO)based on ripple spreading algorithm(RSA), it extended to solve the manyto-many problem in the dynamic disaster environment, so as to obtain the theoretical optimal solution of the many-tomany path optimization problem in the dynamic environment through a single off-line operation. The feasibility and superiority of the method are verified by experiments.
作者
胡小兵
孟相至
HU Xiaobing;MENG Xiangzhi(College of Electronic Information and Automation,Civil Aviation University of China,Tianjin 300300,China;Sino-European Institute of Aviation Engineering,Civil Aviation University of China,Tianjin 300300,China)
出处
《计算机工程与应用》
CSCD
北大核心
2022年第8期297-306,共10页
Computer Engineering and Applications
基金
国家自然科学基金(61472041)。