the area supplied by this distribution network, there are numerous entry points for PEVs to join, which can be considered as fixed data uploading workstations on the roadside, and the number of such entry points is $K$. Here we just use the entry point to describe the parallel process of multiple PEVs’ request. PEVs randomly send charging requests to an idle entry point, and the variable $\xi_k(t)$ denotes whether there is a PEV carrying an amount of energy demand of $e_k(t)$, sending request to the $k$-th ($k\!\in\!\textbf{K}\!=\!\{1,2,\cdots,K\}$) entry point. If there is a PEV uploading request to the $k$-th entry point, let $\xi_k(t)\!=\!1$, otherwise $\xi_k(t)\!=\!0$. Therefore the energy demand arrives at the $k$-th entry point is $E_k(t)\!=\!e_k(t)\xi_k(t)\!\leq\!E_{max}\!<\!\infty$. Notably, the probability of PEVs sending request to the $k$-th entry point is denoted by $p_k$, which means $Pr[\xi_k(t)=1]=p_k$.

The proposed directing policy in Section decides which charging outlet the PEVs arriving at each entry point should be guided to. Hence the binary variable $W_{k,ij}(t)\!\in\!\{0,1\}$ is used to denote the connections between the $k$-th entry point and the $j$-th outlet of the $i$-th charging station, where $W_{k,ij}(t)\!=\!1$ means the PEVs sending request to the $k$-th entry point shall be guided to the $j$-th 