Mathematical Problems in Engineering / 2015 / Article / Tab 5 / Research Article
A Hyperheuristic for the Dial-a-Ride Problem with Time Windows Table 5 Results for DARPTW obtained by using the
cluster-first ,
route-second Genetic Algorithm (GA) described in [
2 ] and a GA with preprocessing techniques described in [
5 ].
GA (Jorgensen et al. [2 ]) GA (Cubillos et al. [5 ]) Route duration Ride time CPU time Route duration Ride time CPU time Avg. Best Avg. Best min Avg. Best Avg. Best min pr01 1041.00 1039.00 477.00 310.00 5.57 1012.32 955.25 546.56 524.59 1.36 pr02 1969.00 1994.00 1367.00 1330.00 11.43 1836.05 1839.06 889.05 838.41 4.08 pr03 2779.00 2781.00 3081.00 2894.00 21.58 2810.59 2787.18 1634.10 1597.95 7.96 pr05 4250.00 4274.00 5099.00 4837.00 58.23 4118.03 4068.05 3007.97 2935.48 18.43 pr11 907.00 928.00 630.00 549.00 5.46 908.09 902.18 454.40 449.91 1.58 pr12 1719.00 1710.00 1214.00 1300.00 11.72 1503.71 1503.34 766.21 744.93 4.49 pr15 4296.00 4336.00 4615.00 4720.00 58.93 4118.34 4057.08 3160.79 3152.67 22.09 pr16 5309.00 5227.00 6134.00 6397.00 81.23 4655.77 4658.35 2377.45 2348.48 17.48 pr17 1299.00 1316.00 990.00 784.00 8.29 1227.46 1223.68 612.40 612.40 3.13 pr19 3679.00 3676.00 5362.00 5358.00 44.66 3441.71 3427.06 2597.10 2515.53 25.42