A new heuristic for solving the \(p\)-median problem in the plane
From MaRDI portal
Publication:339602
DOI10.1016/j.cor.2012.07.012zbMath1349.90557OpenAlexW1980478742MaRDI QIDQ339602
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.07.012
Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Covering part of a planar network ⋮ The planar multifacility collection depots location problem ⋮ Location equilibria for a continuous competitive facility location problem under delivered pricing ⋮ A distance-limited continuous location-allocation problem for spatial planning of decentralized systems ⋮ New heuristic algorithms for solving the planar \(p\)-median problem ⋮ Solving the planar \(p\)-Median problem by variable neighborhood and concentric searches ⋮ A voltage drop limited decentralized electric power distribution network ⋮ Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem ⋮ Incorporating neighborhood reduction for the solution of the planar \(p\)-median problem ⋮ Mean-variance value at risk criterion for solving a \(p\)-median location problem on networks with type-2 intuitionistic fuzzy weights ⋮ A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation ⋮ Extensions to the planar \(p\)-median problem ⋮ Classical and inverse median location problems under uncertain environment ⋮ New local searches for solving the multi-source Weber problem ⋮ A new local search for continuous location problems ⋮ A multi-product production/distribution system design problem with direct shipments and lateral transshipments ⋮ Improved starting solutions for the planar p-median problem ⋮ Generating good starting solutions for the p-median problem in the plane ⋮ The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application ⋮ Multi-facility green Weber problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithm AS 136: A K-Means Clustering Algorithm
- Asymptotic behavior of the Weber location problem on the plane
- Foundations of location analysis
- The \(p\)-median problem: a survey of metaheuristic approaches
- Attraction probabilities in variable neighborhood search
- 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
- Degeneracy in the multi-source Weber problem
- A projection method for \(l_ p\) norm location-allocation problems
- An efficient genetic algorithm for the \(p\)-median problem
- Future paths for integer programming and links to artificial intelligence
- Solving the multiple competitive facilities location problem
- A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
- On the Complexity of Some Common Geometric Location Problems
- Location-Allocation Problems
- An Efficient Method for the Multi-Depot Location-Allocation Problem
- A squared-euclidean distance location-allocation problem
- TSPLIB—A Traveling Salesman Problem Library
- Note—One-Dimensional Facility Location-Allocation using Dynamic Programming
- A computation procedure for the exact solution of location-allocation problems with rectangular distances
- Subdrop: A modified drop heuristic for location problems
- A note on accelerating the weiszfeld procedure
- Heuristic Methods for Location-Allocation Problems
- Heuristics for Location Models
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
