Title

Solving fuzzy Multidimensional Multiple-Choice Knapsack Problems: The multi-start Partial Bound Enumeration method versus the efficient epsilon-constraint method

Document Type

Article

Publication Date

1-18-2013

DOI

https://doi.org/10.1016/j.asoc.2013.01.014

Abstract

In this paper a new fuzzy Multidimensional Multiple-choice Knapsack Problem (MMKP) is proposed. In the proposed fuzzy MMKP, each item may belong to several groups according to a predefined fuzzy membership value. The total profit and the total cost of the knapsack problem are considered as two conflicting objectives. A mathematical approach and a heuristic algorithm are proposed to solve the fuzzy MMKP. One method is an improved version of a well-known exact multi-objective mathematical programming technique, called the efficient ɛ-constraint method. The second method is a heuristic algorithm called multi-start Partial-Bound Enumeration (PBE). Both methods are used to comparatively generate a set of non-dominated solutions for the fuzzy MMKP. The performance of the two methods is statistically compared with respect to a set of simulated benchmark cases using different diversity and accuracy metrics.

Language

English

Comments

Khalili-Damghani, K., Nojavan, M. and Tavana, M. (2013) ‘Solving Fuzzy Multidimensional Multiple-choice Knapsack Problems: The Multi-Start Partial Bound Enumeration Method versus the Efficient Epsilon-Constraint Method,’ Applied Soft Computing, Vol. 13, No. 4, pp. 1627–1638.

Link to Full Text

Share

COinS