Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results
Top Cited Papers
- 1 September 2015
- journal article
- Published by Elsevier in Transportation Research Part E: Logistics and Transportation Review
- Vol. 81, 75-97
Abstract
No abstract availableKeywords
Funding Information
- Danish Maritime Cluster
This publication has 25 references indexed in Scilit:
- A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk portsEuropean Journal of Operational Research, 2014
- Berth and quay crane allocation: a moldable task scheduling modelJournal of the Operational Research Society, 2011
- Models for the discrete berth allocation problem: A computational comparisonTransportation Research Part E: Logistics and Transportation Review, 2011
- Integrating berth allocation and quay crane assignmentsTransportation Research Part E: Logistics and Transportation Review, 2010
- A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planningComputers & Industrial Engineering, 2009
- Heuristics for the integration of crane productivity in the berth allocation problemTransportation Research Part E: Logistics and Transportation Review, 2009
- The simultaneous berth and quay crane allocation problemTransportation Research Part E: Logistics and Transportation Review, 2008
- Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departuresNaval Research Logistics (NRL), 2005
- Berth allocation in a container port: using a continuous location space approachTransportation Research Part B: Methodological, 2005
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problemsComputers & Operations Research, 1994