利用改进鹈鹕优化算法求解TSP问题

Solving TSP Problem with Improved Pelican Optimization Algorithm

为使鹈鹕优化算法(Pelican Optimization Algorithm,POA)能够应用于求解旅行商(Traveling Salesman Problem,TSP)问题,引入2条路径启发式交叉操作和依据概率的倒序变异操作,对鹈鹕优化算法的位置更新方式进行修改,提出一种利用改进鹈鹕优化算法求解TSP问题的新方法。应用实例测试分析结果表明:该方法切实可行,求解结果较为满意,运行稳定性较好。

In order to apply Pelican Optimization Algorithm(POA)to solve Traveling Salesman Problem(TSP),the position update way of POA is modified by introducing two path heuristic crossover operations and the reverse mutation operation based on probability.A new method to solve TSP problem with improved pelican optimization algorithm is put forward.The results of example application test and analysis shows that this method is practical and feasible,the solution results are satisfactory and the operation stability is good.