An efficient optimizer for the 0/1 knapsack problem using group counseling [PDF]
PeerJ Computer Science, 2023 The field of optimization is concerned with determining the optimal solution to a problem. It refers to the mathematical loss or gain of a given objective function.
Yazeed Yasin Ghadi +6 more
doaj +3 more sources
Binary salp swarm algorithm for discounted {0-1} knapsack problem. [PDF]
PLoS ONE, 2022 While the classical knapsack problem has been the object to be solved by optimization algorithm proposals for many years, another version of this problem, discounted {0-1} knapsack problem, is gaining a lot of attention recently.
Binh Thanh Dang, Tung Khac Truong
doaj +2 more sources
Matroid and Knapsack Center Problems [PDF]
Algorithmica, 2013 In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized.
A. Schrijver +15 more
core +3 more sources
Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size [PDF]
, 2021 The development of a satisfying and rigorous mathematical understanding of the performance of neural networks is a major challenge in artificial intelligence.
Hertrich, Christoph, Skutella, Martin
core +3 more sources
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
Leveraging Knapsack QAOA Approach for Optimal Electric Vehicle Charging
IEEE Access, 2023 The electric vehicle (EV) industry is currently afflicted with inefficient charging systems. Considering the growing adoption of EVs, optimization strategies for efficient charging, and overcoming constraints such as a limited power supply and extended ...
Kimleang Kea +2 more
doaj +1 more source
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
Projects Selection In Knapsack Problem By Using Artificial Bee Colony Algorithm
Tikrit Journal of Pure Science, 2023 One of the combinatorial optimization problems is Knapsack problem, which aims to maximize the benefit of objects whose weight not exceeding the capacity of knapsack.
Armaneesa Naaman Hasoon
doaj +1 more source
Knapsack problem in fuzzy nature: Different models based on credibility ranking method [PDF]
Yugoslav Journal of Operations Research, 2022 This paper deals with knapsack problem in fuzzy nature, where both the objective function and constraints are considered to be fuzzy. Three different models for fuzzy knapsack problem are proposed including, expected value model, chance-constrained model,
Niksirat Malihe, Nasseri Hadi S.
doaj +1 more source
Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika
Lontar Komputer, 2016 Knapsack problems is a problem that often we encounter in everyday life. Knapsack problem itself is a problem where a person faced with the problems of optimization on the selection of objects that can be inserted into the container which has limited ...
I Wayan Supriana
doaj +1 more source