A hybrid data mining metaheuristic for the p‐median problem

DOI10.1002/sam.10116OpenAlexW2122247816MaRDI QIDQ4969775

Said Salhi, Alexandre Plastino, Richard Fuchshuber, Simone de L. Martins, Alex A. Freitas

Publication date: 14 October 2020

Published in: Statistical Analysis and Data Mining: The ASA Data Science Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sam.10116

zbMATH Keywords

combinatorial optimizationGRASPdata mininghybrid metaheuristicsp-median problem

Mathematics Subject Classification ID

Statistics (62-XX) Computer science (68-XX)

Related Items (8)

MineReduce: an approach based on data mining for problem size reduction ⋮ Synergies between operations research and data mining: the emerging use of multi-objective approaches ⋮ Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem ⋮ Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining ⋮ Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem ⋮ An iterated greedy heuristic for a market segmentation problem with multiple attributes ⋮ A hyperbolic smoothing approach to the multisource Weber problem

Uses Software

• TSPLIB
• GRASP
• PERL
• OR-Library
• TTTPLOTS

Cites Work

• Unnamed Item
• Unnamed Item
• The \(p\)-median problem: a survey of metaheuristic approaches
• A note on solving large p-median problems
• A probabilistic heuristic for a computationally difficult set covering problem
• A projection method for \(l_ p\) norm location-allocation problems
• A cellular heuristic for the multisource Weber problem.
• Greedy randomized adaptive search procedures
• An evolutionary heuristic for quadratic 0-1 programming
• Metaheuristics: A bibliography
• TTT plots: a perl program to create time-to-target plots
• Hybridization of GRASP metaheuristic with data mining techniques
• An annotated bibliography of GRASP-Part II: Applications
• Applications of the DM‐GRASP heuristic: a survey
• An annotated bibliography of GRASP – Part I: Algorithms
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• TSPLIB—A Traveling Salesman Problem Library
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Data mining. Concepts and techniques

This page was built for publication: A hybrid data mining metaheuristic for the p‐median problem