The vehicle routing problem
Designing And Managing The Supply Chain
Designing And Managing The Supply Chain
Design and Analysis of Experiments
Design and Analysis of Experiments
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows
INFORMS Journal on Computing
Incentive Schemes for Attended Home Delivery Services
Transportation Science
Vehicle Routing Problem with Time Windows, Part II: Metaheuristics
Transportation Science
| Hi-index | 0.00 |
The Help America Vote Act that Congress passed in 2002 required election boards to update their punch card voting systems with new voting technologies by 2006. This change greatly increases the operational and logistical complexities of administering elections in many areas. Because of security concerns and the large physical size of some types of new voting machines, they must be delivered to each polling location during a specified day and time window. Therefore, to generate feasible, cost-effective delivery routes, election boards must solve a difficult vehicle-routing problem. Routes designed by our solution methods have been successfully implemented in Hamilton County, Ohio, to deliver voting machines to polling locations for multiple elections since May 2006. We describe our solution methods and analyze the sensitivity of route costs to time-window and delivery-day constraints. Our sensitivity analysis identified cost-savings strategies that the Hamilton County Board of Elections used to negotiate a new scheduling protocol with poll workers; this protocol reflects a compromise between accommodating poll workers' schedules and reducing the cost of delivering the voting machines. The Board of Elections successfully implemented this new method of specifying delivery time windows, which allowed greater routing flexibility, for the November 2006 midterm election.