A theoretical and empirical investigation on the Lagrangian capacities of the 0-1 multidimensional knapsack problem

2012 ◽  
Vol 218 (2) ◽  
pp. 366-376 ◽  
Author(s):  
Yourim Yoon ◽  
Yong-Hyuk Kim ◽  
Byung-Ro Moon
2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Yourim Yoon ◽  
Yong-Hyuk Kim

We present a new evolutionary algorithm to solve the 0-1 multidimensional knapsack problem. We tackle the problem using duality concept, differently from traditional approaches. Our method is based on Lagrangian relaxation. Lagrange multipliers transform the problem, keeping the optimality as well as decreasing the complexity. However, it is not easy to find Lagrange multipliers nearest to the capacity constraints of the problem. Through empirical investigation of Lagrangian space, we can see the potentiality of using a memetic algorithm. So we use a memetic algorithm to find the optimal Lagrange multipliers. We show the efficiency of the proposed method by the experiments on well-known benchmark data.


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 ◽  
...  

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.


2017 ◽  
Vol 22 (8) ◽  
pp. 2567-2582 ◽  
Author(s):  
Luis Fernando Mingo López ◽  
Nuria Gómez Blas ◽  
Alberto Arteta Albert

Sign in / Sign up

Export Citation Format

Share Document