Table 2.

Optimal trip-oriented PMS, fleet sizing, and charge scheduling algorithm.

Algorithm: Optimal trip-oriented PMS, fleet sizing, and charge scheduling [$u^{\ast }$, $u_f^{\ast }$]
1	Inputs	Route and driveline characteristics
		$\chi$, Eqs. (1)–(4)
2	Initialize	Representative driving cycle and significant speed profile clusters
		$v_{\mathit{dc}}$, $d_{\mathit{dc}}$, $C_1^{\ast },C_2^{\ast },\dots ,C_k^{\ast }$
3	Solve	Optimal route-oriented power management problem, Eq. (14)
	Using NSGA-II (10 levels for $u=[\overline{i_b}\overline{\partial i_b/\partial t}]$ over 10 generations)
		find $u^{\ast }$ achieving $J^{\ast }=\text{min.}J(u,v,t)$
		interim Output $u^{\ast }=[{\overline{i_b}}^{\ast }{\overline{\partial i_b/\partial t}}^{\ast }]$,
4	Initialize	Headway requirements, Eq. (14)
		$H,F_r,\vartheta ,V_O$,
5	Solve	Optimal fleet sizing and charge scheduling problem, Eq. (25)
	Using NSGA-II (10 levels for $u_f=[Z_f{N}_{\mathit{CB}}{h}_{\mathit{ch}}]$ over 10 generations )
		find $u_f^{\ast }$ achieving $J_f^{\ast }=\text{min.}{J}_f(u_f,v_f)$
		interim Output $u_f^{\ast }=[{Z_f}^{\ast }{N}_{\mathit{CB}}^{\ast }{h}_{\mathit{ch}}^{\ast }]$,
Outputs       optimal PMS, fleet size, and charge schedule $u^{\ast }$ and $u_f^{\ast }$