Abstract
In this paper, a restricted dynamic programming algorithm for the static multiple vehicle dial-aride problem is presented. Passengers have to be transported between pickup and delivery locations, while minimizing travel distances, respecting time window, user ride time and route duration constraints. We report preliminary results for benchmark instances which provide promising results. Algorithmic extensions and a hybrid metaheuristic are considered as pathways for future work.
Original language | English |
---|---|
Title of host publication | MIC 2011 conference proceedings |
Number of pages | 3 |
Publication status | Published - 2011 |
Event | 9th Metaheuristic International Conference (MIC 2011) - Duration: 25 Jul 2011 → 28 Jul 2011 |
Conference
Conference | 9th Metaheuristic International Conference (MIC 2011) |
---|---|
Period | 25/07/11 → 28/07/11 |
Research Field
- Former Research Field - Mobility Systems