Optimal Predictive Algorithm for the Pickup and Delivery Problem with Time Windows and Scheduled Lines: Innovative Routing Transport Systems
| dc.contributor.author | Nahayo, Fulgence | |
| dc.contributor.author | Bigirimana , M. | |
| dc.date.accessioned | 2025-01-08T18:07:33Z | |
| dc.date.available | 2025-01-08T18:07:33Z | |
| dc.date.issued | 2020 | |
| dc.description | Article | |
| dc.description.abstract | This paper concerns the Pickup and Delivery Problem with Time Windows and Scheduled Lines "PDPTW-SL" by modeling it mathematically on the one hand with the help of dynamic programming, on the other hand, it presents two optimal predictive methods of combinatorial optimization intended to solve it and which must provide stable and high accuracy solutions. The Pickup and Delivery Problem with Time Windows and Scheduled lines aims at routing a given set of vehicles to transport freight requests from their origins to their corresponding destinations, where the requests can use scheduled passenger transportation services during a stump of their journeys. We describe the PDPTW-SL as a mixed-integer program. Computational results on a set of small-size instances provide a clear understanding of the bene ts of preprocessing step and valid inequalities using scheduled line services as a part of freights journey. | |
| dc.identifier.uri | https://repository.ub.edu.bi/handle/123456789/1296 | |
| dc.publisher | Applied Mathematical Sciences, Vol. 14 | |
| dc.title | Optimal Predictive Algorithm for the Pickup and Delivery Problem with Time Windows and Scheduled Lines: Innovative Routing Transport Systems |