<listing id="l9bhj"><var id="l9bhj"></var></listing>
<var id="l9bhj"><strike id="l9bhj"></strike></var>
<menuitem id="l9bhj"></menuitem>
<cite id="l9bhj"><strike id="l9bhj"></strike></cite>
<cite id="l9bhj"><strike id="l9bhj"></strike></cite>
<var id="l9bhj"></var><cite id="l9bhj"><video id="l9bhj"></video></cite>
<menuitem id="l9bhj"></menuitem>
<cite id="l9bhj"><strike id="l9bhj"><listing id="l9bhj"></listing></strike></cite><cite id="l9bhj"><span id="l9bhj"><menuitem id="l9bhj"></menuitem></span></cite>
<var id="l9bhj"></var>
<var id="l9bhj"></var>
<var id="l9bhj"></var>
<var id="l9bhj"><strike id="l9bhj"></strike></var>
<ins id="l9bhj"><span id="l9bhj"></span></ins>
Volume 36 Issue 1
Jul.  2021
Turn off MathJax
Article Contents
LONG Jian-yu, ZHENG Zhong, GAO Xiao-qiang, GONG Yong-min, HU Wan-zhe. Production re-planning based on genetic algorithm for steelmaking-continuous casting[J]. Chinese Journal of Engineering, 2014, 36(1): 115-122. doi: 10.13374/j.issn1001-053x.2014.01.018
Citation: LONG Jian-yu, ZHENG Zhong, GAO Xiao-qiang, GONG Yong-min, HU Wan-zhe. Production re-planning based on genetic algorithm for steelmaking-continuous casting[J]. Chinese Journal of Engineering, 2014, 36(1): 115-122. doi: 10.13374/j.issn1001-053x.2014.01.018

Production re-planning based on genetic algorithm for steelmaking-continuous casting

doi: 10.13374/j.issn1001-053x.2014.01.018
  • Received Date: 2013-04-08
    Available Online: 2021-07-10
  • An approach, whose hardcore is a classification of charges by determining whether the charge starts at the time of disturbance occurrence, of making a re-plan was proposed to solve the problem of multi-constrained steelmaking-continuous casting re-planning. The constraints of the re-planning problem are divided into hard and soft constraints. A hybrid algorithm based on time forward inferring and genetic algorithm is designed for the processing charges, and another hybrid algorithm based on time backward inferring and genetic algorithm is designed for the un-processing charges. The feasible solution of the re-planning problem is solved with the hybrid algorithm and hard constraints, and the optimal solution is searched with the soft constraints in the feasible solution. The feasibility and effectiveness of the method were verified with the help of simulation experiments by production data in a steel plant.

     

  • loading
  • 加載中

Catalog

    通訊作者: 陳斌, bchen63@163.com
    • 1. 

      沈陽化工大學材料科學與工程學院 沈陽 110142

    1. 本站搜索
    2. 百度學術搜索
    3. 萬方數據庫搜索
    4. CNKI搜索
    Article views (164) PDF downloads(14) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return
    久色视频