A hybrid data mining GRASP with path-relinking

DOI10.1016/j.cor.2012.02.022zbMath1348.90631OpenAlexW2025297255MaRDI QIDQ336726

Alexandre Plastino, Simone L. Martins, Hugo Barbalho, Isabel Rosseti

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

zbMATH Keywords

GRASPdata mininghybrid metaheuristicpath-relinking2-path network design problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Related Items (11)

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 ⋮ A tabu search algorithm to solve a green logistics bi-objective bi-level problem ⋮ A GRASP/Path‐Relinking algorithm for the traveling purchaser 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 ⋮ Combining integer linear programming with a state‐of‐the‐art heuristic for the 2‐path network design problem ⋮ Hybrid data mining heuristics for the heterogeneous fleet vehicle routing problem ⋮ Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art ⋮ A comment on: ``What makes a VRP solution good? The generation of problem-specific knowledge for heuristics ⋮ \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms

Uses Software

• GRASP
• PERL
• CPLEX
• Scatter Search
• TTTPLOTS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Revised GRASP with path-relinking for the linear ordering problem
• Engineering stochastic local search algorithms. Designing, implementing and analyzing effective heuristics. Second international workshop, SLS 2009, Brussels, Belgium, September 3--4, 2009. Proceedings
• A probabilistic heuristic for a computationally difficult set covering problem
• Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
• Greedy randomized adaptive search procedures
• An evolutionary heuristic for quadratic 0-1 programming
• Metaheuristics: A bibliography
• Probabilistic diversification and intensification in local search for vehicle routing
• 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
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory
• The 2-path network problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Handbook of metaheuristics
• Tabu search for a network loading problem with multiple facilities
• Data mining. Concepts and techniques

This page was built for publication: A hybrid data mining GRASP with path-relinking