Quay crane scheduling with non-interference constraints in port container terminals
The quay crane scheduling problem studied in this paper is to determine a handling sequence of holds for quay cranes assigned to a container vessel considering interference between quay cranes. This paper provides a mixed integer programming model for the considered quay crane scheduling problem that is NP-complete in nature. A genetic algorithm is proposed to obtain near optimal solutions. Computational experiments are conducted to examine the proposed model and solution algorithm. The computational results show that the proposed genetic algorithm is effective and efficient in solving the considered quay crane scheduling problem.
Year of publication: |
2008
|
---|---|
Authors: | Lee, Der-Horng ; Wang, Hui Qiu ; Miao, Lixin |
Published in: |
Transportation Research Part E: Logistics and Transportation Review. - Elsevier, ISSN 1366-5545. - Vol. 44.2008, 1, p. 124-135
|
Publisher: |
Elsevier |
Keywords: | Port container terminal Quay crane scheduling NP-completeness Genetic algorithm |
Saved in:
Saved in favorites
Similar items by person
-
Quay crane scheduling with non-interference constraints in port container terminals
Lee, Der-Horng, (2008)
-
A spatiotemporal partitioning approach for large-scale vehicle routing problems with time windows
Qi, Mingyao, (2012)
-
A tabu search heuristic for the local container drayage problem under a new operation mode
Xue, Zhaojie, (2014)
- More ...