Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
10347560 | Computers & Operations Research | 2013 | 11 Pages |
Abstract
This paper presents a new local search for solving the continuous p-median problem in the plane. The basic idea is to first find a good starting solution by overlaying the area containing the set of demand points with a grid and solving heuristically the location problem on this grid. The solution is then used as an initial point for running an improved version of Cooper's well-known alternating local search.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Jack Brimberg, Zvi Drezner,