An Intelligence Scheduling Algorithm for Multi-crane in the Steel Product Warehouse

摘要

A scheduling model with the least total time was proposed to deal with the collision avoidance of multi-crane scheduling with the transitive priority changing rules in the steel product warehouse. The cuckoo search algorithm (CS) was applied to optimize multi-crane scheduling. In order to get a better performance, an improved CS (ICS) was provided by adding adaptive dynamic steps, dynamically changing the discovery probability and the local optimal solution mutation mechanism. The ICS has the characteristics of fast convergence, high solution precision and strong ability to jump out of the local optimum. The provided algorithm was validated by the simulation example.