Repository logo
  • English
  • 中文
Log In
Have you forgotten your password?
  1. Home
  2. College of Engineering / 工學院
  3. Industrial Engineering / 工業工程學研究所
  4. Ant Colony Optimization for the Mixed-Model U-Shaped Assembly Line Balancing Problem
 
  • Details

Ant Colony Optimization for the Mixed-Model U-Shaped Assembly Line Balancing Problem

Date Issued
2009
Date
2009
Author(s)
Lai, Hao-De
URI
http://ntur.lib.ntu.edu.tw//handle/246246/178523
Abstract
The mathematical model of the mixed-model U-shaped assembly line balancing problem is first rigorously defined in this thesis. This research proposes an Ant Colony Optimization (ACO) method for the tasks of line balancing and model sequencing involved in the problem. The pitfall and fitness for the objective functions using the minimum cycle time (CT) and the absolute deviation of workloads (ADW) are discussed. Two operation scenarios are simulated for the assembly line to determine the cycle times of all of the subcycles: (1) each task assigned to a workstation is processing on an individual model instance, and (2) successive tasks assigned to a workstation are processing on the same model instance. An ant platoon consisting of three squads with different heuristic value evaluations is proposed to guide the solution construction for line balancing. The first task for an ant is to construct a sequence of assembly tasks subject to the precedence constraints and create workstation one after the other to host the tasks. The second task is to construct a model sequence. Our method uses a solution set augmentation technique to enlarge the number of solutions and then adopts the segment-based pheromone update strategy from the segment discriminated ant system (SDAS). A software prototype system is developed to implement the proposed method. Several numerical tests are conducted on benchmarks to evaluate the performance of the proposed method. Numerical results show that the ADW objective function, compared with the one with CT, is unable to maximize the line efficiency. In addition, the proposed ACO method significantly outperforms the existing solving algorithms in solving the discussed problems.
Subjects
Assembly line balancing problem
Line balancing
Model sequencing
Mixed-model U-shaped line
Ant Colony Optimization
Type
thesis
File(s)
Loading...
Thumbnail Image
Name

ntu-98-R96546029-1.pdf

Size

23.53 KB

Format

Adobe PDF

Checksum

(MD5):35f879bebbd2c3580757555295d44295

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