期刊文献+

时变交通下生鲜配送电动车辆路径优化方法 被引量:29

Electric Vehicle Route Optimization for Fresh Logistics Distribution Based on Time-varying Traffic Congestion
下载PDF
导出
摘要 依据时变交通路网特点设计基于路段划分策略的行驶时间计算方法,综合考虑客户对生鲜产品最低新鲜度约束,车载限制和电动车电量约束,设计三约束决策因子方法.以配送总成本最小为目标,构建时变交通下电动车城市生鲜配送路径优化模型,根据模型特点设计自适应改进的蚁群算法.实验结果表明,本文方法能够根据客户生鲜新鲜度要求,客户属性和路网特性,合理安排发车时间,科学规划配送路径,有效避免交通拥堵;通过算法对比,本文模型和算法能够明显降低配送成本,提高企业经济效益. The electric vehicle routing planning for fresh logistics distributions based on time-varying traffic conditions is investigated in this paper. With the time-varying traffic network, the calculation method for travel time is designed based on a route section division strategy. A three-constraint decision factor method is designed to consider the minimum product freshness limit, vehicle load constraints, and electric vehicle power constraints. A distribution route optimization model for electric vehicles is established for the urban logistics distribution of fresh products to minimize the total distribution cost. An improved ant colony algorithm is proposed, in which its parameters are adjusted adaptively. Simulation results show that this method can properly arrange the departure time and plan the distribution route to avoid traffic congestion, according to the requirements of product freshness,customer attributes, and road network characteristics. Compared with other algorithms, the proposed model and algorithm can significantly reduce the distribution cost and improve the economic benefits of enterprises.
作者 赵志学 李夏苗 ZHAO Zhi-xue;LI Xia-miao(School of Traffic&Transportation Engineering,Central South University,Changsha 410205,China;Key Laboratory of Hunan Province for Mobile Business Intelligence,Hunan University of Technology and Business,Changsha 410205,China)
出处 《交通运输系统工程与信息》 EI CSCD 北大核心 2020年第5期218-225,239,共9页 Journal of Transportation Systems Engineering and Information Technology
基金 国家自然科学基金(71071165)。
关键词 城市交通 电动车路径问题 蚁群算法 生鲜配送 时变交通 新鲜度 urban traffic electric vehicle routing problem ant colony algorithm fresh distribution time-varying traffic freshness
  • 相关文献

参考文献4

二级参考文献55

  • 1Dantzig G, Ramser J. The truck dispatching problem[J]. Management Science, 1959, 6(1): 80-91.
  • 2Br?ysy O, Gendreau M. Vehicle routing problem with time windows, part I: Route construction and local search[J]. Transportation Science, 2005, 39: 104-118.
  • 3Br?ysy O, Gendreau M. Vehicle routing problem with time windows, part II: Metaheuristics[J]. Transportation Science, 2005, 39: 119-139.
  • 4Najera A G, Bullinaria J A. An improved multi-objective evolutionary algorithm for the vehicle routing problem with time windows[J]. Computers & Operations Research, 2011, 38: 287-300.
  • 5Sbihi A, Eglese R W. Combinatorial optimization and green logistics[J]. 4OR: A Quarterly Journal of Operations Research, 2007, 5(2): 99-116.
  • 6Fagerholt K, Laporte G, Norstad I. Reducing fuel emissions by optimizing speed on shipping routes[J]. Journal of the Operational Research Society, 2010, 61(3): 523-529.
  • 7Bauer J, Bekta? T, Crainic T G. Minimizing greenhouse gas emissions in intermodal freight transport: An application to rail service design[J]. Journal of the Operational Research Society, 2010, 61(3): 530-542.
  • 8Kuo Y. Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem[J]. Computers & Industrial Engineering, 2010, 59(1): 157-165.
  • 9Demir E, Bekta? T, Laporte G. A comparative analysis of several vehicle emission models for road freight transportation[J]. Transportation Research Part D: Transport and Environment, 2011, 6(5): 347-357.
  • 10Bekta? T, Laporte G. The pollution-routing problem[J]. Transportation Research Part B: Methodological, 2011, 45(8): 1232-1250.

共引文献131

同被引文献237

引证文献29

二级引证文献68

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部