|
|||||
|
|
Containership scheduling with transit-time-sensitive container shipment demand |
|
| Institution: | 1. Department of Logistics and Maritime Studies, The Hong Kong Polytechnic University, Kowloon, Hong Kong;2. School of Management, Shanghai University, Shang Da Road 99, Shanghai 200444, China;3. School of Civil and Environmental Engineering, University of Technology Sydney, Sydney, NSW 2007, Australia;1. Department of Mathematics, Hangzhou Dianzi University, Hangzhou 310018, PR China;2. School of Mathematics and Information Engineering, Taizhou University, Linhai 317000, Zhejiang, PR China |
| Abstract: | This paper examines the optimal containership schedule with transit-time-sensitive demand that is assumed to be a decreasing continuous function of transit time. A mixed-integer nonlinear non-convex optimization model is first formulated to maximize the total profit of a ship route. In view of the problem structure, a branch-and-bound based holistic solution method is developed. It is rigorously demonstrated that this solution method can obtain an ε-optimal solution in a finite number of iterations for general forms of transit-time-sensitive demand. Computational results based on a trans-Pacific liner ship route demonstrate the applicability and efficiency of the solution method. |
| Keywords: | Liner shipping Containership scheduling Transit-time-sensitive demand Conic quadratic mixed-integer programming Branch-and-bound |
| 本文献已被 ScienceDirect 等数据库收录！ | |