Adaptation of a Mosquito Swarm Algorithm to Solve a Binary Knapsack Problem [PDF]
Al-Rafidain Journal of Computer Sciences and Mathematics, 2018 The paper tackled one of the artificial intelligence algorithms which is Mosquito swarm algorithm as a nature inspired algorithms, to solve 0-1 knapsack an optimization problem through adaptation steps of a Mosquito swarm algorithm and the inspiration ...
Ruqaya Sha’ban, Isra Alkallak
doaj +1 more source
Optimizing over the efficient set of the binary bi-objective knapsack problem [PDF]
Yugoslav Journal of Operations Research, 2023 This paper deals with the problem of optimizing a linear function over the efficient set of a 0-1 bi-objective knapsack problem. Such a function represents the main criterion of the problem posed.
Chaabane Djamal, Lachemi Nadia
doaj +1 more source
Time-constrained restless bandits and the knapsack problem for perishable items (Extended Abstract) [PDF]
, 2007 Motivated by a food promotion problem, we introduce the Knapsack Problem for Perishable Items (KPPI) to address a dynamic problem of optimally filling a knapsack with items that disappear randomly.
Jacko, Peter, Niño-Mora, José
core +1 more source
A Rough Sets based modified Scatter Search algorithm for solving 0-1 Knapsack problem [PDF]
Decision Science Letters, 2015 This paper presents a new search methodology for different sizes of 0-1 Knapsack Problem (KP). The proposed methodology uses a modified scatter search as a meta-heuristic algorithm.
Hassan Rezazadeh
doaj +1 more source
The RaPID-Ω system: Room and proctor intelligent decider for large scale tests programming [PDF]
Yugoslav Journal of Operations Research, 2021 We present the documentation and mathematical modeling of the open-box system RaPID/Ω. The software is designed for the choice of classrooms and the assignment of proctoring duties in massive tests, which is a common situation in educational institutions
Morales Fernando A.
doaj +1 more source
A novel binary Kepler optimization algorithm for 0–1 knapsack problems: Methods and applications
Alexandria Engineering Journal, 2023 The 0–1 Knapsack problem is a non-deterministic polynomial-time-hard combinatorial optimization problem that cannot be solved in reasonable time using traditional methods.
Mohamed Abdel-Basset +5 more
doaj +1 more source
Integer 1/0 Knapsack Problem Dynamic Programming Approach in Building Maintenance Optimization
International Journal of Science and Applied Science: Conference Series, 2017 The most common problem in urban areas is the high public demand and the limited provision of housing. In meeting the needs of affordable housing for low income communities, the Government of Indonesia implements Rusunawa Project. Object of this research
Viska Dewi Fawzy +2 more
doaj +1 more source
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
IEEE Access, 2018 The discounted {0-1} knapsack problem (DKP) extends the classical 0-1 knapsack problem (0-1 KP) in which a set of item groups is included and each group consists of three items, whereas at most one of the three items can be packed into the knapsack ...
Yan-Hong Feng, Gai-Ge Wang
doaj +1 more source
Multi-Objective ABC-NM Algorithm for Multi-Dimensional Combinatorial Optimization Problem
Axioms, 2023 This article addresses the problem of converting a single-objective combinatorial problem into a multi-objective one using the Pareto front approach. Although existing algorithms can identify the optimal solution in a multi-objective space, they fail to ...
Muniyan Rajeswari +5 more
doaj +1 more source
Lower Bounds for the Average and Smoothed Number of Pareto Optima [PDF]
, 2011 Smoothed analysis of multiobjective 0-1 linear optimization has drawn considerable attention recently. The number of Pareto-optimal solutions (i.e., solutions with the property that no other solution is at least as good in all the coordinates and better ...
Goyal, Navin, Rademacher, Luis
core +2 more sources