Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Document Type : Original Article


1 Department of Industrial Engineering, Shomal University, Amol, Iran

2 Department of Industrial Engineering and Management Systems, Amirkabir University of Technology, Tehran, Iran

3 School of Mechanical Engineering, Shandong University, Jinan, China Key Laboratory of High Efficiency and Clean Mechanical Manufacture (Ministry of Education), Shandong University, Jinan, China


Nowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assignment Problem (QCAP) as among the first attempts in this area. Another main contribution of this paper is to apply a recent nature-inspired algorithm called Red Deer Algorithm (RDA). The RDA revealed its performance for a variety of combinatorial optimization problems in different real-world applications. This is the first attempt in the literature to employ this recent metaheuristic to solve the proposed Coordinated Quay Crane Scheduling and Assignment Problem (CQCSAP). Finally, an extensive comparison discussion is considered to reveal the main benefits of the proposed optimization model and solution algorithm.


Main Subjects