基于混沌搜索和错卦变换的阴阳平衡优化算法

doi:10.11772/j.issn.1001-9081.2020010089

计算机应用 ›› 2020, Vol. 40 ›› Issue (8): 2305-2312.DOI: 10.11772/j.issn.1001-9081.2020010089

基于混沌搜索和错卦变换的阴阳平衡优化算法

许秋艳, 马良, 刘勇

上海理工大学管理学院, 上海 200093

收稿日期:2020-02-02 修回日期:2020-03-25 出版日期:2020-08-10 发布日期:2020-03-28
通讯作者: 许秋艳(1981-),女,江苏东台人,博士研究生,主要研究方向:智能优化、系统工程,44424072@qq.com
作者简介:马良(1964-),男,上海人,教授,博士,主要研究方向:智能优化、系统工程;刘勇(1982-),男,江苏金湖人,副教授,博士,主要研究方向:智能优化、系统工程。
基金资助:
教育部人文社会科学研究规划基金资助项目（16YJA630037）；上海市“科技创新行动计划”软科学研究重点项目（17692109400，18692110500）；上海市哲学社科规划课题（2019BGL014）；上海市高原学科建设项目（第二期）。

Yin-Yang-pair optimization algorithm based on chaos search and intricate operator

XU Qiuyan, MA Liang, LIU Yong

Business School, University of Shanghai for Science and Technology, Shanghai 200093, China

Received:2020-02-02 Revised:2020-03-25 Online:2020-08-10 Published:2020-03-28
Supported by:
This work is partially supported by the Ministry of Education's Fund for Research in Humanities and Social Sciences (16YJA630037), the Key Project of Soft Science Research in Shanghai "Science and Technology Innovation Action Plan" (17692109400, 18692110500), the Shanghai Philosophy and Social Science Planning Project (2019BGL014), the Plateau Discipline Construction Project of Shanghai (phase II).

摘要/Abstract

摘要： 针对基本阴阳平衡优化（YYPO）算法易早熟收敛的问题，基于混沌的遍历性，在算法中引入混沌搜索对更多区域进行探索，以提高全局探索能力。此外，借鉴《易经》中的错卦变换引入反向学习策略，对当前解的反向解进行集中搜索，提高局部开发能力。同时，为充分利用多核处理器等计算资源，还对算法进行了并行程序设计。采用标准测试函数进行数值实验，以测试基于混沌搜索和错卦变换的改进YYPO（CSIOYYPO）算法的求解性能。实验结果表明，与基本YYPO算法和自适应YYPO算法等YYPO算法以及其他类型智能优化算法相比，CSIOYYPO算法具有更高的计算精度和更快的优化速度。

关键词: 阴阳平衡优化算法, 混沌搜索, 错卦变换, 智能优化, 中国传统文化

Abstract: To solve the premature convergence problem of the basic Yin-Yang-Pair Optimization (YYPO) algorithm, the chaos search was introduced to the algorithm to explore more areas based on the ergodicity of chaos, so as to improve the global exploration capability. Besides, based on the intricate operator of I Ching, opposition-based learning was adopted to search for the opposite solutions to the current ones in order to improve the local exploitation ability. The design of parallel programming was also added to the algorithm to make full use of computing resources such as multi-core processors. Benchmark functions were used for numerical experiments to test the performance of the improved YYPO algorithm combined with chaos search and intricate operator, namely CSIOYYPO. Experimental results show that, compared with YYPO algorithms including basic YYPO algorithm and adaptive YYPO algorithm as well as other intelligent optimization algorithms, CSIOYYPO algorithm has higher calculation accuracy and higher convergence speed.

Key words: Yin-Yang-Pair Optimization (YYPO) algorithm, chaos search, intricate operator, intelligent optimization, Chinese traditional culture

中图分类号:

TP301.6

许秋艳, 马良, 刘勇. 基于混沌搜索和错卦变换的阴阳平衡优化算法[J]. 计算机应用, 2020, 40(8): 2305-2312.

XU Qiuyan, MA Liang, LIU Yong. Yin-Yang-pair optimization algorithm based on chaos search and intricate operator[J]. Journal of Computer Applications, 2020, 40(8): 2305-2312.

