An effective implementation of a direct spanning tree representation in GAs

DOI10.1007/3-540-45365-2_2MaRDI QIDQ2770480zbMATH OpenFDO

Authors Y. Li

Publication date 13 February 2002

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2037/20370011

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1472129
• Constrained minimal spanning trees solved by a GA with feasible encodings
• Representations for genetic and evolutionary algorithms. With a foreword by David E. Goldberg.
• A note on genetic algorithms for degree-constrained spanning tree problems
• Minimal edge-ordered spanning trees using a self-adapting genetic algorithm with multiple genomic representations

Cited in

(4)

• Minimal edge-ordered spanning trees using a self-adapting genetic algorithm with multiple genomic representations
• scientific article; zbMATH DE number 1990670 (Why is no real title available?)
• scientific article; zbMATH DE number 1472129 (Why is no real title available?)
• Making the edge-set encoding fly by controlling the bias of its crossover operator

This page was built for publication: An effective implementation of a direct spanning tree representation in GAs

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