Loading...
Please wait, while we are loading the content...
Similar Documents
A restricted dynamic programming algorithm for the dial-a-ride problem
| Content Provider | Semantic Scholar |
|---|---|
| Author | Ritzinger, Ulrike Puchinger, Jakob Hartl, Richard F. |
| Copyright Year | 2011 |
| Abstract | In this paper, a restricted dynamic programming algorithm for the static multiple vehicle dial-a-ride 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://608649f4-a-bc054126-s-sites.googlegroups.com/a/jakobpuchinger.com/jakob-puchinger/files/mic2011.pdf?attachauth=ANoY7creORDRBsQQTVhdhkiQA79xkwPViovKe-hZ4DahGRfhjka4G4uoDZK5xNWZxCdsRv9fshKc7ZyMFFNuInZRG8lvFWzrQi2u3i7b3cvhMJCohY5Osqj8xKpL-xAhRjIHRbwQJkwLOAS_EmolZOCUYlM-kD8OUASBSMcQZuVlhSe4mcFavYzHhIyaDZ4q2Iu_VpiuXa_i0PveTdbod5OffnlXLmAQgYPQjjTvdq6gsQrI3n2-iHA%3D&attredirects=1&d=1 |
| Alternate Webpage(s) | https://hal.archives-ouvertes.fr/hal-01317142/file/mic2011.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |