Network Formation Using Ant Colony Optimization
A significant area of research in the field of hybrid communications is the Network Design Problem (NDP) . The NDP is an NP complete problem  that focuses on identifying the optimal network topology for transmitting commodities between nodes, under constraints such as bandwidth, limited compatible directed channels, and link and commodity costs. The NDP focuses on designing a flexible network while trying to achieve optimal flow or routing. If a link (or arc) is used, then an associated fixed cost of the edge is incurred. In addition, there is a cost for using the arc depending on the flow. The solution is a network topology connecting all of the nodes that minimizes the total system cost.
- 1.Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall, Upper Saddle River (1993)Google Scholar
- 2.Garner, R.: Heeuristically Driven Search Methods for Topology Control in Directional Wireless Networks. Masters Thesis Air Force Institute of Technology, Wright-Patterson AFB, OH (2007)Google Scholar
- 3.Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions of Systems, Man and Cybermetrics Part B 26, 1–13 (1996)Google Scholar
- 5.de Campos, L., Fernandez-Luna, J., Gamez, J., Puerta, J.: Ant Colony Optimization for Learning Bayesian Networks. International Journal of Approximate Reasoning, 291–311 (2002)Google Scholar