Using multiple genetic operators to reduce premature convergence in genetic assembly planning

Authors:
Shana Shiang-Fong Smith
Affiliations:
Department of Industrial Education and Technology, 122 I. ED. II, Iowa State University, Ames, IA
Venue:
Computers in Industry
Year:
2004

Citing 6
Cited 5

Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Computer integrated manufacturing and engineering

Computer integrated manufacturing and engineering
Robots and Manufacturing Automation

Robots and Manufacturing Automation
Automation, Production Systems and Computer-Aided Manufacturing

Automation, Production Systems and Computer-Aided Manufacturing
Forward Assembly Planning Based on Stability

Journal of Intelligent and Robotic Systems
Task sequence planning for robotic assembly

Task sequence planning for robotic assembly

Enhancing optimal feeder assignment of the multi-head surface mounting machine using genetic algorithms

Applied Soft Computing
Economical green product design based on simplified computer-aided product structure variation

Computers in Industry
Rule-based recursive selective disassembly sequence planning for green design

Advanced Engineering Informatics
Survey on assembly sequencing: a combinatorial and geometrical perspective

Journal of Intelligent Manufacturing
Haptic assisted aircraft optimal assembly path planning scheme based on swarming and artificial potential field approach

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recent research reports describe efforts to create automated assembly sequence planners, which will help design and manufacturing engineers analyze increasingly complex and customized products and the dynamic conditions found in modern computer integrated manufacturing (CIM) systems.Early assembly planners that use graph searching techniques can generally find global-optimal assembly plans for a product, but tend to have long run-times. More recent assembly planners that use genetic algorithms can generally find high-quality solutions quickly, but tend to converge prematurely at local-optimal solutions. The author introduces two new genetic operators to help reduce premature convergence in genetic assembly planners.The results bring automated assembly planning and fully flexible computer integrated manufacturing systems closer to real-world application.