2011 | OriginalPaper | Buchkapitel
Scheduling Flexible Assembly Lines Using Differential Evolution
verfasst von : Lui Wen Han Vincent, S. G. Ponnambalam
Erschienen in: Swarm, Evolutionary, and Memetic Computing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper investigates the performance of Differential Evolution (DE) in solving a Flexible Assembly Line (FAL) scheduling problem. Using a mathematical model developed in literature, the DE algorithm is implemented with the objectives of minimizing the sum of Earliness/Tardiness (E/T) penalties and maximizing the balance of the FAL. Experimental results have shown that DE is capable of solving the FAL scheduling problem effectively. Furthermore, a comparison with similar work in literature which employs Genetic Algorithm (GA) shows that DE produces a better solution.