ARTÍCULO
TITULO

Hybrid Scheduling for Multi-Equipment at U-Shape Trafficked Automated Terminal Based on Chaos Particle Swarm Optimization

Junjun Li    
Jingyu Yang    
Bowei Xu    
Yongsheng Yang    
Furong Wen and Haitao Song    

Resumen

Aimed to improve the efficiency of port operations, Shanghai Zhenhua Heavy Industries Co., Ltd. (ZPMC) proposed a new U-shape trafficked automated terminal. The new U-shape trafficked automated terminal brings a new hybrid scheduling problem. A hybrid scheduling model for yard crane (YC), AGV and ET in the U-shape trafficked automated terminal yard is established to solve the problem. The AGV and ET yard lanes are assumed to be one-way lane. Take the YC, AGV and ET scheduling results (the container transportation sequences) as variables and the minimization of the maximum completion time as the objective function. A scheduling model architecture with hierarchical abstraction of scheduling objects is proposed to refine the problem. The total completion time is solved based on a static and dynamic mixed scheduling strategy. A chaotic particle swarm optimization algorithm with speed control (CCPSO) is proposed, which include a chaotic particle strategy, a particle iterative speed control strategy, and a particle mapping space for hybrid scheduling. The presented model and algorithm were applied to experiments with different numbers of containers and AGVs. The parameters of simulation part refer to Qinzhou Port. The simulation results show that CCPSO can obtain a near-optimal solution in a shorter time and find a better solution when the solution time is sufficient, comparing with the traditional particle swarm optimization algorithm, the adaptive particle swarm optimization algorithm and the random position particle swarm optimization algorithm.

 Artículos similares

       
 
Songnong Li, Yao Yan, Yongliang Ji, Wenxin Peng, Lingyun Wan and Puning Zhang    
The increasing number of Artificial Intelligence of Things (AIoT) devices at the edge layer brings serious challenges to the traditional access network architecture, which results in a decrease in data transmission due to different QoS requirements. To i... ver más
Revista: Applied Sciences

 
Levente Fazekas, Boldizsár Tüu-Szabó, László T. Kóczy, Olivér Hornyák and Károly Nehéz    
Flow-shop scheduling problems are classic examples of multi-resource and multi-operation scheduling problems where the objective is to minimize the makespan. Because of the high complexity and intractability of the problem, apart from some exceptional ca... ver más
Revista: Algorithms

 
Toufik Mzili, Ilyass Mzili, Mohammed Essaid Riffi and Gaurav Dhiman    
This paper presents a new hybrid algorithm that combines genetic algorithms (GAs) and the optimizing spotted hyena algorithm (SHOA) to solve the production shop scheduling problem. The proposed GA-SHOA algorithm incorporates genetic operators, such as un... ver más
Revista: Algorithms

 
Amin Rahimi, Seyed Mojtaba Hejazi, Mostafa Zandieh and Mirpouya Mirmozaffari    
In this paper, the problem of finding an assignment of ?n? surgeries to be presented in one of ?m? identical operating rooms (ORs) or machines as the surgical case scheduling problem (SCSP) is proposed. Since ORs are among NP-hard optimization problems, ... ver más

 
Fan Huang, Haiping Zhang, Qiaofeng Wu, Shanqing Chi and Mingqing Yang    
The proper dispatching of hydraulic structures in water diversion projects is a desirable way to maximize project benefits. This study aims to provide a reliable, optimal scheduling model for hydraulic engineering to improve the regional water environmen... ver más
Revista: Water