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 language | English |
---|---|
Title of host publication | 2016 5th IEEE International Conference on Advanced Logistics and Transport (ICALT) |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Publication status | Accepted for publication - 10 Mar 2016 |
Event | IEEE International Conference on Advanced Logistics and Transport - Kraków, Kraków, Poland Duration: 1 Jun 2016 → 3 Jun 2016 Conference number: 5 http://www.icalt.org/2016/ |
Conference
Conference | IEEE International Conference on Advanced Logistics and Transport |
---|---|
Abbreviated title | ICALT |
Country/Territory | Poland |
City | Kraków |
Period | 1/06/16 → 3/06/16 |
Internet address |
Keywords
- Berth Allocation
- Quay Crane Assignment
- Integrated problem
- Genetic Programming
- Composite dispatching rules