Adaptive Cultural Algorithm-Based Cuckoo Search for Time-Dependent Vehicle Routing Problem with Stochastic Customers Using Adaptive Fractional Kalman Speed Prediction

Table 3

Comparison of new solution and published optimal solution for B-n31-k5.

Route	Published optimal solution			New solution
	Travelling sequence	Distance	Capacity	Travelling sequence	Distance	Capacity
1	30 ⟶ 23 ⟶ 8 ⟶ 12 ⟶ 28 ⟶ 26	109.6811	97	7 ⟶ 30 ⟶ 5 ⟶ 25 ⟶ 18 ⟶ 16 ⟶ 21	119.2372893	97
2	21 ⟶ 16 ⟶ 18 ⟶ 25 ⟶ 5 ⟶ 4 ⟶ 29	112.9915	86	12 ⟶ 24 ⟶ 19 ⟶ 1 ⟶ 3 ⟶ 6 ⟶ 9	102.3659802	99
3	7 ⟶ 17 ⟶ 13 ⟶ 6 ⟶ 9 ⟶ 22	110.8287	96	20 ⟶ 27 ⟶ 10 ⟶ 2 ⟶ 14 ⟶ 15 ⟶ 11 ⟶ 28 ⟶ 8	240.5088518	95
4	20 ⟶ 27 ⟶ 10 ⟶ 2	183.5752	38	4 ⟶ 29 ⟶ 22 ⟶ 13 ⟶ 17 ⟶ 23	108.7156422	99
5	14 ⟶ 15 ⟶ 11 ⟶ 24 ⟶ 19 ⟶ 1 ⟶ 3	155.4298	95	26	98.06120538	22
Total		672.506	412		668.889	412