An Exact Algorithm for the Period Routing Problem

Authors:
Roberto Baldacci;Enrico Bartolini;Aristide Mingozzi;Andrea Valletta
Affiliations:
Department of Electronics, Computer Science, and Systems (DEIS), University of Bologna, 47521 Cesena, Italy;Department of Computer Science, University of Bologna, 40127 Bologna, Italy;Department of Mathematics, University of Bologna, 47521 Cesena, Italy;NEMSYS, Network Models and System Optimization, 47521 Cesena, Italy
Venue:
Operations Research
Year:
2011

Citing 10
Cited 5

Computerized vehicle routing in the soft drink industry

Operations Research
The Two-Period Travelling Salesman Problem Appliedto Milk Collection in Ireland

Computational Optimization and Applications
Optimizing Periodic Maintenance Operations for Schindler Elevator Corporation

Interfaces
A new branch-and-cut algorithm for the capacitated vehicle routing problem

Mathematical Programming: Series A and B
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem

Mathematical Programming: Series A and B
The Period Vehicle Routing Problem with Service Choice

Transportation Science
The Missouri Lottery Optimizes Its Scheduling and Routing to Improve Efficiency and Balance

Interfaces
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation

Operations Research
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts

Mathematical Programming: Series A and B
A unified exact method for solving different classes of vehicle routing problems

Mathematical Programming: Series A and B

The skill vehicle routing problem

INOC'11 Proceedings of the 5th international conference on Network optimization
A parallel iterated tabu search heuristic for vehicle routing problems

Computers and Operations Research
A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems

Operations Research
A set-covering based heuristic algorithm for the periodic vehicle routing problem

Discrete Applied Mathematics
A sequential GRASP for the therapist routing and scheduling problem

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.