A chance constrained programming model for short-term liner ship fleet planning problems
A chance constrained programming model for short-term liner ship fleet planning problems
复制标题
DOI：
10.1080/03088839.2010.486635
复制
发表时间：
2010-01-01
影响因子：
3.5
通讯作者：
Wang, Tingsong
中科院分区：
文献类型：
--
作者：
Meng, Qiang;Wang, Tingsong
本文研究了一家集装箱班轮公司在货物运输需求不确定的情况下的短期班轮船队规划问题。货运需求的不确定性使我们能够为每条航线提出一个机会约束，保证航线至少以预定的概率满足客户的需求。假设航线上任意两个港口之间的货物运输需求服从正态分布，建立了带机会约束的短期LSFP问题的整数线性规划模型。所提出的整数线性规划模型可以有效地解决任何优化求解器，如CPLEX。最后，通过算例对模型进行了评价，分析了机会约束和货物运输需求对模型的影响。
This article deals with a short-term Liner Ship Fleet Planning (LSFP) problem with cargo shipment demand uncertainty for a single liner container shipping company. The cargo shipment demand uncertainty enables us to propose a chance constraint for each liner service route, which guarantees that the liner service route can satisfy the customers' demand at least with a predetermined probability. Assuming that cargo shipment demand between any two ports on each liner service route is normally distributed, this article develops an integer linear programming model with chance constraints for the short-term LSFP problem. The proposed integer linear programming model can be efficiently solved by any optimization solver such as CPLEX. Finally, a numerical example is carried out to assess the model and analyze impact of the chance constraints and cargo shipment demand.