An Improved Ant Colony Optimization for Two-Sided Assembly Line Balancing Problem

ZHENG Qiao-xian; LI Ming; LI Yuan-xiang; TANG Qiu-hua

doi:10.3969/j.issn.0372-2112.2014.05.002

您当前的位置：

首页 >

文章列表页 >

An Improved Ant Colony Optimization for Two-Sided Assembly Line Balancing Problem

更新时间：2025-07-16

- An Improved Ant Colony Optimization for Two-Sided Assembly Line Balancing Problem
- Acta Electronica Sinica Vol. 42, Issue 5, Pages: 841-845(2014)
- 作者机构：
  
  1. 湖北大学数学与计算机科学学院,湖北,武汉,430062
  2. 武汉大学计算机学院,湖北,武汉,430072
  3. 武汉科技大学理学院,湖北,武汉,430065
  4. 武汉科技大学机械自动化学院,湖北,武汉,430081
  5. 湖北大学数学与计算机科学学院,湖北,武汉,430062
  6. 武汉大学计算机学院,湖北,武汉,430072
  7. 武汉科技大学理学院,湖北,武汉,430065
  8. 武汉科技大学机械自动化学院,湖北,武汉,430081
- 作者简介：
- 基金信息：
  
  National Natural Science Foundation of China (No.50875190, No.51275366);Open Fund for Hubei Province Key Laboratory of Systems Science in Metallurgical Process of Wuhan University of Science and Technology (No.Y201109)
- DOI：10.3969/j.issn.0372-2112.2014.05.002
  CLC： TH166TP18
- Published：2014
- 稿件说明：
移动端阅览
ZHENG Qiao-xian, LI Ming, LI Yuan-xiang, et al. An Improved Ant Colony Optimization for Two-Sided Assembly Line Balancing Problem[J]. Acta Electronica Sinica, 2014, 42(5): 841-845.
DOI：

ZHENG Qiao-xian, LI Ming, LI Yuan-xiang, et al. An Improved Ant Colony Optimization for Two-Sided Assembly Line Balancing Problem[J]. Acta Electronica Sinica, 2014, 42(5): 841-845. DOI： 10.3969/j.issn.0372-2112.2014.05.002.

摘要

结合第2类双边装配线平衡问题(TALBP-2)的特点，提出了一种改进蚁群算法.针对TALBP-2中操作间的序关系，对分配至同一个边工位中相邻的两项操作间定义了一种新的信息素；提出了一种新的定界策略，根据所得的最好解，减小工位时间的上界，利用已分配工位的平均实际作业时间界定工位时间的下界，缩小蚂蚁的搜索空间；针对TALBP-2提出了一种新的操作分配准则，根据所定义的3种理想操作的优先分配权限分配操作；提出了一种边工位确定原则，平衡两边工位时间的增加速度.算例的比较结果表明算法有较好的求解效果和稳定性.

Abstract

According to the characteristics of the type 2 two-sided assembly line balancing problem

an improved ant colony optimization is proposed.A novel pheromone between two adjacent tasks in the same side station is defined to describe the order relation between them.A new bound strategy is proposed to reduce the search space of ants

by decreasing the upper bound of station times according to the current best solution

and bounding their lower bounds with the mean processing time of assigned stations.An improved task assignment rule is applied to assign the suitable task to station

in which three kinds ideal task with different prior permissions are used.A side station determination rule is proposed to balance the increase speed of both side times.Computational results show the effectiveness and stability of proposed algorithm.

关键词

Keywords

references

Views

1399

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

One Hybrid Strategy for Automatic Placement and Routing of QCA Circuit

An Almost Everywhere Strong Convergence Proof for a Class of Ant Colony Algorithms

A Study of Optimum Multiuser Detection Problem

A Novel Improved Quantum Genetic Algorithm for Combinatorial Optimization Problems

Uplink Status Based Dynamically Optimized Channel Assignment

Related Author

XIE Guang-jun

LI Xiao-shuai

HAN Qian

PENG Fei

LI Yang-shuai

XIA Na

ZHANG Guo-fu

LIANG Chang-yong

Related Institution

College of Electronic Engineering， National University of Defense Technology

College of Microelectronics， Hefei University of Technology

National Engineering Research Center of Special Display TechnologyHefeiAnhui 230009China

Engineering Research Center of Safety Critical Industrial Measurement and Control TechnologyMinistry of EducationHefeiAnhui 230009China

Postdoctoral Programs at Management Science and EngineeringHefei University of TechnologyHefeiAnhui 230009China

⁰