文化大學機構典藏 CCUR:Item 987654321/22911
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 47121/50987 (92%)
造访人次 : 13820397      在线人数 : 241
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻
    主页 ‧ 登入 ‧ 上传 ‧ 说明 ‧ 关于CCUR ‧ 管理 到手机版


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://irlib.pccu.edu.tw/handle/987654321/22911


    题名: SOLVING THE SHORTEST PATH PROBLEM WITH IMPRECISE ARC LENGTHS USING A TWO-STAGE TWO-POPULATION GENETIC ALGORITHM
    作者: Lin, Feng-Tse
    Shih, Teng-San
    贡献者: 應用數學系
    关键词: CONSTRAINTS
    FUZZY
    NETWORK
    日期: 2011-12
    上传时间: 2012-09-04 09:38:33 (UTC+8)
    摘要: This study investigates how to solve the shortest path problem with imprecise arc lengths using a two-stage two-population genetic algorithm (CA). This approach can conveniently represent imprecise numerical quantities, and therefore, it is able to handle imprecise arc lengths. In its first stage, the proposed GA simulates a fuzzy number by partitioning an imprecise arc length into a finite number of subintervals. Each subinterval represents a partition point. A random real number in [0, 1] is first assigned to each partition point. The GA then evolves the values in each partition point, with the final values in each partition point representing the membership grades of that, fuzzy number. Thus, it is possible to obtain estimated values for the originally imprecise arc lengths, and the fuzzy problem becomes a defuzzified instance. The second stage of the GA is to search for the best solution to the defuzzified instance using a scheme in which two candidate populations evolve simultaneously. The first population comprises a set of feasible candidate solutions, and the second population consists of infeasible candidate solutions. The two solution populations are separately maintained and evolved, but their offspring may flow from one population into the other. Experimental results show that the proposed two-stage two-population GA approach obtains better results than other fuzzy shortest path approaches.
    關聯: INTERNATIONAL JOURNAL OF INNOVATIVE COMPUTING INFORMATION AND CONTROL Volume: 7 Issue: 12 Pages: 6889-6904
    显示于类别:[應數系] 期刊論文

    文件中的档案:

    没有与此文件相关的档案.



    检视Licence

    在CCUR中所有的数据项都受到原著作权保护.

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