APPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING

محورهای موضوعی : فصلنامه ریاضی

Majid Darehmiraki ¹

1 - khatam alanbia university of technology Iran, Islamic Republic of department of mathematics

تاریخ دریافت : 1395/01/27 تاریخ پذیرش : 1395/01/27 تاریخ انتشار : 1392/01/01

کلید واژه: Efficiency, : multi-dimensional knapsack problem, Multiple Criteria Decision Making,

چکیده مقاله :

In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, items are selected in according to their rank.