Using fuzzy numbers in knapsack problems

被引:23
作者
Lin, FT
Yao, JS
机构
[1] Chinese Culture Univ, Dept Appl Math, Taipei 111, Taiwan
[2] Natl Taiwan Univ, Dept Math, Taipei 10764, Taiwan
关键词
fuzzy sets; optimization; knapsack problem; multiconstraint 0/1 knapsack problem; signed distance ranking;
D O I
10.1016/S0377-2217(00)00310-6
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper investigates knapsack problems in which all of the weight coefficients are fuzzy numbers. This work is based on the assumption that each weight coefficient is imprecise due to the use of decimal truncation or rough estimation of the coefficients by the decision-maker. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve this problem. Our work intends to extend the original knapsack problem into a more generalized problem that would be useful in practical situations. As a result, our study shows that the fuzzy knapsack problem is an extension of the crisp knapsack problem, and that the crisp knapsack problem is a special case of the fuzzy knapsack problem. (C) 2001 Elsevier Science B.V. All rights reserved.
引用
收藏
页码:158 / 176
页数:19
相关论文
共 50 条
[31]   Computational aspects of hard Knapsack Problems [J].
Caccetta, L ;
Kulanoot, A .
NONLINEAR ANALYSIS-THEORY METHODS & APPLICATIONS, 2001, 47 (08) :5547-5558
[32]   Knapsack problems: A parameterized point of view [J].
Gurski, Frank ;
Rehs, Carolin ;
Rethmann, Jochen .
THEORETICAL COMPUTER SCIENCE, 2019, 775 :93-108
[33]   A note on dominance in unbounded knapsack problems [J].
Johnston, RE ;
Khan, LR .
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 1995, 12 (02) :145-160
[34]   Approximation for knapsack problems with multiple constraints [J].
Zhang L. ;
Zhang Y. .
Journal of Computer Science and Technology, 1999, 14 (4) :289-297
[35]   DNA computing of solutions to knapsack problems [J].
Henkel, Christiaan V. ;
Back, Thomas ;
Kok, Joost N. ;
Rozenberg, Grzegorz ;
Spaink, Herman P. .
BIOSYSTEMS, 2007, 88 (1-2) :156-162
[36]   Randomized algorithms for online knapsack problems [J].
Han, Xin ;
Kawase, Yasushi ;
Makino, Kazuhisa .
THEORETICAL COMPUTER SCIENCE, 2015, 562 :395-405
[37]   A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems [J].
Sharkey, Thomas C. ;
Romeijn, H. Edwin ;
Geunes, Joseph .
MATHEMATICAL PROGRAMMING, 2011, 126 (01) :69-96
[38]   The Statement and Solution of the Knapsack Problem with Fuzzy Data [J].
Donets, G. A. ;
Yemets, A. O. .
JOURNAL OF AUTOMATION AND INFORMATION SCIENCES, 2009, 41 (09) :1-13
[39]   Fuzzy linear programming approach for solving transportation problems with interval-valued trapezoidal fuzzy numbers [J].
Ebrahimnejad, Ali .
SADHANA-ACADEMY PROCEEDINGS IN ENGINEERING SCIENCES, 2016, 41 (03) :299-316
[40]   MODELING OF UNCERTAINTY OF CONNECTION ARRIVAL USING FUZZY NUMBERS [J].
Gonda, Dalibor ;
Majer, Tomas .
PROCEEDINGS OF THE INTERNATIONAL SCIENTIFIC CONFERENCE QUANTITATIVE METHODS IN ECONOMICS MULTIPLE CRITERIA DECISION MAKING XXI, 2022, :49-55