Approximation Results for the Incremental Knapsack Problem

2018 ◽  
pp. 75-87 ◽  
Author(s):  
Federico Della Croce ◽  
Ulrich Pferschy ◽  
Rosario Scatamacchia
Keyword(s):  
Knapsack Problem

A core approach to the 0 –1 equality knapsack problem

1998 ◽  
Vol 49 (1) ◽  
pp. 86-92
Author(s):  
A Volgenant ◽  
S Marsman
Keyword(s):  
Knapsack Problem

Recycling Lethal Chromosomes Based on Immune Operation in Genetic Algorithm for Multi-Knapsack Problem

2014 ◽  
Vol 1 ◽  
pp. 219-222
Author(s):  
Jing Guo ◽  
Jousuke Kuroiwa ◽  
Hisakazu Ogura ◽  
Izumi Suwa ◽  
Haruhiko Shirai ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Knapsack Problem

An enhanced binary slime mould algorithm for solving the 0–1 knapsack problem

2021 ◽  
Author(s):  
Benyamin Abdollahzadeh ◽  
Saeid Barshandeh ◽  
Hatef Javadi ◽  
Nicola Epicoco
Keyword(s):  
Knapsack Problem ◽  
Slime Mould

scholarly journals ACO with Intuitionistic Fuzzy Pheromone Updating Applied on Multiple-Constraint Knapsack Problem

Mathematics ◽  
2021 ◽  
Vol 9 (13) ◽  
pp. 1456
Author(s):  
Stefka Fidanova ◽  
Krassimir Todorov Atanassov
Keyword(s):  
Decision Making ◽  
Knapsack Problem ◽  
Propositional Logic ◽  
Optimization Problems ◽  
Real Life ◽  
Combinatorial Optimization Problems ◽  
Intuitionistic Fuzzy ◽  
Life Problems ◽  
Multiple Constraint

Some of industrial and real life problems are difficult to be solved by traditional methods, because they need exponential number of calculations. As an example, we can mention decision-making problems. They can be defined as optimization problems. Ant Colony Optimization (ACO) is between the best methods, that solves combinatorial optimization problems. The method mimics behavior of the ants in the nature, when they look for a food. One of the algorithm parameters is called pheromone, and it is updated every iteration according quality of the achieved solutions. The intuitionistic fuzzy (propositional) logic was introduced as an extension of Zadeh’s fuzzy logic. In it, each proposition is estimated by two values: degree of validity and degree of non-validity. In this paper, we propose two variants of intuitionistic fuzzy pheromone updating. We apply our ideas on Multiple-Constraint Knapsack Problem (MKP) and compare achieved results with traditional ACO.

A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables

1976 ◽  
Vol 23 (1) ◽  
pp. 147-154 ◽  
Author(s):  
D. S. Hirschberg ◽  
C. K. Wong
Keyword(s):  
Polynomial Time ◽  
Knapsack Problem ◽  
Polynomial Time Algorithm ◽  
Time Algorithm

scholarly journals Optimization Method to Address Psychosocial Risks through Adaptation of the Multidimensional Knapsack Problem

Mathematics ◽  
2021 ◽  
Vol 9 (10) ◽  
pp. 1126
Author(s):  
Marta Lilia Eraña-Díaz ◽  
Marco Antonio Cruz-Chávez ◽  
Fredy Juárez-Pérez ◽  
Juana Enriquez-Urbano ◽  
Rafael Rivera-López ◽  
...  
Keyword(s):  
Risk Factors ◽  
Simulated Annealing ◽  
Knapsack Problem ◽  
Simulated Annealing Algorithm ◽  
Psychosocial Risk Factors ◽  
Psychosocial Risk ◽  
Multidimensional Knapsack Problem ◽  
Optimal Subset ◽  
Multidimensional Knapsack ◽  
A Company

This paper presents a methodological scheme to obtain the maximum benefit in occupational health by attending to psychosocial risk factors in a company. This scheme is based on selecting an optimal subset of psychosocial risk factors, considering the departments’ budget in a company as problem constraints. This methodology can be summarized in three steps: First, psychosocial risk factors in the company are identified and weighted, applying several instruments recommended by business regulations. Next, a mathematical model is built using the identified psychosocial risk factors information and the company budget for risk factors attention. This model represents the psychosocial risk optimization problem as a Multidimensional Knapsack Problem (MKP). Finally, since Multidimensional Knapsack Problem is NP-hard, one simulated annealing algorithm is applied to find a near-optimal subset of factors maximizing the psychosocial risk care level. This subset is according to the budgets assigned for each of the company’s departments. The proposed methodology is detailed using a case of study, and thirty instances of the Multidimensional Knapsack Problem are tested, and the results are interpreted under psychosocial risk problems to evaluate the simulated annealing algorithm’s performance (efficiency and efficacy) in solving these optimization problems. This evaluation shows that the proposed methodology can be used for the attention of psychosocial risk factors in real companies’ cases.

Sign in / Sign up

Export Citation Format

Share Document