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

Table 2

Calculation result of different instances when the demand probability is 1.

Instance	A-n32-k5	A-n39-k6	B-n31-k5	P-n16-k8	P-n19-k2
N	32	39	31	16	19
K	5	6	5	8	2
Optimal solution (m)	784.612	831.2696	662.3275	451.9471	212.6569
Average iteration number	427	648	329	193	308
Average CPU computing time (s)	18.9688	27.1563	6.8125	3.2969	6.7188
Published optimal solution (m)	784	831	672	450	212
Improvement ratio (%)	0	0	1.43936	0	0