参考文献

[1] 段海滨,张祥银,徐春芳. 仿生智能计算[M]. 北京:科学出版社, 2011:11-20. (DUAN H B, ZHANG X Y, XU C F. Bio-inspired Computing[M]. Beijing:Science Press, 2011:11-20.)
[2] 张雷,范波.计算智能理论与方法[M].北京:科学出版社,2013:2-9. (ZHANG L, FAN B. Theories and Methods of Computational Intelligence[M]. Beijing:Science Press, 2013:2-9.)
[3] 黄竞伟,朱福喜,康立山.计算智能[M].北京:科学出版社,2010:22-29. (HUANG J W, ZHU F X, KANG L S. Computational Intelligence[M]. Beijing:Science Press, 2010:22-29.)
[4] 刘勇,马良,张惠珍,等.智能优化算法[M].上海:上海人民出版社,2019:1-9. (LIU Y, MA L, ZHANG H Z, et al. Intelligent Optimization Algorithms[M]. Shanghai:Shanghai People's Publishing House, 2019:1-9.)
[5] WOLPERT D H, MACREADY W G. No free lunch theorems for optimization[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1):67-82.
[6] HOLLAND J H. Genetic algorithms[J]. Scientific American, 1992, 267(1):66-73.
[7] 刘哲,邹涛,孙威,等. 结合实时优化遗传算法的磨削机器人阻抗控制[J]. 控制理论与应用, 2018, 35(12):1788-1795. (LIU Z, ZOU T, SUN W, et al. Impedance control of grinding robot based on real-time optimization genetic algorithm[J]. Control Theory and Applications, 2018, 35(12):1788-1795.)
[8] 贾叶玲,董绍华. 基于启发式遗传算法的混合流水车间成套订单问题[J]. 计算机应用, 2019, 39(9):2772-2777. (JIA Y L, DONG S H. Whole-set order problem of hybrid flow shop based on heuristic-genetic algorithms[J]. Journal of Computer Applications, 2019, 39(9):2772-2777.)
[9] KIRKPATRICK S, GELATT C D, VECCHI M P. Optimization by simulated annealing[J]. Science, 1983, 220(4598):671-680.
[10] 李元香,项正龙,夏界宁.模拟退火算法的动力系统模型及收敛性分析[J].计算机学报,2019,42(6):1161-1173. (LI Y X, XIANG Z L, XIA J N. Dynamical system models and convergence analysis for simulated annealing algorithm[J]. Chinese Journal of Computers, 2019, 42(6):1161-1173.)
[11] 钱龙,黄嵩,倪宣明,等.基于模拟退火算法的知情交易研究[J].系统科学与数学,2019,39(5):703-719. (QIAN L, HUANG S, NI X M, et al. Research of informed trading based on simulated annealing[J]. Journal of Systems Science and Mathematical Sciences, 2019, 39(5):703-719.)
[12] 马良.多目标平面选址问题的模拟退火算法[J].系统工程理论与实践,1997,17(3):70-73. (MA L. Simulated annealing algorithm for multi-objective planar location problem[J]. Systems Engineering-Theory and Practice, 1997, 17(3):70-73.)
[13] 印会河,张伯讷.中医基础理论[M].上海:上海科学技术出版社,2018:11-15. (YIN H H, ZHANG B N. Basic Theory of Traditional Chinese Medicine[M]. Shanghai:Shanghai Scientific and Technical Publishers, 2018:11-15.)
[14] PUNNATHANAM V, KOTECHA P. Yin-Yang-pair optimization:a novel lightweight optimization algorithm[J]. Engineering Applications of Artificial Intelligence, 2016, 54:62-79.
[15] HILLS T T, TODD P M, LAZER D, et al. Exploration versus exploitation in space, mind, and society[J]. Trends in Cognitive Sciences, 2015, 19(1):46-54.
[16] ALBA E, DORRONSORO B. The exploration/exploitation tradeoff in dynamic cellular genetic algorithms[J]. IEEE Transactions on Evolutionary Computation, 2005, 9(2):126-142.
[17] ZHOU Z, ONG Y S, NAIR P B, et al. Combining global and local surrogate models to accelerate evolutionary optimization[J]. IEEE Transactions on Systems, Man, and Cybernetics, Part C, 2007, 37(1):66-76.
[18] PUNNATHANAM V, KOTECHA P. Reduced Yin-Yang-pair optimization and its performance on the CEC 2016 expensive case[C]//Proceedings of the 2016 Congress on Evolutionary Computation. Piscataway:IEEE, 2016:2996-3002.
[19] MAHARANA D, KOMMADATH R, KOTECHA P. Dynamic Yin-Yang pair optimization and its performance on single objective real parameter problems of CEC 2017[C]//Proceedings of the 2017 Congress on Evolutionary Computation. Piscataway:IEEE, 2017:2390-2396.
[20] HEIDARI A A, KAZEMIZADE O, HAKIMPOUR F. A new hybrid Yin-Yang-pair-particle swarm optimization algorithm for uncapacitated warehouse location problems[J]. International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2017, XLII-4/W4:373-379.
[21] SONG D, LIU J, YANG J, et al. Optimal design of wind turbines on high-altitude sites based on improved Yin-Yang-pair optimization[J]. Energy, 2020, 193:No.116794.
[22] RAHNAMAYAN S, TIZHOOSH H R, SALAMA M M A. Opposition-based differential evolution[J]. IEEE Transactions on Evolutionary Computation, 2008, 12(1):64-79.
[23] CAPONETTO R, FORTUNA L, FAZZINO S, et al. Chaotic sequences to improve the performance of evolutionary algorithms[J]. IEEE Transactions on Evolutionary Computation, 2003, 7(3):289-304.
[24] RASHEDI E, NEZAMABADI-POUR H, SARYAZDI S. GSA:a gravitational search algorithm[J]. Information Sciences, 2009, 179(13):2232-2248.
[25] YANG X S. Nature-Inspired Metaheuristic Algorithms[M]. 2nd ed. Beckington:Luniver Press, 2010:21-39.

基于混沌搜索和错卦变换的阴阳平衡优化算法

Yin-Yang-pair optimization algorithm based on chaos search and intricate operator

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 11

编辑推荐

Metrics

[1]	张新明, 王豆豆, 陈海燕, 毛文涛, 窦智, 刘尚旺. 强化最优和最差狼的郊狼优化算法及其二次指派问题应用[J]. 计算机应用, 2019, 39(10): 2985-2991.
[2]	周海鹏, 高芹, 蒋丰千, 余大为, 乔焰, 李旸. 自适应混沌量子粒子群算法及其在WSN覆盖优化中的应用[J]. 计算机应用, 2018, 38(4): 1064-1071.
[3]	张斌, 李延晖, 郭昊. 基于反向学习的跨种群差分进化算法[J]. 计算机应用, 2017, 37(4): 1093-1099.
[4]	张新明, 康强, 王霞, 程金凤. 交叉反向学习和同粒社会学习的粒子群优化算法[J]. 计算机应用, 2017, 37(11): 3194-3200.
[5]	曹璐贾银平张安. 基于改进人工蜂群算法的多无人作战飞机协同航迹规划[J]. 计算机应用, 2013, 33(12): 3596-3599.
[6]	王培崇钱旭. 基于改进鱼群算法的路径测试数据生成[J]. 计算机应用, 2013, 33(04): 1139-1141.
[7]	李莉. 基于自适应参数与混沌搜索的PSO算法求解柔性作业车间调度问题[J]. 计算机应用, 2012, 32(07): 1932-1934.
[8]	黄美灵赵之杰浦立娜吴非赵美玲陈浩陈明哲. 基于自适应Tent混沌搜索的粒子群优化算法[J]. 计算机应用, 2011, 31(02): 485-489.
[9]	赵鹏军. 基于差分扰动的混合蛙跳算法[J]. 计算机应用, 2010, 30(10): 2575-2577.
[10]	杨凌宋军金强. 一种引入混沌机制的新型Elman网络及其应用[J]. 计算机应用, 2009, 29(2): 549-553.
[11]	武妍冯钊. 一种基于混沌搜索的自适应入侵遗传算法[J]. 计算机应用, 2008, 28(1): 101-103.