摘要
我国新能源汽车市场正快速增长,用户对新能源汽车出行规划的需求显著增加。与传统路径规划不同,新能源汽车的路径规划需要考虑充电问题。针对家用新能源汽车提出了ETSP-1问题,研究从起点出发,经过若干个途经点后返回起点,且中途最多充电一次,要求总里程最短的路径规划问题。基于分枝定界算法寻找最优解,该算法与最近邻居算法相比,平均可节约5%的里程,最高可节省9.35%的里程。通过Shiny R技术开发了Web端应用程序——FEVER。用户可以在地图上选择出行途经点,指定出发时的续航里程以及充电前的电量下限,并在网页上获取可行的路径指南与规划方案。该应用有望为用户提供出行前的路径规划服务,缓解因充电问题产生的里程焦虑。FEVER求解问题的适宜规模上限为12个途经点。
The market for new energy vehicles in China is growing rapidly,with a clear increase in demand from users for travel planning with new energy vehicles.In contrast to conventional path planning methodologies,the incorporation of charging considerations is essential for new energy vehicles.This article introduces the ETSP-1 problem for household new energy vehicles,which focuses on a path planning issue.The objective is to determine the shortest route that begins at a starting point,visits several intermediate points,and returns to the starting point,allowing for a maximum of one charging stop along the way.The process of finding the optimal solution using the branch and bound algorithm,compared to the nearest neighbour algorithm,can save an average of 5%of mileage,with a maximum savings of up to 9.35%.A web-based application called FEVER has been implemented using Shiny R technology.This interactive platform enables users to delineate their journey on a digital map,delineating preferred travel paths,and setting thresholds for battery range and minimum charge levels prior to recharging.Users will obtain feasible path guides and planning solutions on the web-based application.This application is designed to offer users pre-travel path planning,alleviate"mileage anxiety"related to charging concerns,and can effectively handle problems involving up to 12 waypoints.
作者
冯伊迪
张昆
FENG Yidi;ZHANG Kun(School of Geographical Sciences,East China Normal University,Shanghai 200241,China)
出处
《软件导刊》
2025年第8期158-163,共6页
Software Guide
