EA/G-GA for single machine scheduling problems with earliness/tardiness costs

Shih Hsin Chen, Min Chih Chen, Pei Chann Chang, Yuh Min Chen

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

An Estimation of Distribution Algorithm (EDA), which depends on explicitly sampling mechanisms based on probabilistic models with information extracted from the parental solutions to generate new solutions, has constituted one of the major research areas in the field of evolutionary computation. The fact that no genetic operators are used in EDAs is a major characteristic differentiating EDAs from other genetic algorithms (GAs). This advantage, however, could lead to premature convergence of EDAs as the probabilistic models are no longer generating diversified solutions. In our previous research [1], we have presented the evidences that EDAs suffer from the drawback of premature convergency, thus several important guidelines are provided for the design of effective EDAs. In this paper, we validated one guideline for incorporating other meta-heuristics into the EDAs. An algorithm named "EA/G-GA" is proposed by selecting a well-known EDA, EA/G, to work with GAs. The proposed algorithm was tested on the NP-Hard single machine scheduling problems with the total weighted earliness/tardiness cost in a just-in-time environment. The experimental results indicated that the EA/G-GA outperforms the compared algorithms statistically significantly across different stopping criteria and demonstrated the robustness of the proposed algorithm. Consequently, this paper is of interest and importance in the field of EDAs.

Original languageEnglish
Pages (from-to)1152-1169
Number of pages18
JournalEntropy
Volume13
Issue number6
DOIs
Publication statusPublished - 2011 Jun

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'EA/G-GA for single machine scheduling problems with earliness/tardiness costs'. Together they form a unique fingerprint.

  • Cite this