Quay crane scheduling with draft and trim constraints

This paper discusses the quay crane scheduling problem with draft and trim constraints (QCSPDT), an extension to the current quay crane scheduling problem. The authors 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.

• Record URL:
  • https://doi.org/10.1016/j.tre.2016.10.011
• Record URL:
  • http://www.sciencedirect.com/science/article/pii/S1366554516303179
• Availability:
  • Find a library where document is available. Order URL: http://worldcat.org/issn/13665545
• Supplemental Notes:
  • Abstract reprinted with permission of Elsevier.
• Authors:
  • Wu, Lingxiao
  • Ma, Weimin
• Publication Date: 2017-1

Language

• English

Media Info

• Media Type: Web
• Features: Appendices; Figures; References; Tables;
• Pagination: pp 38-68
• Serial:
  • Transportation Research Part E: Logistics and Transportation Review
  • Volume: 97
  • Publisher: Elsevier
  • ISSN: 1366-5545
  • Serial URL: http://www.sciencedirect.com/science/journal/13665545

Subject/Index Terms

• TRT Terms: Branch and bound algorithms; Container terminals; Genetic algorithms; Linear programming; Mixed integer programming; Quays; Scheduling
• Subject Areas: Freight Transportation; Terminals and Facilities;

Filing Info

• Accession Number: 01620015
• Record Type: Publication
• Files: TRIS
• Created Date: Dec 28 2016 8:52AM