Research Article
Multiobjective Optimization of Large-Scale EVs Charging Path Planning and Charging Pricing Strategy for Charging Station
Algorithm 1
Basic Martins’ algorithm.
| Create a list | | The initial element in the list is the label of the starting point , | | Create the path set | (1) | While is not empty | (2) | Get the minimum node label in , | (3) | For the adjacent node, | (4) | Calculate the label of the adjacent point | (5) | If is not dominated by other node labels of , and not dominated by labels in | (6) | Then put into list | (7) | If | (8) | Then get the previous nodes of , and put the path nodes into |
|