no code implementations • 2 May 2016 • Fábio Cruz, Anand Subramanian, Bruno P. Bruck, Manuel Iori
This paper deals with a particular case of the SBRP, in which only a single vehicle is available and the objective is to find a least-cost route that meets the demand of all stations and does not violate the minimum (zero) and maximum (vehicle capacity) load limits along the tour.
