Volume 11 Issue 4
. 
Turn off MathJax
Article Contents
Article Navigation >  Journal of Traffic and Transportation Engineering  > 2011  >  11(4): 68-75
JI Ming-jun, CHEN Zhe, WANG Qing-bin. Optimization algorithm of branch transportation route for container ship[J]. Journal of Traffic and Transportation Engineering, 2011, 11(4): 68-75. doi: 10.19818/j.cnki.1671-1637.2011.04.011
Citation: JI Ming-jun, CHEN Zhe, WANG Qing-bin. Optimization algorithm of branch transportation route for container ship[J]. Journal of Traffic and Transportation Engineering, 2011, 11(4): 68-75. doi: 10.19818/j.cnki.1671-1637.2011.04.011
shu

Optimization algorithm of branch transportation route for container ship

doi: 10.19818/j.cnki.1671-1637.2011.04.011

  • School of Transportation Management, Dalian Maritime University, Dalian 116026, Liaoning, China

More Information
  • Author Bio:

    JI Ming-jun(1973-), male, professor, PhD, +86-411-84729330, jmj012001@yahoo.com.cn

  • Received Date: 2011-03-23
  • Publish Date: 2011-08-25
    Abstract
  • On the basis of the limit time of hub port ship and branch ship capacity, hub-and-spoke network transportation model was analyzed. Taking the total minimum navigation time of ship as objective function, the mixed integer programming model of branch container transportation model was set up. Hybridization and variation were realized by designing itinerant route method, the structure of solution was updated, and genetic algorithm was used to solve the model. Calculation result indicates that when ship capacity is 150 TEU, the total navigation time is 708.6 h, and the route number is 8 after 160 times iteration. When the ship capacities are 100 and 150 TEU respectively, the total navigation time is 714.6 h, and the route number is 9 after 150 times iteration. Through the variance analysis of the limit time of hub port ship and branch ship capacity, the probability values of F test statistics are almost less than 0.05 significantly. Through the sensitivity analysis of branch ship capacity and running cost, while there is higher ship capacity, there are lower route number and navigation time, but there is higher running cost. When there is the bigger limit time of hub port ship, there is lower route number. While considering navigation time and running cost, the ship capacity of 150 TEU is most reasonable.

     

    • FullText(HTML)
  • loading
    • References(15)
  • [1]
    CHRISTIANSEN M, FAGERHOLT K, FLATBERG T, et al. Maritime inventory routing with multiple products: a case study fromthe cement industry[J]. European Journal of Operational Research, 2011, 208 (1): 86-94. doi: 10.1016/j.ejor.2010.08.023
    [2]
    FAGERHOLT K. Ship scheduling with soft time windows: an optimization based approach[J]. European Journal of Operational Research, 2011, 131 (3): 559-571.
    [3]
    BRONMO G, CHRISTIANSEN M, FAGERHOLT K, et al. A multi-start local search heuristic for ship schedulinga computational study[J]. Computer and Operations Research, 2007, 34 (3): 900-917. doi: 10.1016/j.cor.2005.05.017
    [4]
    PANG K W, XU Zhou, LI C L. Ship routing problem with berthing time clash avoidance constraints[J]. International Journal of Production Economics, 2011, 131 (2): 752-762. doi: 10.1016/j.ijpe.2011.03.013
    [5]
    KOSMAS O T, VIACHOS D S. Si mulated annealing for optimal ship routing[J]. Computers and Operations Research, 2008, 35 (3): 576-581.
    [6]
    KIM K Y, KIM K H. Arouting algorithm for a single straddle carrier to load export containers onto a containership[J]. International Journal of Production Economics, 1999, 59 (1/2/3): 425-433.
    [7]
    NISHIMURA E, IMAI A, JANSSENS G K, et al. Container storage and transshipment marine terminals[J]. Transportation Research Part E: Logistics and Transportation Review, 2009, 45 (5): 771-786. doi: 10.1016/j.tre.2009.03.003
    [8]
    MENG Qiang, WANG S. Liner shipping service network design with empty container repositioning[J]. Transportation Research Part E: Logistics and Transportation Review, 2011, 47 (5): 695-708. doi: 10.1016/j.tre.2011.02.004
    [9]
    GELAREH S, NICHEL S, PISINGER D. Liner shipping hub network designin a competitive environment[J]. Transportation Research Part E: Logistics and Transportation Review, 2010, 46 (6): 991-1004. doi: 10.1016/j.tre.2010.05.005
    [10]
    HSU C I, HSIEH Y P. Routing ship size and sailing frequency decision-making for a maritime hub-and-spoke container network[J]. Mathematical and Computer Modelling, 2007, 45 (7/8): 899-916.
    [11]
    KARLAFTIS M G, KEPAPTSOGLOU K, SAMBRACOS E. Containership routing with time deadlines and simultaneous deliveries and pick-ups[J]. Transportation Research Part E: Logistics and Transportation Review, 2009, 45 (1): 210-221. doi: 10.1016/j.tre.2008.05.001
    [12]
    靳志宏, 胡杰, 杨永志. 集装箱支线运输航次调度优化[J]. 大连海事大学学报, 2009, 35 (3): 32-36. https://www.cnki.com.cn/Article/CJFDTOTAL-DLHS200903010.htm

    JIN Zhi-hong, HU Jie, YANG Yong-zhi. Optimization on voyage scheduling for container feeder lines[J]. Journal of Dalian Maritime University, 2009, 35 (3): 32-36. (in Chinese) https://www.cnki.com.cn/Article/CJFDTOTAL-DLHS200903010.htm
    [13]
    靳志宏, 解玉真, 李阳, 等. 集装箱支线运输船舶调度优化问题[J]. 中国航海, 2008, 31 (4): 415-419. doi: 10.3969/j.issn.1000-4653.2008.04.023

    JIN Zhi-hong, XIE Yu-zhen, LI Yang, et al. Scheduling optimization problems of feeder line container ships[J]. Navigation of China, 2008, 31 (4): 415-419. (in Chinese) doi: 10.3969/j.issn.1000-4653.2008.04.023
    [14]
    JEON G, LEEP H R, SHIM J Y. A vehicle routing problem solved by using a hybird genetic algorithm[J]. Computer and Industrial Engineering, 2007, 53 (4): 680-692.
    [15]
    BAKER B M, AYECHEW M A. A genetic algorithm for the vehicle routing problem[J]. Computer and Operations Research, 2003, 30 (4): 787-800.
    • Relative Articles
    • Supplements(0)
    • Cited By
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索
    Get Citation
    PDF
    XML

    Article Metrics

    Article views (655) PDF downloads(612) Cited by()
    Proportional views
    Related

    Copyright《Journal of Traffic and Transportation Engineering》编辑部陕ICP备05001904号-1

    Address ：Editorial Department of Journal of Traffic and Transportation Engineering, Chang 'an University, Middle Section of South Second Ring Road, Xi 'an, Shaanxi（710064） Tel：029-82334388 Email：jygc@chd.edu.cn

    All visit:Today's visit:

    Supported by: Beijing Renhe Information Technology Co. Ltd    

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return