Journal of Northeastern University Natural Science ›› 2017, Vol. 38 ›› Issue (7): 913-917.DOI: 10.12068/j.issn.1005-3026.2017.07.001

• Information & Control •     Next Articles

Memetic Algorithm for Crane Scheduling Problem in Slab Yard with Spatial and Temporal Constraints

WANG Xu1, LIU Shi-xin1, WANG Jia2,3   

  1. 1. School of Information Science & Engineering, Northeastern University, Shenyang 110819, China; 2. School of Business Administration, Northeastern University, Shenyang 110169, China;3.School of Economics, Northeastern University at Qinhuangdao, Qinhuangdao 066004,China.
  • Received:2016-02-04 Revised:2016-02-04 Online:2017-07-15 Published:2017-07-07
  • Contact: WANG Xu
  • About author:-
  • Supported by:
    -

Abstract: Crane scheduling problem was researched for slab yard in steel plant. Considering the time and space as well as the hot rolling, a crane scheduling model for slab yard was established. According to the characters of real-time and non-crossing for the problem, a Memetic algorithm was designed to solve it, including the crane allocation rule based on the priority relation, the decoding rules based on discrete event dynamic simulation(DEDS), adaptive crossover operator and simulate annealing global search after each crossover and mutation. Simulation experiment was performed with data by crane scheduling for slab out, and the results of simulation experiments showed that the proposed algorithm has high convergence speed and stability, which meets actual production demand.

Key words: slab yard, crane scheduling, Memetic algorithm, spatial and temporal constraints, discrete event dynamic simulation

CLC Number: