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

Authors:
Kaveh Khalili-Damghani;Majid Nojavan;Madjid Tavana
Affiliations:
Department of Industrial Engineering, South-Tehran Branch, Islamic Azad University, Tehran, Iran;Department of Industrial Engineering, South-Tehran Branch, Islamic Azad University, Tehran, Iran;Business Systems and Analytics, Lindback Distinguished Chair of Information Systems and Decision Sciences, La Salle University, Philadelphia, PA 19141, USA
Venue:
Applied Soft Computing
Year:
2013

Citing 26
Cited 0

Fuzzy multiple choice knapsack problem

Fuzzy Sets and Systems - Special issue on operations research
A fuzzy programming approach to multiobjective multidimensional 0–1 knapsack problems

Fuzzy Sets and Systems
Possibilistic linear programming: a brief review of fuzzy mathematical programming and a comparison with stochastic programming in portfolio selection problem

Fuzzy Sets and Systems - Fuzzy mathematical programming
Formal Algorithms + Formal Representations = Search Strategies

PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Towards the real time solution of strike force asset allocation problems

Computers and Operations Research
An approach to fuzzy multiattribute decision making under uncertainty

Information Sciences: an International Journal
MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem

Computers and Operations Research
Asset portfolio optimization using fuzzy mathematical programming

Information Sciences: an International Journal
Multi-objective Group Decision Making: Methods, Software and Applications With Fuzzy Set Techniques

Multi-objective Group Decision Making: Methods, Software and Applications With Fuzzy Set Techniques
The two-stage recombination operator and its application to the multiobjective 0/1 knapsack problem: A comparative study

Computers and Operations Research
A grasp-knapsack hybrid for a nurse-scheduling problem

Journal of Heuristics
Hard multidimensional multiple choice knapsack problems, an empirical study

Computers and Operations Research
Vendor selection problem by using an interactive fuzzy multi-objective approach with modified S-curve membership functions

Computers & Mathematics with Applications
An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows

Computers and Operations Research
Transportation planning with modified S-curve membership functions using an interactive fuzzy multi-objective approach

Applied Soft Computing
Development of core to solve the multidimensional multiple-choice knapsack problem

Computers and Industrial Engineering
Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem

Computers and Operations Research
A fuzzy DEA and knapsack formulation integrated model for project selection

Computers and Operations Research
A knapsack problem as a tool to solve the production planning problem in small foundries

Computers and Operations Research
A capital budgeting problem for preventing workplace mobbing by using analytic hierarchy process and fuzzy 0-1 bidimensional knapsack model

Expert Systems with Applications: An International Journal
Fusing ant colony optimization with Lagrangian relaxation for the multiple-choice multidimensional knapsack problem

Information Sciences: an International Journal
A fast and elitist multiobjective genetic algorithm: NSGA-II

IEEE Transactions on Evolutionary Computation
A New Heuristic for Solving the Multichoice Multidimensional Knapsack Problem

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Inexact two-phase fuzzy programming and its application to municipal solid waste management

Engineering Applications of Artificial Intelligence
Applying fuzzy mathematical programming approach to optimize a multiple supply network in uncertain condition with comparative analysis

Applied Soft Computing
Introduction to Evolutionary Algorithms

Introduction to Evolutionary Algorithms

Quantified Score

Hi-index	0.00

Visualization

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.