Journal of Northeastern University Natural Science ›› 2014, Vol. 35 ›› Issue (2): 190-194.DOI: 10.12068/j.issn.1005-3026.2014.02.009

• Information & Control • Previous Articles     Next Articles

Memetic Algorithm for Crane Scheduling Problem with Spatial and Temporal Constraints

WANG Xu1,2, LIU Shixin1,2, WANG Jia3   

  1. 1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China; 2. State Key Laboratory of Synthetical Automation for Process Industries, Northeastern University, Shenyang 110819, China; 3. School of Business Administration, Northeastern University, Shenyang 110819, China.
  • Received:2013-05-28 Revised:2013-05-28 Online:2014-02-15 Published:2013-11-22
  • Contact: WANG Xu
  • About author:-
  • Supported by:
    -

Abstract: A crane scheduling problem is a multimachine,multitask and NPhard problem. For the problem in the steelmakingcontinuous casting production process, a model was proposed to minimize the waiting time of molten steel, with temporal and spatial constraints considered. An improved Memetic algorithm was developed to solve the model, in which individual decoding based on task allocation rules and conflicts eliminating rules, PPX crossover operator and local search(LS) operator were designed, and it was also compared with the genetic algorithm. The solution to the model with the improved algorithm for a practical problem showed that the waiting time was reduced by 1667% at most with high stability, in comparison with the genetic algorithm.

Key words: multitask model, crane scheduling, spatial and temporal constraint, Memetic algorithm

CLC Number: