Abstract
Abstract As social systems based on computer networks are more complicated, the optimization problems in network systems have been drawing the attention of many related researchers. Recently, genetic algorithms (GAs) have achieved a great advancement in related research fields, such as combinatorial optimization, multiobjective optimization, and so on. In this paper, we consider hybrid GAs (called spanning tree-based GAs) for difficult-to-solve network design problems inherent in industrial engineering and computer communication networks, such as degree-constrained minimum spanning tree problems, capacitated minimum spanning tree problems, fixed charge transportation problems, network topological design problems, and so on.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.