Cumulative VRP: A Simplified Model of Green Vehicle Routing

Rishi Ranjan Singh () and Daya Ram Gaur ()
Additional contact information
Rishi Ranjan Singh: Indian Institute of Technology Bhilai
Daya Ram Gaur: University of Lethbridge

A chapter in Sustainable Logistics and Transportation, 2017, pp 39-55 from Springer

Abstract: Abstract There has been a recent resurge of interest in vehicle routing problems, especially in the context of green vehicle routing. One popular and simplified model is that of the cumulative vehicle routing problem. In this chapter, we examine the motivation, the definition, and the mixed integer linear program for the cumulative VRP. We review some of the recent results on approximation algorithms for the cumulative VRP. A column generation-based procedure for solving the cumulative VRP is also described. We also review approximation algorithms for a stochastic version of the cumulative VRP.

Keywords: Vehicle Routing Problem (VRPs); Mixed Integer Linear Programming (MILP); Capacitated VRPs; VRPs With Stochastic Demands; Subtour (search for similar items in EconPapers)
Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-319-69215-9_3

Ordering information: This item can be ordered from
http://www.springer.com/9783319692159

DOI: 10.1007/978-3-319-69215-9_3

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().