吉林大学学报(工学版) ›› 2016, Vol. 46 ›› Issue (1): 108-113.doi: 10.13229/j.cnki.jdxbgxb201601016

• • 上一篇    下一篇

基于云和声搜索的综合运输网络设计和货流分配优化

刘星材1, 2, 何世伟1, 孙杨3, 黎浩东1, 景云1   

  1. 1.北京交通大学 交通运输学院,北京 100044;
    2.四川省铁路产业投资集团有限责任公司,成都 610041;
    3.交通运输部科学研究院 综合运输研究中心,北京 100029
  • 收稿日期:2014-05-28 出版日期:2016-01-30 发布日期:2016-01-30
  • 通讯作者: 何世伟(1969-),男,教授,博士生导师.研究方向:交通运输规划与管理.E-mail:shwhe@bjtu.edu.cn
  • 作者简介:刘星材(1988-),男,博士研究生.研究方向:交通运输规划与管理.E-mail:xcliu88@163.com
  • 基金资助:
    国家自然科学基金项目(61374202); 中国铁路总公司科技研究开发计划项目(2014F007,2013F021,2013X005-A)

Comprehensive transportation mixed network design and freight flow allocation based on cloud harmony search algorithm

LIU Xing-cai1, 2, HE Shi-wei1, SUN Yang3, LI Hao-dong1, JING Yun1   

  1. 1.School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China;
    2.Sichuan Railway Investment Group Co. Ltd.,Chengdu 610041,China;
    3.Integrated Transport Research Center, China Academy of Transportation Sciences, Beijing 100029, China
  • Received:2014-05-28 Online:2016-01-30 Published:2016-01-30

RICH HTML

0   

PDF (PC)

358

摘要： 针对综合运输网络中的货物运输,以货流运输费用、扩建和新建费用最小为目标,构建了考虑建设资金约束的综合运输网络设计优化模型,采用结合ILOG Cplex的云和声搜索算法进行求解。路段的扩建或新建方案由云和声搜索进行优化,根据路段扩建或新建方案获取货流的k短路集合作为配流的备选径路集合,利用ILOG Cplex进行配流。仿真结果表明了模型和求解算法的有效性,且云模型的引入有效提升了和声算法的寻优效率。

关键词: 交通运输系统工程, 混合运输网络设计, 和声搜索算法, 云模型, ILOG Cplex

Abstract: A survey of comprehensive transportation mixed network design and freight flow allocation was carried out. An optimal model was developed to minimize the total transportation cost and reconstruction cost, considering the investment budget constraint. A hybrid heuristic algorithm based on cloud harmony search strategy (C-HS) and ILOG Cplex optimization studio was designed to solve the model. The C-HS was used to optimize the reconstruction decision of the transport arc in the network, while the freight flow allocation result for harmony evaluation was solved by ILOG Cplex based on the k shortest path of the freight. The cloud model was used to enhance the harmony search convergence rate when the new harmony (new solution) was constructed. A numerical example was given and results show that the model and algorithm are effective.

Key words: engineering of communications and transportation system, mixed network design, harmony search, cloud model, ILOG Cplex

中图分类号: 

  • U491
