基于差分进化算法的穿越走廊可行网络优化问题

Viable Network Optimization Problemof Cross-corridor Based on Differential Evolution Algorithm

针对考虑限制空域的穿越走廊可行网络优化问题,将穿越走廊网络优化问题转化为无干涉路径点布局优化问题,建立无干涉路径点布局模型;根据无干涉路径点布局问题的特点,设计了个体评价标准和个体修复算子,以利于差分进化算法对优化模型进行求解。实例表明,较之于初始规划结果,所提出方法的各项性能指标有了明显提高,从而验证了方法用于穿越走廊优化设计的有效性和可行性。

For the viable network optimization problem of the cross-corridor considering the restricted airspace,firstly,the network optimization problem of the cross-corridor is transformed into the non-interference path point layout optimization problem,and the non-interference path point layout model is established.Then,according to the characteristics of the non-interference path point layout problem,the individual evaluation criteria and individual restoration operators are designed to facilitate the differential evolution algorithm for solving the optimization model.The actual example shows that,compared with the initial planning results,the performance indices of the proposed method have been significantly improved.This validates the effectiveness and feasibility of the proposed method in the application of cross-corridor optimization design.