The \(p\)-median problem: a survey of metaheuristic approaches

DOI10.1016/j.ejor.2005.05.034zbMath1163.90610OpenAlexW2153171506MaRDI QIDQ864013

Nenad Mladenović, Pierre Hansen, José Andrés Moreno-Pérez, Jack Brimberg

Publication date: 12 February 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.05.034

zbMATH Keywords

metaheuristicslocation\(p\)-median

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Related Items

Models and algorithms for competitive facility location problems with different customer behavior, Optimal column subset selection for image classification by genetic algorithms, A multi-objective genetic algorithm for a bi-objective facility location problem with partial coverage, A modified \(p\)-median model for the emergency facilities location problem and its variable neighbourhood search-based algorithm, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, A model for clustering data from heterogeneous dissimilarities, GRASP for the uncapacitated \(r\)-allocation \(p\)-hub median problem, Variable neighborhood search for the pharmacy duty scheduling problem, Strengthening the reliability fixed-charge location model using clique constraints, A new heuristic for solving the \(p\)-median problem in the plane, A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain, Generalization of the restricted planar location problems: unified metaheuristic algorithms, K-medoids inverse regression, Novel Formulations and Logic-Based Benders Decomposition for the Integrated Parallel Machine Scheduling and Location Problem, Solving the \(p\)-median problem on regular and lattice networks, A Lagrangian search method for the \(P\)-median problem, A general variable neighborhood search for solving the uncapacitated \(r\)-allocation \(p\)-hub Median problem, An efficient heuristic algorithm for the capacitated \(p\)-median problem, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, Discrete parallel machine makespan ScheLoc problem, Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem, An exact procedure and LP formulations for the leader-follower location problem, A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights, Discrete facility location in machine learning, Primal and dual bounds for the vertex \(p\)-median problem with balance constraints, Location Problems with Cutoff, Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem, A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem, A 16-competitive algorithm for hierarchical median problem, Efficient algorithms for finding <scp>2‐medians</scp> of a tree, Configuration‐based approach for topological problems in the design of wireless sensor networks, Improving emergency services efficiency during Islamic pilgrimage through optimal allocation of facilities, A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation, Location Science in Canada, Territorial design for customers with demand frequency, Location-allocation analysis of humanitarian distribution plans: a case of united nations humanitarian response depots, An efficient Benders decomposition for the \(p\)-median problem, Does Euclidean distance work well when the \(p\)-median model is applied in rural areas?, A hybrid genetic algorithm for the Hamiltonian p‐median problem, Accelerating the convergence in the single-source and multi-source Weber problems, MIRHA: multi-start biased randomization of heuristics with adaptive local search for solving non-smooth routing problems, Complexity evaluation of benchmark instances for the \(p\)-median problem, \(k\)-means genetic algorithms with greedy genetic operators, Variations in the flow approach to CFCLP-TC for multiobjective supply chain design, Alternative formulations for the obnoxious \(p\)-median problem, A facility location model for air pollution detection, Fast metaheuristics for the discrete \((r|p)\)-centroid problem, Complexity of local search for the \(p\)-median problem, Multiple voting location problems, Data aggregation for \(p\)-median problems, An exact column-generation approach for the lot-type design problem, Threshold robustness in discrete facility location problems: a bi-objective approach, Solving the wire-harness design problem at a European car manufacturer, A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem, Clustering and maximum likelihood search for efficient statistical classification with medium-sized databases, The heterogeneous \(p\)-median problem for categorization based clustering, An adaptive multiphase approach for large unconditional and conditional \(p\)-median problems, A new local search for continuous location problems, Determining optimal resource recycling boundary at regional level: a case study on Tokyo metropolitan area in Japan, A computational study of a nonlinear minsum facility location problem, Lagrangean relaxation heuristics for the \(p\)-cable-trench problem, An aggregation heuristic for large scale p-median problem, New genetic algorithms based approaches to continuous \(p\)-median problem, A multi-product production/distribution system design problem with direct shipments and lateral transshipments, Variable neighbourhood search: methods and applications, Multiobjective optimization for multimode transportation problems, Facility location with tree topology and radial distance constraints, A modified firefly algorithm for general inverse \(p\)-Median location problems under different distance norms, Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs, Affinity propagation and uncapacitated facility location problems, The problem of the optimal placing of the information-technological reserve in distributed data processing systems, Adaptive memory artificial bee colony algorithm for Green vehicle routing with cross-docking, Solving multiple facilities location problems with separated clusters, Pharmacy duty scheduling problem, A hybrid data mining metaheuristic for the p‐median problem, Near-optimal large-scale k-medoids clustering, A Local Search Algorithm for the Single Machine Scheduling Problem with Setups and a Storage, The Branch and Cut Method for the Clique Partitioning Problem, Local improvement in planar facility location using vehicle routing, Optimal location with equitable loads, Variable neighbourhood search: Methods and applications, A general variable neighborhood search approach based on a \(p\)-median model for cellular manufacturing problems, Using injection points in reformulation local search for solving continuous location problems, ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE, Exemplar-based clustering via simulated annealing, Fuzzy metrics and its applications in image processing, Median Problems in Networks, Heuristics for Location Models, Mathematical modeling and optimal blank generation in glass manufacturing, Exploiting flat subspaces in local search for \(p\)-center problem and two fault-tolerant variants, Variable neighborhood search for minimum sum-of-squares clustering on networks, Metaheuristic applications on discrete facility location problems: a survey

