Results 11 to 20 of about 417,011 (184)

New Binary Reptile Search Algorithms for Binary Optimization Problems [PDF]

Biomimetics
Binarizing continuous metaheuristics to solve challenging NP-hard binary optimization problems is a fundamental step in adapting continuous algorithms for discrete domains.
Broderick Crawford, Benjamín López Cortés, Felipe Cisternas-Caneo, José Manuel Gómez-Pulido, Rodrigo Olivares, Ricardo Soto, José Barrera-Garcia, Cristóbal Brante-Aguilera, Giovanni Giachetti   +8 more
doaj   +2 more sources

Exploring Initialization Strategies for Metaheuristic Optimization: Case Study of the Set-Union Knapsack Problem

Mathematics, 2023
In recent years, metaheuristic methods have shown remarkable efficacy in resolving complex combinatorial challenges across a broad spectrum of fields. Nevertheless, the escalating complexity of these problems necessitates the continuous development of ...
José García, Andres Leiva-Araos, Broderick Crawford, Ricardo Soto, Hernan Pinto   +4 more
doaj   +2 more sources

A db-Scan Hybrid Algorithm: An Application to the Multidimensional Knapsack Problem

Mathematics, 2020
This article proposes a hybrid algorithm that makes use of the db-scan unsupervised learning technique to obtain binary versions of continuous swarm intelligence algorithms.
José García, Paola Moraga, Matias Valenzuela, Hernan Pinto   +3 more
doaj   +2 more sources

Binary Pufferfish Optimization Algorithm for Combinatorial Problems [PDF]

Biomimetics
Metaheuristics are a fundament pillar of Industry 4.0, as they allow for complex optimization problems to be solved by finding good solutions in a reasonable amount of computational time.
Broderick Crawford, Álex Paz, Ricardo Soto, Álvaro Peña Fritz, Gino Astorga, Felipe Cisternas-Caneo, Claudio Patricio Toledo Mac-lean, Fabián Solís-Piñones, José Lara Arce, Giovanni Giachetti   +9 more
doaj   +2 more sources

Variable fixing method by weighted average for the continuous quadratic knapsack problem

Numerical Algebra, Control & Optimization, 2022
We analyze the method of solving the separable convex continuous quadratic knapsack problem by weighted average from the viewpoint of variable fixing. It is shown that this method, considered as a variant of the variable fixing algorithms, and Kiwiel's ...
Hsin-Min Sun, Yu-Juan Sun
semanticscholar   +3 more sources

On a nonseparable convex maximization problem with continuous knapsack constraints

Operations Research Letters, 2007
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
H Edwin Romeijn, Joseph Geunes, Kevin Taaffe   +2 more
exaly   +4 more sources

A Heuristics-Guided Simplified Discrete Harmony Search Algorithm for Solving 0-1 Knapsack Problem

Algorithms
The harmony search (HS) algorithm is a novel metaheuristic which has been widely used to solve both continuous and discrete optimization problems. In order to improve the performance and simplify the implementation of the HS algorithm for solving the 0-1
Fuyuan Zheng, Kanglong Cheng, Kai Yang, Ning Li, Yu Lin, Yiwen Zhong   +5 more
doaj   +2 more sources

Solving 0-1 Knapsack and Bin Packing Problem Using Logical Social Group Optimization

IEEE Access
The 0-1 Knapsack Problem (KP) and Bin Packing Problem (BPP) are NP-hard combinatorial optimization challenges often tackled using metaheuristics. Both problems have prominent utilization in the real world such as in resource allocation, logistics ...
Rhiddhi Prasad Das, Junali Jasmine Jena, Suresh Chandra Satapathy, Naeem M. S. Hannoon   +3 more
doaj   +2 more sources

Binary Puma Optimizer: A Novel Approach for Solving 0-1 Knapsack Problems and the Uncapacitated Facility Location Problem

Applied Sciences
In this study, the Binary Puma Optimizer (BPO) is introduced as a novel binary metaheuristic. The BPO employs eight Transfer Functions (TFs), consisting of four S-shaped and four V-shaped mappings, to convert the continuous search space of the original ...
Aysegul Ihsan, Tahir Sag
doaj   +2 more sources

Analysis of maximum total return in the continuous knapsack problem with fuzzy object weights

Applied Mathematical Modelling, 2009
Shih-Pin Chen
exaly   +2 more sources