“…We can obtain vehicle flows in the initial network by solving UE problems (4)- (12); when setting candidate AV link set̃= ⌀ without congestion pricing. After solving this UE problem for vehicle flows, we find that no AVs run on links (5,6), (6,5), (6,9), (7,8), (8,7), and (8,3) in the initial network. So we exclude these links from the candidate link set and form the following candidate link set: = {(1, 5) , (1,6) , (2,5) , (2, 6) , (5, 7) , (5, 9) , (6,8) , (9, 7) , (9,8) , (7,3) , (7,4) , (8,4)} .…”