Scheduling flexible assembly lines using differential evolution

Authors:
Lui Wen Han Vincent;S. G. Ponnambalam
Affiliations:
Monash University, Petaling Jaya, Malaysia;Monash University, Petaling Jaya, Malaysia
Venue:
SEMCCO'11 Proceedings of the Second international conference on Swarm, Evolutionary, and Memetic Computing - Volume Part I
Year:
2011

Citing 4
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Two improved differential evolution schemes for faster global search

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
A Genetic-Algorithm-Based Optimization Model for Solving the Flexible Assembly Line Balancing Problem With Work Sharing and Workstation Revisiting

IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
Differential Evolution: A Survey of the State-of-the-Art

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.