Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Industrial Engineering / 工業工程學研究所
  4. An Electromagnetic Attraction and Repulsion Simulated Optimization Algorithm for Object Sequencing and Grouping Problems
 
  • Details

An Electromagnetic Attraction and Repulsion Simulated Optimization Algorithm for Object Sequencing and Grouping Problems

Date Issued
2005
Date
2005
Author(s)
YU, Chih-Wei
DOI
zh-TW
URI
http://ntur.lib.ntu.edu.tw//handle/246246/49098
Abstract
本研究提出仿電磁吸斥離散優化演算法,求解物件排序優化問題及物件分群優化問題。求解問題包括旅行銷售員問題、裝箱重量均等問題、及節點著色問題。本研究針對物件排序優化問題本研究提出「虛擬映射」和「真實映射」兩種粒子移動模式及四種連續座標值映射成離散值的「離散映射作業」法。至於物件分群優化問題,本研究以區間指派法求解裝箱重量均等問題。針對有容量限制的裝箱重量均等問題提出懲罰函數及嘗試修補機制求解。求解節點著色問題是應用群合併法將節線限制問題轉成物件著色群合併作業的排序問題,最後並以求解物件排序優化法求解。本研究成功地擴展仿電磁吸斥優化演算法的應用範圍,使能求解組合優化問題。研究並測試甚多標竿問題的測試顯示效能甚佳。
This thesis proposes a new heuristic based on Electromagnetic-like mechanism (EM). The method can be used in object sequencing problem and object grouping problem. It still contains an attraction-repulsion mechanism to move the particles towards the global optimality together. The object sequencing problem includes Traveling Salesman Problem(TSP). The object grouping problem contains Bin Packing Balance Problem and Vertex Coloring Problem(VCP). In solving object sequencing problem, the thesis proposes two scenario:Keep Continued and Keep Discritied, and also proposes four methods about Discritied Mapping Operation. In solving object grouping problem, the thesis uses Interval Assignment method to solve Bin Packing Balance Problem. The thesis uses Penalty Function and Repair Method to solve Bin Packing Balance Problem with Limited Capacity. In solving Vertex Coloring Problem, the thesis uses Merge Method(Juhos)and solving object sequencing problem methods. Some test results about Benchmark problem of these problems are included. The method extends successfully to discrete problems. We hope the thesis introduces EM to more researchers. More researches can be attracted to EM, more problem can be solved by EM.
Subjects
仿電磁吸斥優化演算法
物件排序優化問題
物件分群優化問題
旅行銷售員問題
節點著色問題
裝箱問題
Electromagnetic Attraction and Repulsion Optimization Algorithm.
Object Sequencing Problems
Object Grouping Problems
Traveling Salesman Problem
Vertex Coloring Problem
Bin Packing Problem
Type
thesis

臺大位居世界頂尖大學之列,為永久珍藏及向國際展現本校豐碩的研究成果及學術能量,圖書館整合機構典藏(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