Results 11 to 20 of about 25,976 (248)
Binary Puma Optimizer: A Novel Approach for Solving 0-1 Knapsack Problems and the Uncapacitated Facility Location Problem [PDF]
Applied SciencesIn 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
A hybrid heuristic for the 0–1 Knapsack Sharing Problem
Expert Systems with Applications, 2015 A new hybrid method based on ILPH and QPSO is proposed and validated on the KSP.The proposed approach can be easily adapted to other variants of knapsack problems.New valid constraints are used to speed up the reduced problems solved inside ILPH.A local search is incorporated in ILPH as an intensification process.QPSO starts with the best solutions ...
Boukthir Haddar +3 more
openalex +3 more sources
Binary social group optimization algorithm for solving 0-1 knapsack problem [PDF]
Decision Science Letters, 2022 In this paper, we propose the binary version of the Social Group Optimization (BSGO) algorithm for solving the 0-1 knapsack problem. The standard Social Group Optimization (SGO) is used for continuous optimization problems.
Anima Naik, Pradeep Kumar Chokkalingam
doaj +1 more source
Application of Black Hole Algorithm for Solving Knapsack Problems [PDF]
Computer and Knowledge Engineering, 2021 This study investigates the application of the Black Hole algorithm (BH) for solving 0–1 knapsack problems. Knapsack problem is a classic and famous problem for testing and analyzing the behavior of optimization and meta-heuristic algorithms. There is no
Abdolreza Hatamlou
doaj +1 more source
Heuristics for the 0–1 multidimensional knapsack problem [PDF]
European Journal of Operational Research, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vincent Boyer 0002 +2 more
openaire +1 more source
Adjusted 0-1 Knapsack Problem in Cargo Flow by Using Artificial Bee Colony Algorithm
Journal of Computing Research and Innovation, 2022 This study describes the problem with the knapsack that occurred in the cargo flow. The problem of the knapsack is the problem of optimisation used to illustrate the problem and the solution in which each set of items has its own specific value and ...
Siti Hafawati Jamaluddin +2 more
doaj +3 more sources
Algorithms, 2022 The multiple knapsack problem (0/1-mKP) is a valuable NP-hard problem involved in many science-and-engineering applications. In current research, there exist two main approaches: 1.
Patcharin Buayen, Jeeraporn Werapun
doaj +1 more source
Contrasting of Various Algorithmic Techniques to Solve Knapsack 0-1 Problem
JOIV: International Journal on Informatics Visualization, 2020 This paper will point of convergence on a relative assessment and estimation of the dynamic programming, B&B, Greedy and Genetic algorithm including of the intricacy of time prerequisites, and the necessary programming endeavors and inspect the absolute ...
Yogesh Awasthi, Ashish Sharma
doaj +1 more source
A novel approach for solving travelling thief problem using enhanced simulated annealing [PDF]
PeerJ Computer Science, 2021 Real-world optimization problems are getting more and more complex due to the involvement of inter dependencies. These complex problems need more advanced optimizing techniques.
Hamid Ali +5 more
doaj +2 more sources
Nature-inspired optimization algorithms in knapsack problem: A review [PDF]
المجلة العراقية للعلوم الاحصائية, 2019 Meta-heuristic algorithms have become an arising field of research in recent years. Some of these algorithms have proved to be efficient in solving combinatorial optimization problems, particularly knapsack problem.
Ghalya Tawfeeq Basheer, Zakariya Algamal
doaj +1 more source