[1] Boyce D E, Janson B N. A discrete transportation network design problem with combined trip distribution and assignment[J]. Transportation Research Part B, 1980, 14(1-2):147-154.
[2] Poorzahedy H , Rouhani O M. Hybrid meta-heuristic algorithms for solving network design problem[J]. European Journal of Operational Research, 2007, 182(2):578-596.
[3] Chen M Y, Alfa A S. A network design algorithm using a stochastic incremental traffic assignment approach[J]. Transportation Science, 1991, 25(3):215-224.
[4] 聂伟,邵春福,杨励雅,等. 混合交通网络设计的双层模型及遗传算法求解[J]. 土木工程学报,2007,40(8):90-93.
Nie Wei, Shao Chun-fu, Yang Li-ya, et al. Bi-level programming model for mixed transportation network design and genetic solution algorithm[J]. China Civil Engineering Journal, 2007, 40(8):90-93.
[5] 孙杨,宋瑞,何世伟,等. 混合交通网络设计及免疫克隆退火算法求解研究[J]. 交通运输系统工程与信息,2009,9(3):103-108.
Sun Yang, Song Rui, He Shi-wei, et al. Mixed transportation network design based on immune clone annealing algorithm[J]. Journal of Transportation Systems Engineering and Information Technology, 2009, 9(3):103-108.
[6] 潘艳荣,邓卫. 考虑需求预测不确定性的交通网络设计[J]. 交通运输工程学报,2008,8(6):82-87.
Pan Yan-rong, Deng Wei. Transport network design under demand forecast uncertainty[J]. Journal of Traffic and Transportation Engineering, 2008, 8(6):82-87.
[7] Yen J Y. Finding the K shortest loopless paths in a network[J]. Management Science, 1971, 17(11):712-716.
[8] Martins E Q V, Pascoal M M B, Santos J L E. The K shortest paths problem[J]. European Journal of Operational Research,1998,165(1):97-107.
[9] Geem Z W, Kim J H, Loganathan G V. A new heuristic optimization algorithm: harmony search[J]. Transactions of the Society for Modeling and Simulation International-Simulation, 2001, 76(2):60-68.
[10] Geem Z W, Tseng C L, Park Y J. Harmony search for generalized orienteering problem:best touring in China[C]∥Proceedings of the First International Conference on Advances in Natural Computation, Changsha,2005: 741-750.
[11] Lee K S, Geem Z W. A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice[J]. Computer Methods in Applied Mechanics and Engineering, 2005, 194(36-38):3902-3933.
[12] 刘星材,何世伟,孙杨,等. 基于时间满意度的铁路枢纽空车调配随机机会约束模型及算法研究[J]. 铁道学报,2013,32(9):1-6.
Liu Xing-cai, He Shi-wei, Sun Yang, et al. Stochastic chance-constrained model and algorithm for empty car distribution at railway terminals in consideration of time satisfaction[J]. Journal of the China Railway Society, 2013, 32(9):1-6.
[13] 李德毅,杜鹢. 不确定性人工智能[M]. 北京:国防工业出版社,2005:143-156.
[1] 陈永恒,刘芳宏,曹宁博. 信控交叉口行人与提前右转机动车冲突影响因素[J]. 吉林大学学报(工学版), 2018, 48(6): 1669-1676.
[2] 常山,宋瑞,何世伟,黎浩东,殷玮川. 共享单车故障车辆回收模型[J]. 吉林大学学报(工学版), 2018, 48(6): 1677-1684.
[3] 曲大义,杨晶茹,邴其春,王五林,周警春. 基于干线车流排队特性的相位差优化模型[J]. 吉林大学学报(工学版), 2018, 48(6): 1685-1693.
[4] 宗芳, 齐厚成, 唐明, 吕建宇, 于萍. 基于GPS数据的日出行模式-出行目的识别[J]. 吉林大学学报(工学版), 2018, 48(5): 1374-1379.
[5] 刘翔宇, 杨庆芳, 隗海林. 基于随机游走算法的交通诱导小区划分方法[J]. 吉林大学学报(工学版), 2018, 48(5): 1380-1386.
[6] 钟伟, 隽志才, 孙宝凤. 不完全网络的城乡公交一体化枢纽层级选址模型[J]. 吉林大学学报(工学版), 2018, 48(5): 1387-1397.
[7] 刘兆惠, 王超, 吕文红, 管欣. 基于非线性动力学分析的车辆运行状态参数数据特征辨识[J]. 吉林大学学报(工学版), 2018, 48(5): 1405-1410.
[8] 宗芳, 路峰瑞, 唐明, 吕建宇, 吴挺. 习惯和路况对小汽车出行路径选择的影响[J]. 吉林大学学报(工学版), 2018, 48(4): 1023-1028.
[9] 栾鑫, 邓卫, 程琳, 陈新元. 特大城市居民出行方式选择行为的混合Logit模型[J]. 吉林大学学报(工学版), 2018, 48(4): 1029-1036.
[10] 陈永恒, 刘鑫山, 熊帅, 汪昆维, 谌垚, 杨少辉. 冰雪条件下快速路汇流区可变限速控制[J]. 吉林大学学报(工学版), 2018, 48(3): 677-687.
[11] 王占中, 卢月, 刘晓峰, 赵利英. 基于改进和声搜索算法的越库车辆排序[J]. 吉林大学学报(工学版), 2018, 48(3): 688-693.
[12] 李志慧, 胡永利, 赵永华, 马佳磊, 李海涛, 钟涛, 杨少辉. 基于车载的运动行人区域估计方法[J]. 吉林大学学报(工学版), 2018, 48(3): 694-703.
[13] 陈松, 李显生, 任园园. 公交车钩形转弯交叉口自适应信号控制方法[J]. 吉林大学学报(工学版), 2018, 48(2): 423-429.
[14] 苏书杰, 何露. 步行交通规划交叉路口行人瞬时动态拥塞疏散模型[J]. 吉林大学学报(工学版), 2018, 48(2): 440-447.
[15] 孟品超, 李学源, 贾洪飞, 李延忠. 基于滑动平均法的轨道交通短时客流实时预测[J]. 吉林大学学报(工学版), 2018, 48(2): 448-453.
Viewed
Full text


Abstract

Cited
  Shared   
  Discussed   
No Suggested Reading articles found!
版权所有 © 《吉林大学学报(工学版)》编辑部
地址：长春市人民大街5988号　电话：+86-431-85095297　传真：+86-431-85094074　E-mail: xbgxb@jlu.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发