---
title: Dynamic PSA-CEM for EV Charging Pricing
url: https://www.emergentmind.com/topics/dynamic-probabilistic-sensitivity-analysis-guided-cross-entropy-method-psa-cem
type: topic
---

# Dynamic PSA-CEM for EV Charging Pricing

The Dynamic Probabilistic Sensitivity Analysis-guided Cross-Entropy Method (PSA-CEM) is an adaptive, high-dimensional stochastic optimization approach developed for bilevel, nonconvex, and behaviorally heterogeneous dynamic pricing problems, as exemplified by electric vehicle charging systems. Integrating the Cross-Entropy Method (CEM) with a dynamic probabilistic sensitivity analysis, PSA-CEM targets efficient global optimization in problems characterized by vast decision spaces and intricate lower-level stochastic equilibria. In combination with rolling-horizon decomposition and the Method of Successive Averages (MSA), PSA-CEM enables tractable, scalable solution of time-coupled pricing strategies under queueing and multinomial logit (MNL) user choice models [2601.13571].

## 1. Optimization Problem Structure

The target application involves dynamic pricing of EV charging, with the decision vector $\boldsymbol\theta=(p_{11},p_{12},\dots,p_{N_sN_h})\in\Omega\subset\mathbb R^d$ representing all station-hour price variables. The upper-level objective function to be maximized is
\[
F(\boldsymbol\theta)=\sum_{t=1}^{N_h}\sum_{i=1}^{N_s}\sum_j Q_{ij}^\Delta(t)(p_i(t)-\nu_i(t))p_{ij}(t)
+ (1-\omega)[\sum_{j}\sum_{t,i}\kappa Q_{ij}^\Delta(t) p_{ij}(t) - \nu\sum_{t,i,j}T_{ij}^q(t)p_{ij}(t) -\eta\sum_{t,i}\lambda_i(t)\pi_{i,c_i}(t)]
\]
subject to box constraints $\nu_i(t)\leq p_i(t)\leq p_{\max,i}(t)$. Lower-level user flows and queueing effects are resolved by an MNL model augmented with queuing-theoretic approximations. This construction yields a bilevel, high-dimensional stochastic program that is intractable to solve directly without specialized metaheuristics.

## 2. Dynamic Probabilistic Sensitivity Analysis Integration

PSA is interleaved into CEM iterations. At each iteration $\ell$, candidate price vectors $\{\boldsymbol\theta^{(m)}\}_{m=1}^N$ are sampled from a parameterized density $f^{(\ell)}$, and their performance evaluated. To quantify the influence of each decision variable $\theta_k$ on the distribution of $F$, a “frozen” sample set is constructed for $k$ by fixing $\theta_k$ at its elite-mean $\bar\theta_k$ while retaining all other sample components, and recomputing the induced pdf $\hat g_k^{(\ell)}(s)$ for $F$. The probabilistic sensitivity index is given by the Kullback–Leibler divergence:
\[
D_k^{(\ell)} = \int \hat g_k^{(\ell)}(s)\ln\frac{\hat g_k^{(\ell)}(s)}{\hat f^{(\ell)}(s)}\,ds
\]
where $\hat f^{(\ell)}(s)$ is the empirical density under normal sampling. The set of indices with $D_k^{(\ell)}>\tau$ (with threshold $\tau\approx 10^{-3}$) defines the active set $\mathcal{A}^{(\ell)}$. Only $\mathcal{A}^{(\ell)}$ undergoes adaptive distribution parameter updates, freezing all others, enabling dimensionality reduction and focused optimization.

## 3. Cross-Entropy Method Formulation

