Bi-Objective Berth–Crane Allocation Problem in Container Terminals
Transportation via sea continues to rise as a result of the increasing demand due to its advantages over other transportation modes in terms of cost and security. Actually, as of 2013, seaborne trade accounted for 80% of global trade in terms of volume (UNCTAD, 2013), and since 2006, it counts for 70.1% in terms of value (Rodrigue et al., 2009). Due to this trend toward sea transportation, efficient port management has become a major issue for port owners and shipping companies. Typical operations in a port consist of allocation of berths to arriving vessels, allocation of cranes to docked vessels at the quayside, routing of internal transportation vehicles, storage space assignment, and gantry crane deployment at the yard side. Berth allocation problem (BAP) consists of assigning berth spaces to the incoming vessels. Crane allocation problem (CAP) is the determination of
4.1 Motivation 83 4.2 Related Work 85 4.3 Model Description 87
4.3.1 Assumptions 88 4.3.2 Notation 88 4.3.3 Model 89
4.4 Solution Methodology 92 4.5 Case Study 94 4.6 Conclusions and Further Research Directions 102 Acknowledgment 103 References 103
the assignment sequence of cranes to a container ship. Both problems on the quayside have received significant attention from researchers (Bierwirth and Meisel, 2010). More often, these two problems are studied separately in the literature, resulting in suboptimal solutions. To find more realistic solutions, researchers offer solutions that combine the two problems.