A hybrid heuristic for the \(p\)-median problem
From MaRDI portal
Publication:1826490
DOI10.1023/B:HEUR.0000019986.96257.50zbMath1069.68600MaRDI QIDQ1826490
Mauricio G. C. Resende, Renato F. Werneck
Publication date: 6 August 2004
Published in: Journal of Heuristics (Search for Journal in Brave)
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
A computational study for the p-median Problem, Vehicle driven approaches for non preemptive vehicle relocation with integrated quality criterion in a vehicle sharing system, Making a state-of-the-art heuristic faster with data mining, Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem, A model for clustering data from heterogeneous dissimilarities, A robust and scalable algorithm for the Steiner problem in graphs, A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems, GRASP and path relinking for the equitable dispersion problem, A GRASP metaheuristic for microarray data analysis, A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem, GRASP with evolutionary path-relinking for the capacitated arc routing problem, Scatter search for an uncapacitated \(p\)-hub median problem, A hybrid multistart heuristic for the uncapacitated facility location problem, A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation, The \(p\)-median problem: a survey of metaheuristic approaches, A genetic algorithm for the \(p\)-median problem with pos/neg weights, Computational study of large-scale \(p\)-median problems, Imposing Contiguity Constraints in Political Districting Models, Solving the \(p\)-median problem on regular and lattice networks, A scatter search-based heuristic to locate capacitated transshipment points, A Lagrangian search method for the \(P\)-median problem, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, A hybrid artificial bee colony algorithm for the \(p\)-median problem with positive/negative weights, Discrete facility location in machine learning, A sample approximation solution procedure for chance-constrained districting problems, Configuration‐based approach for topological problems in the design of wireless sensor networks, Approximation schemes for districting problems with probabilistic constraints, A Branch Decomposition Algorithm for the p-Median Problem, An efficient Benders decomposition for the \(p\)-median problem, GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, A GRASP with evolutionary path relinking for the truck and trailer routing problem, Mathematical formulations and solution methods for the uncapacitated \(r\)-allocation \(p\)-hub maximal covering problem, A variable neighborhood search approach for the vertex bisection problem, Fast metaheuristics for the discrete \((r|p)\)-centroid problem, Analyzing Heuristic-based Randomized Search Strategies for the Quantum Circuit Compilation Problem, An ant colony algorithm for the pos/neg weighted \(p\)-median problem, A novel ant colony optimization strategy for the quantum circuit compilation problem, Median and covering location problems with interconnected facilities, Heuristic solution approaches for the maximum minsum dispersion problem, A fast swap-based local search procedure for location problems, A multi-objective GRASP procedure for reactive power compensation planning, Scatter search for the cutwidth minimization problem, An aggregation heuristic for large scale p-median problem, A multi-product production/distribution system design problem with direct shipments and lateral transshipments, Probabilistic stopping rules for GRASP heuristics and extensions, A tighter formulation of the \(p\)-median problem, Affinity propagation and uncapacitated facility location problems, Hybridizations of GRASP with path relinking for the far from most string problem, A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks, Randomized heuristics for the family traveling salesperson problem, GRASP with path relinking heuristics for the antibandwidth problem, P-Median Problems with an Additional Constraint on the Assignment Variables, Exemplar-based clustering via simulated annealing, GRASP and path relinking for the max-min diversity problem, A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem, Metaheuristic applications on discrete facility location problems: a survey
Uses Software
