本站首页 | 中心概况 | 研究队伍 | 科研动态 | 研究进展 | 学术交流 | 人才培养 | 政策规章 | 人才招聘 | 【2022版】 

    
当前位置: 本站首页>>学术交流>>正文

An energy-efficient reliable path finding algorithm for stochastic road networks with electric vehicles(中国矿业大学邵虎教授)

2021-10-10 11:41  

报告题目:An energy-efficient reliable path finding algorithm for stochastic road networks with electric vehicles

主讲人:邵虎 教授

报告时间:2021年10月12日上午10:00

报告地点:腾讯会议 683 968 844

主办单位:重庆国家应用数学中心

报告摘要

In this paper, we develop a novel reliable path finding algorithm for a stochastic road network with uncertainty in travel times while both electric vehicle energy andefficiency are simultaneously taken into account. We first propose abi-objective optimization model to maximize (1) the on-time arrival reliabilityand (2) energy-efficiency for battery electric vehicles (BEVs) in a pathfinding problem. The former objective requires finding the reliable shortestpath (RSP), which is the path with the minimal effective travel time measuredby the sum of the mean travel time and a travel time safety margin for anygiven origin-destination (OD) pair. Then, we refer to energy-efficiency as theminimum of the electric energy consumption. We discuss the non-additiveproperty of the RSP problem since we also consider the link travel timecorrelations, whereas the latter objective satisfies the additive criterion. To this end, we illustrate the existence of non-dominated solutions that satisfy both of the two objectives. Further more, it is shown that the intersection of two candidate sets – one for the RSPs and the other for paths with minimal energy-consumption - actually contains the optimal solution for thebi-objective optimization problem. The upper and lower bounds of the effectivetravel time are mathematically deduced and can be used to generate thecandidate path set of this bi-objective problem via the K-shortest algorithm.Our proposed algorithm overcomes the infeasibility of traditional path findingalgorithms (e.g., the Dijkstra algorithm) for RSPs. Moreover, using two numerical examples, we verify the effectiveness and efficiency of the propose dalgorithm. We numerically demonstrate promising potential applications of theproposed algorithm in real-life road traffic networks.

主讲人介绍

邵虎,男,1979年出生,中国矿业大学数学学院,教授,博士,博士生导师,中国矿业大学数学学院最优化理论与应用研究所所长。江苏省高校优秀共产党员,江苏省“青蓝工程”优秀教学团队带头人、优秀青年骨干教师,中国矿业大学青年学术带头人,中国矿业大学年度优秀教师。江苏省运筹学会副理事长,徐州市工业与应用数学学会副理事长。主持4项国家自然科学基金项目(面上3项,青年1项),在《TransportationResearch Part B》、《TransportationResearch Part C》、《管理科学学报》、《MathematicalMethods of Operations Research》等刊物发表科研论文40余篇,教学研究论文9篇,出版第一作者专著1部,参编教材1部,获得江苏省教学成果一等奖、教育部2018年度高等学校科学研究优秀成果奖自然科学奖二等奖、中国矿业大学教学贡献奖等60余项奖励。

主要从事问题驱动型“应用数学”研究,研究方向涉及最优化理论应用、交通网络建模与算法设计、数据驱动下的网络建模与算法、机器学习的应用等,具体包括:交通网络可靠性分析、不确定性条件下的路径优化问题、交通需求与行程时间估计、交通数据采集传感器布置、公交排班算法等

关闭窗口

电话:023-65911112  邮箱:cqcam@cqnu.edu.cn
传真:023-65362798  地址:重庆师范大学,大学城校区,汇贤楼    
版权所有@重庆国家应用数学中心  技术支持:谭华山,6510388@qq.com

Baidu
map