Citation
Development of E ective Estimation of Distribution Algorithms for Scheduling Problems. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 531-556, 2009.
Paper
Abstract
The purpose of this paper is to establish some guidelines for designing effective Estimation of Distribution Algorithms (EDAs). These guidelines aim at balancing intensification and diversification in EDAs. Most EDAs are able to maintain some important linkages among variables. This advantage, however, may lead to the premature convergence of EDAs since the probabilistic models no longer generating diversified solutions. In addition, overfitting might occure in EDAs. This paper proposes guidelines based on the convergence speed analysis of EDAs under different computational times for designing e ective EDA algorithms. The major ideas are to increase the population diversity gradually and by hybridizing EDAs with other meta-heuristics. Using these guidelines, this research further proposes an adaptive EA/G and EA/G-GA to improve the performance of EA/G. The proposed algorithm solved the single machine scheduling problems with earliness/tardiness cost in a just-in-time scheduling environment. The experimental results indicated that the Adaptive EA/G and EA/G-GA outperform ACGA and EA/G statistically signficant with di erent stopping criteria. When it comes to the intensfication of EDAs, heuristic method is combined with EDAs. Because NEH is a well-known heuristic in solving permutation flowshop problems with the objective of makespan, this heuristic generates a good initial solution for EDAs. The experimental results also indicate NEH improving the EDAs signifcantly. This paper, hence, is of importance in the field of EDAs as well as for the researchers in studying the scheduling problems.
You can download the pdf of this publication from here
doi
This publication does not have a doi, so we cannot provide a link to the original source
What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information
URL
This pubication does not have a URL associated with it.
The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.
Bibtex
@INPROCEEDINGS{2009-531-556-P, author = {S-H. Chen and M-C. Chen and P-C. Chang and Q. Zhang and Y-M. Chen},
title = {Development of E ective Estimation of Distribution Algorithms for Scheduling Problems},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {531--556},
note = {Paper},
abstract = {The purpose of this paper is to establish some guidelines for designing effective Estimation of Distribution Algorithms (EDAs). These guidelines aim at balancing intensification and diversification in EDAs. Most EDAs are able to maintain some important linkages among variables. This advantage, however, may lead to the premature convergence of EDAs since the probabilistic models no longer generating diversified solutions. In addition, overfitting might occure in EDAs. This paper proposes guidelines based on the convergence speed analysis of EDAs under different computational times for designing e ective EDA algorithms. The major ideas are to increase the population diversity gradually and by hybridizing EDAs with other meta-heuristics. Using these guidelines, this research further proposes an adaptive EA/G and EA/G-GA to improve the performance of EA/G. The proposed algorithm solved the single machine scheduling problems with earliness/tardiness cost in a just-in-time scheduling environment. The experimental results indicated that the Adaptive EA/G and EA/G-GA outperform ACGA and EA/G statistically signficant with di erent stopping criteria. When it comes to the intensfication of EDAs, heuristic method is combined with EDAs. Because NEH is a well-known heuristic in solving permutation flowshop problems with the objective of makespan, this heuristic generates a good initial solution for EDAs. The experimental results also indicate NEH improving the EDAs signifcantly. This paper, hence, is of importance in the field of EDAs as well as for the researchers in studying the scheduling problems.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-531-556-P.pdf} }