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

Figure 2

Two most basic low-level heuristics implemented for DARPTW. A single vehicle schedule, or route, starts/ends with a leave/arrival to depot event . Within a single route, several clients are transported (), and different pickup events () and delivery events () are performed. The heuristic (a) performs modifications at the customer-to-vehicle assignation level, while the heuristic (b) performs modifications at the pickup/delivery events ordering level.

(a) Move random customer from route

(b) Move random customer event within a route