|
|
|
| Scheduling Optimization of Railway Container Terminals with "Rail Crane-common Bay" |
| LIU Fenghui, ZHANG Jihui
|
| a. Institute of Complexity Science; b. Shandong Key Laboratory of Industrial Control Technology, Qingdao University, Qingdao 266071, China |
|
|
|
|
Abstract For the scheduling problem of railway container terminal with fixed operating range of rail cranes, the K-means clustering algorithm is used to divide the operation tasks into direct unloading tasks and indirect unloading ones. In order to fully utilize the idle container space of the yard, a common bay is selected as the relay point to divide the working area of the rail cranes, and dynamic adjustment rules for the common bay are designed to obtain the optimal operating area of the rail cranes. A mixed integer programming model with the goal of minimizing the completion time is established, and a method to determine the interference between two rail cranes at the relay point is given. A solution algorithm combing genetic algorithm and ant colony algorithms is designed, and the pheromone mechanism is added to generate the solution to improve the quality of the solution; Different grouping mechanisms are proposed to update the population for avoiding to fall into local optimum. The numerical simulation experimental results show that the proposed method has significant advantages in solving such problems. For a fixed rail crane and truck configuration and the given task, compared with the "rail crane truck" and rail crane flexible scheduling modes, the "rail crane common bay" operation mode has a shorter completion time.
|
|
Received: 01 November 2023
Published: 10 December 2025
|
|
|
|
|
|
| No related articles found! |
|
|
|
|
