.png){kind=icon}
返回
Multi-stage stochastic districting: optimization models and solution algorithms
.png){kind=icon}
OA
AI
DOI：10.1007/s10479-024-06459-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper investigates a Multi-Stage Stochastic Districting Problem (MSSDP). The goal is to devise a districting plan (i.e., clusters of Territorial Units-TUs) accounting for uncertain parameters changing over a discrete multi-period planning horizon. The problem is cast as a multi-stage stochastic programming problem. It is assumed that uncertainty can be captured by a finite set of scenarios, which induces a scenario tree. Each node in the tree corresponds to the realization of all the stochastic parameters from the root node-the state of nature-up to that node. A mathematical programming model is proposed that embeds redistricting recourse decisions and other recourse actions to ensure that the districts are balanced regarding their activity. The model is tested on instances generated using literature data containing real geographical data. The results demonstrate the relevance of hedging against uncertainty in multi-period districting. Since the model is challenging to tackle using a general-purpose solver, a heuristic algorithm is proposed based on a restricted model. The computational results obtained give evidence that the approximate algorithm can produce high-quality feasible solutions within acceptable computation times.
Keyword:
Districting
Multi-stage stochastic programming
Heuristics
期刊
IF:
4.5
论文数:
8.1K
被引数:
2.1W
机构
引用论文
.png){kind=icon}
Solving a multi-objective dynamic stochastic districting and routing problem with a co-evolutionary algorithm用协同进化算法求解多目标动态随机分区和路由问题
PREAI
分享收藏Effect of Cooperative Problem-Based Lab Instruction on Metacognition and Problem-Solving Skills
PREAI
分享收藏
查看更多内容