Multiobjective Optimization of Large-Scale EVs Charging Path Planning and Charging Pricing Strategy for Charging Station

Algorithm 2

Bidirectional Martins’ algorithm.

	Create a forward list and a backward list
	The initial element in is the label of the starting point , , and the initial element in is the label of the end point ,
	Create the path set
	The initial search direction is forward
(1)	While is not dominated by
(2)	If, Then get the minimum node label in
(3)	For the child adjacent node of ,
(4)	Calculate the node label of the adjacent point,
(5)	If is not dominated by other node labels of , Then put into
(6)	If, Then get the minimum node label in
(7)	For the parent adjacent node of ,
(8)	Calculate the node label of the adjacent point,
(9)	If is not dominated by other node labels of , Then put into
(10)	If the label of is in the list of reverse direction, Then obtain the final path by return the previous node label in and , and add the path into
(11)	Change the direction to the opposite