Each CEM iteration proceeds by sampling $N$ candidate $\boldsymbol\theta^{(m)}$ from a multivariate normal with independent marginals,
\[
f^{(\ell)}(\boldsymbol\theta) = \prod_{k=1}^d \mathcal N(\theta_k|\mu_k^{(\ell)},\sigma_k^{(\ell)2})
\]
Performance scores $F^{(m)}$ are computed for each sample, and the top $q$ fraction (e.g., $q=0.05$) by $F$ value comprise the elite set $\mathcal E^{(\ell)}$. Update equations for means and variances of the elite samples are
\[
\bar\theta_k^{(\ell)} = \frac{1}{|\mathcal E^{(\ell)}|} \sum_{\boldsymbol\theta\in\mathcal E^{(\ell)}} \theta_k,\quad
s_k^{(\ell)2} = \frac{1}{|\mathcal E^{(\ell)}|} \sum_{\boldsymbol\theta\in\mathcal E^{(\ell)}} (\theta_k-\bar\theta_k^{(\ell)})^2
\]
For $k\in\mathcal{A}^{(\ell)}$, the parameter update with smoothing $\beta$ is
\[
\mu_k^{(\ell+1)} = \beta\mu_k^{(\ell)} + (1-\beta)\bar\theta_k^{(\ell)},\quad
\sigma_k^{(\ell+1)} = \beta\sigma_k^{(\ell)} + (1-\beta)s_k^{(\ell)}
\]
while variables not in the active set remain frozen. This regime promotes rapid convergence on sensitive decision variables and avoids unnecessary update noise in insensitive ones.

## 4. Rolling-Horizon Integration

PSA-CEM is embedded in a rolling-horizon procedure, essential for addressing temporal dependencies of queue states and time-varying user demand. The overall optimization horizon $T$ is divided into windows of length $H$ (typically one hour). For each window:

- Queue-states and initial prices are set.
- PSA-CEM is run to convergence (stopping after a relative elite-mean change $<\varepsilon$ for 2 consecutive iterations).
- The optimized period's prices are fixed, queue transitions are computed via MSA, and the window is advanced, with updated queue states and sampling parameters carried forward.

This receding-horizon decomposition permits large-scale, multi-period optimization, accommodating system dynamics and state carryover between windows without exponential computational cost growth.

## 5. Algorithmic Steps and Update Logic

The PSA-CEM algorithm can be summarized as follows:

1. Initialize $\mu_k^{(0)}$, $\sigma_k^{(0)}$ for each $\theta_k$; set iteration $\ell=0$.
2. For each rolling window:
    - Set queue-states using the previous solution.
    - Iterate until convergence:
        - Draw $N$ samples from current parameterization.
        - Compute lower-level equilibrium (MNL+MSA) and $F^{(m)}$ for each.
        - Form elite set of the best $qN$ samples.
        - Every $\psi$ iterations, recalculate sensitivity indices $D_k$ and active set $\mathcal A$.
        - Update $\mu_k$, $\sigma_k$ for $k\in\mathcal A$; freeze others.
        - Check for convergence in variances or elite-mean relative change.
    - Fix the period's optimal prices and advance queue states.

## 6. Implementation Parameters and Practical Considerations

Typical parameterization for effective operation:

| Parameter           | Typical Value    | Role                                |
|---------------------|-----------------|-------------------------------------|
| Population size $N$ | $1000$          | Number of samples per iteration     |
| Elite fraction $q$  | $0.05$          | Fraction for elite selection        |
| Smoothing $\beta$   | $0.7$           | Balance update/new estimate         |
| PSA update $\psi$   | $5$ iterations  | Sensitivity recalculation frequency |
| Sensitivity $\tau$  | $10^{-3}$       | PSA threshold for activeness        |
| Convergence $\varepsilon$ | $10^{-3}$ | Elite mean relative change tolerance|
| Rolling window $H$  | $1$ h           | Horizon per optimization window     |

Auxiliary implementation recommendations include the use of Gaussian moment-matched densities for pdf fitting, variance bounds to prevent collapse, parallelization of batch evaluations, and warm-starting of $(\mu, \sigma)$ and queue-states between windows. The lower-level equilibrium in each sample is efficiently resolved with MSA using a diminishing stepsize $1/n$ [2601.13571].

## 7. Computational Impact and Application Scope

The PSA-CEM method offers dimensionality screening and targeted search, enabling solution of high-dimensional pricing problems with high fidelity to behavioral and system uncertainties. Empirical studies in the context of EV charging networks show marked improvements over fixed and time-of-use pricing, both in user utility and queuing performance, as evidenced in real-world trials with 22 stations. The adaptive freezing of insensitive variables, coupled with rolling-horizon decomposition, ensures both computational efficiency and robustness. A plausible implication is applicability to a broader class of bilevel stochastic programs with similar structural properties, especially where sensitivity varies across dimensions and temporal coupling is significant [2601.13571].

Source: https://www.emergentmind.com/topics/dynamic-probabilistic-sensitivity-analysis-guided-cross-entropy-method-psa-cem