Article ID: | iaor201530394 |
Volume: | 82 |
Start Page Number: | 141 |
End Page Number: | 161 |
Publication Date: | Dec 2015 |
Journal: | Transportation Research Part B |
Authors: | Meng Qiang, Du Yuquan, Wang Yadong |
Keywords: | transportation: general, combinatorial optimization, programming: branch and bound, programming: integer, programming: nonlinear |
This paper proposes a liner container seasonal shipping revenue management problem for a container shipping company. For a given weekly multi‐type shipment demand pattern in a particular season, the proposed problem aims to maximize the total seasonal shipping profit by determining the number of multi‐type containers to be transported and assigned on each container route, the number of containerships deployed on each ship route, and the sailing speed of containerships on each shipping leg subject to both the volume and capacity constraints of each containership. By adopting the realistic bunker consumption rate of a containership as a function of its sailing speed and payload (displacement), we develop a mixed‐integer nonlinear programing with a nonconvex objective function for the proposed liner container seasonal shipping revenue management problem. A tailored branch and bound (B&B) method is designed to obtain the global