A Percentile Transition Ranking Algorithm Applied to Knapsack Problem

The binarization of Swarm Intelligence continuous metaheuristics is an area of great interest in operational research. This interest is mainly due to the application of binarized metaheuristics to combinatorial problems. In this article we propose a general binarization algorithm called Percentile Transition Ranking Algorithm (PTRA). PTRA uses the percentile concept as a binarization mechanism. In particular we will apply this mechanism to the Cuckoo Search metaheuristic to solve the set multidimensional Knapsack problem (MKP). We provide necessary experiments to investigate the role of key ingredients of the algorithm. Finally to demonstrate the efficiency of our proposal, we solve Knapsack benchmark instances of the literature. These instances show PTRA competes with the state-of-the-art algorithms.

[1]  José García,et al.  A k-means binarization framework applied to multidimensional knapsack problem , 2018, Applied Intelligence.

[2]  Andries Petrus Engelbrecht,et al.  Critical considerations on angle modulated particle swarm optimisers , 2015, Swarm Intelligence.

[3]  Broderick Crawford,et al.  Solving the non-unicost set covering problem by using cuckoo search and black hole optimization , 2017, Natural Computing.

[4]  Hasan Pirkul,et al.  A heuristic solution procedure for the multiconstraint zero‐one knapsack problem , 1987 .

[5]  Xin-She Yang,et al.  Cuckoo Search via Lévy flights , 2009, 2009 World Congress on Nature & Biologically Inspired Computing (NaBIC).

[6]  Hossein Nezamabadi-pour,et al.  GSA: A Gravitational Search Algorithm , 2009, Inf. Sci..

[7]  José García,et al.  Putting Continuous Metaheuristics to Work in Binary Search Spaces , 2017, Complex..

[8]  Broderick Crawford,et al.  Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization , 2017, Expert Syst. Appl..

[9]  Shengyao Wang,et al.  A novel binary fruit fly optimization algorithm for solving the multidimensional knapsack problem , 2013, Knowl. Based Syst..

[10]  Adil Baykasoglu,et al.  An improved firefly algorithm for solving dynamic multidimensional knapsack problems , 2014, Expert Syst. Appl..

[11]  Zhijing Yang,et al.  Binary artificial algae algorithm for multidimensional knapsack problems , 2016, Appl. Soft Comput..

[12]  Damian Kelty-Stephen,et al.  Cascade-Driven Series with Narrower Multifractal Spectra Than Their Surrogates: Standard Deviation of Multipliers Changes Interactions across Scales , 2017, Complex..

[13]  Xin-She Yang,et al.  Firefly algorithm, stochastic test functions and design optimisation , 2010, Int. J. Bio Inspired Comput..

[14]  Sarada Prasad Sarmah,et al.  Modified swarm intelligence based techniques for the knapsack problem , 2016, Applied Intelligence.

[15]  José García,et al.  A Multi Dynamic Binary Black Hole Algorithm Applied to Set Covering Problem , 2017, ICHSA.

[16]  Steven Li,et al.  Solving large-scale multidimensional knapsack problems with a new binary harmony search algorithm , 2015, Comput. Oper. Res..

[17]  Riccardo Poli,et al.  Particle swarm optimization , 1995, Swarm Intelligence.

[18]  Thomas Stützle,et al.  The Ant Colony Optimization Metaheuristic: Algorithms, Applications, and Advances , 2003 .