A solution of real-world OCST problems with a new tree encoding-based genetic algorithm

DOI10.1080/01969720802312504zbMATH Open1213.68084OpenAlexW2076062928MaRDI QIDQ3065872FDOQ3065872

Authors: Jong Ryul Kim, Kyeong-Hoon do, Wan Young Chung, Il Seok Ko 

Publication date: 7 January 2011

Published in: Cybernetics and Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01969720802312504

Recommendations

• scientific article; zbMATH DE number 1617347
• An approach to a problem in network design using genetic algorithms
• Genetic algorithm approach on multi-criteria minimum spanning tree problem
• On Optimal Solutions for the Optimal Communication Spanning Tree Problem
• An effective genetic algorithm approach to the quadratic minimum spanning tree problem

zbMATH Keywords

genetic algorithmminimum spanning tree (MST) problemsoptimal communication spanning tree (OCST) problem

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorics in computer science (68R05) Network design and communication in computer systems (68M10)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• An encoding in metaheuristics for the minimum communication spanning tree problem
• Genetic algorithm approach on multi-criteria minimum spanning tree problem

This page was built for publication: A solution of real-world OCST problems with a new tree encoding-based genetic algorithm

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