Developing a model for the stochastic time-dependent vehicle-routingproblem

Vehicle-routing problems (VRP) have been studied in depth. Many variants ofthe problem exist, most of them trying to find a set of routes with theshortest distance possible for a fleet of vehicles. This paper combines twoimportant variants, the stochastic VRP and the time-dependent VRP, to form anddefine the Stochastic Time-Dependent VRP. An efficient heuristic that is a newvariant of the well-known saving algorithm is introduced. The algorithmincorporates simulation that enables an estimate of each route’s probability ofbeing the quickest. This new algorithm yields fast results that are 10% higherthan optimal solutions. Such results are similar to the performance of thesaving algorithm when compared to the capacitated VRP. © 2009 IEEE.

https://doi.org/10.1109/iccie.2009.5223595

Cite as:

@inproceedings{Nahum_2009,
	doi = {10.1109/iccie.2009.5223595},
	url = {https://doi.org/10.1109%2Ficcie.2009.5223595},
	year = 2009,
	month = {jul},
	publisher = {{IEEE}},
	author = {Oren E. Nahum and Yuval Hadas},
	title = {Developing a model for the stochastic time-dependent vehicle-routing problem},
	booktitle = {2009 International Conference on Computers {&}amp$mathsemicolon$ Industrial Engineering}
}