班轮船舶调度多目标优化模型与蚁群算法.pdf

第11 卷 第4 期 交 通 运 输 工 程 学 报 V ol11 No4 2011 年8 月 Jour nal of T r affic and T ransp ort ation Engineering A ug . 2011 : 167 11637( 20 11 1 1 2 寿涌毅, 赖昌涛 , 吕如福 ( 1 , 310058; 2 , 5 18067 : 针对班轮船舶调度问 , 在将班轮合理配置到各往返航班上和不存在时间冲突的基础上, 以最小班轮变动成本最小航线运载量缺口和最小班轮航次总绝对偏差为目标函数, 构造了基于港 口时段与往返航班的时空网络, 建立了班轮调度的01 整数规划数学模型基于某船务公司实际 运载数据, 利用蚁群算法求解模型, 并用邻域搜索技术提高求解效率计算结果表明: 在运载量满 足运营要求的前提下, 班轮运营的日均总变动成本从 198 0863 元降低到170 4722 元, 下降了约 139 % ; 班轮航次数总绝对偏差从44 次降低到24 次, 下降了约455% , 班轮利用率更加均衡; 运载量缺口仍旧为0可见, 模型可行, 算法有效 : 船舶调度; 班轮船运; 时空网络; 蚁群算法; 整数规划; 多目标优化 : U 692. 3 : A Multiobjective optimization model and ant colony optimization of liner ship scheduling 1 1 2 SH OU Y ongyi , LA I Changtao , L U Rufu ( 1. Scho ol of M anagement , Zhej iang U niv ersity , H ang zho u 3 1005 8, Zhej iang, China; 2. Shenzhen Xunlong Shipping Co. , L td. , Shenzhen 5 18067, Guang dong, China Abstract: A iming at liner ship scheduling problem, on t he basis of rat ional allocat ion for liner ship s to diff erent round t rips and nonexisting t ime conflict, t he minimum variat ion cost on liner ship, the minimum carrying amount notch on rout e and the absolut e minimum deviat ion of t ot al liner voyages were taken as objective funct ions, a t imespace net work was construct ed based on port periods and round liners, and a 01 int eger programming mathematical model w as est ablished. T he historical data of a certain liner shipping company w ere anal