A new heuristic for solving the p-median problem in the plane

Authors:
Jack Brimberg;Zvi Drezner
Affiliations:
The Royal Military College of Canada, Kingston, ON, Canada;Steven G. Mihaylo College of Business and Economics, California State University-Fullerton, Fullerton, CA 92834, United States
Venue:
Computers and Operations Research
Year:
2013

Citing 8
Cited 1

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
Spatial tessellations: concepts and applications of Voronoi diagrams

Spatial tessellations: concepts and applications of Voronoi diagrams
Asymptotic behavior of the Weber location problem on the plane

Annals of Operations Research - Special issue on locational decisions
A projection method for lp norm location-allocation problems

Mathematical Programming: Series A and B
Tabu Search

Tabu Search
Improvement and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem

Operations Research
Genetic K-means algorithm

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Heuristic solution of the multisource Weber problem as a p-median problem

Operations Research Letters

Applied p-median and p-center algorithms for facility location problems

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

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.