Displaying similar documents to “Two problems in multicommodity networks”

Ratio rewards in networks

V. Aggarwal, Y. P. Aneja, K. P. K. Nair (1981)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

Ant algorithm for flow assignment in connection-oriented networks

Krzysztof Walkowiak (2005)

International Journal of Applied Mathematics and Computer Science

Similarity:

This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern...

Quasi-hierarchical evolution algorithm for flow assignment in survivable connection-oriented networks

Michal Przewozniczek, Krzysztof Walkowiak (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

The main objective of this paper is to develop an effective evolutionary algorithm (EA) for the path-assignment problem in survivable connection-oriented networks. We assume a single-link failure scenario, which is the most common and frequently reported failure event. Since the network flow is modeled as a non-bifurcated multicommodity flow, the discussed optimization problem is NP-complete. Thus, we develop an effective heuristic algorithm based on an evolutionary algorithm. The main...