Tytuł pozycji:
Forecast duration of requests with time constraints in the dynamic vehicle routing problem
This paper presents a simple algorithm used to forecast realization time of requests. It takes into account priorities of requests and maximum efficiency of deliveries with limited resources. The method is based on predicting future states based on hypothetical requests in some fixed time horizon. The efficiency of the algorithm has been verified by two simulations.
Opracowanie ze środków MNiSW w ramach umowy 812/P-DUN/2016 na działalność upowszechniającą naukę (zadania 2017).