Journal of Northeastern University ›› 2011, Vol. 32 ›› Issue (2): 183-187.DOI: -

• OriginalPaper • Previous Articles     Next Articles

A differential evolution algorithm for dynamic scheduling with variable delivery dates

Liu, Li-Li (1); Wang, Shi-Yuan (1); Wang, Ding-Wei (2)   

  1. (1) School of Information Science and Engineering, Northeastern University, Shenyang 110819, China; (2) Key Laboratory of Integrated Automation of Process Industry, Ministry of Education, Northeastern University, Shenyang 110819, China
  • Received:2013-06-19 Revised:2013-06-19 Published:2013-04-04
  • Contact: Liu, L.-L.
  • About author:-
  • Supported by:
    -

Abstract: Diversity loss and low optimizing efficiency are the two problems to be solved for the differential evolution (DE) algorithm in dynamic environment. A multi-population DE algorithm usually applied to the space optimization of continuous solution is proposed for the solution of dynamic scheduling problem with sequential coding, where the representative method using random keys for coding is introduced to transform the continuous position vectors into sequential coding. A self-organizing multi-population strategy is then set out to divide the population into parent population and child population, which is separated automatically from the parent one in accordance to their dynamic spatial characteristics. With the parent population in uninterrupted search of the regions where the peaks take place, the child population is assigned to exploit the useful regions further with adaptive adjustment done for its size, thus expediting the optimizing speed of the algorithm with computing resource saved. The algorithm proposed has been applied to the dynamic scheduling with variable delivery date, and a satisfactory result is gained.

CLC Number: