首页 | 本学科首页   官方微博 | 高级检索  
     检索      


A hybrid parallel genetic algorithm for yard crane scheduling
Authors:Junliang He  Daofang Chang  Weijian Mi  Wei Yan
Institution:aContainer Supply Chain Technology Engineering Research Center, Ministry of Education, Shanghai Maritime University, 1550 Pudong Avenue, Shanghai 200135, PR China;bSchool of Mechanical Engineering, Shanghai Jiao Tong University, Shanghai 200030, PR China;cSchool of Logistics Engineering, Shanghai Maritime University, Shanghai 200135, PR China
Abstract:This paper aims at postulating a novel strategy in terms of yard crane scheduling. In this study, a dynamic scheduling model using objective programming for yard cranes is initially developed based on rolling-horizon approach. To resolve the NP-complete problem regarding the yard crane scheduling, a hybrid algorithm, which employs heuristic rules and parallel genetic algorithm (PGA), is then employed. Then a simulation model is developed for evaluating this approach. Finally, numerical experiments on a specific container terminal yard are used for system illustration. Computational results suggest that the proposed method is able to solve the problem efficiently.
Keywords:Yard crane scheduling  Objective programming  Heuristic rules  Parallel genetic algorithm  Simulation model
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号