Approximation algorithms for cumulative VRP with stochastic demands

dc.contributor.author	Gaur, D.R.
dc.contributor.author	Mudgal, A.
dc.contributor.author	Singh, R.R.
dc.date.accessioned	2022-09-19T17:44:53Z
dc.date.available	2022-09-19T17:44:53Z
dc.date.issued	2022-09-19
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/4018
dc.description.abstract	In this paper we give randomized approximation algorithms for stochastic cumulative VRPs for split and unsplit deliveries. The approximation ratios are 2(1 + α) and 7 respectively, where α is the approximation ratio for the metric TSP. The approximation factor is further reduced for trees and paths. These results extend the results in [Technical note - approximation algorithms for VRP with stochastic demands. Operations Research, 2012] and [Routing vehicles to minimize fuel consumption. Operations Research Letters, 2013].	en_US
dc.language.iso	en_US	en_US
dc.subject	Approximation algorithms	en_US
dc.subject	Cumulative VRps	en_US
dc.subject	Stochastic demand	en_US
dc.title	Approximation algorithms for cumulative VRP with stochastic demands	en_US
dc.type	Article	en_US