A biased random-key genetic algorithm for the Steiner triple covering problem

DOI10.1007/S11590-011-0285-3MaRDI QIDQ691474zbMATH OpenOpenAlexFDO

Authors Mauricio G. C. Resende, Rodrigo F. Toso, José Fernando Gonçalves

Publication date 30 November 2012

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-011-0285-3

zbMATH Keywords

biased random-key genetic algorithmgenetic algorithmmetaheuristicsrandom keysset coveringSteiner triple covering

Mathematics Subject Classification ID

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

Recommendations

• Genetic algorithms applied to computationally difficult set covering problems
• Solving large Steiner Triple Covering Problems
• A probabilistic heuristic for a computationally difficult set covering problem
• scientific article; zbMATH DE number 4106856
• Biased random-key genetic algorithms with applications in telecommunications

Cites work

• A note on some computationally difficult set covering problems
• A probabilistic heuristic for a computationally difficult set covering problem
• An interior point algorithm to solve computationally difficult set covering problems
• Approximation algorithms for combinatorial problems
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Global optimization by continuous grasp
• scientific article; zbMATH DE number 43417 (Why is no real title available?)
• scientific article; zbMATH DE number 3550465 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1302177 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• Improved solutions to the Steiner triple covering problem
• Mersenne twister
• Russian doll search for the Steiner triple covering problem
• Solving hard set covering problems
• Solving large Steiner Triple Covering Problems

Cited in

(10)

• Solving large Steiner Triple Covering Problems
• An efficient local search heuristic with row weighting for the unicost set covering problem
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
• A biased random key genetic algorithm for the field Technician scheduling problem
• An integer linear programming formulation and heuristics for the minmax relative regret robust shortest path problem
• A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
• An extended Akers graphical method with a biased random‐key genetic algorithm for job‐shop scheduling
• The connected Grundy coloring problem: formulations and a local-search enhanced biased random-key genetic algorithm
• Obtaining the Grundy chromatic number: how bad can my greedy heuristic coloring be?
• Biased random-key genetic algorithms: a review

Describes a project that uses

Uses Software

• TTTPLOTS
• PERL
• MersenneTwister

This page was built for publication: A biased random-key genetic algorithm for the Steiner triple covering problem

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