Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Industrial Engineering / 工業工程學研究所
  4. A human intelligence inspired meta heuristic optimization algorithm for TSPs
 
  • Details

A human intelligence inspired meta heuristic optimization algorithm for TSPs

Journal
3rd International Conference on Computational Intelligence and Applications
Pages
42-46
Date Issued
2018
Author(s)
FENG-CHENG YANG  
Li, R.-F.
DOI
10.1109/ICCIA.2018.00016
URI
https://scholars.lib.ntu.edu.tw/handle/123456789/467285
URL
https://www.scopus.com/inward/record.uri?eid=2-s2.0-85066329025&doi=10.1109%2fICCIA.2018.00016&partnerID=40&md5=2ef876f9d1908d36dc39111fc6b0bc23
Abstract
This paper presents a novel heuristic optimization algorithm for discrete optimization problems, the Bandwidth Restricted Transmission-Simulated Optimization Algorithm (BRT-S). This algorithm imitates the intellective behaviors of human in managing network transmission. BRT-S is a constructive heuristic algorithm whose optimization procedures simulate processes of data transferring and management operations over the network. A population of solution agents mimicking message transmitters on networks is deployed to quest for optimal solutions. The algorithm however restricts the resource utilized in solution search mimicking the bandwidth resource is limited in network transmission. As a result, agents must compete with others to obtain solution construction resources. Due to the mimicked bandwidth restriction, not every agent is able to complete a solution construction. Only constructed solutions are subject to objective value evaluations. In each evolution iteration, bandwidth resources are separately modulated by conducting bandwidth deterioration, enhancement, or depletion, on the basis of the solution qualities obtained. To illustrate the operation procedures of the algorithm, a BRT-S computation model for solving the Traveling Salesman Problem is presented and the solving system is implemented for benchmark testing. Numerical results of the tests indicate that given similar computation resources, the algorithm generates better solutions than other meta heuristic algorithms, such as ACO and GA.
Type
conference paper

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(NTUR)與學術庫(AH)不同功能平台,成為臺大學術典藏NTU scholars。期能整合研究能量、促進交流合作、保存學術產出、推廣研究成果。

To permanently archive and promote researcher profiles and scholarly works, Library integrates the services of “NTU Repository” with “Academic Hub” to form NTU Scholars.

總館學科館員 (Main Library)
醫學圖書館學科館員 (Medical Library)
社會科學院辜振甫紀念圖書館學科館員 (Social Sciences Library)

開放取用是從使用者角度提升資訊取用性的社會運動,應用在學術研究上是透過將研究著作公開供使用者自由取閱,以促進學術傳播及因應期刊訂購費用逐年攀升。同時可加速研究發展、提升研究影響力,NTU Scholars即為本校的開放取用典藏(OA Archive)平台。(點選深入了解OA)

  • 請確認所上傳的全文是原創的內容,若該文件包含部分內容的版權非匯入者所有,或由第三方贊助與合作完成,請確認該版權所有者及第三方同意提供此授權。
    Please represent that the submission is your original work, and that you have the right to grant the rights to upload.
  • 若欲上傳已出版的全文電子檔,可使用Open policy finder網站查詢,以確認出版單位之版權政策。
    Please use Open policy finder to find a summary of permissions that are normally given as part of each publisher's copyright transfer agreement.
  • 網站簡介 (Quickstart Guide)
  • 使用手冊 (Instruction Manual)
  • 線上預約服務 (Booking Service)
  • 方案一:臺灣大學計算機中心帳號登入
    (With C&INC Email Account)
  • 方案二:ORCID帳號登入 (With ORCID)
  • 方案一:定期更新ORCID者,以ID匯入 (Search for identifier (ORCID))
  • 方案二:自行建檔 (Default mode Submission)
  • 方案三:學科館員協助匯入 (Email worklist to subject librarians)

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science