A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem

A genetic algorithms simulation approach for the multi-attribute combinatorial dispatching decision problem

0.00 Avg rating0 Votes
Article ID: iaor20084380
Country: Netherlands
Volume: 176
Issue: 3
Start Page Number: 1859
End Page Number: 1873
Publication Date: Feb 2007
Journal: European Journal of Operational Research
Authors: , ,
Keywords: combinatorial optimization, heuristics: genetic algorithms
Abstract:

This paper presents a genetic algorithms (GA) simulation approach in solving a multi-attribute combinatorial dispatching (MACD) decision problem in a flow shop with multiple processors (FSMP) environment. The simulation is capable of modeling a non-linear and stochastic problem. GA are one of the commonly used metaheuristics and are a proven tool for solving complex optimization problems. The proposed GA simulation approach addresses a complex MACD problem. Its solution quality is illustrated by a case study from a multi-layer ceramic capacitor (MLCC) manufacturing plant. Because GA search results are often sensitive to the search parameters, this research optimized the GA parameters by using regression analysis. Empirical results showed that the GA simulation approach outperformed several commonly used dispatching rules. The improvements are ranging from 33% to 61%. On the other hand, the increased shop-floor-control complexity may hinder the implementation of the system. Finally, future research directions are discussed.

Reviews

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