A clonal selection algorithm with adaptive quantum crossover(AQCCSA)is proposed to overcome the premature convergence drawback of traditional clonal selection algorithms(CSA)and to solve the holes machining path optimization problems(HMPOP). The effect of high affinity antibodies on low affinity antibodies is used to accelerate the convergence process in the first half evolution process. Then the disturbance effect of low affinity antibodies on high affinity antibodies is used to help the algorithm escaping from local optimum in the last half evolution process. Experimental results on traveling salesman problems(TSP)
single-objective and multi-objective HMPOP show that the proposed algorithm achieves a good balance between global searches and local mining
and the convergence speed and robustness of the algorithm are better than those of other CSAs and heuristic algorithms.
LING Ling, HU Yujin, WANG Qingqing, et al. Holes machining path optimization using the improved genetic algorithm[J]. Journal of Huazhong University of Science and Technology, 2009, 37(8): 88-91.
ABBAS A, ALY M, HAMZA K. Optimum drilling path planning for a rectangular matrix of holes using ant colony optimisation[J]. International Journal of Production Research, 2011, 49(19): 5877-5891.
ZHU Guangyu, ZHANG Weibo. Drilling path optimization by the particle swarm optimization algorithm with global convergence characteristics[J]. International Journal of Production Research, 2008, 46(8): 2299-2311.
CAI Yun, ZHOU Liwei. Holes machining path optimization using an artificial fish swarm algorithm[J]. Journal of Wuhan University of Science and Technology, 2011, 34(3): 182-185.
JIAO Licheng, LI Yangyang, GONG Maoguo, et al. Quantum-inspired immune clonal algorithm for global optimization[J]. IEEE Transactions on System, Man and Cybernetics: Part B, 2008, 38(5): 1234-1253.
XIAO Renbin, TAO Zhenwu. Solution to holes machining path planning by evolutionary methods[J]. Computer Integrated Manufacturing System, 2005, 11(5): 682-689.
LI Yangyang, XIANG Rongrong, JIAO Licheng, et al. An improved cooperative quantum-behaved particle swarm optimization[J]. Soft Computing, 2012, 16(6): 1061-1069.
NARAYANAN A, MOORE M. Quantum-inspired genetic algorithm[C]∥Proceedings of IEEE International Conference on Evolutionary Computation. Piscataway, NJ, USA: IEEE, 1996: 61-66.
LI Yangyang, JIAO Licheng. Quantum clonal algorithm for multicast routing problem[J]. Journal of Software, 2007, 18(9): 2063-2069.
GAO Shangce, DAI Hongwei, YANG Gang, et al. A novel clonal selection algorithm and its application to traveling salesman problems[J]. IEICE Transaction on Fundamentals of Electronics, Communications and Computer Sciences, 2007, 90(10): 2318-2325.
HONG Lu, JI Zhicheng, GONG Chenglong. On an improved clonal selection algorithm and its almost sure strong convergence[J]. Control and Decision, 2010, 25(5): 725-729.
CHANG Pei-Chann, HUANG Wei-Hsiu, TING Ching-Jung. Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems[J]. Expert Systems with Applications, 2010, 37(4): 1863-1878.
DAI Hongwei, YANG Yu, LI Cunhua, et al. Quantum interference crossover-based clonal selection algorithm and its application to traveling salesman problem[J]. IEICE Transaction on Information System, 2009, 92(1): 78-85.
LIU Min, ZENG Wenhua, ZHAO Jianfeng. A fast biobjective non-dominated sorting algorithm[J]. Pattren Recognition and Artificial Intelligence, 2011, 24(4): 538-547.