Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

5

ICAISC
2004
Springer

favoriteEmaildiscussreport

125views Artificial Intelligence» more ICAISC 2004»

On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem

13 years 10 months ago

On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem

Download www.kssk.pwr.wroc.pl

Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity ﬂow problem. We propose a general framework of ant algorithm that can be applied to the design of static ﬂows in connection-oriented computer networks. Next, through numerical simulation, we study the inﬂuence of algorithm’s parameters setting on the quality of solutions. We compare and discuss two variants of the algorithm: without and with feasible initial solution.

Krzysztof Walkowiak

Real-time Traffic

Ant Algorithm | Artificial Intelligence | Feasible Initial Solution | ICAISC 2004 | Multicommodity ﬂow Problem |

claim paper

Related Content

» Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems

» A fixedparameter tractability result for multicommodity demand flow in trees

» Freight Flow Consolidation in Presence of Time Windows

» Provisioning a virtual private network a network design problem for multicommodity flow

» Almost Tight bounds and existence theorems for singlecommodity confluent flows

» Multicommodity Demand Flow in a Tree

» A multicommodity flow approach to maximising utility in linked marketbased grids

» A Simple Greedy Algorithm for the kDisjoint Flow Problem

» The Metric Polytope

Post Info
More Details (n/a)

Added	01 Jul 2010
Updated	01 Jul 2010
Type	Conference
Year	2004
Where	ICAISC
Authors	Krzysztof Walkowiak

Comments (0)