A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports

Abstract

Exact and heuristic approach methods to solve berth allocation problem in bulk ports. Tech. rep., TRANSP-OR, Ecole Polytechnique Federale De Lausanne, 2012. Zhen, L. An integrated model for berth template and yard template planning in transshipment hubs. Transportation Science 45 (2011), 483-504.

Integrated Berth Allocation and Quay Crane Assignment Problem: Set partitioning models and computational results

“…Such an approach has been used for related problems by, for example, Vacca et al [28] and Robenek et al [22].…”

“…The model, with a priori generated columns, can solve instances up to 40 vessels to optimality. Robenek et al [22] formulated a GSPP model for the integrated berth allocation and yard assignment problem in bulk ports. The problem considers the cargo types on the vessel which aect the storage location in the yard and consequently the berth allocation.…”

Optimal sequence of container ships in a string

“…In addition, more yard space is required to storage the delayed containers (Zhen, Lee, & Chew, 2011). Moreover, when there are a large number of delayed containers from the previous week, the handling time at port is longer, which affects the berth allocation by port operators (Bierwirth & Meisel, 2010;Imai, Nishimura, & Papadimitriou, 2001;Jin, Lee, & Hu, 2015;Robenek, Umang, Bierlaire, & Ropke, 2014;Türkogulları, Ta¸skın, Aras, & Altınel, 2014;Xu, Li, & Leung, 2012).…”

Using a Hybrid Model on Joint Scheduling of Berths and Quay Cranes—From a Sustainable Perspective

“…To maximize the berth throughput and reliability of berth scheduling, Robenek et al [20] proposed a mixed integer programming model based on branch and price framework to solve the two key optimization problems of berth distribution and distribution of cargo ports in bulk cargo ports. Xu et al [28] proposed an expression for solving the berth scheduling problem by introducing a delayed buffer concept to simulate the ship's delay and the uncertainty of the processing time.…”

“…Golias et al [19] established a two-objective optimization mathematical model to minimize the average time and range of a ship's total service and proposed a heuristic algorithm to solve the problem of robust berth scheduling. To solve the problem of berth and yard allocation, Robenek et al [20] proposed an exact algorithm that was based on the branch and price framework to solve the integration problem, and used the mixed integer programming method; (2) Study of the theory and method of berth disturbance recovery. Xu et al [21] studied the location and time costs of berth deviations based on the theory of interference management and established the interference management model.…”