Hybridizations of GRASP with path relinking for the far from most string problem

DOI10.1111/itor.12167zbMath1342.90161OpenAlexW2121576052WikidataQ62047866 ScholiaQ62047866MaRDI QIDQ2811940

Daniele Ferone, Mauricio G. C. Resende, Paola Festa

Publication date: 9 June 2016

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12167

zbMATH Keywords

combinatorial optimizationhybrid metaheuristicsstring problemsconsensus problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

Solving the set packing problem via a maximum weighted independent set heuristic, On the role of metaheuristic optimization in bioinformatics, Application of negative learning ant colony optimization to the far from most string problem, A survey on optimization metaheuristics, An efficient exact approach for the constrained shortest path tour problem, Hybrid algorithms for placement of virtual machines across geo-separated data centers

Uses Software

• GRASP
• Scatter Search

Cites Work

• Unnamed Item
• On covering problems of codes
• Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
• GRASP and path relinking for the max-min diversity problem
• A probabilistic heuristic for a computationally difficult set covering problem
• Distinguishing string selection problems.
• Greedy randomized adaptive search procedures
• A hybrid heuristic for the \(p\)-median problem
• Probability distribution of solution time in GRASP: an experimental investigation
• On some optimization problems in molecular biology
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• An annotated bibliography of GRASP-Part II: Applications
• GRASP with path relinking for the weighted MAXSAT problem
• An annotated bibliography of GRASP – Part I: Algorithms
• Randomized heuristics for the Max-Cut problem
• Statistical Analysis of Computational Tests of Algorithms and Heuristics
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Solving a bus driver scheduling problem with randomized multistart heuristics
• Randomized heuristics for the family traveling salesperson problem
• Analysis and design of peer‐assisted video‐on‐demand services