模式识别与人工智能
Saturday, May. 3, 2025 Home      About Journal      Editorial Board      Instructions      Ethics Statement      Contact Us                   中文
Pattern Recognition and Artificial Intelligence  2023, Vol. 36 Issue (6): 483-494    DOI: 10.16451/j.cnki.issn1003-6059.202306001
Papers and Reports Current Issue| Next Issue| Archive| Adv Search |
Modified Moth Search Algorithm Based on Adaptive ε-Constrained Method
FENG Yanhong1,2,3, WANG Gaige4, LI Mingliang1,2, LI Xi1
1. School of Information Engineering, Hebei GEO University, Shijiazhuang 050031;
2. Intelligent Sensor Network Engineering Research Center of Hebei Province, Hebei GEO University, Shijiazhuang 050031;
3. Hebei Key Laboratory of Optoelectronic Information and Geo-detection Technology, Hebei GEO University, Shijiazhuang 050031;
4. School of Computer Science and Technology, Ocean University of China, Qingdao 266100

Download: PDF (796 KB)   HTML (1 KB) 
Export: BibTeX | EndNote (RIS)      
Abstract  The multidemand multidimensional knapsack problem includes two types of inequality constraints with conflicts, making the search for the feasible solution region exceptionally difficult. Therefore, a modified moth search algorithm(MMS) based on adaptive ε-constrained method is proposed in this paper. In the Lévy flight phase, the step is adjusted according to the current iteration. In the straight flight phase, the mutation rate is introduced to increase the diversity of the population. Finally, the uniform mutation operator is applied to the whole population to improve the global search capability of the algorithm. The space mapping method is utilized to transfer the search space to the problem space, and the adaptive ε-constrained method is adopted. Experiments on classic 96 benchmark instances show that adaptive lévy flight operator, mutation straight flight operator and uniform mutation operator contribute significantly to the solution accuracy of the algorithm and the proposed algorithm performs better on the majority of instances. Furthermore, orthogonal experimental design method is utilized to analyze the influence of parameters on the ε-constrained method.
Key wordsEvolutionary Algorithm      Moth Search Algorithm      Adaptive ε-Constrained Method      Multidemand Multidimensional Knapsack Problem(MDMKP)     
Received: 10 April 2023     
ZTFLH: TP301.6  
Fund:National Natural Science Foundation of China(No.61806069), Key Research and Development Plan Project of Hebei Province(No.22375415D), Science and Technology Project of Hebei Education Department(No.ZD2022083)
Corresponding Authors: WANG Gaige, Ph.D., associate professor. His research interests include evolutionary computing and scheduling optimization.   
About author:: About Author:FENG Yanhong, master, professor. Her research interests include evolutionary computing and combinatorial optimization.Li Mingliang, Ph.D., professor. His research interests include Internet of things technology and applications.LI Xi, Ph.D., associate professor. Her research interests include evolutionary computing and machine learning.
Service
E-mail this article
Add to my bookshelf
Add to citation manager
E-mail Alert
RSS
Articles by authors
FENG Yanhong
WANG Gaige
LI Mingliang
LI Xi
Cite this article:   
FENG Yanhong,WANG Gaige,LI Mingliang等. Modified Moth Search Algorithm Based on Adaptive ε-Constrained Method[J]. Pattern Recognition and Artificial Intelligence, 2023, 36(6): 483-494.
URL:  
http://manu46.magtech.com.cn/Jweb_prai/EN/10.16451/j.cnki.issn1003-6059.202306001      OR     http://manu46.magtech.com.cn/Jweb_prai/EN/Y2023/V36/I6/483
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