A Heuristic for the Periodic Vehicle Routing Problem

M. Gaudioso and G. Paletta
Additional contact information
M. Gaudioso: Dipartimento di Sistemi, Universitá della Calabria, Italy
G. Paletta: Dipartimento di Informatica ed Applicazioni, Universitá di Salerno, Italy

Transportation Science, 1992, vol. 26, issue 2, 86-92

Abstract: The paper describes a model for the optimal management of periodic deliveries of a given commodity. The goal is to schedule the deliveries according to feasible combinations of delivery days and to determine the scheduling and routing policies of the vehicles in order to minimize over the planning horizon the maximum number of vehicles simultaneously employed, i.e., the fleet size. Heuristic algorithms are proposed and computational experience is reported.

Date: 1992
References: Add references at CitEc
Citations: View citations in EconPapers (31)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.26.2.86 (application/pdf)

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:inm:ortrsc:v:26:y:1992:i:2:p:86-92

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().