Quay crane scheduling with draft and trim constraints

Lingxiao Wu; Weimin Ma

doi:10.1016/j.tre.2016.10.011

Quay crane scheduling with draft and trim constraints

Lingxiao Wu, Weimin Ma

Research output: Journal article publication › Journal article › Academic research › peer-review

18 Citations (Scopus)

Abstract

This paper discusses the quay crane scheduling problem with draft and trim constraints (QCSPDT), an extension to the current quay crane scheduling problem. We propose a linear mixed integer programming model with the objective to minimize the total handling time for the considered problem. A branch and bound method and a hybrid genetic algorithm are developed to solve the studied problem with different sizes. Computational experiments are conducted to examine the proposed model and solution algorithms. The computational results show that the solution methods are effective and efficient in solving the QCSPDT.

Original language	English
Pages (from-to)	38-68
Number of pages	31
Journal	Transportation Research Part E: Logistics and Transportation Review
Volume	97
DOIs	https://doi.org/10.1016/j.tre.2016.10.011
Publication status	Published - 1 Jan 2017
Externally published	Yes

Keywords

Branch and bound
Container terminals
Draft and trim constraints
Genetic algorithm
Quay crane scheduling

ASJC Scopus subject areas

Business and International Management
Civil and Structural Engineering
Transportation

More information

10.1016/j.tre.2016.10.011

Cite this

@article{a040ccb5818248faa346a1877b5b2067,

title = "Quay crane scheduling with draft and trim constraints",

abstract = "This paper discusses the quay crane scheduling problem with draft and trim constraints (QCSPDT), an extension to the current quay crane scheduling problem. We propose a linear mixed integer programming model with the objective to minimize the total handling time for the considered problem. A branch and bound method and a hybrid genetic algorithm are developed to solve the studied problem with different sizes. Computational experiments are conducted to examine the proposed model and solution algorithms. The computational results show that the solution methods are effective and efficient in solving the QCSPDT.",

keywords = "Branch and bound, Container terminals, Draft and trim constraints, Genetic algorithm, Quay crane scheduling",

author = "Lingxiao Wu and Weimin Ma",

note = "Funding Information: The authors would like to acknowledge the constructive comments by the referees and the editor. The authors thank Kap Hwan Kim (Pusan National University, Korea) and Young-Man Park (Korea Naval Academy, Korea) for providing the benchmark suite. This work was supported by National Natural Science Foundation of China ( 71071113 ). Publisher Copyright: {\textcopyright} 2016 Elsevier Ltd",

year = "2017",

month = jan,

day = "1",

doi = "10.1016/j.tre.2016.10.011",

language = "English",

volume = "97",

pages = "38--68",

journal = "Transportation Research Part E: Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Ltd",

}

TY - JOUR

T1 - Quay crane scheduling with draft and trim constraints

AU - Wu, Lingxiao

AU - Ma, Weimin

N1 - Funding Information: The authors would like to acknowledge the constructive comments by the referees and the editor. The authors thank Kap Hwan Kim (Pusan National University, Korea) and Young-Man Park (Korea Naval Academy, Korea) for providing the benchmark suite. This work was supported by National Natural Science Foundation of China ( 71071113 ). Publisher Copyright: © 2016 Elsevier Ltd

PY - 2017/1/1

Y1 - 2017/1/1

N2 - This paper discusses the quay crane scheduling problem with draft and trim constraints (QCSPDT), an extension to the current quay crane scheduling problem. We propose a linear mixed integer programming model with the objective to minimize the total handling time for the considered problem. A branch and bound method and a hybrid genetic algorithm are developed to solve the studied problem with different sizes. Computational experiments are conducted to examine the proposed model and solution algorithms. The computational results show that the solution methods are effective and efficient in solving the QCSPDT.

AB - This paper discusses the quay crane scheduling problem with draft and trim constraints (QCSPDT), an extension to the current quay crane scheduling problem. We propose a linear mixed integer programming model with the objective to minimize the total handling time for the considered problem. A branch and bound method and a hybrid genetic algorithm are developed to solve the studied problem with different sizes. Computational experiments are conducted to examine the proposed model and solution algorithms. The computational results show that the solution methods are effective and efficient in solving the QCSPDT.

KW - Branch and bound

KW - Container terminals

KW - Draft and trim constraints

KW - Genetic algorithm

KW - Quay crane scheduling

UR - http://www.scopus.com/inward/record.url?scp=84995745369&partnerID=8YFLogxK

U2 - 10.1016/j.tre.2016.10.011

DO - 10.1016/j.tre.2016.10.011

M3 - Journal article

AN - SCOPUS:84995745369

SN - 1366-5545

VL - 97

SP - 38

EP - 68

JO - Transportation Research Part E: Logistics and Transportation Review

JF - Transportation Research Part E: Logistics and Transportation Review

ER -

Quay crane scheduling with draft and trim constraints

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this