D. L. Huerta Muñoz, C. Archetti, E. Fernández

This study focuses on PVRPs (Periodic Vehicle Routing Problems) as a means of analyzing alternative policies concerning the customer service frequency criterion and the effect they can have on the final solutions. We study the properties of the problem and their relationship to the IRP (Inventory Routing Problem) and propose different alternatives to model the policies studied. Furthermore, we study the separation problem for exponential size constraints. Finally, computational results are analyzed and shown.

Keywords: PVRP, IRP, Service Frequency, Vehicle Routing


F2 Routing 2
October 2, 2015  11:30 AM
Salón de actos

Other papers in the same session

The 2-Depot Vehicle and Driver Routing Problem

B. Domínguez Martín, I. Rodríguez Martín, J. J. Salazar Gonzalez

The Cyclic Rank Aggregation Problem

M. Landete Ruiz, J. Alcaraz, E. M. García, J. F. Monge, J. Puerto Albandoz

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.