Full cover charging station location problem with routing

Kinay Omer Burak; Gzara Fatma; Alumur Sibel A.

摘要

In this paper, a new full cover modeling framework is developed to design refueling station infrastructure, where the focus is on locating fast-charging stations for battery electric vehicles to enable long-distance transportation. A mathematical model is introduced to determine the optimal locations of these charging stations so that every origin-destination trip on a given transportation network is covered with respect to vehicle range. This full cover model allows deviations from the shortest paths and also determines an optimal route for each trip that requires the minimum total en route recharging. Two variants of this model are proposed: one that minimizes the total cost of locating charging stations and total en route recharging, and another that determines the locations of a predetermined number of stations to minimize the total en route recharging. Computational experiments performed on benchmark data sets validate that the proposed full cover models perform better than the maximum or set cover problem settings in the literature in terms of routing-related measures, such as total trip distance and maximum deviation from the shortest paths. A Benders decomposition algorithm is developed to optimally solve real-life instances of the problem. The Benders subproblem is identified as a many-to-many shortest path problem with an additional constraint that restricts the nodes that can be used to open facilities that are determined by the master problem. A new algorithmic methodology is developed to construct the dual solution for this subproblem and to generate non-dominated optimality cuts and strong valid inequalities for feasibility cuts. This novel algorithm accelerates the performance of the Benders algorithm up to 900 times over the tested large-size instances. (c) 2020 Elsevier Ltd. All rights reserved.

机译：在本文中，开发了一种新的全封面建模框架来设计加油站基础设施，其中重点是为电池电动车辆定位快速充电站，以实现长途运输。引入了数学模型以确定这些充电站的最佳位置，使得给定运输网络上的每个起始目的地跳闸被覆盖到车辆范围。此全封面模型允许与最短路径的偏差，并且还确定每个跳闸的最佳路径，这需要最小的总计挖掘加压。提出了该模型的两个变体：一个最小化定位充电站的总成本和总沟通的全部加压，另一个确定预定数量的车站的位置，以最小化总沟通的电压再充电。在基准数据集上执行的计算实验验证所提出的全封面模型在路由相关措施方面的文献中的最大或设置覆盖问题设置，例如总跳闸距离和与最短路径的最大偏差。开发了弯曲分解算法以最佳地解决问题的现实生活实例。弯曲者子问题被识别为多对多的最短路径问题，其中附加约束限制可用于打开由主问题确定的设施的节点。开发了一种新的算法方法来构建该子问题的双解决方法，并产生非主导的最优性切割和强大的可行性削减不等式。该新颖算法通过测试的大尺寸实例将弯曲算法的性能加速到900倍。（c）2020 elestvier有限公司保留所有权利。

Full cover charging station location problem with routing

摘要

著录项

相关主题

期刊订阅