用户名: 密码: 验证码:
基于选址-运输路线的中欧班列国际运输网络优化研究
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Research on Optimization of International Transportation Network in Sino-Europe Based on Location Selection
  • 作者:文思涵 ; 张军
  • 英文作者:WEN Si-han;ZHANG Jun;School of Business Planning,Chongqing Technology and Business University;
  • 关键词:运输经济 ; 中欧班列 ; 集拼集运 ; 离散粒子群
  • 英文关键词:transportation economy;;Sino-Europe trains;;LCL cargo;;discrete particle swarm
  • 中文刊名:YZZK
  • 英文刊名:Journal of Chongqing Technology and Business University(Natural Science Edition)
  • 机构:重庆工商大学商务策划学院;
  • 出版日期:2018-07-09
  • 出版单位:重庆工商大学学报(自然科学版)
  • 年:2018
  • 期:v.35;No.180
  • 基金:2017年重庆市研究生科研创新项目(yjscxx2017-066-27)
  • 语种:中文;
  • 页:YZZK201804015
  • 页数:9
  • CN:04
  • ISSN:50-1155/N
  • 分类号:91-99
摘要
针对我国中欧班列的运输现状,解决直达班列不同线路恶性竞争、国内货源分散等问题,从选址-运输路线安排的角度出发,以中欧班列国际网络运输节点为研究对象,建立总成本最小模型,根据离散粒子群算法原理,采用Matlab开发程序对其进行优化求解;实例仿真结果表明:通过该模型及算法得到的全局最优解具有良好的收敛性和有效性;同时可以有效降低中欧班列国际运输网络的物流运作总成本。
        According to the status quo of China's trains to Central Europe,in order to solve vicious competition of different lines,dispersive goods sources and so on,based on the perspective of location selection-transportation line arrangement,by taking international transportation network node of China-Europe as study object,this paper sets up minimum total cost model. Based on discrete particle swarm optimization principle,Matlab development program is used to optimize and solve it. Simulation results show that the global optimal solution derived from this model and algorithm has good convergence and effectiveness,at the same time,it can effectively reduce the total cost of logistic operation of Sino-Europe transportation network.
引文
[1]王杨堃.中欧班列发展现状、问题及建议[J].综合运输,2015,37(S1):70-75,89WANG Y K.Status,Problems and Suggestions on Development of Sino-Europe Block Trains[J].China Transportation Review,2015,37(S1):70-75,89
    [2]许英明.“一带一路”战略视角下中欧班列综合效益发挥路径探讨[J].前沿,2015(11):45-48XU Y M.The Path of Comprehensive Benefit of China-EU Classes under“the Belt and Road”Strategy[J].Forward Position,2015(11):45-48
    [3]李佳峰.“一带一路”战略下中欧班列优化对策研究[J].铁道运输与经济,2016,38(5):41-45LI J F.Study on Countermeasures of Optimizing ChinaEurope Block Trains under“the Belt and Road”Strategy[J].Railway Transport and Economy,2016,38(5):41-45
    [4]张磊.中欧班列发展经验借鉴及相关建议[J].港口经济,2016(10):26-29ZHANG L.Experience and Suggestions for the Development of“the Belt and Road”[J].Port Economy,2016(10):26-29
    [5]蒋晓丹,范厚明.“一带一路”战略下中欧班列开行中的问题与对策探讨[J].对外经贸实务,2017(1):28-30JIANG X D,FAN H M.Discussion on the Problems and Countermeasures of the Central European Team under“the Belt and Road”Strategy[J].Practice in Foreign Economic Relations and Trade,2017(1):28-30
    [6]罗耀波,孙延明,刘小龙.多约束选址-路径问题的改进混合遗传算法研究[J].计算机应用研究,2013,30(8):2283-2287LUO Y B,SUN Y M,LIU X L.Hybrid Genetic Algorithm for Capacitated Location-Routing Problem[J].Application Research of Computers,2013,30(8):2283-2287
    [7]罗耀波,孙延明.基于模糊时间窗的带容积约束选址路径问题[J].系统工程,2014,32(1):19-25LUO Y B,SUN Y M.Capacitated Location Routing Problem Based on Fuzzy Time Windows[J].Systems Engineering,2014,32(1):19-25
    [8]李昌兵,张斐敏.集成选址-路径-库存问题的逆向物流网络优化[J].计算机集成制造系统,2014,20(7):1793-1798LI C B,ZHANG F M.Reverse Logistics Network Optimization of Integrated Location-Routing-Inventory Problem[J].Computer Integrated Manufacturing Systems,2014,20(7):1793-1798
    [9]肖健梅,黄有方,李军军,等.基于离散粒子群优化的物流配送车辆路径问题[J].系统工程,2005(4):97-100XIAO J M,HUANG Y F,LI J J,et al.Vehicle Routing Problem Based on Discrete Particle Swarm Optimization[J].Systems Engineering,2005(4):97-100
    [10]刘建芹,贺毅朝,顾茜茜.基于离散粒子群算法求解背包问题研究[J].计算机工程与设计,2007(13):3189-3191,3204LIU J Q,HE Y C,GU Q Q.Solving Knapsack Problem Based on Discrete Particle Swarm Optimization[J].Computer Engineering and Design,2007(13):3189-3191,3204
    [11]潘全科,王凌,高亮.离散粒子群优化算法的研究进展[J].控制与决策,2009,24(10):1441-1449PAN Q K,WANG L,GAO L.The-State-of-Art of Discrete Particle Swarm Optimization Algorithms[J].Control and Decision,2009,24(10):1441-1449
    [12]张军.基于集成选址-运输路线安排问题的废旧家电逆向回收物流网络优化[J].计算机应用,2012,32(9):2652-2655ZHANG J.Reverse Logistic Networks Optimization of Home Appliances Return Based on Combined Location Routing Problem[J].Journal of Computer Applications,2012,32(9):2652-2655

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

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

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