An improved monkey algorithm for a 0-1 knapsack problem |
| |
| Affiliation: | 1. Department of Irrigation and Reclamation Engineering, University of Tehran, Tehran, Iran;2. Department of Agricultural Machinery Engineering, University of Tehran, Tehran, Iran;3. Dept. of Irrigation & Reclamation Engineering, Faculty of Agricultural Engineering & Technology, College of Agriculture & Natural Resources, University of Tehran, Karaj, Iran;1. College of Science, China University of Petroleum, Beijing 102249, China;2. Australasian Joint Research Centre for Building Information Modelling, School of Built Environment, Curtin University, Perth, WA 6845, Australia;3. Department of Housing and Interior Design, Kyung Hee University, Seoul, Korea;4. Department of Mathematics and Statistics, Curtin University, Perth, WA 6845, Australia |
| |
| Abstract: | 
The 0-1 knapsack problem is a classic combinational optimization problem. However, many exiting algorithms have low precision and easily fall into local optimal solutions to solve the 0-1 knapsack problem. In order to overcome these problems, this paper proposes a binary version of the monkey algorithm where the greedy algorithm is used to strengthen the local search ability, the somersault process is modified to avoid falling into local optimal solutions, and the cooperation process is adopted to speed up the convergence rate of the algorithm. To validate the efficiency of the proposed algorithm, experiments are carried out with various data instances of 0-1 knapsack problems and the results are compared with those of five metaheuristic algorithms. |
| |
| Keywords: | Monkey algorithm Binary version of the monkey algorithm Knapsack problem Cooperation process Greedy strategy |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
