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

Table 1

Relevant data of the example.

Pickup nodes	Pickup node coordinates	Delivery nodes	Delivery node coordinates	Demand (kg)
0	[5.00, 5.00]	0	[5.00, 5.00]	-	0	90
1	[5.94, 8.94]	31	[8.34, 9.35]	23	0	10
2	[5.53, 3.99]	32	[1.89, 4.51]	14	0	10
3	[2.38, 4.03]	33	[3.35, 5.38]	16	0	10
4	[5.68, 9.84]	34	[5.11, 7.29]	32	0	10
5	[3.95, 8.98]	35	[2.08, 5.79]	10	0	10
6	[5.23, 7.70]	36	[4.44, 8.41]	20	0	20
7	[2.38, 7.33]	37	[5.11, 7.29]	33	0	20
8	[2.75, 10.48]	38	[9.05, 6.20]	10	0	20
9	[3.95, 8.98]	39	[2.04, 10.44]	30	0	20
10	[8.30, 7.96]	40	[6.58, 8.71]	28	0	20
11	[6.16, 9.80]	41	[3.95, 10.66]	40	0	30
12	[5.00, 9.50]	42	[2.79, 6.13]	40	0	30
13	[4.63, 9.43]	43	[2.34, 7.10]	20	0	30
14	[7.21, 10.55]	44	[4.29, 8.30]	22	0	30
15	[5.68, 9.84]	45	[4.3, 8.29]	20	0	30
16	[5.75, 7.03]	46	[6.43, 6.50]	20	10	30
17	[7.36, 9.88]	47	[4.51, 10.85]	10	10	30
18	[4.45, 6.84]	48	[6.73, 4.63]	21	10	30
19	[1.14, 11.04]	49	[2.19, 8.68]	20	10	30
20	[2.41, 7.29]	50	[0.43, 6.13]	43	10	30
21	[9.95, 10.63]	51	[7.06, 8.94]	15	20	40
22	[5.94, 8.41]	52	[8.56, 9.73]	40	20	40
23	[6.91, 9.28]	53	[8.11, 9.43]	10	20	40
24	[6.20, 8.00]	54	[8.64, 10.03]	10	20	40
25	[5.64, 8.90]	55	[2.83, 6.16]	26	20	40
26	[7.21, 7.93]	56	[8.19, 6.73]	10	30	50
27	[4.55, 9.91]	57	[4.70, 6.84]	25	30	50
28	[5.56, 5.90]	58	[8.04, 9.54]	20	30	50
29	[5.22, 7.70]	59	[8.07, 9.54]	41	30	50
30	[6.69, 4.96]	60	[2.90, 4.81]	20	30	50