Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Ant colony system: a cooperative learning approach to the traveling salesman problem
IEEE Transactions on Evolutionary Computation
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
A significant area of research in the field of hybrid communications is the Network Design Problem (NDP) [1]. The NDP is an NP complete problem [1] 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.