Route Design for Delivery of Voting Machines in Hamilton County, Ohio

被引:4
作者
Fry, Michael J. [1 ]
Ohlmann, Jeffrey W. [2 ]
机构
[1] Univ Cincinnati, Dept Quantitat Anal & Operat Management, Cincinnati, OH 45221 USA
[2] Univ Iowa, Dept Management Sci, Iowa City, IA 52242 USA
关键词
transportation: vehicle routing; government: elections;
D O I
10.1287/inte.1090.0430
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:443 / 459
页数:17
相关论文
共 15 条
[1]  
ANDREWS C, 2004, CINCINNATI ENQU 0726
[2]  
[Anonymous], 2002, The vehicle routing problem pp
[3]   Vehicle routing problem with time windows, part 1:: Route construction and local search algorithms [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :104-118
[4]   Vehicle routing problem with time windows, part II:: Metaheuristics [J].
Bräysy, I ;
Gendreau, M .
TRANSPORTATION SCIENCE, 2005, 39 (01) :119-139
[5]   Incentive schemes for attended home delivery services [J].
Campbell, Ann Melissa ;
Savelsbergh, Martin .
TRANSPORTATION SCIENCE, 2006, 40 (03) :327-341
[6]  
Cordeau JF, 2002, J OPER RES SOC, V53, P512, DOI 10.1057/palgrave.jors.2601319
[7]  
Election Data Services, 2006, 2006 VOT EQ STUD
[8]  
HULL V, 2006, HERALDTRIBUNE C 1119
[9]   COMPLEXITY OF VEHICLE-ROUTING AND SCHEDULING PROBLEMS [J].
LENSTRA, JK ;
KAN, AHGR .
NETWORKS, 1981, 11 (02) :221-227
[10]  
Montgomery D.C., 2001, DESIGN ANAL EXPT