eCite Digital Repository

Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth

Citation

Qin, T and Du, Y and Sha, M, Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth, Transportation Review. Part E: Logistics and Transportation Review, 87 pp. 167-185. ISSN 1366-5545 (2016) [Refereed Article]

Copyright Statement

Copyright 2016 Elsevier Ltd.

DOI: doi:10.1016/j.tre.2016.01.007

Abstract

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, CPs incapability of proving optimality can be compensated by post-optimization with IP, by using a simple CP/IP hybrid procedure.

Item Details

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 and Freight Services
Research Field:Transportation and Freight Services not elsewhere classified
Objective Division:Transport
Objective Group:Water Transport
Objective Field:Port Infrastructure and Management
Author:Du, Y (Dr Bill Du)
ID Code:113309
Year Published:2016
Web of Science® Times Cited:1
Deposited By:Maritime and Logistics Management
Deposited On:2016-12-20
Last Modified:2017-11-01
Downloads:0

Repository Staff Only: item control page