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）扩展至多标准情形，从而逼近任意约束集下的帕累托前沿。我们在现实场景中对该方法的实证表现进行研究，发现其行为符合预期且对算法参数不敏感。该方案已通过开源软件实现，将有助于研究者与实践者更深入理解选区划分过程中固有的权衡关系。