Title :
The 0/1 Multi-objective Knapsack Problem Based on Regional Search
Author :
Chen, Weiqi ; Hao, Zhifeng ; Liu, Hailin
Author_Institution :
Fac. of Appl. Math., Guangdong Univ. of Technol., Guangzhou, China
Abstract :
A novel evolutionary algorithm is proposed in this paper. The presented algorithm uses regional search strategy to solve MOKP. By this way, the proposed algorithm reduces the computational complexity and accelerates the speed of convergence. This paper uses the greedy repair strategy to handle infeasible individuals during the evolution process. For making the strategy reasonable, we only consider the weight of items in knapsacks which violate the constraint. The experimental results of 0/1 MOKP, with nine testing instances, indicate that the proposed algorithm is highly competitive and can be considered as a viable alternative.
Keywords :
computational complexity; convergence; evolutionary computation; knapsack problems; search problems; 0/1 multiobjective knapsack problem; computational complexity reduction; convergence speed acceleration; evolutionary algorithm; regional search strategy; Approximation algorithms; Evolutionary computation; Genetics; Maintenance engineering; Optimization; Testing; Vectors; Knapsack problem; evolutionary algorithm; multi-objective optimization; regional search;
Conference_Titel :
Computational Intelligence and Security (CIS), 2011 Seventh International Conference on
Conference_Location :
Hainan
Print_ISBN :
978-1-4577-2008-6
DOI :
10.1109/CIS.2011.41
