| Article ID: | iaor20125446 |
| Volume: | 40 |
| Issue: | 1 |
| Start Page Number: | 427 |
| End Page Number: | 437 |
| Publication Date: | Jan 2013 |
| Journal: | Computers and Operations Research |
| Authors: | Drezner Zvi, Brimberg Jack |
| Keywords: | combinatorial optimization, heuristics, heuristics: local search |
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.