An electric vehicle charging station access equilibrium model with M/D/C queueing

• URL: http://arxiv.org/abs/2102.05851v2
• Date: Fri, 3 Sep 2021 19:41:03 GMT
• Title: An electric vehicle charging station access equilibrium model with M/D/C queueing
• Authors: Bingqing Liu, Theodoros P. Pantelidis, Stephanie Tam, Joseph Y. J. Chow
• Abstract summary: We propose an EV-to-charging station user equilibrium (UE) assignment model with a M/D/C queue approximation as a nondifferentiable nonlinear program. The model is applied to the large-scale case study of New York City Department of Citywide Administrative Services (NYC DCAS) fleet and EV charging station configuration as of July 8, 2020. Results suggest a policy based on selecting locations with high utilization ratio instead of with high queue delay.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Despite the dependency of electric vehicle (EV) fleets on charging station availability, charging infrastructure remains limited in many cities. Three contributions are made. First, we propose an EV-to-charging station user equilibrium (UE) assignment model with a M/D/C queue approximation as a nondifferentiable nonlinear program. Second, to address the non-differentiability of the queue delay function, we propose an original solution algorithm based on the derivative-free Method of Successive Averages. Computational tests with a toy network show that the model converges to a UE. A working code in Python is provided free on Github with detailed test cases. Third, the model is applied to the large-scale case study of New York City Department of Citywide Administrative Services (NYC DCAS) fleet and EV charging station configuration as of July 8, 2020, which includes unique, real data for 563 Level 2 chargers and 4 Direct Current Fast Chargers (DCFCs) and 1484 EVs distributed over 512 Traffic Analysis Zones. The arrival rates of the assignment model are calibrated in the base scenario to fit an observed average utilization ratio of 7.6% in NYC. The model is then applied to compare charging station investment policies of DCFCs to Level 2 charging stations based on two alternative criteria. Results suggest a policy based on selecting locations with high utilization ratio instead of with high queue delay.

Related papers

• Federated Data-Driven Kalman Filtering for State Estimation [49.40531019551957]
  This paper proposes a novel localization framework based on collaborative training or federated learning paradigm. We build on the standard approach of KalmanNet, a recurrent neural network aiming to estimate the underlying system uncertainty of traditional Extended Kalman Filtering. FedKalmanNet is used by each vehicle to localize itself, by estimating the associated system uncertainty matrices.
  arXiv  Detail & Related papers  (2024-11-06T16:18:33Z)
• SPARQ: Efficient Entanglement Distribution and Routing in Space-Air-Ground Quantum Networks [50.91365514137301]
  Space-air-ground quantum (SPARQ) network is developed as a means for providing a seamless on-demand entanglement distribution. Deep reinforcement learning framework is proposed and trained using deep Q-network (DQN) on multiple graphs of SPARQ. Third-party entanglement distribution policy is proposed to establish entanglement between communication parties.
  arXiv  Detail & Related papers  (2024-09-19T16:31:37Z)
• Location based Probabilistic Load Forecasting of EV Charging Sites: Deep Transfer Learning with Multi-Quantile Temporal Convolutional Network [1.49199020343864]
  This article presents a location-based load forecasting of EV charging sites using a deep Multi-Quantile Temporal Convolutional Network (MQ-TCN) We conducted experiments on data from four charging sites, namely, Caltech, JPL, Office-1, and NREL, which have diverse EV user types. Our proposed deep MQ-TCN model exhibited a remarkable 28.93% improvement over the XGBoost model for a day-ahead load forecasting at the JPL charging site.
  arXiv  Detail & Related papers  (2024-09-18T10:34:48Z)
• Bench2Drive: Towards Multi-Ability Benchmarking of Closed-Loop End-To-End Autonomous Driving [59.705635382104454]
  We present Bench2Drive, the first benchmark for evaluating E2E-AD systems' multiple abilities in a closed-loop manner. We implement state-of-the-art E2E-AD models and evaluate them in Bench2Drive, providing insights regarding current status and future directions.
  arXiv  Detail & Related papers  (2024-06-06T09:12:30Z)
• Controlling Large Electric Vehicle Charging Stations via User Behavior Modeling and Stochastic Programming [0.0]
  This paper introduces an Electric Vehicle Charging Station model that incorporates real-world constraints. We propose two Multi-Stage Programming approaches that leverage user-provided information. A user's behavior model based on a sojourn-time-dependent process enhances cost reduction while maintaining customer satisfaction.
  arXiv  Detail & Related papers  (2024-02-20T18:37:11Z)
• A Meta-Learning Approach to Predicting Performance and Data Requirements [163.4412093478316]
  We propose an approach to estimate the number of samples required for a model to reach a target performance. We find that the power law, the de facto principle to estimate model performance, leads to large error when using a small dataset. We introduce a novel piecewise power law (PPL) that handles the two data differently.
  arXiv  Detail & Related papers  (2023-03-02T21:48:22Z)
• Neighbor-Based Optimized Logistic Regression Machine Learning Model For Electric Vehicle Occupancy Detection [0.0]
  The model was trained on data from 57 EV charging stations around the University of California San Diego campus. The model achieved an 88.43% average accuracy and 92.23% maximum accuracy in predicting occupancy.
  arXiv  Detail & Related papers  (2022-04-28T01:05:32Z)
• Learning to Operate an Electric Vehicle Charging Station Considering Vehicle-grid Integration [4.855689194518905]
  We propose a novel centralized allocation and decentralized execution (CADE) reinforcement learning (RL) framework to maximize the charging station's profit. In the centralized allocation process, EVs are allocated to either the waiting or charging spots. In the decentralized execution process, each charger makes its own charging/discharging decision while learning the action-value functions from a shared replay memory. Numerical results show that the proposed CADE framework is both computationally efficient and scalable, and significantly outperforms the baseline model predictive control (MPC)
  arXiv  Detail & Related papers  (2021-11-01T23:10:28Z)
• Comparing Probability Distributions with Conditional Transport [63.11403041984197]
  We propose conditional transport (CT) as a new divergence and approximate it with the amortized CT (ACT) cost. ACT amortizes the computation of its conditional transport plans and comes with unbiased sample gradients that are straightforward to compute. On a wide variety of benchmark datasets generative modeling, substituting the default statistical distance of an existing generative adversarial network with ACT is shown to consistently improve the performance.
  arXiv  Detail & Related papers  (2020-12-28T05:14:22Z)
• Over-the-Air Federated Learning from Heterogeneous Data [107.05618009955094]
  Federated learning (FL) is a framework for distributed learning of centralized models. We develop a Convergent OTA FL (COTAF) algorithm which enhances the common local gradient descent (SGD) FL algorithm. We numerically show that the precoding induced by COTAF notably improves the convergence rate and the accuracy of models trained via OTA FL.
  arXiv  Detail & Related papers  (2020-09-27T08:28:25Z)
• A node-charge graph-based online carshare rebalancing policy with capacitated electric charging [3.262056736346764]
  We propose a new rebalancing policy using cost function approximation. The algorithm is validated in a case study of electric carshare in Brooklyn, New York.
  arXiv  Detail & Related papers  (2020-01-20T23:28:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.