Data · dataset · 2007
A Study on the Facility Location Problem with Different Distance of Satisfaction Level
Listed in Harvard Dataverse
Facility location problems treat either min-max or max-min criterion.
Description
But most residents in urban areas hope that even the city office should not be so near and not so far. So we propose the model considering the satisfaction degree with respect to the distance from the facility for each customer (residents).
For each demand point, satisfaction degree with respect to the distance to the facility is defined and this satisfaction degree is denoted by the membership function of the distance to the facility. The objective is to find the site of the facility maximizing minimal satisfaction degree among all demand points. The case of emergency and incinerator are studied.
Read the rest (1 more)
We propose an efficient algorithm to find the optimal site of the facility.
Links
Where it is published
- Dataverse dataset page dataverse.harvard.edu/dataset.xhtml?persistentId=doi%3A10.6141%2FTW-SRDA-E93026-1 ↗
landing page · from Harvard Dataverse
- DOI doi.org/10.6141/tw-srda-e93026-1 ↗
DOI / persistent id · from Harvard Dataverse
Catalogue records · 1
- Dataverse API dataverse.harvard.edu/api/datasets/:persistentId/?persistentId=doi%3A10.6141%2FTW-SR… ↗
metadata API · from Harvard Dataverse
Provenance · 1 source records, 5 field assertions
| Source | Key | Last seen | Raw |
|---|---|---|---|
| Harvard Dataverse | doi:10.6141/TW-SRDA-E93026-1 | 11 d ago | JSON v1 |
| Field | Assertion | Extractor | Evidence |
|---|---|---|---|
| created_date | source · Harvard Dataverse | connector:dataverse@1.0.0 | |
| description | source · Harvard Dataverse | connector:dataverse@1.0.0 | /description |
| publication_date | source · Harvard Dataverse | connector:dataverse@1.0.0 | |
| title | source · Harvard Dataverse | connector:dataverse@1.0.0 | /name |
| updated_date | source · Harvard Dataverse | connector:dataverse@1.0.0 |