Routing vehicles to minimize fuel consumption

Please use this identifier to cite or link to this item: http://dspace.iitrpr.ac.in:8080/xmlui/handle/123456789/224

Full metadata record

DC Field	Value	Language
dc.contributor.author	Gaur, D.R.
dc.contributor.author	Mudgal, A.
dc.contributor.author	Singh, R.R.
dc.date.accessioned	2016-08-17T05:29:08Z
dc.date.available	2016-08-17T05:29:08Z
dc.date.issued	2016-08-17
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/224
dc.description.abstract	We consider a generalization of the capacitated vehicle routing problem known as the cumulative vehicle routing problem in the literature. Cumulative VRPs are known to be a simple model for fuel consumption in VRPs. We examine four variants of the problem, and give constant factor approximation algorithms. Our results are based on a well-known heuristic of partitioning the traveling salesman tours and the use of the averaging argument.	en_US
dc.language.iso	en_US	en_US
dc.subject	Approximation algorithms	en_US
dc.subject	Fuel consumption	en_US
dc.subject	Cumulative vehicle routing problem	en_US
dc.title	Routing vehicles to minimize fuel consumption	en_US
dc.type	Article	en_US
Appears in Collections:	Year-2013

Files in This Item:

File	Description	Size	Format
1-s2.0-S0167637713001004-main.pdf		370.18 kB	Adobe PDF	View/Open Request a copy

DSpace JSPUI