A Time-Dependent Vehicle Routing Problem for Instant Delivery Based on Memetic Algorithm

Table 4

Delivery plans at different departure times.

Departure time	Delivery plan
18:00	0-17-14-11-47-41-8-19-49-44-26-38-56-0
	0-5-27-12-13-7-20-43-42-50-35-57-37-0
	0-4-15-25-9-39-45-34-30-60-55-0
	0-16-6-29-36-18-28-48-46-24-58-54-59-0
	0-1-22-31-10-40-23-21-52-53-51-0
	0-2-3-32-33-0
12:00	0-25-5–27-12-13-20-43-50-35-42-55-57-0
	0-10-24-22-40-23-54-21-52-53-51-0
	0-1-31-17-14-11-15-47-41-44-45-0
	0-9-8-39-19-49-26-38-56-0
	0-4-6-34-36-18-28-48-30-60-29-59-58-0
	0-2-3-32-33-7-37-16-46-0