Solving the knapsack problem with imprecise weight coefficients using genetic algorithms

CCUR > College of Natural Science and Engineering > College of Science > Department of Applied Mathematics > journal articles > Item 987654321/2589

Please use this identifier to cite or link to this item: https://irlib.pccu.edu.tw/handle/987654321/2589

Title:	Solving the knapsack problem with imprecise weight coefficients using genetic algorithms
Authors:	Lin, Feng-Tse
Contributors:	應數系
Keywords:	genetic algorithms fuzzy sets knapsack problem fuzzy knapsack problem
Date:	2008
Issue Date:	2009-11-06 15:44:37 (UTC+8)
Abstract:	This paper investigates solving the knapsack problem with imprecise weight coefficients using genetic algorithms. This work is based on the assumption that each weight coefficient is imprecise due to decimal truncation or coefficient rough estimation by the decision-maker. To deal with this kind of imprecise data, fuzzy sets provide a powerful tool to model and solve this problem. We investigate the possibility of using genetic algorithms in solving the fuzzy knapsack problem without defining membership functions for each imprecise weight coefficient. The proposed approach simulates a fuzzy number by distributing it into some partition points. We use genetic algorithms to evolve the values in each partition point so that the final values represent the membership grade of a fuzzy number. The empirical results show that the proposed approach can obtain very good solutions within the given bound of each imprecise weight coefficient than the fuzzy knapsack approach. The fuzzy genetic algorithm concept approach is different, but gives better results than the traditional fuzzy approach. (c) 2007 Elsevier B.V. All rights reserved.
Relation:	EUROPEAN JOURNAL OF OPERATIONAL RESEARCH Volume: 185 Issue: 1 Pages: 133-145
Appears in Collections:	[Department of Applied Mathematics] journal articles

Files in This Item:

File	Description	Size	Format
index.html		0Kb	Text	811	View/Open

Loading...