SearcharxivSearch

arXiv · 2402.14263

Innovation Diffusion in EV Charging Location Decisions: Integrating Demand & Supply through Market Dynamics

Abstract

This paper offers a strategic approach to Electric Vehicles (EVs) charging network planning, emphasizing the integration of demand and supply dynamics via continuous-time fluid queue models and discrete flow refueling location modeling, all in the context of innovation diffusion principles. We employ a continuous-time approximation based on Ordinary Differential Equations (ODEs) to design multi-year supply curves, a method that stands in contrast to conventional practices which often overlook inter-year transitions and ongoing processes. For medium-term charging station location planning (CSLP), we apply a flow refueling location model (FRLM) within grid-based multi-level networks, considering both multiple-path networks and capacity constraints. The grid-based network planning strategy uses a three-tier (Macro-Meso-Micro) approach for thorough EV charging station placement, with the macro-level covering entire cities, the meso-level assessing detailed EV routes and bridging the macro to micro levels, and the micro-level focusing on precise station placement for accessibility and efficiency. Our investigation into overutilization and underutilization scenarios delivers valuable insights for policymaking and cost-benefit analyses. Illustrating our approach with the example of the Chicago sketch network, we introduce an integrated demand-supply model suitable for a single region and extendable to multiple regions, thereby addressing a gap in the existing literature. Our proposed methodology focuses on EV station placement, taking into account future needs, geographical capacities, and the importance of scenario analysis, which empowers strategic resource planning for EV charging networks over extended timeframes, thus aiding the transition towards a more sustainable and efficient transportation system.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiangyong Luo, Michael J. Kuby, Yudai Honma, Mouna Kchaou-Boujelben, Xuesong, Zhou. 2024-02-22. Innovation Diffusion in EV Charging Location Decisions: Integrating Demand & Supply through Market Dynamics. https://doi.org/10.1016/j.trc.2024.104733

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC