Final answer:
The optimization model is designed to recommend park locations that minimize the total demand-weighted distance for all residents. It sets binary variables to indicate the closest park to each location and includes constraints for assigning people to parks and limiting the number of new parks.
Step-by-step explanation:
To address the first optimization model for recommending locations for new parks in Asheville, NC to minimize the total demand-weighted distance all people will need to travel to their nearest park, we can consider the following formulation based on sets and parameters:
Sets
-
- № - set of possible park locations.
-
- ℘ - set of people locations.
-
- №existing - subset of existing parks within the city (№existing ⊂ №).
-
- №candidate - subset of candidate locations for new parks (№candidate ⊂ №).
Parameters
-
- dij - distance between location i and park j.
-
- pi - number of people living in location i.
Model Formulation
Minimize ∑i ∈ ℘ ∑j ∈ № (pi × dij × xij), where xij is a binary variable indicating if location i is closest to park j.
Formulation Description
The objective function is designed to minimize total demand-weighted distances to parks. Every person-location has an associated closest park-location. The binary variable xij ensures that each person is only counted once for their closest park. Constraints include ensuring that each person is assigned to one park, and that parks selected from candidate locations do not exceed the number of new parks to be established.