English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 47126/50992 (92%)
造訪人次 : 13848822      線上人數 : 253
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    主頁登入上傳說明關於CCUR管理 到手機版


    請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/2589


    題名: Solving the knapsack problem with imprecise weight coefficients using genetic algorithms
    作者: Lin, Feng-Tse
    貢獻者: 應數系
    關鍵詞: genetic algorithms
    fuzzy sets
    knapsack problem
    fuzzy knapsack problem
    日期: 2008
    上傳時間: 2009-11-06 15:44:37 (UTC+8)
    摘要: 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.
    關聯: EUROPEAN JOURNAL OF OPERATIONAL RESEARCH Volume: 185 Issue: 1 Pages: 133-145
    顯示於類別:[應數系] 期刊論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    index.html0KbText805檢視/開啟


    在CCUR中所有的資料項目都受到原著作權保護.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - 回饋