Papers › The Integrated Vehicle and Pollster Routing Problem
The Integrated Vehicle and Pollster Routing Problem
Sandra Gutiérrez, Andrés Miniguano-Trujillo, Diego Recalde, Luis M. Torres, Ramiro Torres
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The National Statistics Bureau of Ecuador conducts monthly price surveys to monitor the evolution of the Consumer Price Index, a metric that measures the 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. Additionally, pollsters move between stores using walking paths or vehicles to reduce 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. A three-phase algorithm is proposed, and computational experience with real-world instances is presented.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections