A hybrid data mining GRASP with path-relinking
From MaRDI portal
Publication:336726
DOI10.1016/J.COR.2012.02.022zbMATH Open1348.90631OpenAlexW2025297255MaRDI QIDQ336726FDOQ336726
Authors: Hugo Barbalho, Isabel Rosseti, Simone L. Martins, Alexandre Plastino 
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.022
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metaheuristics. From design to implementation.
- Data mining. Concepts and techniques
- Fundamentals of scatter search and path relinking
- Title not available (Why is that?)
- Handbook of metaheuristics
- Title not available (Why is that?)
- A probabilistic heuristic for a computationally difficult set covering problem
- Greedy randomized adaptive search procedures
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Probabilistic diversification and intensification in local search for vehicle routing
- TTT plots: a perl program to create time-to-target plots
- Title not available (Why is that?)
- Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
- Metaheuristics: A bibliography
- An annotated bibliography of GRASP-Part II: Applications
- An annotated bibliography of GRASP – Part I: Algorithms
- GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- An evolutionary heuristic for quadratic 0-1 programming
- Hybridization of GRASP metaheuristic with data mining techniques
- Applications of the DM‐GRASP heuristic: a survey
- Revised GRASP with path-relinking for the linear ordering problem
- Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
- The 2-path network problem
- Tabu search for a network loading problem with multiple facilities
Cited In (15)
- Hybridization of GRASP metaheuristic with data mining techniques
- A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics
- Applications of the DM‐GRASP heuristic: a survey
- A hybrid data mining heuristic to solve the point‐feature cartographic label placement problem
- Making a state-of-the-art heuristic faster with data mining
- A GRASP/Path‐Relinking algorithm for the traveling purchaser problem
- Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art
- Improving a state‐of‐the‐art heuristic for the minimum latency problem with data mining
- Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem
- MineReduce: an approach based on data mining for problem size reduction
- A hybrid column generation with GRASP and path relinking for the network load balancing problem
- A tabu search algorithm to solve a green logistics bi-objective bi-level problem
- Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem
- Synergies between operations research and data mining: the emerging use of multi-objective approaches
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms
Uses Software
This page was built for publication: A hybrid data mining GRASP with path-relinking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336726)
