Ant Colony Algorithm for Solving the First Category of Assembly Line Balancing Problem
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    Assembly line balancing problem is an important and difficult problem in production management. The first category is the key to the assembly line balancing problem. Based on the assembly line balancing problem analysis and modeling, this paper proposes steps and algorithms of the first category of general assembly line balancing problem using artificial intelligence optimization algorithm of ant colony algorithm, which uses heuristic methods to generate structure program distribution strategy. It introduces pheromone local update policy with a combination of global rules, so that the algorithm has a good purpose, which greatly improved the efficiency of access to the optimal solution. This algorithm can better solve the first type of assembly line balancing problem, and have advantages like high speed, robustness and universal property etc.

    Reference
    Related
    Cited by
Get Citation

毛凌翔,郑永前.蚁群算法求解装配线平衡第一类问题.计算机系统应用,2010,19(1):140-143

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:April 14,2009
  • Revised:
  • Adopted:
  • Online:
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063