HYBRID GENETIC ALGORITHM TO APPROACH THE DARP IN A DEMAND RESPONSIVE PASSENGER SERVICE

Abstract In this work, we address a Demand Responsive Transport System capable of managing incoming transport demand using a solution architecture based on a two- stage algorithm to solve a Dial-a-Ride Problem instance. In the first stage, a constructive heuristic algorithm quickly provides a feasible solution to accept the incoming demand. The algorithm in the second stage is a specialized Hybrid Genetic Algorithm that attempts to improve the solution evaluated at the first stage by using the time between two consecutive transportation events.

[1]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[2]  J. Wesley Barnes,et al.  Solving the Pickup and Delivery Problem with Time Windows Using Reactive Tabu Search Transportation , 2000 .

[3]  Keiichi Uchimura,et al.  The dial‐a‐ride problem in a public transit system , 1999 .

[4]  G. Laporte,et al.  Transportation Demand , 2019, Energy: Supply and Demand.

[5]  Martin W. P. Savelsbergh,et al.  The General Pickup and Delivery Problem , 1995, Transp. Sci..

[6]  Jane Yung-jen Hsu,et al.  Dynamic vehicle routing using hybrid genetic algorithms , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).