English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62830/95882 (66%)
Visitors : 4145254      Online Users : 631
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121537


    Title: Development of Effective Estimation of Distribution Algorithms for Scheduling Problems
    Authors: Chen, Shih-hsin;Chen, Min-chih;Chang, Pei-chann;Qingfu, Zhang Yuh-min;Chen, Shih-hsin;Chen, Min-chih;Chang, Pei-chann;Zhang, Qingfu;Chen, Yuh-min
    Keywords: effective estimation;distribution algorithm;adaptive ea;different computational time;effective eda algorithm;premature convergence;ea gga outperform acga;convergence speed analysis;population diversity;major idea;single machine;diversified solution heuristic method;probabilistic model;ea g-ga;just-in-time scheduling environment;earliness tardiness cost;experimental result;important linkage
    Date: 2009-08-10
    Issue Date: 2021-10-21 12:11:46 (UTC+8)
    Abstract: 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 effective 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 significant with different stopping criteria. When it comes to the intensification of EDAs, heuristic method is combined with EDAs.
    Appears in Collections:[資訊工程學系暨研究所] 會議論文

    Files in This Item:

    File SizeFormat
    index.html0KbHTML40View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback