中国综合性科技类核心期刊(北大核心)

中国科学引文数据库来源期刊(CSCD)

美国《化学文摘》(CA)收录

美国《数学评论》(MR)收录

俄罗斯《文摘杂志》收录

留言板

尊敬的读者、作者、审稿人, 关于本刊的投稿、审稿、编辑和出版的任何问题, 您可以本页添加留言。我们将尽快给您答复。谢谢您的支持!

姓名
邮箱
手机号码
标题
留言内容
验证码

成组集中策略下滚装汽车堆场车位分配优化

陈晓静 胡志华 李功君 滕炜超

陈晓静, 胡志华, 李功君, 滕炜超. 成组集中策略下滚装汽车堆场车位分配优化[J]. 华东师范大学学报(自然科学版), 2017, (1): 11-18. doi: 10.3969/j.issn.1000-5641.2017.01.002
引用本文: 陈晓静, 胡志华, 李功君, 滕炜超. 成组集中策略下滚装汽车堆场车位分配优化[J]. 华东师范大学学报(自然科学版), 2017, (1): 11-18. doi: 10.3969/j.issn.1000-5641.2017.01.002
CHEN Xiao-jing, HU Zhi-hua, LI Gong-jun, TENG Wei-chao. Optimization for parking space distribution in storage yard of automotive ro-ro wharf based on the strategy of gathered groups[J]. Journal of East China Normal University (Natural Sciences), 2017, (1): 11-18. doi: 10.3969/j.issn.1000-5641.2017.01.002
Citation: CHEN Xiao-jing, HU Zhi-hua, LI Gong-jun, TENG Wei-chao. Optimization for parking space distribution in storage yard of automotive ro-ro wharf based on the strategy of gathered groups[J]. Journal of East China Normal University (Natural Sciences), 2017, (1): 11-18. doi: 10.3969/j.issn.1000-5641.2017.01.002

成组集中策略下滚装汽车堆场车位分配优化

doi: 10.3969/j.issn.1000-5641.2017.01.002
基金项目: 

国家自然科学基金 71471109, 71101088

详细信息
    作者简介:

    陈晓静, 女, 硕士研究生,研究方向为港口物流运作优化. E-mail: 990598065@qq.com

    通讯作者:

    胡志华, 男, 教授, 研究生导师,研究方向为物流与供应链管理.E-mail:zhhu@shmtu.edu.cn

  • 中图分类号: O224; U651

Optimization for parking space distribution in storage yard of automotive ro-ro wharf based on the strategy of gathered groups

  • 摘要: 滚装汽车堆场车位分配的合理性直接影响到滚装运输过程中汽车装卸滚装船舶的周转率.为提升装卸作业效率, 研究了堆场车位最优分配问题;按照成组集中分配原则, 以提高堆场内成组汽车停放集中度为目标,建立了衡量成组汽车停放集中度的混合整数规划模型;进而设计了基于网格随机搜索的启发式算法对模型进行求解.通过数值实验与分支定界法作比,验证了模型的合理性及网格随机搜索算法的有效性,拓展了汽车滚装码头堆场车位分配管理的理论研究.
  • 图  1  上海海通汽车滚装码头外四堆场部分车位布局图

    Fig.  1  Layout of partial parking space in the outer four storage yard of Shanghai Haitong automotive ro-ro wharf

    图  2  变量间逻辑关系

    Fig.  2  Logical relationship among the variables

    图  3  基于网格随机搜索的汽车车位交换示例

    Fig.  3  A demonstration of vehicles swap based on the grids random searching

    图  4  分支定界------场景一算例1堆场车位分配方案

    Fig.  4  Branch and bound---distribution scheme of parking space in the first example of first scene

    图  5  网格随机搜索------场景一算例 1 堆场车位分配方案

    Fig.  5  Grids random search---distribution scheme of parking space in the first example of first scene

    表  1  数值实验设计

    Tab.  1  Numerical experiments design

    实验待作业汽车属性初始堆场属性
    场景序号汽车
    组数
    每组汽
    车数目
    布局
    (行,列)
    已占车位率已占车位坐标
    132/2/3(4,5)0.25(2,2)(2,5)(3,1)(3,3)(3,5)
    234/2/3(4,5)0.25(2,2)(2,5)(3,1)(3,3)(3,5)
    334/3/4(4,5)0.25(2,2)(2,5)(3,1)(3,3)(3,5)
    143/2/4/3(4,5)0.25(2,2)(2,5)(3,1)(3,3)(3,5)
    252/4/1/3/2(4,5)0.25(2,2)(2,5)(3,1)(3,3)(3,5)
    361/2/3/2/1/3(4,5)0.25(2,2)(2,5)(3,1)(3,3)(3,5)
    134/3/5(4,5)0.25(2,2)(2,5)(3,1)(3,3)(3,5)
    234/3/5(4,7)0.25(2,2)(2,4)(2,6)(2,7)(3,1)(3,3)(3,6)
    334/3/5(4,9)0.25(2,2)(2,4)(2,6)(3,3)(3,5)(3,7)(4,2)(4,4)(4,6)
    134/3/5(4,5)0.30(2,1)(2,3)(2,4)(3,2)(3,3)(3,5)
    234/3/5(4,5)0.20(2,1)(2,4)(3,3)(3,5)
    334/3/5(4,5)0.10(2,1)(3,5)
    下载: 导出CSV

    表  2  分支定界法与网格随机搜算法实验结果对比

    Tab.  2  Results comparison between branch and bound method and grids random searchalgorithm

    实验分支定界法基于网格随机搜索的启发式算法
    场景序号目标值fCPU Time/s目标值fCPU Time/s误差/偏差*
    13.0463.0170.00
    23.04583.3100.10
    33.314393.5110.06
    14.0119314.780.18
    25.0328085.5130.10
    36.0212146.370.05
    13.222613.3200.03
    23.01260763.7260.23
    33.2*2592003.0191.00*
    13.06384.1130.17
    23.023033.5200.20
    33.5119763.2200.07
    注: ① 分支定界法对应的f中上标*值为上界值,其下界值为 0,gap=1; 其余f均为最优解,gap=0.
    ② 误差计算公式: (b-a)/a,其中 a 为分支定界法对应的f值,b为网格随机搜索算法对应的f值.
    ③ 偏差计算公式: (b-a)/b,其中 a为分支定界法对应的下界值,b为网格随机搜索算法对应的
    f值.
    下载: 导出CSV
  • [1] DIAS J C Q, CALADO J M F, MENDONCA M C. The role of European "ro-ro" port terminals in the automotivesupply [J]. Journal of Transport Geography, 2010, 18(1): 116-124. doi:  10.1016/j.jtrangeo.2008.10.009
    [2] MENDONCA M C, DIAS J C Q. "postponement" in the logistical systems of new automobiles marketed in portugal: The brandsand quality [J]. Total Quality Management & Business Excellence, 2007, 18(6): 681-696.
    [3] CHEN I J, PAULRAJ A. Understanding supply chain management: Critical research and a theoretical framework [J]. International Journal of Production Research, 2004, 42(1): 131-163. doi:  10.1080/00207540310001602865
    [4] FISCHER T, GEHRING H. Planning vehicle transhipment in a seaport automobile terminal using a multi-agent system [J]. European Journal of Operational Research, 2005, 166(3): 726-740. doi:  10.1016/j.ejor.2004.03.042
    [5] BOSE F, WINDT K. Understanding Autonomous Cooperation and Control in Logistics [M]. Berlin: Springer, 2007: 351-363.
    [6] MATTFELD D C, ORTH H. The allocation of storage space for transshipmentin vehicle distribution [C]//linebreak Container Terminals and Cargo Systems. Berlin: Springer, 2007: 267-290.
    [7] MATTFELD D C, BIERWIRTH C. An efficient genetic algorithm for job shop scheduling with tardiness objectives [J]. European Journal of Operational Research, 2004, 155(3): 616-630. doi:  10.1016/S0377-2217(03)00016-X
    [8] MATTFELD D C, KOPFER H. Terminal operations management in vehicle transshipment [J]. Transportation Research Part A, 2003, 37(6): 435-452.
    [9] CORDEAU J F, MOCCIA G L. Optimizing yard assignment in an automotive transshipment terminal [J]. European Journal of Operational Research, 2011, 215(1): 149-160. doi:  10.1016/j.ejor.2011.06.008
  • 加载中
图(5) / 表(2)
计量
  • 文章访问数:  286
  • HTML全文浏览量:  95
  • PDF下载量:  513
  • 被引次数: 0
出版历程
  • 收稿日期:  2016-01-06
  • 刊出日期:  2017-01-25

目录

    /

    返回文章
    返回