Chung-Hua University Repository:Item 987654321/35904
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 8557/14866 (58%)
Visitors : 1406037      Online Users : 1101
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
    •  Adv. Search
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: http://chur.chu.edu.tw/handle/987654321/35904


    Title: 調適型螞蟻演算法應用於旅行推銷員問題之研究
    Authors: 卓裕仁
    Cho, Yuh-Jen
    Contributors: 運輸科技與物流管理學系
    Transportation Technology and Logistics Management
    Keywords: 螞蟻演算法;旅行推銷員問題;調適型參數控制
    Ant Colony Optimization;Traveling Salesman Problem;Adaptive Parameters Control
    Date: 2007
    Issue Date: 2014-06-27 10:55:10 (UTC+8)
    Abstract: 螞蟻演算法(Ant Algorithms)為近年來廣被探討的一種巨集啟發式方法，也被統稱為螞蟻群落最佳化(Ant Colony Optimization, ACO)方法。ACO已被成功應用於求解許多複雜的組合最佳化問題上，並衍生出多種不同的執行機制(例如：AS、ACS、Ant-Q、Max-Min AS與ASrank)。這些ACO方法的主要差異在於兩個部份：路徑構建機制與費洛蒙更新機制。本研究之目的即針對ACO的路徑構建機制及其控制參數設定進行深入研究，提出一個稱之為「調適型螞蟻演算法(Adaptive A
    The Ant Algorithm, also named as Ant Colony Optimization (ACO), is recently a famous meta-heuristic approach that has been successfully applied to solve many complicated Combinatorial Optimization Problems. Furthermore, several variants of the Ant Algorit
    Appears in Collections:[Department of Transportation Technology and Logistice Management] Journal Articles

    Files in This Item:

    File Description SizeFormat
    p_m620_0059.pdf37KbAdobe PDF86View/Open


    All items in CHUR are protected by copyright, with all rights reserved.

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