A Deep Reinforcement Learning-Based Scheme for Solving Multiple Knapsack Problems
A knapsack problem is to select a set of items that maximizes the total profit of selected items while keeping the total weight of the selected items no less than the capacity of the knapsack.
Giwon Sur +3 more
doaj +1 more source
Application of Black Hole Algorithm for Solving Knapsack Problems [PDF]
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
Lagrangian based approach to solve a two level capacitated lot sizing problem
Two-level, multi-item, multi-period-capacitated dynamic lot-sizing problem with inclusions of backorders and setup times, TL_CLSP_BS, a well-known NP-hard problem, is solved using a novel procedure.
Mayank Verma, R.R.K. Sharma
doaj +1 more source
Improvement of the total mass and operating time of Knapsack sprayer to Propel Cart Sprayer (PCS) [PDF]
There are two types of background of the farmers which are the large scale and small scale of agriculture. Usually, the large scale farmers will use the motorize Knapsack Sprayer while the small scale farmers will use manual-operated Knapsack Sprayer ...
Ahamad Azahari, Ahmad Syakir +3 more
core
Semi-mechanized Harvesting of the Safflower Petals in Comparison with Conventional Method [PDF]
IntroductionSafflower (Carthamus tinctorius L.) is an oil plant with a growth cycle of 120 days. The seeds of this crop are primarily used for oil production, while its flower petals are used for extracting natural pigments and medicinal purposes.
M Safari, H Sharifnasab
doaj +1 more source
Leveraging Knapsack QAOA Approach for Optimal Electric Vehicle Charging
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
Projects Selection In Knapsack Problem By Using Artificial Bee Colony Algorithm
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
Optimalisasi Penyelesaian Knapsack Problem Dengan Algoritma Genetika
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
Improvement of the ergonomical structure of Knapsack sprayer to propel cart sprayer (PCS) [PDF]
A sprayer is a device used to spray a liquid projection mostly used in agriculture crop used to apply such as pesticides. The sprayer’s usage are based on the type of the background of the farmers scale in agriculture. Large scale of farmers will use the
Ahamad Azahari, Ahmad Syakir +3 more
core
Online Knapsack Problem under Expected Capacity Constraint
Online knapsack problem is considered, where items arrive in a sequential fashion that have two attributes; value and weight. Each arriving item has to be accepted or rejected on its arrival irrevocably.
Vaze, Rahul
core +1 more source

