Abstract

The joint scheduling of quay cranes (QCs), yard cranes (YCs), and yard trucks (YTs) is critical to achieving good overall performance for a container terminal. However, there are only a few such integrated studies. Especially, those who have taken the vessel stowage plan (VSP) into consideration are very rare. The VSP is a plan assigning each container a stowage position in a vessel. It affects the QC operations directly and considerably. Neglecting this plan will cause problems when loading/unloading containers into/from a ship or even congest the YT and YC operations in the upstream. In this research, a framework of simulation-based optimization methods have been proposed firstly. Then, four kinds of heuristics/metaheuristics has been employed in this framework, such as sort-by-bay (SBB), genetic algorithm (GA), particle swarm optimization (PSO), and multiple groups particle swarm optimization (MGPSO), to deal with the yard crane scheduling problem (YCSP), yard truck scheduling problem (YTSP), and quay crane scheduling problem (QCSP) simultaneously for export containers, taking operational constraints into consideration. The objective aims to minimize makespan. Each of the simulation-based optimization methods includes three components, load-balancing heuristic, sequencing method, and simulation model. Experiments have been conducted to investigate the effectiveness of different simulation-based optimization methods. The results show that the MGPSO outperforms the others.

Highlights

  • Maritime transport accounts for 80% of global trade [1], which indicates the importance of this kind of transport

  • This research focuses on solving the simultaneous yard crane scheduling problem (YCSP), yard truck scheduling problem (YTSP), and quay crane scheduling problem (QCSP) by using

  • This research focuses on solving the simultaneous YCSP, YTSP, and QCSP by using simulation-based optimization approaches

Read more

Summary

Introduction

Maritime transport accounts for 80% of global trade [1], which indicates the importance of this kind of transport. It is noted that the vessel stowage plan (VSP), a plan assigning vessel stowage positions to containers, has often been neglected in past research This plan is important as it can affect the loading and unloading sequences of containers. The survey in [9] shows that exact methods, evolutionary heuristics, heuristics, and simulation have been used to solve container terminal problems [9]. Mathematical models, such as mixed-integer linear programming (MILP), mixed-integer programming (MIP), constraint programming (CP), Lagrangian relaxation (LR), dynamic programming (DP), branch and bound (B&B), column generation (CG), etc., have been commonly used. This research focuses on solving the simultaneous YCSP, YTSP, and QCSP by using simulation-based optimization approaches.

Section 22 introduces introduces background background
Overall
Yard Storage
Vessel
Relevant Studies
Method Approaches
Problem Definition
Operations Analysis
Mathematical
Mathematical Model
Evaluation
12: END For
The Main Flow Logic of MGPSO
Multiple
Particle i searches the target particle o within
The Simulation Method
Experiments
Experiment Data Generation
Numerical Experiments
Parameter Values
Input Data
Output Result
Extensive Experiments
Statistically Test
Results
7.7.Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call