Probabilistic time-dependent vehicle routing problem
- 178 Downloads
The probabilistic time-dependent vehicle routing problem is presented in this paper. It is a novel variant of the vehicle routing problem. The variant is a problem of finding optimal routes for a fleet of vehicles visiting customers in order to proceed delivery or pick-up. All customers must be visited in designated times with given probabilities and services must begin within the given time windows. Each vehicle has a given capacity, which must not be exceeded. The travel time between each two locations is dependent on a vehicle departure time. The paper also contains examples and solution results of testing data sets using the adaptive large neighbourhood search algorithm.
KeywordsVehicle routing Probabilistic time-dependent vehicle routing problem Probability of arrival
- Golasowski M, Tomis R, Martinovič J, Slaninová K, Rapant L (2016) Performance evaluation of probabilistic time-dependent travel time computation. In: Proceedings of the 15th international conference on computer information systems and industrial management, CISIM 2016Google Scholar
- Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications, 2nd ed. MOS-SIAM series on optimization, SIAM. https://books.google.cz/books?id=AoTTBQAAQBAJ