EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

1500. Iterated Greedy for the Yard Crane Scheduling Problem

Invited abstract in session TC-62: Container Stacking and Yard Planning II, stream OR in Port Operations.

Tuesday, 12:30-14:00
Room: S12 (building: 101)

Authors (first author is the speaker)

1. Hongtao Wang
Departamento de Estadistica e Investigación Operativa Aplicadas y Calidad, Universitat Politècnica de València
2. Rubén Ruiz
Departamento de Estadistica e Investigación Operativa Aplicadas y Calidad, Universitat Politècnica de València
3. Eva Vallada
Estadística e Investigación Operativa Aplicadas y Calidad, Universidad Politécnica de Valencia
4. Fulgencia Villa
Department of Applied Statistics, Operations Research and Quality, Universitat Politecnica de Valencia

Abstract

Yard crane scheduling problems (YCSPs) arrange requests for loading containers by yard cranes on terminals. Of the scheduling nature and operational complexity is a real-world YCSP with the assignments of input/output (I/O) points that serve as dynamic buffers to receive and send containers. The YCSP schedules storage and retrieval containers coordinated with their time parameters at the I/O points, which are also limited and need to be assigned during the scheduling process. Instead of proposing hybrid or complicated approaches, we introduce a series of simple Iterated Greedy (IG) methods upon a classical vanilla IG. New destruction, reconstruction and local search operators are designed for task schedules and I/O assignments. It results in 3 IG algorithms which require little variation from the vanilla IG. Extensive computational campaigns have shown a statistically wide margin of the proposed IG methods over several state of the art approaches.

Keywords

Status: accepted

Back to the list of papers