*3.1. Notations*

*i*: The set of traveler types in the network. *i* presents an element, mainly including EVs and GVs. When specific instructions are needed, subscripts *g* and *e* are used to indicate variables or parameters related to GVs and EVs, respectively;

*W*: The set of OD pairs. *w* is an element of the set;

*R w*: The set of paths between all OD pairs;

*p*: The number of charging stations subject to the budget;

*U*: The utility value of the charging stations, resulting in a reduction in travel cost;

*K*·*U*: The waiting cost in charging stations, where *K* is a constant coefficient;


*l ij <sup>k</sup>* : Length of path *k* between node *i* and *j;*

*l js <sup>k</sup>* : Length of path *k* between node *j* and *s;*

*Re*: The range limit of EVs;

ε: Charging power. Unit: hour/mile;

*t w ck*: The minimum charging time;

*va*: Traffic flow on link *a*, including EVs and GVs, so *va* = *vae* + *vag*;

*ta(vag*, *vae*): Actual travel time through link *a*;

*t* 0 *<sup>a</sup>* : Free travel time through link *a;*

*Ha*: Capacity of link *a*;

*xa*: Binary parameter. If the charging facility is on link *a*, *xa* = 1, otherwise *xa* = 0;

δ*w ak*: Binary parameter. If the path *<sup>k</sup>* crosses the link *<sup>a</sup>*, <sup>δ</sup>*<sup>w</sup> ak* <sup>=</sup> 1, otherwise <sup>δ</sup>*<sup>w</sup> ak* = 0;

*q <sup>w</sup> <sup>i</sup>* : Elastic travel demand of type-*i* traveler between OD pair *w*;

*q w <sup>i</sup>* : Maximum potential demand of type-*i* traveler between OD pair *w*;

*f <sup>w</sup> ki*: Traffic flow of type-*i* traveler on path *k* between OD pair *w*;

*p <sup>w</sup> ki*: The probability that type-*i* traveler chooses the path *k* between OD pair *w*;

*c <sup>w</sup> <sup>k</sup>* : The actual travel time of the path *<sup>k</sup>* between OD pair *<sup>w</sup>*, and *<sup>c</sup> <sup>w</sup> <sup>k</sup>* <sup>=</sup> *ta*( *<sup>v</sup> <sup>a</sup>*)δ*<sup>w</sup> ak*;

*c w ki*: The generalized travel cost of type-*i* traveler on path *k* between OD pair *w*;

*C wi*: The expected perceived travel cost of the type-*i* traveler between OD pair *w*;

*D wi(*·*)*: The traffic demand function of the type-*i* traveler between OD pair *w*;

*cw*( → *x* ): Vector of the actual travel cost of all paths between OD pair *w*;

θ*i*: a non-negative parameter that characterizes the uncertainty of type-*i* traveler's understanding of the path travel time.
