CAJ | 학술논문

针对基本萤火虫群优化算法的早熟收敛，易陷入局部最优值，求解精度不高等问题，提出了一种基于切比雪夫映射的混沌萤火虫优化算法。利用混沌系统的随机性和遍历性初始化萤火虫群，获得了质量较高且分布较均匀的初始解；同时对部分适应值低的个体进行了混沌优化，以提高种群的多样性。对4个标准测试函数进行了仿真实验，结果表明该算法的求解精度、全局搜索能力优于基本萤火虫优化算法。将改进算法应用于车辆路径问题的求解中，结果表明了改进算法的有效性。
침대기본형화충군우화산법적조숙수렴，역함입국부최우치，구해정도불고등문제，제출료일충기우절비설부영사적혼돈형화충우화산법。이용혼돈계통적수궤성화편력성초시화형화충군，획득료질량교고차분포교균균적초시해；동시대부분괄응치저적개체진행료혼돈우화，이제고충군적다양성。대4개표준측시함수진행료방진실험，결과표명해산법적구해정도、전국수색능력우우기본형화충우화산법。장개진산법응용우차량로경문제적구해중，결과표명료개진산법적유효성。
To overcome the disadvantages of premature convergence, local optimum and low precision in basic glow-worm swarm optimization (GSO) algorithm, this paper proposes a chaotic glowworm swarm optimization (CGSO) algorithm based on Chebyshev map. CGSO applies the features of chaotic randomness and ergodicity to initial the glowworm population. Therefore, it can achieve high quality and uniformly distributed initial solutions. Meanwhile, in order to increase the diversity of population, the proposed algorithm disturbs the partial individuals with low fitness value by Chebyshev map. The experiments on four standard test functions show that CGSO outperforms the basic GSO in precision and global searching ability. Finally, the improved algorithm is applied to vehicle routing problem (VRP), the results show that the algorithm is effective.