A logistics company is tasked with delivering packages to multiple destinations within a

city using a fleet of vehicles. The company wants to optimize its delivery routes to

minimize fuel consumption and total travel time. To achieve this, they decided to

employ the Sweep Heuristic method in the Vehicle Routing Problem $($VRP$).$

Which of the following statements accurately describes the Sweep Heuristic in the

context of the VRP for this scenario?

A$.$ The Sweep Heuristic initially assigns each delivery destination to the nearest available

vehicle and then iteratively swaps destinations between vehicles to optimize the total

travel distance.

B$.$ The Sweep Heuristic evaluates all possible combinations of delivery routes and selects

the one with the minimum total distance traveled by the fleet of vehicles.

C$.$ The Sweep Heuristic randomly assigns delivery destinations to vehicles and then applies a

simulated annealing process to gradually improve the routes until an optimal solution is

found.

D$.$ The Sweep Heuristic iteratively selects a depot and sorts the delivery destinations based

on their polar angles relative to the depot. Then, it assigns each destination to the closest

available vehicle until the vehicle's capacity is reached.