Uses Software

• TSPLIB
• OR-Library
• Scatter Search
• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Solving the \(p\)-median problem with a semi-Lagrangian relaxation
• A note on solving large p-median problems
• Fast primal and dual heuristics for the \(p\)-median location problem
• An efficient tabu search procedure for the \(p\)-median problem
• Heuristic concentration: Two stage solution construction
• A dynamic programming heuristic for the \(P\)-median problem
• Heuristic concentration and tabu search: A head to head comparison
• Analysis of aggregation errors for the \(p\)-median problem
• The demand partitioning method for reducing aggregation errors in \(p\)-median problems
• A heuristic for large-size \(p\)-median location problems with application to school location
• On the choice of aggregation points for continuous \(p\)-median problems: A case for the gravity centre
• Cluster analysis and mathematical programming
• Variable neighborhood search
• Heuristic methods for large centroid clustering problems
• An efficient genetic algorithm for the \(p\)-median problem
• The volume algorithm: Producing primal solutions with a subgradient method
• A statistical analysis of simulated annealing applied to the \(p\)-median problem
• Lagrangean heuristics for location problems
• Greedy randomized adaptive search procedures
• A gamma heuristic for the \(p\)-median problem
• A hybrid heuristic for the \(p\)-median problem
• Variable neighborhood decomposition search
• The parallel variable neighborhood search for the \(p\)-median problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• Cluster Analysis: An Application of Lagrangian Relaxation
• Heuristic cluster algorithm for multiple facility location-allocation problem
• An Overview of Representative Problems in Location Research
• A Dual-Based Procedure for Uncapacitated Facility Location
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• A Dual-Bounded Algorithm for the p-Median Problem
• TSPLIB—A Traveling Salesman Problem Library
• Tabu Search—Part I
• Tabu Search—Part II
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• `` Strong NP-Completeness Results
• Variable neighborhood search for the p-median
• Dynamic facility location: The progressive p-median problem
• Subdrop: A modified drop heuristic for location problems
• A new heuristic approach for the P-median problem
• A perturbation heuristic for a class of location problems
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Aggregation Error Bounds for a Class of Location Models
• Worst-case incremental analysis for a class ofp-facility location problems
• Large neighborhood local search for the p-median problem
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Handbook of metaheuristics
• Variable neighborhood search: Principles and applications
• Defining tabu list size and aspiration criterion within tabu search methods