Article ID: | iaor2013431 |
Volume: | 49 |
Issue: | 1 |
Start Page Number: | 48 |
End Page Number: | 54 |
Publication Date: | Jan 2013 |
Journal: | Transportation Research Part E |
Authors: | Meng Qiang, Wang Shuaian, Liu Zhiyuan |
Keywords: | approximation, Programming (cone), berth allocation |
Du et al. (2011) dealt with a berth allocation problem incorporating ship’ fuel consumption minimization. To address the difficulty posed by the power function between fuel consumption rate and sailing speed, they formulated a tractable mixed‐integer second‐order cone programming model. We propose two quadratic outer approximation approaches that can handle general fuel consumption rate functions more efficiently. In the static quadratic outer approximation approach, the approximation lines are generated a priori. In the dynamic quadratic outer approximation approach, the approximation lines are generated dynamically. Numerical experiments demonstrate the advantages of the two approaches.