Abstract
In this paper, an interactive fuzzy satisficing method for multiobjective multidimensional 0-1 knapsack problems is proposed by incorporating the desirable features of both the interactive fuzzy programming methods and genetic algorithms. By considering the vague nature of human judgements, fuzzy goals of the decision maker (DM) for objective functions are quantified by eliciting linear membership functions. If the DM specifies a reference membership level for each of the membership functions, the corresponding (local) Pareto optimal solution can be obtained by solving the formulated minimax problem through a genetic algorithm with double strings. For obtaining an optimal solution not dominated by the solutions before interaction, the algorithm is revised by introducing some new mechanism for forming an initial population. Illustrative numerical examples demonstrate both feasibility and effectiveness of the proposed method.
Keywords
Knapsack problemSatisficingMathematical optimizationFuzzy logicGenetic algorithmMathematicsMinimaxPopulationContinuous knapsack problemLinear programmingComputer scienceAlgorithmArtificial intelligence
Affiliated Institutions
Related Publications
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Decomposition is a basic strategy in traditional multiobjective optimization. However, it has not yet been widely used in multiobjective evolutionary optimization. This paper pr...
Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach
Evolutionary algorithms (EAs) are often well-suited for optimization problems involving several, often conflicting objectives. Since 1985, various evolutionary approaches to mul...
GENETIC ALGORITHMS FOR MULTI-OBJECTIVE OPTIMIZATION: FORMULATION, DISCUSSION, AND GENERALIZATION
The paper describes a rank-based fitness assignment method for Multiple Objective Genetic Algorithms (MOGAs). Conventional niche formation methods are extended to this class of ...
A niched Pareto genetic algorithm for multiobjective optimization
Many, if not most, optimization problems have multiple objectives. Historically, multiple objectives have been combined ad hoc to form a scalar objective function, usually throu...
Comparison of Multiobjective Evolutionary Algorithms: Empirical Results
In this paper, we provide a systematic comparison of various evolutionary approaches to multiobjective optimization using six carefully chosen test functions. Each test function...
Publication Info
- Year
- 2002
- Type
- article
- Pages
- 243-246
- Citations
- 24
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
24
OpenAlex
Cite This
Μ. Sakawa,
Kosuke Kato,
Toshihiro Shibano
(2002).
An interactive fuzzy satisficing method for multiobjective multidimensional 0-1 knapsack problems through genetic algorithms.
, 243-246.
https://doi.org/10.1109/icec.1996.542368
Identifiers
- DOI
- 10.1109/icec.1996.542368