Maximizing residual capacity in connection-oriented networks.
Walkowiak, Krzysztof (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
Walkowiak, Krzysztof (2006)
Journal of Applied Mathematics and Decision Sciences
Similarity:
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...
Veira Martins, Ernesto Q. (1979)
Portugaliae mathematica
Similarity:
Maric, Miroslav (2013)
Serdica Journal of Computing
Similarity:
In this paper a Variable Neighborhood Search (VNS) algorithm for solving the Capacitated Single Allocation Hub Location Problem (CSAHLP) is presented. CSAHLP consists of two subproblems; the first is choosing a set of hubs from all nodes in a network, while the other comprises finding the optimal allocation of non-hubs to hubs when a set of hubs is already known. The VNS algorithm was used for the first subproblem, while the CPLEX solver was used for the second. Computational results...
Brian Boffey (1993)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
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...
Dimiter Ivanchev, Elena Radovanova (2009)
The Yugoslav Journal of Operations Research
Similarity:
T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2002)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity:
Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...
Teodros Getachew, Michael Kostreva, Laura Lancaster (2000)
RAIRO - Operations Research - Recherche Opérationnelle
Similarity: