A hybrid data mining metaheuristic for the p‐median problem

DOI10.1002/SAM.10116MaRDI QIDQ4969775zbMATH OpenOpenAlexFDO

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

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 optimizationdata miningGRASPhybrid metaheuristicsp-median problem

Mathematics Subject Classification ID

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

Cites work

• A cellular heuristic for the multisource Weber problem.
• 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
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An annotated bibliography of GRASP – Part I: Algorithms
• An annotated bibliography of GRASP-Part II: Applications
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• An evolutionary heuristic for quadratic 0-1 programming
• Applications of the DM‐GRASP heuristic: a survey
• Data mining. Concepts and techniques
• Greedy randomized adaptive search procedures
• scientific article; zbMATH DE number 2050708 (Why is no real title available?)
• scientific article; zbMATH DE number 2200689 (Why is no real title available?)
• Hybridization of GRASP metaheuristic with data mining techniques
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• Metaheuristics: A bibliography
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• The \(p\)-median problem: a survey of metaheuristic approaches
• TSPLIB—A Traveling Salesman Problem Library
• TTT plots: a perl program to create time-to-target plots

Cited in

(8)

• An iterated greedy heuristic for a market segmentation problem with multiple attributes
• 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
• MineReduce: an approach based on data mining for problem size reduction
• Hybrid data mining heuristics for the heterogeneous fleet vehicle routing 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
• A hyperbolic smoothing approach to the multisource Weber problem

Describes a project that uses

Uses Software

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4969775)