Article ID: | iaor2006686 |
Country: | Netherlands |
Volume: | 98 |
Issue: | 2 |
Start Page Number: | 251 |
End Page Number: | 261 |
Publication Date: | Jan 2005 |
Journal: | International Journal of Production Economics |
Authors: | Gen Mitsuo, Kumar Anup, Kim Jong Ryul |
Keywords: | heuristics |
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.