两阶段Bicriminal搜索用于寻找快速高效的电动汽车路线
Two-Phase Bicriterion Search for Finding Fast and Efficient Electric Vehicle Routes
摘要：
找到一个电动汽车的路线，优化驾驶时间和能源消耗的问题可以建模为一个双临界路径问题。不幸的是，寻找最优双临界路径的问题是NP完全的。本文研究的问题限制在两个阶段的路径，这对应于一种常见的方式，人们驾驶电动汽车，其中一个司机使用一种驾驶风格（如，最小化驾驶时间）在路线的开始和另一种驾驶风格（如，最小化能源消耗）在结束。我们提供了有效的多项式时间算法，找到最佳的两相路径的双克里什网络，我们经验验证了这些算法的有效性，找到良好的电动汽车行驶路线在美国各州的道路网络。此外，我们展示了如何将充电站到这些算法中，尽管这样的网络顶点的负能量消耗所带来的计算挑战。
英文摘要：
The problem of finding an electric vehicle route that optimizes both driving time and energy consumption can be modeled as a bicriterion path problem. Unfortunately, the problem of finding optimal bicriterion paths is NP-complete. This paper studies such problems restricted to two-phase paths, which correspond to a common way people drive electric vehicles, where a driver uses one driving style (say, minimizing driving time) at the beginning of a route and another driving style (say, minimizing energy consumption) at the end. We provide efficient polynomial-time algorithms for finding optimal two-phase paths in bicriterion networks, and we empirically verify the effectiveness of these algorithms for finding good electric vehicle driving routes in the road networks of various U.S. states. In addition, we show how to incorporate charging stations into these algorithms, in spite of the computational challenges introduced by the negative energy consumption of such network vertices.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
