Redistricting practitioners must balance many competing constraints and criteria when drawing district boundaries. To aid in this process, researchers have developed many methods for optimizing districting plans according to one or more criteria. This research note extends a recently-proposed single-criterion optimization method, short bursts (Cannon et al., 2023), to handle the multi-criterion case, and in doing so approximate the Pareto frontier for any set of constraints. We study the empirical performance of the method in a realistic setting and find it behaves as expected and is not very sensitive to algorithmic parameters. The proposed approach, which is implemented in open-source software, should allow researchers and practitioners to better understand the tradeoffs inherent to the redistricting process.

翻译：选区重划实践者在划定选区边界时，必须平衡众多相互制约的约束条件与标准。为辅助这一过程，研究者已开发出多种根据单一或多项标准优化选区划分方案的方法。本研究简报将近期提出的单标准优化方法——短脉冲法（Cannon等人，2023）——拓展至多标准场景，从而实现对任意约束集下帕累托前沿的近似求解。我们在现实情境中检验该方法的实证表现，发现其行为符合预期且对算法参数不敏感。这一通过开源软件实现的新方法，将有助于研究者与实践者更深入地理解选区重划过程中固有的权衡关系。