An Exact Algorithm for the Period Routing Problem

Roberto Baldacci (), Enrico Bartolini (), Aristide Mingozzi () and Andrea Valletta ()
Additional contact information
Roberto Baldacci: Department of Electronics, Computer Science, and Systems (DEIS), University of Bologna, 47521 Cesena, Italy
Enrico Bartolini: Department of Computer Science, University of Bologna, 40127 Bologna, Italy
Aristide Mingozzi: Department of Mathematics, University of Bologna, 47521 Cesena, Italy
Andrea Valletta: NEMSYS, Network Models and System Optimization, 47521 Cesena, Italy

Operations Research, 2011, vol. 59, issue 1, 228-241

Abstract: This paper presents an exact algorithm for solving strategic and tactical multiperiod vehicle routing problems that can be modeled as period vehicle routing problems (PVRPs). The PVRP is defined on a time horizon of several days and consists of assigning appropriate combinations of delivery to customers and designing a set of delivery routes for every day of the planning period. The objective is to service all customers assigned to each day minimizing the overall routing cost. This paper describes an integer programming formulation of the PVRP that is used to derive different lower bounds and an exact solution method. Computational results on test instances from the literature and on new sets of test instances show the effectiveness of the proposed method.

Keywords: period vehicle routing; set partitioning; dual ascent; dynamic programming (search for similar items in EconPapers)
Date: 2011
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (15)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.1100.0875 (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:oropre:v:59:y:2011:i:1:p:228-241

Access Statistics for this article

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