A genetic algorithm approach to optimization of asynchronous automatic assembly systems

A genetic algorithm approach to optimization of asynchronous automatic assembly systems

0.00 Avg rating0 Votes
Article ID: iaor19952008
Country: United States
Volume: 7
Issue: 1
Start Page Number: 27
End Page Number: 46
Publication Date: Mar 1995
Journal: International Journal of Flexible Manufacturing Systems
Authors: ,
Keywords: genetic algorithms
Abstract:

This paper presents the application of genetic algorithms to the performance optimization of asynchronous automatic assembly systems (AAS). These stochastic systems are subject to blocking and starvation effects that make complete analytic performance modeling difficult. Therefore, this paper extends genetic algorithms to stochastic systems. The performance of the genetic algorithm is measured through comparison with the results of stochastic quasi-gradient (SQM) methods to the same AAS. The genetic algorithm performs reasonably well in obtaining good solutions (as compared with results of SQM) in this stochastic optimization example, even though genetic algorithms were designed for application to deterministic systems. However, the genetic algorithm’s performance does not appear to be superior to SQM.

Reviews

Required fields are marked *. Your email address will not be published.