Open AccessTaming a 0-1 knapsack problem with monkey algorithm
Author(s) -
Xiaoping Xu,
Li Xu,
Xiao Zhang,
Daqing Zhang,
Yi Hong Luo,
Long Liu,
Fucai Qian
Publication year - 2020
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/768/5/052094
Subject(s) - knapsack problem , continuous knapsack problem , change making problem , algorithm , cutting stock problem , chaotic , mathematical optimization , computer science , process (computing) , range (aeronautics) , climb , mathematics , optimization problem , artificial intelligence , engineering , aerospace engineering , operating system
Now, the 0-1 knapsack problem has a wide range of applications in real life, but it is a typical NP hard problem. thereby, solving the 0-1 knapsack problem has been widely concerned by many researchers. This paper puts forward an improved monkey algorithm where uniform distribution’s Kent chaotic map is adopted as the initial feasible solution of the algorithm, and the descending factor is used as the step size in the climb process of the algorithm. Finally, in numerical simulation, a 0-1 knapsack problem is solved using the presented method and other existing methods to show that the given method is effective.