A trajectory based heuristic for the planar \(p\)-median problem

DOI10.1016/j.cor.2023.106296OpenAlexW4380149198MaRDI QIDQ6106602

Jack Brimberg, Anita Schöbel, Zvi Drezner

Publication date: 3 July 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2023.106296

zbMATH Keywords

heuristics\(p\)-medianstarting solutionsmultiple facility location

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On Newton's method for the Fermat-Weber location problem
• Continuous multifacility ordered median location problems
• New local searches for solving the multi-source Weber problem
• A note on the Weber location problem
• Asymptotic behavior of the Weber location problem on the plane
• Localization in single facility location
• The gravity \(p\)-median model
• On the point for which the sum of the distances to \(n\) given points is minimum
• Heuristic solution of the multisource Weber problem as a \(p\)-median problem
• An efficient genetic algorithm for the \(p\)-median problem
• Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem
• Interior point methods for second-order cone programming and OR applications
• An elliptical cover problem in drone delivery network design and its solution algorithms
• Extensions to the Weber problem
• Biologically inspired parent selection in genetic algorithms
• Solving multiple facilities location problems with separated clusters
• Review of obnoxious facilities location problems
• On the Complexity of Some Common Geometric Location Problems
• Improved starting solutions for the planar p-median problem
• Location-Allocation Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A Trajectory Method for the Optimization of the Multi-Facility Location Problem With lp Distances
• A note on accelerating the weiszfeld procedure
• Heuristic Methods for Location-Allocation Problems
• The fortified Weiszfeld algorithm for solving the Weber problem
• Heuristics for Location Models
• Exact and approximate solutions to the multisource weber problem
• Location Theory, Dominance, and Convexity
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• A modified Weiszfeld algorithm for the Fermat-Weber location problem
• The multiple markets competitive location problem