This paper considers the berth allocation problem (BAP) with time-varying water depth at a tidal river port. Both integer programming (IP) and constraint programming (CP) models are developed. Numerical experiments find that CP tends to be superior to IP when the feasible domain is small (e.g. dynamic vessel arrivals), when the restriction of the objective towards decision variables is loose (e.g. makespan, departure delay), or when the size of IP models is too large due to fine time resolution. Meanwhile, CP’s incapability of proving optimality can be compensated by post-optimization with IP, by using a simple CP/IP hybrid procedure.

Item Type:	Refereed Article
Keywords:	berth allocation, tide, water depth, integer programming, constraint programming, hybrid algorithm
Research Division:	Commerce, Management, Tourism and Services
Research Group:	Transportation, logistics and supply chains
Research Field:	Maritime transportation and freight services
Objective Division:	Transport
Objective Group:	Water transport
Objective Field:	Port infrastructure and management
UTAS Author:	Du, Y (Dr Bill Du)
ID Code:	113309
Year Published:	2016
Web of Science® Times Cited:	16
Deposited By:	Maritime and Logistics Management
Deposited On:	2016-12-20
Last Modified:	2017-11-01
Downloads:	0