A genetic algorithm approach to optimization of asynchronous automatic assembly systems | Zendy

Mark A. Wellman | Zendy; Douglas D. Gemmill | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A genetic algorithm approach to optimization of asynchronous automatic assembly systems

Author(s) -

Mark A. Wellman,

Douglas D. Gemmill

Publication year - 1995

Publication title -

international journal of flexible manufacturing systems

Language(s) - English

Resource type - Journals

eISSN - 1572-9370

pISSN - 0920-6299

DOI - 10.1007/bf01324878

Subject(s) - asynchronous communication , genetic algorithm , computer science , quality control and genetic algorithms , algorithm , meta optimization , mathematical optimization , stochastic optimization , blocking (statistics) , mathematics , machine learning , computer network

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research