Cumulative vehicle routing problem: A column generation approach

dc.contributor.author	Gaur, D.R.
dc.contributor.author	Singh, R.R.
dc.date.accessioned	2022-09-18T07:48:37Z
dc.date.available	2022-09-18T07:48:37Z
dc.date.issued	2022-09-18
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/4010
dc.description.abstract	Cumulative vehicle routing problems are a simplified model of fuel consumption in vehicle routing problems. Here we study computationally, an approach for constructing approximate solutions to cumulative vehicle routing problems based on rounding solutions to a linear program. The linear program is based on the set cover formulation, and is solved using column generation. The pricing sub-problem is solved using dynamic programming. Simulation results show that the simple scalable strategy computes solutions with cost close to the lower bound given by the linear programming relaxation.	en_US
dc.language.iso	en_US	en_US
dc.subject	Column generation	en_US
dc.subject	Linear programming	en_US
dc.subject	Routing	en_US
dc.subject	Transportation	en_US
dc.subject	Traveling salesman	en_US
dc.title	Cumulative vehicle routing problem: A column generation approach	en_US
dc.type	Article	en_US