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, Haitao SongJournal of Marine Science and Engineering 2021 · DOI

TL;DR

This paper tackles the complex scheduling problem of multiple equipment types (yard cranes, AGVs, and external trucks) in a novel U-shaped automated container terminal. They introduce a hybrid static-dynamic scheduling strategy and a Chaos Particle Swarm Optimization (CCPSO) algorithm to minimize the overall completion time, demonstrating its superior performance over traditional PSO variants.

What Problem Does This Paper Address?

Traditional container terminals often face inefficiencies due to equipment interference and long travel distances. The advent of U-shaped automated terminals, while promising, introduces a new, more complex scheduling challenge. This "hybrid scheduling problem" involves coordinating yard cranes (YCs), automated guided vehicles (AGVs), and external trucks (ETs) operating in a U-shaped layout with one-way lanes. The core difficulty lies in managing the intricate interdependencies and potential conflicts between these different equipment types to minimize the maximum completion time of all tasks. Existing scheduling methods for traditional terminals are insufficient for this new, more complex scenario.

Methods

The authors propose a multi-faceted approach:

  • Hierarchical Layered Architecture: They introduce a layered model architecture (initialization, circulation, particle, and scheduling layers) to abstract and manage the complexity of the scheduling problem, making it more scalable and maintainable.
  • Hybrid Static-Dynamic Scheduling Strategy: To address the mixed constraints, they combine static scheduling (assuming known decision variables) with dynamic scheduling (tracking real-time road occupancy and queuing). This allows for more accurate modeling of equipment interactions.
  • Chaos Particle Swarm Optimization (CCPSO): This is the core algorithmic contribution. CCPSO enhances the standard Particle Swarm Optimization (PSO) by incorporating:
  • Particle Mapping Space: A novel method to map continuous particle representations to discrete decision variables, ensuring consistency.
  • Chaos Strategy: Utilizes a chaotic mapping function to prevent particles from getting stuck in local optima and improve exploration.
  • Speed Control Strategy: An iterative speed control mechanism to refine particle movement and enhance convergence.

Datasets

The study uses simulated data based on parameters from the Qinzhou Port. Specific parameters for yard dimensions, equipment speeds, and task types are defined. No new benchmark datasets were introduced; rather, the authors created a simulation environment to test their proposed model and algorithm.

Key Insights and Ideas

  • U-shaped terminals create unique scheduling challenges: The shift to a U-shaped layout fundamentally alters equipment interactions, necessitating new scheduling approaches beyond traditional methods.
  • Hybrid scheduling is crucial for complex interdependencies: Simply using static or dynamic scheduling alone is insufficient. Combining them allows for better management of real-time constraints and equipment interactions.
  • Chaos can be a powerful tool for optimization: Introducing chaotic elements into PSO helps it escape local optima and find better global solutions, especially in complex search spaces.
  • Layered architecture simplifies complex systems: Breaking down the problem into hierarchical layers makes it more manageable and adaptable for future extensions.

Key Results

The CCPSO algorithm demonstrated superior performance compared to traditional PSO, Adaptive PSO (APSO), and Random Position PSO (RPPSO).

  • Efficiency: CCPSO achieved near-optimal solutions in shorter times and found better solutions when sufficient time was available.
  • Time Savings: The paper reports that CCPSO saved yard operation time by approximately 1.162%, 1.418%, and 1.695% on average compared to PSO, APSO, and RPPSO, respectively.
  • Robustness: CCPSO showed more stable results and better adaptability across different numbers of containers, AGVs, and iteration counts, particularly in complex scenarios.
  • Scalability: The model and algorithm showed good performance even with up to 10,000 containers, with calculation times remaining under 1 second.

Limitations and Future Work

  • Single Yard Lane Layout: The current work focuses on a single yard lane layout. Future work will consider multiple yard lane layouts.
  • Exclusion of Quay Cranes (QCs): The study did not include the scheduling of Quay Cranes. Future research will incorporate QCs, leading to more complex mixed constraints (e.g., AGV constraints from QCs, QC non-crossing constraints).
  • Uncertainty: The current model does not account for inevitable uncertainties in terminal operations. Robust optimization techniques will be explored to address this.
  • ET Delays: The impact of ET delays was not explicitly considered and will be a focus for future research.

Summary updated

Abstract

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.
BibTeX
@article{li2021hybrid,
  author = {Junjun Li and Jingyu Yang and Bowei Xu and Yongsheng Yang and Furong Wen and Haitao Song},
  title = {{Hybrid Scheduling for Multi-Equipment at U-Shape Trafficked Automated Terminal Based on Chaos Particle Swarm Optimization}},
  journal = {Journal of Marine Science and Engineering},
  year = {2021},
  doi = {10.3390/jmse9101080},
}
Figure