投票站的优化整合

Adam P. Schmidt, Duncan Buell, Laura A. Albert
{"title":"投票站的优化整合","authors":"Adam P. Schmidt, Duncan Buell, Laura A. Albert","doi":"10.1287/msom.2022.0497","DOIUrl":null,"url":null,"abstract":"Problem definition: Many logistical and financial challenges of facilitating an election lead election officials to consolidate polling locations. However, determining when it is appropriate to consolidate polling locations and how to consolidate polling locations, if necessary, is a difficult and high-stakes decision that influences voter participation. Methodology/results: We formalize the set of constraints and criteria that election officials should follow as the polling location consolidation problem (PLCP), which is formulated as an integer programming model. The PLCP simultaneously selects which polling locations will be used in the upcoming election, reassigns voter precincts to polling locations, and allocates critical resources to the selected polling locations. The PLCP minimizes the increased distance that voters must travel to their updated polling location. Because empirical research also demonstrates the importance of reducing the voters’ wait times, we require that most voters do not wait longer than a prespecified limit, such as 30 minutes, using a chance constraint. We prove that identifying a feasible solution to PLCP is NP-complete, which demonstrates the difficulty in making consolidation decisions, as well as the importance of optimization for this problem. Managerial implications: This paper introduces a structured and transparent approach to support election officials in making informed, data-driven decisions regarding how and when to consolidate polling locations that minimally impact voters and encourage voter participation. The approach could be used to develop preapproved contingency plans that could be employed if there are major disruptions to an election.Supplemental Material: The online supplement is available at https://doi.org/10.1287/msom.2022.0497 .","PeriodicalId":501267,"journal":{"name":"Manufacturing & Service Operations Management","volume":"21 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Optimal Consolidation of Polling Locations\",\"authors\":\"Adam P. Schmidt, Duncan Buell, Laura A. Albert\",\"doi\":\"10.1287/msom.2022.0497\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Problem definition: Many logistical and financial challenges of facilitating an election lead election officials to consolidate polling locations. However, determining when it is appropriate to consolidate polling locations and how to consolidate polling locations, if necessary, is a difficult and high-stakes decision that influences voter participation. Methodology/results: We formalize the set of constraints and criteria that election officials should follow as the polling location consolidation problem (PLCP), which is formulated as an integer programming model. The PLCP simultaneously selects which polling locations will be used in the upcoming election, reassigns voter precincts to polling locations, and allocates critical resources to the selected polling locations. The PLCP minimizes the increased distance that voters must travel to their updated polling location. Because empirical research also demonstrates the importance of reducing the voters’ wait times, we require that most voters do not wait longer than a prespecified limit, such as 30 minutes, using a chance constraint. We prove that identifying a feasible solution to PLCP is NP-complete, which demonstrates the difficulty in making consolidation decisions, as well as the importance of optimization for this problem. Managerial implications: This paper introduces a structured and transparent approach to support election officials in making informed, data-driven decisions regarding how and when to consolidate polling locations that minimally impact voters and encourage voter participation. The approach could be used to develop preapproved contingency plans that could be employed if there are major disruptions to an election.Supplemental Material: The online supplement is available at https://doi.org/10.1287/msom.2022.0497 .\",\"PeriodicalId\":501267,\"journal\":{\"name\":\"Manufacturing & Service Operations Management\",\"volume\":\"21 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-03-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Manufacturing & Service Operations Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1287/msom.2022.0497\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Manufacturing & Service Operations Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1287/msom.2022.0497","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

问题定义:促进选举所面临的许多后勤和财务挑战导致选举官员合并投票站。然而,确定何时适合合并投票站,以及必要时如何合并投票站,是一项影响选民参与度的困难且利害攸关的决策。方法/结果:我们将选举官员应遵循的一系列约束条件和标准正式表述为投票站合并问题(PLCP),并将其表述为整数编程模型。PLCP 同时选择在即将到来的选举中使用哪些投票站,将选民选区重新分配到投票站,并将关键资源分配到选定的投票站。PLCP 可最大限度地减少选民前往其最新投票地点所增加的路程。由于实证研究也证明了减少选民等待时间的重要性,因此我们利用机会约束条件要求大多数选民的等待时间不超过预先规定的限制,如 30 分钟。我们证明,确定 PLCP 的可行解是 NP-完备的,这表明了做出合并决策的难度,以及优化对这一问题的重要性。管理意义:本文介绍了一种结构化、透明的方法,以支持选举官员就如何以及何时合并投票站做出知情的、数据驱动的决策,从而最大限度地减少对选民的影响并鼓励选民参与。该方法可用于制定预先批准的应急计划,以便在选举出现重大干扰时使用:在线补编可在 https://doi.org/10.1287/msom.2022.0497 上查阅。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Optimal Consolidation of Polling Locations
Problem definition: Many logistical and financial challenges of facilitating an election lead election officials to consolidate polling locations. However, determining when it is appropriate to consolidate polling locations and how to consolidate polling locations, if necessary, is a difficult and high-stakes decision that influences voter participation. Methodology/results: We formalize the set of constraints and criteria that election officials should follow as the polling location consolidation problem (PLCP), which is formulated as an integer programming model. The PLCP simultaneously selects which polling locations will be used in the upcoming election, reassigns voter precincts to polling locations, and allocates critical resources to the selected polling locations. The PLCP minimizes the increased distance that voters must travel to their updated polling location. Because empirical research also demonstrates the importance of reducing the voters’ wait times, we require that most voters do not wait longer than a prespecified limit, such as 30 minutes, using a chance constraint. We prove that identifying a feasible solution to PLCP is NP-complete, which demonstrates the difficulty in making consolidation decisions, as well as the importance of optimization for this problem. Managerial implications: This paper introduces a structured and transparent approach to support election officials in making informed, data-driven decisions regarding how and when to consolidate polling locations that minimally impact voters and encourage voter participation. The approach could be used to develop preapproved contingency plans that could be employed if there are major disruptions to an election.Supplemental Material: The online supplement is available at https://doi.org/10.1287/msom.2022.0497 .
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Competition in Optimal Stopping: Behavioral Insights Information Dependency in Mitigating Disruption Cascades Adaptive Two-Stage Stochastic Programming with an Analysis on Capacity Expansion Planning Problem Demand Equilibria in Spatial Service Systems Optimal Salesforce Compensation with General Demand and Operational Considerations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1