252. The Planar p-Median Problem with Uniform Demand Density Over an Area
Invited abstract in session MB-48: Advances in Location Analysis, stream Locational Analysis.
Monday, 10:30-12:00Room: Parkinson B09
Authors (first author is the speaker)
| 1. | Pawel Kalczynski
|
| Information Systems Decision Sciences, California State University, Fullerton | |
| 2. | Jack Brimberg
|
| Mathematics and Computer Science, Royal Military College of Canada | |
| 3. | Taly Drezner
|
| Department of Physical Sciences, College of Southern Nevada | |
| 4. | Zvi Drezner
|
| California State University, Fullerton |
Abstract
Most location papers assume that demand is generated at points, which is convenient for designing models and solution methods. In many real applications, however, demand is generated in an area. We designed explicit expressions to calculate the exact value of the objective function and the average distance between all the points in the area to their closest facility when locating multiple facilities inside a convex polygon. Based on these formulations, heuristic procedures for finding the best locations of facilities are developed and tested with good results.
Keywords
- Location
- Continuous Optimization
- Optimization Modeling
Status: accepted
Back to the list of papers