Multidimensional Knapsack Problem Based on Uncertain Measure
(ندگان)پدیدآور
Cheng, LiRao, CongjunChen, Linنوع مدرک
TextArticle
زبان مدرک
Englishچکیده
The research of classical multidimensional knapsack problem always assumes that the weights,the values and the capacities are constant values. However, in the real-life industrial engineering applica-tions, the multidimensional knapsack problem often comes with uncertainty for lacking of the informationabout these parameters. This paper investigates a constrained multidimensional knapsack problem underuncertain environment, in which the relevant parameters are assumed to be uncertain variables. Withinthe framework of uncertainty theory, two types of uncertain programming models with discount con-straints are constructed for the problem with di erent decision criteria, i.e., the expected value criterionand the critical value criterion. Taking full advantage of the operational law for uncertain variables, theproposed models can be transformed into their corresponding deterministic models. After theoreticallyinvestigating the properties of the models, we do some numerical experiments. The numerical resultsillustrate that the proposed models are feasible and e cient for solving the constrained multidimensionalknapsack problem with uncertain parameters.
کلید واژگان
Multidimensional knapsack problemUncertain network optimization
Uncertain measure
Discount constraint
Industrial Engineering
شماره نشریه
5تاریخ نشر
2017-10-011396-07-09
ناشر
Sharif University of Technologyسازمان پدید آورنده
College of Mathematics and Physics, Huanggang Normal University, Hubei 438000, ChinaSchool of Science, Wuhan University of Technology, Wuhan 430070, China
College of Mathematics and Sciences, Shanghai Normal University, Shanghai 200234, China
شاپا
1026-30982345-3605




