Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on uniform random number generation
Computers and Operations Research
Discrete Mathematics
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Variable Neighborhood Decomposition Search
Journal of Heuristics
Toward Self-Integrating Software Applications for Supply Chain Management
Information Systems Frontiers
Heuristic Methods for Large Centroid Clustering Problems
Journal of Heuristics
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization
INFORMS Journal on Computing
A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs
INFORMS Journal on Computing
Parallelization of the scatter search for the p-median problem
Parallel Computing - Special issue: Parallel computing in logistics
Performance of Various Computers Using Standard Linear Equations Software
Performance of Various Computers Using Standard Linear Equations Software
GRASP with Path Relinking for Three-Index Assignment
INFORMS Journal on Computing
Air cargo pickup schedule for single delivery location
Computers and Industrial Engineering
Metaheuristics for optimization problems in computer communications
Computer Communications
A scatter search-based heuristic to locate capacitated transshipment points
Computers and Operations Research
A memetic genetic algorithm for the vertex p-center problem
Evolutionary Computation
Limited-Memory Techniques for Sensor Placement in Water Distribution Networks
Learning and Intelligent Optimization
Experiences on enhancing data collection in large networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Exact and Asymptotically Exact Solutions for a Class of Assortment Problems
INFORMS Journal on Computing
GRASP and path relinking for the max-min diversity problem
Computers and Operations Research
Optimization-based content selection for opinion summarization
UCNLG+Sum '09 Proceedings of the 2009 Workshop on Language Generation and Summarisation
M-GRASP: a GRASP with memory for latency-aware partitioning methods in DVE systems
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
The OA-based swap method for the p-median problem
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Expert Systems with Applications: An International Journal
Ant based hyper heuristics with space reduction: a case study of the p-median problem
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
A GRASP with evolutionary path relinking for the truck and trailer routing problem
Computers and Operations Research
A multiobjective GRASP for the 1/3 variant of the time and space assembly line balancing problem
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
Modeling the gateway location problem for multicommodity flow rerouting
INOC'11 Proceedings of the 5th international conference on Network optimization
Computers and Industrial Engineering
Solving Large p-Median Problems with a Radius Formulation
INFORMS Journal on Computing
An aggregation heuristic for large scale p-median problem
Computers and Operations Research
Effective probabilistic stopping rules for randomized metaheuristics: GRASP implementations
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Path-relinking intensification methods for stochastic local search algorithms
Journal of Heuristics
Hyper-heuristics with low level parameter adaptation
Evolutionary Computation
Entity-centric topic-oriented opinion summarization in twitter
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps
Computers and Operations Research
Computers and Operations Research
GRASP and path relinking for the equitable dispersion problem
Computers and Operations Research
A GRASP metaheuristic for microarray data analysis
Computers and Operations Research
Computers and Operations Research
GRASP with evolutionary path-relinking for the capacitated arc routing problem
Computers and Operations Research
Randomized heuristics for handover minimization in mobility networks
Journal of Heuristics
| Hi-index | 0.00 |
Given n customers and a set F of m potential facilities, the p-median problem consists in finding a subset of F with p facilities such that the cost of serving all customers is minimized. This is a well-known NP-complete problem with important applications in location science and classification (clustering). We present a multistart hybrid heuristic that combines elements of several traditional metaheuristics to find near-optimal solutions to this problem. Empirical results on instances from the literature attest the robustness of the algorithm, which performs at least as well as other methods, and often better in terms of both running time and solution quality. In all cases the solutions obtained by our method were within 0.1% of the best known upper bounds.