Application of negative learning ant colony optimization to the far from most string problem

DOI10.1007/978-3-031-30035-6_6MaRDI QIDQ6149093zbMATH OpenOpenAlexFDO

Authors Christian Blum, Pedro Pinacho Davidson

Publication date 12 January 2024

Published in Evolutionary Computation in Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-30035-6_6

zbMATH Keywords

ant colony optimizationcombinatorial optimizationfar from most String problemnegative learning

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Evolutionary algorithms, genetic algorithms (computational aspects) (68W50) Combinatorial optimization (90C27)

Cites work

• Distinguishing string selection problems.
• Efficient solutions for the far from most string problem
• Exact algorithm and heuristic for the closest string problem
• Hybridizations of GRASP with path relinking for the far from most string problem
• On some optimization problems in molecular biology

This page was built for publication: Application of negative learning ant colony optimization to the far from most string problem

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