The Integrated Vehicle and Pollster Routing Problem

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Gutiérrez, Sandra, Miniguano-Trujillo, Andrés, Recalde, Diego, Torres, Luis M., Torres, Ramiro
Format: Preprint
Veröffentlicht: 2019
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866909467180793856
author Gutiérrez, Sandra
Miniguano-Trujillo, Andrés
Recalde, Diego
Torres, Luis M.
Torres, Ramiro
author_facet Gutiérrez, Sandra
Miniguano-Trujillo, Andrés
Recalde, Diego
Torres, Luis M.
Torres, Ramiro
contents The National Statistics Bureau of Ecuador carries out monthly polls to monitor the evolution of the Consumer Price Index, a metric measuring consumer prices of essential commodities. These surveys are administered across a designated set of stores, with a fleet of vehicles transporting pollsters from the bureau headquarters to the chosen locations. Moreover, pollsters move between stores using pedestrian paths or using a vehicle to shorten the travel time. This paper introduces the Integrated Vehicle and Pollster Routing Problem and presents an integer programming model to effectively schedule pollster visits to selected stores while optimizing the routing of the vehicle fleet. Results on the computational complexity, a three-phase algorithm, and computational experience based on real-world instances are provided.
format Preprint
id arxiv_https___arxiv_org_abs_1912_07356
institution arXiv
publishDate 2019
record_format arxiv
spellingShingle The Integrated Vehicle and Pollster Routing Problem
Gutiérrez, Sandra
Miniguano-Trujillo, Andrés
Recalde, Diego
Torres, Luis M.
Torres, Ramiro
Optimization and Control
Combinatorics
The National Statistics Bureau of Ecuador carries out monthly polls to monitor the evolution of the Consumer Price Index, a metric measuring consumer prices of essential commodities. These surveys are administered across a designated set of stores, with a fleet of vehicles transporting pollsters from the bureau headquarters to the chosen locations. Moreover, pollsters move between stores using pedestrian paths or using a vehicle to shorten the travel time. This paper introduces the Integrated Vehicle and Pollster Routing Problem and presents an integer programming model to effectively schedule pollster visits to selected stores while optimizing the routing of the vehicle fleet. Results on the computational complexity, a three-phase algorithm, and computational experience based on real-world instances are provided.
title The Integrated Vehicle and Pollster Routing Problem
topic Optimization and Control
Combinatorics
url https://arxiv.org/abs/1912.07356