模式识别与人工智能
Friday, May. 2, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
  2021, Vol. 34 Issue (7): 592-604    DOI: 10.16451/j.cnki.issn1003-6059.202107002
Metaheuristic Algorithm Current Issue| Next Issue| Archive| Adv Search |
Dual-Archive Large-Scale Sparse Optimization Algorithm Based on Dynamic Adaption
GU Qinghua1,2,3, WANG Chuhao1,2, JIANG Song2,3, CHEN Lu1,2,3
1. School of Management, Xi′an University of Architecture and Technology, Xi′an 710055;
2. Institute of Mine Systems Engineering, Xi′an University of Architecture and Technology, Xi′an 710055;
3. School of Resources Engineering, Xi′an University of Architecture and Technology, Xi′an 710055

Download: PDF (1008 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The traditional large-scale optimization algorithms generate high dimensionality and sparseness problems. A dual-archive large-scale sparse optimization algorithm based on dynamic adaptation is proposed to keep the balance of dimensionality and sparseness in the algorithm and improve the diversity and convergence performance of the algorithm in solving large-scale optimization problems. Firstly, the scores strategy for generating population is changed. By adding adaptive parameter and inertia weight, the dynamics of scores is increased, the diversity of the population is improved, and it is not easy to fall into the local optimum. Secondly, the environment selection strategy of the algorithm is changed by introducing the concept of angle truncation, and the offspring is generated effectively. Meanwhile, a double-archive strategy is introduced to separate the real decision variables from the binary decision variables and thus the running time of the algorithm is reduced. The experimental results on problems of large-scale optimization, sparse optimization and practical application show that the proposed algorithm maintains the original sparsity with steadily improved diversity and convergence and strong competitiveness.
Key wordsLarge-Scale      Sparse Optimization Algorithm      Dynamic Adaptation      Inertial Weight      Dual-Archive     
Received: 16 March 2021     
ZTFLH: TP301.6  
Fund:National Natural Science Foundation of China(No.51974223), Outstanding Youth Project of Shaanxi Natural Science Foundation(No. 2020JC-44), Joint Fund Project of Shaanxi Natural Science Basic Research Foundation(No. 2019JLP-16)
Corresponding Authors: GU Qinghua, Ph.D., professor. His research interests include mining system engineering.   
About author:: WANG Chuhao, master student. His research interests include multi-objective system optimization.JIANG Song, Ph. D., associate professor. His research interests include optimization mo-deling of intelligent mine.CHEN Lu, Ph.D. candidate. His research interests include multi-objective system optimization.
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
GU Qinghua
WANG Chuhao
JIANG Song
CHEN Lu
Cite this article:   
GU Qinghua,WANG Chuhao,JIANG Song等. Dual-Archive Large-Scale Sparse Optimization Algorithm Based on Dynamic Adaption[J]. , 2021, 34(7): 592-604.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/10.16451/j.cnki.issn1003-6059.202107002      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2021/V34/I7/592
Copyright © 2010 Editorial Office of Pattern Recognition and Artificial Intelligence
Address: No.350 Shushanhu Road, Hefei, Anhui Province, P.R. China Tel: 0551-65591176 Fax:0551-65591176 Email: bjb@iim.ac.cn
Supported by Beijing Magtech  Email:support@magtech.com.cn