Guidelines for developing effective Estimation of Distribution Algorithms in solving single machine scheduling problems

摘要

The goal of this research is to deduce important guidelines for designing effective Estimation of Distribution Algorithms (EDAs). These guidelines will enhance the designed algorithms in balancing the intensification and diversification effects of EDAs. Most EDAs have the advantage of incorporating probabilistic models which can generate chromosomes with the non-disruption of salient genes. This advantage, however, may cause the problem of the premature convergence of EDAs resulted in the probabilistic models no longer generating diversified solutions. In addition, due to overfitting of the search space, probabilistic models cannot really represent the general information of the population. Therefore, this research will deduce important guidelines through the convergency speed analysis of EDAs under different computational times for designing effective EDA algorithms. The major idea is to increase the population diversity gradually by hybridizing EDAs with other meta-heuristics and replacing the procedures of sampling new solutions. According to that, this research further proposes an Adaptive EA/G to improve the performance of EA/G. The proposed algorithm solves 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 outperforms ACGA and EA/G statistically significant in different stopping criteria. This paper, hence, is of importance in the field of EDAs as well as for the researchers in studying the scheduling problems.