A Binary Grasshopper Algorithm Applied to the Knapsack Problem

In engineering and science, there are many combinatorial optimization problems. A lot of these problems are NP-hard and can hardly be addressed by full techniques. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to grasshopper algorithm to solve multidimensional knapsack problem (MKP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that binary grasshopper algorithm (BGOA) obtains adequate results when it is evaluated against another state of the art algorithm.

[1]  Valquiria Aparecida Rosa Duarte,et al.  A multiagent player system composed by expert agents in specific game stages operating in high performance environment , 2017, Applied Intelligence.

[2]  Broderick Crawford,et al.  A Meta-Optimization Approach to Solve the Set Covering Problem , 2018 .

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

[4]  Julián M. Ortiz,et al.  Urban Dynamic Estimation Using Mobile Phone Logs and Locally Varying Anisotropy , 2017 .

[5]  José García,et al.  A Distributed K-Means Segmentation Algorithm Applied to Lobesia botrana Recognition , 2017, Complex..

[6]  José García,et al.  A Meta-Optimization Approach for Covering Problems in Facility Location , 2017, WEA.

[7]  Kusum Deep,et al.  A Modified Binary Particle Swarm Optimization for Knapsack Problems , 2012, Appl. Math. Comput..

[8]  Alvaro Peña,et al.  Robust Optimization: Concepts and Applications , 2018 .

[9]  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..

[10]  José García,et al.  A Percentile Transition Ranking Algorithm Applied to Binarization of Continuous Swarm Intelligence Metaheuristics , 2018, SCDM.

[11]  Saïd Hanafi,et al.  A hybrid quantum particle swarm optimization for the Multidimensional Knapsack Problem , 2016, Eng. Appl. Artif. Intell..

[12]  Yung-Keun Kwon,et al.  A novel mutual information-based Boolean network inference method from time-series gene expression data , 2017, PloS one.

[13]  Broderick Crawford,et al.  A Percentile Transition Ranking Algorithm Applied to Knapsack Problem , 2017 .

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

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

[16]  Eduardo Graells-Garrido,et al.  Sensing Urban Patterns with Antenna Mappings: The Case of Santiago, Chile , 2016, Sensors.

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

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

[19]  K. Teo,et al.  A Binary differential search algorithm for the 0-1 multidimensional knapsack problem , 2016 .

[20]  Eduardo Graells-Garrido,et al.  Visual Exploration of Urban Dynamics Using Mobile Data , 2015, UCAmI.

[21]  José García,et al.  A clustering algorithm applied to the binarization of Swarm intelligence continuous metaheuristics , 2019, Swarm Evol. Comput..

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

[23]  José García,et al.  Constructive Metaheuristics for the Set Covering Problem , 2018, BIOMA.

[24]  M. Măntoiu,et al.  Localization results for zero order pseudodifferential operators , 2013, 1310.2663.

[25]  José García,et al.  A Binary Cuckoo Search Big Data Algorithm Applied to Large-Scale Crew Scheduling Problems , 2018, Complex..

[26]  Yair Neuman,et al.  A Novel Procedure for Measuring Semantic Synergy , 2017, Complex..

[27]  Broderick Crawford,et al.  A Db-Scan Binarization Algorithm Applied to Matrix Covering Problems , 2019, Comput. Intell. Neurosci..

[28]  Andrew Lewis,et al.  Grasshopper Optimisation Algorithm: Theory and application , 2017, Adv. Eng. Softw..