A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators

被引:8
作者
Bonyadi, Mohammad Reza [1 ]
Li, Xiaodong [2 ]
机构
[1] Shahid Beheshti Univ, Tehran, Iran
[2] RMIT Univ, Melbourne, Vic, Australia
关键词
Swarm intelligence; Population based optimization; Electromagnetism-Like meta-heuristic; Multidimensional knapsack problem; ALGORITHM; MECHANISM; SEARCH;
D O I
10.1007/s12351-010-0084-0
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
The Standard Electromagnetism-like Mechanism (SEM) is one of the swarm-based optimization methods which is examined in this paper. The SEM works based on the charges in electrons and hence its operators have been especially designed for continuous space problems. Although the SEM was successfully applied to the standard optimization problems, it was not that notable when it came to tackling discrete space problems. This shortcoming was obvious when the SEM was applied to some standard discrete problems such as Travelling Salesman Problem, Nurse Scheduling Problem, etc. In this paper, a modified SEM called Discrete Electromagnetism-like Mechanism is proposed which utilizes Genetic Algorithm (GA) operators to work in discrete spaces. In fact, the vector calculations (which are at the heart of the SEM) in the SEM are replaced by specific types of GA operators to determine the effects that particles have on one another. Also, a new operator based on the principles of quantum mechanics is proposed which further improves the performance of the method. In our experiments, the proposed algorithm is applied to a well-studied discrete space problem called Multidimensional Knapsack Problem (MKP). All tests are done on standard problems of the MKP and the results are reported and compared with several stochastic population-based optimization methods. Experiments showed that the proposed algorithm not only found comparable (and even better in some cases) solutions for the standard problems of the MKP, but also took much less computational time (75% improvement in average in comparison to other methods).
引用
收藏
页码:229 / 252
页数:24
相关论文
共 32 条
[21]   A new ant colony optimization algorithm for the multidimensional Knapsack problem [J].
Kong, Min ;
Tian, Peng ;
Kao, Yucheng .
COMPUTERS & OPERATIONS RESEARCH, 2008, 35 (08) :2672-2683
[22]  
Leguizamon G., 1999, IEEE 1999 C EV COMP, V2, P1459
[23]   An electromagnetic meta-heuristic for the nurse scheduling problem [J].
Maenhout, Broos ;
Vanhoucke, Mario .
JOURNAL OF HEURISTICS, 2007, 13 (04) :359-385
[24]   Electromagnetism-like mechanism and simulated annealing algorithms for flowshop scheduling problems minimizing the total weighted tardiness and makespan [J].
Naderi, B. ;
Tavakkoli-Moghaddam, R. ;
Khalili, M. .
KNOWLEDGE-BASED SYSTEMS, 2010, 23 (02) :77-85
[25]  
Parra-Hernández R, 2003, 2003 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS, AND SIGNAL PROCESSING, VOLS 1 AND 2, CONFERENCE PROCEEDINGS, P338
[26]  
Pirkul H, 1987, NAVAL RES LOGIST, V34, P61
[28]   A study of ACO capabilities for solving the maximum clique problem [J].
Solnon, C ;
Fenet, S .
JOURNAL OF HEURISTICS, 2006, 12 (03) :155-180
[29]  
Stenholm S, 2005, QUANTUM APPROACH TO INFORMATICS, P1, DOI 10.1002/0471739367
[30]   Improved results on the 0-1 multidimensional knapsack problem [J].
Vasquez, M ;
Vimont, Y .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2005, 165 (01) :70-81