A genetic programming algorithm for the berth and quay crane allocation problem

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In container terminals, most of the operations are strongly interdependent on each other. This paper focuses on an integrated problem which arises in seaside container terminals, the Berth Allocation and Quay Crane Assignment Problem (BQCAP). We present a new priority-based scheduling method for solving the problem using Genetic Programming (GP). GP is used to automatically evolve effective and robust composite dispatching rules (CDRs). A comparative study with Standard Priority Rules (SPRs) and CDRs is presented. CDRs is been shown to be more effective and flexible to fully meet the needs of terminal operators and vessel operators. The computational results show that our method did outperform well known standard heuristics on all instances.
Original languageEnglish
Title of host publication2016 5th IEEE International Conference on Advanced Logistics and Transport (ICALT)
PublisherIEEE
Publication statusAccepted for publication - 10 Mar 2016
EventIEEE International Conference on Advanced Logistics and Transport - Kraków, Kraków, Poland
Duration: 1 Jun 20163 Jun 2016
Conference number: 5
http://www.icalt.org/2016/

Conference

ConferenceIEEE International Conference on Advanced Logistics and Transport
Abbreviated titleICALT
Country/TerritoryPoland
City Kraków
Period1/06/163/06/16
Internet address

Keywords

  • Berth Allocation
  • Quay Crane Assignment
  • Integrated problem
  • Genetic Programming
  • Composite dispatching rules

Fingerprint

Dive into the research topics of 'A genetic programming algorithm for the berth and quay crane allocation problem'. Together they form a unique fingerprint.

Cite this