A Heuristic for Solving a Large-Scale Static Multi Depot Dial-a-Ride Problem with Time Varying Travel Times

@inproceedings{Kim2012AHF,
  title={A Heuristic for Solving a Large-Scale Static Multi Depot Dial-a-Ride Problem with Time Varying Travel Times},
  author={Taehyeong Kim and Ali Haghani},
  year={2012}
}
This paper studies a static dial-a-ride problem with time varying travel times, soft time windows and multiple depots. In this paper, a heuristic based on clustering first-routing second proposed by Kim and Haghani (2011) is applied to a real-world large dial-a-ride problem. For the case study, Maryland Transit Administration (MTA)’s real operation of Dial-a-ride service is introduced and compared with the results of developed heuristic. The whole problem is decomposed into 5 time slots problem… CONTINUE READING