Skip to main navigation Skip to search Skip to main content

Assembly sequence planning utilizing chaotic adaptive ant colony optimization algorithm

  • Yong Wang*
  • , De Tian
  • , Jihong Liu
  • *Corresponding author for this work
  • North China Electric Power University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The chaotic adaptive ant colony optimization algorithm (CAACO) is proposed to seek the optimal or near-optimal assembly sequences of mechanical products. Different from the general AACO algorithm, the parameter ρ denoting the global evaporation rate of the AACO algorithm is not specified by the designers, but is generated with the chaotic operators in the optimization process. An example is used to validate the capability of the CAACO algorithm, and the results show that the robustness of the CAACO algorithm is enhanced and more ants in the ant colony can find their own optimal or near-optimal assembly sequences than those of the general AACO algorithm.

Original languageEnglish
Title of host publicationAdvanced Mechanical Engineering
Pages391-396
Number of pages6
DOIs
StatePublished - 2010
Event2010 International Conference on Advanced Mechanical Engineering, AME 2010 - Luoyang, China
Duration: 4 Sep 20105 Sep 2010

Publication series

NameApplied Mechanics and Materials
Volume26-28
ISSN (Print)1660-9336
ISSN (Electronic)1662-7482

Conference

Conference2010 International Conference on Advanced Mechanical Engineering, AME 2010
Country/TerritoryChina
CityLuoyang
Period4/09/105/09/10

Keywords

  • Adaptive ant colony optimization
  • Assembly sequence planning
  • Chaotic operator

Fingerprint

Dive into the research topics of 'Assembly sequence planning utilizing chaotic adaptive ant colony optimization algorithm'. Together they form a unique fingerprint.

Cite this