Assessing the Potential of the Strategic Formation of Urban Platoons for Shared Automated Vehicle Fleets

Algorithm 1

Pseudocode for the formation of platoons.

	INPUT: information about a list of arriving vehicles A The information for vehicle can be represented by a set Origin is the service point that vehicle is moving towards and destination represents the next service point. is the shortest route between and .
	FOR each arriving vehicle in the set
	Compare information to the information of existing platoons’ leaders
	IF ( ) AND platoon size of the platoon is not reached)
	Add vehicles to the platoon as a follower;
	Adjust the vehicle’s shortest route to the platoon shortest route ;
	Remove vehicle from the set ;
	ENDIF
	Continue
	FOR each arriving vehicle in the set
	IF(( is not connected to the number of connected vehicles for < platoon size )
	and are paired, and the connection between and is established;
	IF is not in the destination group of vehicle
	Let the vehicle join the destination group ;
	ENDIF
	ENDIF
	ENDFOR
	Remove vehicle from the set ;
	Vehicles that are not paired move as individual vehicles;
	ENDFOR
	OUTPUT: Platoons of vehicles and regular driving vehicles that are not in platoons