SearcharxivSearch

arXiv · 2401.03300

Coordinating Guidance, Matching, and Charging Station Selection for Electric Vehicle Ride-Hailing Services through Data-Driven Stochastic Optimization

Abstract

Electric vehicles (EVs) play a pivotal role in sustainable ride-hailing services primarily due to their potential in reducing carbon emissions and enhancing environmental protection. Despite their significance, current research in the realm of EV batched matching frequently overlooks critical aspects such as rider demand uncertainty and charging station (CS) selection, leading to inefficiencies like decreased matching rates and prolonged waiting times for both riders and EV drivers. To fill the research gap, we propose a data-driven optimization framework that incorporates two inter-connected stochastic optimization models to address the challenges. The first model aims to relocate the idle EVs under satisfied conditions to the designated regions based on the probabilistic rider demand forecasting result before the real rider demand is revealed. Taking the solutions of the first model as the input, the second model optimizes the batched matching results by minimizing the rider's average waiting time and EV charging waiting time at CS. This integrated framework not only elevates the matching rate through the incorporation of rider demand uncertainties in the guidance module but also substantially curtails both rider and EV charging waiting times by synergizing guidance with CS selection choices. Empirical validation of our framework was conducted through an extensive case study in New York City, utilizing real-world data sets. The validation results demonstrate that the proposed data-driven optimization framework outperforms the benchmark models in terms of the proposed evaluation metrics. Most importantly, when deploying our framework, the charging waiting time of the EVs with low SOC can be reduced up to 73.6% compared to the benchmark model without CS selection.

Explore related subjects

Keep this discovery

BibTeXRIS

Xiaoming Li, Chun Wang, Xiao Huang. 2024-01-06. Coordinating Guidance, Matching, and Charging Station Selection for Electric Vehicle Ride-Hailing Services through Data-Driven Stochastic Optimization. https://arxiv.org/abs/2401.03300

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