Research Article

AGV Scheduling Optimization for Medical Waste Sorting System

Table 1

Algorithm performance for small-scale instances.

InstancesCPLEXVNSComparisonHeuristicComparison
ScaleID (%) (%) (%)

140.021.4540.00.0030.001037.00.00925.00−7.50
239.06.6139.00.0030.001047.00.01525.0020.51
341.07.4341.00.0030.001042.00.00525.002.44
441.010.8941.00.0020.001041.00.01325.000.00
540.010.9240.00.0030.001040.00.02325.000.00
Avg.40.211.4640.20.0030.001041.40.01325.003.09

146.031.6246.00.0020.001552.00.01125.0013.04
247.039.9847.00.0040.001547.00.00625.000.00
341.039.6441.00.0020.001341.00.0108.330.00
444.031.4344.00.0020.001244.00.0130.000.00
542.031.4342.00.0050.001340.00.0078.33−4.76
Avg.44.034.8244.00.0030.0013.644.80.00913.331.66

147.0132.3247.00.0030.001647.00.02614.290.00
246.041.2646.00.0060.001546.00.0077.140.00
351.0416.4351.00.0050.002051.00.01242.860.00
450.0799.3750.00.0040.001648.00.00314.29−4.00
552.099.7552.00.0060.001552.00.0087.140.00
Avg.49.2297.82649.20.0050.0016.448.80.01117.14−0.80

161.0>720061.00.0030.001859.00.00612.50−3.28
257.0>720057.00.0030.003058.00.00787.501.75
354.0>720054.00.0060.001654.00.0100.000.00
458.0>720058.00.0060.002662.00.01062.506.90
562.0>720062.00.0060.002162.00.00731.250.00
Avg.58.4>720058.40.0050.0022.259.00.00838.751.07

Notes. (1) denotes the optimal solution obtained by CPLEX. For the instance scale , denotes the feasible solution obtained by CPLEX in 7200 seconds. denote the feasible solution obtained by VNS algorithm and heuristic algorithm, respectively. (2) represents the number of AGVs required when the heuristic algorithm obtains a feasible solution. are the computation time of CPLEX, VNS algorithm, and heuristic algorithm in seconds, respectively. (3) , , .