A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports
We model the integrated berth allocation and yard assignment problem in bulk ports. The objective is the minimization of the total service time of all the vessels. We present a branch-and-price algorithm to solve the combined optimization problem. The algorithm is tested using real-life-inspired data from a bulk port. We obtain near-optimal solutions to instances containing up to 40 vessels.
bulk ports maritime logistics large scale optimization branch and price integrated planning mixed integer programming