An adaptive genetic algorithm for the minimal switching graph problem

DOI10.1007/978-3-540-31996-2_21MaRDI QIDQ5706015zbMATH OpenOpenAlexFDO

Authors Mao Lin Tang

Publication date 10 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b107115

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
• Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
• scientific article; zbMATH DE number 1472129
• Constrained minimal spanning trees solved by a GA with feasible encodings
• A genetic algorithm approach to scheduling PCBs on a single machine

Cited in

(1)

• Conjugate conflict continuation graphs for multi-layer constrained via minimization

This page was built for publication: An adaptive genetic algorithm for the minimal switching graph problem

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