A Binary Firefly Algorithm Applied to Knapsack Problem

The NP-hard problems are of interest in operations research and particularly the combinatorial problems. Therefore, the design of efficient algorithms that address these combinatorial problems are active lines of research. Inspired by the above, this article designs a binarization method so that continuous metaheuristics can solve combinatorial problems. The binarization method uses the concept of percentile. This method of percentile is applied to the firefly algorithm. The multidimensional knapsack problem (MKP) was used to verify our algorithm.

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

[2]  Paola Moraga,et al.  A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem , 2020, Mathematics.

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

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

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

[6]  Víctor Yepes,et al.  Embodied Energy Optimization of Buttressed Earth-Retaining Walls with Hybrid Simulated Annealing , 2021 .

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

[8]  Eduardo Lalla-Ruiz,et al.  Enhancing a machine learning binarization framework by perturbation operators: analysis on the multidimensional knapsack problem , 2020, International Journal of Machine Learning and Cybernetics.

[9]  Carlos Maureira,et al.  A KNN quantum cuckoo search algorithm applied to the multidimensional knapsack problem , 2021, Appl. Soft Comput..

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

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

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

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

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

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

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

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

[18]  Víctor Yepes,et al.  An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics , 2021, Mathematics.

[19]  Matias Valenzuela,et al.  Investigating the Efficiency of Swarm Algorithms for Bridge Strengthening by Conversion to Tied-Arch: A Numerical Case Study on San Luis Bridge , 2020 .

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

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

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

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

[24]  Víctor Yepes,et al.  A Hybrid k-Means Cuckoo Search Algorithm Applied to the Counterfort Retaining Walls Problem , 2020, Mathematics.

[25]  Quan-Ke Pan,et al.  An improved fruit fly optimization algorithm for solving the multidimensional knapsack problem , 2017, Appl. Soft Comput..

[26]  Víctor Yepes,et al.  The Buttressed Walls Problem: An Application of a Hybrid Clustering Particle Swarm Optimization Algorithm , 2020, Mathematics.

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

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

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

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