内支线配船与船舶调度优化
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Internal Feeder Ship Allocation and Ship Dispatching Optimization
  • 作者:郑红星 ; 李珊珊 ; 司羽
  • 英文作者:ZHENG Hongxing;LI Shanshan;SI Yu;Transportation Management College,Dalian Maritime University;China Ocean Shipping Agency in Tianjin;
  • 关键词:交通运输工程 ; 内支线运输 ; 不定期船舶 ; 航线配船 ; 船舶调度 ; 和声退火算法
  • 英文关键词:traffic and transportation engineering;;feeder line transportation;;tramp ship;;ship routing;;ship scheduling;;harmony annealing algorithm
  • 中文刊名:CQJT
  • 英文刊名:Journal of Chongqing Jiaotong University(Natural Science)
  • 机构:大连海事大学交通运输管理学院;天津外轮代理有限公司;
  • 出版日期:2018-11-21 14:00
  • 出版单位:重庆交通大学学报(自然科学版)
  • 年:2019
  • 期:v.38;No.205
  • 基金:国家自然科学基金项目(71473024)
  • 语种:中文;
  • 页:CQJT201902016
  • 页数:8
  • CN:02
  • ISSN:50-1190/U
  • 分类号:113-120
摘要
为平衡航运企业内支线营运成本和客户服务水平,研究内支线不定期船舶的配置和调度问题。考虑枢纽港船舶的限制时间和支线船舶容量等现实约束,兼顾各支线港在计划期内不同时段的货运需求,构建了以内支线营运成本和甩货成本之和最小为目标的内支线配船与调度优化模型。结合问题的特征,设计了和声退火混合算法,对模型进行求解。通过案例分析不仅验证了模型和算法的有效性,还给出了枢纽港船舶的限制时间和单位甩货成本的灵敏度分析。
        In order to balance the operation cost and customer service level of internal feeder in shipping enterprises,the problem of feeder line tramp ship configuration and scheduling was studied. Considering the actual constraints such as the limited time of vessels in hub port and the capacity of branch ships,as well as considering the freight requirements of feeder ports at different time during the planning period,an optimization model of internal branch ship allocation and dispatching was established,which aimed at minimizing the sum of operation cost and cargo rejection cost of internal branch. Combined with the characteristics of the problem,a harmony annealing hybrid algorithm was designed to solve the proposed model. Case study not only validates the effectiveness of the proposed model and the algorithm,but also gives sensitivity analysis of the limited time and unit dumping cost of ships in hub port.
引文
[1]周武,陈洁,朱小明.集装箱船舶大型化对支线运输的多面需求[J].世界海运,2006,29(3):26-27.ZHOU Wu,CHEN Jie,ZHU Xiaoming. Multi demand of container ship maximization for feeder line transportation[J]. World Shipping,2006,29(3):26-27.
    [2]BRONOM G,CHRISTIANSEN M,NYGEENB. Ship routing and sched-uling with flexible cargo sizes[J]. Journal of the Operational Research Society,2007,58(2):1167-1177.
    [3]CHRISTIANSEN M. Maritime inventory routing with multiple products:a case study from the cement industry[J]. European Journal of Operational Research,2011,208(1):86-94.
    [4]FAGERHOLT K. Ship scheduling with soft time windows:An optimization based approach[J]. European Journal of Operational Research,2011,131(2001):559-571.
    [5] HSU C,HSIEH Y. Routing,ship size and sailing frequency decisionmaking for a maritime hub-and-spoke container network[J]. Mathematical and Computer Modeling,2007,45(8):899-916.
    [6]徐骅,宁涛,田璐.竞争市场中的集装箱班轮航线优化模型[J].大连海事大学学报,2012,38(3):55-58.XU Hua,NING Tao,TIAN Lu. Container shipping route optimization model in a competitive market[J]. Journal of Dalian Maritime University,2012,38(3):55-58.
    [7]靳志宏.集装箱支线运输船舶调度优化问题[J].中国航海,2008,31(4):415-419.JIN Zhihong. Ship scheduling optimization problem for feeder line container ships[J].China Navigation,2008,31(4):415-419.
    [8]杨立乾.基于轴辐式网络的集装箱支线运输多船型船舶调度模型[J].中国管理科学,2015,23(4):56-63.YANG Liqian. Scheduling model of feeder line container ships based on hub-spoke network[J]Chinese Journal of Management Science,2015,23(4):56-63.
    [9]靳志宏,胡洁,杨永志.集装箱支线运输航次调度优化[J].大连海事大学学报,2009,35(3):32-36.JIN Zhihong,HU Jie,YANG Yongzhi. Optimization on voyage schedul-ing for container feeder lines[J]. Journal of Dalian Maritime University,2009,35(3):32-36.
    [10]计明军,陈哲,王清斌.集装箱船舶支线运输航线优化算法[J].交通运输工程学报,2011,11(4):68-75.JI Mingjun,CHEN Zhe,WANG Qingbin. Route optimization algorithm for feeder line container ship transportation[J]. Journal of Transportation Engineering,2011,11(4):68-75.
    [11]庞玺斌,张闯.基于整数规划的支线运输船队规划模型.中国水运,2014(4):73-75.PANG Xibin,ZHANG Chuang. A fleet planning model for feeder transport based on integer programming[J].China Water Transport,2014(4):73-75.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700