The ridematching problem with time windows in dynamic ridesharing: A model and a genetic algorithm

The increasing ubiquity of mobile handheld devices paved the way for the dynamic ridesharing which could save travel cost and reduce the environmental pollution. The ridematching problem with time windows in dynamic ridesharing considers matching drivers and riders with similar routes (with drivers detour flexibility) and time schedules on short notice. This problem is hard to solve. In this work, we model the ridematching problem with time windows in dynamic ridesharing as an optimization problem and propose a genetic algorithm to solve it. We consider minimizing the total travel distance and time of the drivers (vehicles) and the total travel time of the riders and maximizing the number of the matches. In addition, we provide datasets for the ridematching problem, derived from a real world travel survey for northeastern Illinois, to test the proposed algorithm. Experimentation results indicate that the idea of dynamic ridesharing is feasible and the proposed algorithm is able to solve the ridematching problem with time windows in reasonable time.

[1]  Gopala Krishna Reddy Kakivaya,et al.  INTRACTABILITY OF THE DIAL-A-RIDE PROBLEM AND A MULTIOBJECTIVE SOLUTION USING SIMULATED ANNEALING , 1998 .

[2]  E. Roberts,et al.  DIAL‐A‐RIDE , 1983 .

[3]  Eric Horvitz,et al.  Collaboration and shared plans in the open world: studies of ridesharing , 2009, IJCAI 2009.

[4]  R. Sinnott.  Virtues of the Haversine , 1984 .

[5]  Susan Shaheen,et al.  Ridesharing in North America: Past, Present, and Future , 2012 .

[6]  Niels A. H. Agatz,et al.  Sustainable Passenger Transportation: Dynamic Ride-Sharing , 2010 .

[7]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[8]  Niels A. H. Agatz,et al.  The Value of Optimization in Dynamic Ride-Sharing: A Simulation Study in Metro Atlanta , 2010 .

[9]  Nigel H. M. Wilson,et al.  A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows , 1986 .

[10]  Wesam Herbawi,et al.  Comparison of multiobjective evolutionary algorithms for solving the multiobjective route planning in dynamic multi-hop ridesharing , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[11]  P Willmott,et al.  DIAL-A-RIDE , 1982 .

[12]  Michael Weber,et al.  Ant Colony vs. Genetic Multiobjective Route Planning in Dynamic Multi-hop Ridesharing , 2011, 2011 IEEE 23rd International Conference on Tools with Artificial Intelligence.

[13]  R M Jorgensen,et al.  Solving the Dial-a-Ride problem using genetic algorithms , 2007, J. Oper. Res. Soc..

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