Access Restriction

Author Xue, Zhaojie ♦ Zhang, Canrong ♦ Miao, Lixin ♦ Lin, Wei Hua
Source SpringerLink
Content type Text
Publisher SP Systems Engineering Society of China
File Format PDF
Copyright Year ©2013
Language English
Subject Domain (in DDC) Technology ♦ Engineering & allied operations
Subject Keyword Container terminal ♦ yard truck scheduling ♦ yard location assignment ♦ quay crane scheduling ♦ precedence constraints ♦ ant colony optimization ♦ Complexity ♦ Game Theory/Mathematical Methods ♦ Operations Research/Decision Theory
Abstract This paper examines the yard truck scheduling, the yard location assignment for discharging containers, and the quay crane scheduling in container terminals. Taking into account the practical situation, we paid special attention to the loading and discharging precedence relationships between containers in the quay crane operations. A Mixed Integer Program (MIP) model is constructed, and a two-stage heuristic algorithm is proposed. In the first stage an Ant Colony Optimization (ACO) algorithm is employed to generate the yard location assignment for discharging containers. In the second stage, the integration of the yard truck scheduling and the quay crane scheduling is a flexible job shop problem, and an efficient greedy algorithm and a local search algorithm are proposed. Extensive numerical experiments are conducted to test the performance of the proposed algorithms.
ISSN 10043756
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2013-03-12
Publisher Place Heidelberg
e-ISSN 18619576
Journal Journal of Systems Science and Systems Engineering
Volume Number 22
Issue Number 1
Page Count 17
Starting Page 21
Ending Page 37

Open content in new tab

   Open content in new tab
Source: SpringerLink