A Hyperheuristic for the Dial-a-Ride Problem with Time Windows

Figure 3

Performance comparison of different heuristic methods for DARPTW, which includes the hyperheuristic implementation with greedy and random permutation descent heuristic selection, a Simulated Annealing (SA, Mauri and Lorena) in [6], a multiagent system with a SA embedded (MOSA, Zidi et al.) in [7], a Genetic Algorithm (GA, Jorgensen et al.) in [2], and another GA (Cubillos et al.) in [5]. The uppermost figures compare the route duration factor, which is focused on the transport system optimization. The middle figures compare the ride time factor, which is focused on the quality of service optimization. The leftmost figures compare the best value obtained, and the rightmost figures compare the average value obtained (not available in all cases). The bottom figure compares the CPU time.

(a) Comparison of route duration (best result)

(b) Comparison of route duration (average result)

(c) Comparison of ride time (best result)

(d) Comparison of ride time (average result)

(e) Comparison of CPU time (best time)