.png){kind=icon}
.png){kind=icon}
Return
Towards a stochastic programming modeling framework for districting
.png){kind=icon}
PRE
AI
DOI：10.1007/s10479-020-03631-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper a stochastic districting problem is investigated. Demand is assumed to be represented by a random vector with a given joint probability distribution function. A two-stage mixed-integer stochastic programming model is proposed. The first stage comprises the decision about the initial territory design: the districts are defined and all the territory units assigned to one and exactly one of them. In the second stage, i.e., after demand becomes known, balancing requirements are to be met. This is ensured by means of two recourse actions: outsourcing and reassignment of territory units. The objective function accounts for the total expected cost that includes the cost for the first-stage territory design plus the expected cost incurred at the second stage by outsourcing and reassignment. The (re)assignment costs are associated with the distances between territory units, i.e., the focus is put on the compactness of the solution. The model is then extended in different ways to account for aspects of practical relevance such as a maximum desirable dispersion, reallocation constraints, or similarity of the second-stage solution w.r.t. the first-stage one. The new modeling framework proposed is tested computationally using instances built using real geographical data.
Keywords:
Stochastic Districting
Equity objective
Uncertain Demand
Stochastic Programming
Complete recourse
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
4.5
Papers:
8.0K
Citations:
2.1W
Organization
View more organizations