An Improved Chaos Electromagnetism Mechanism Algorithm for Path Optimization Problem

Abstract

<p><em>As we all know, traditional electromagnetism mechanism</em><em> </em><em>(EM) algorithm has the disadvantage with low solution precision, lack of mining ability and easily falling into precocity. This paper proposes a new chaos electromagnetism mechanism algorithm combining chaotic mapping with limited storage Quasi-Newton Method</em><em> </em><em>(EM-CMLSQN). Its main idea is that it adopts limit quasi-Newton operator to replace the local optimization operator in EM algorithm for local searching in the late of algorithm. In the process of algorithm, the chaos mapping is introduced into optimization processes, and it generates new individuals to jump out of local to maintain the population diversity according to characteristics of chaos mapping random traversal. Finally, the experiments show that the new algorithm can effectively jump out of local optimal solution through comparing three continuous space test functions. The new algorithm has obvious advantages in terms of convergence speed compared to traditional EM algorithm, in addition, it is more accuracy than particle swarm optimization</em><em> </em><em>(PSO) algorithm. We compare the new chaos electromagnetism mechanism algorithm with ant colony optimization</em><em> </em><em>(ACO) algorithm, PSO algorithm, the results represent that new scheme can obtain the optimal path in the path optimization process, which shows that the new method has better applicability in the discrete domain problem</em>.</p>