Multi-Depot Pickup and Delivery Problem with Resource Sharing

Algorithm 1

Procedure of k-means algorithm.

	Input: The datasets, including logistics facility and customer information, such as the coordination, time windows, and demands
Output: The clustering results
(1)	Step 1: Select k objects as the initial clustering center
(2)	Step 2: Calculate the Manhattan distance between each customer and each clustering center
(3)	Step 3: (Re-)Assign each customer to their closest clustering center
(4)	Step 4: If some customers need to be adjusted among the clustering results, then enter Step 3; otherwise, go to Step 5
(5)	Step 5: Update the clustering centers
(6)	Step 6: Output the clustering results