Ant Algorithm Applied in the Minimal Cost Maximum Flow Problem

Authors:
Min Xie;Lixin Gao;Haiwa Guan
Affiliations:
Institute of Operations Research and Control Science, Wenzhou University, Zhejiang, China 325000;Institute of Operations Research and Control Science, Wenzhou University, Zhejiang, China 325000;Institute of Operations Research and Control Science, Wenzhou University, Zhejiang, China 325000
Venue:
ICIC '08 Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Artificial Intelligence
Year:
2008

Citing 2
Cited 0

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimal cost maximum flow problem is a classical combinational optimization problem. Based on the characteristic of ant algorithm and the minimal cost maximum flow problem, a graph mode is presented to use the ant algorithm to solve the minimal cost maximum flow problem. Simulation results show that the algorithm can efficiently solve minimal cost maximum flow problem in a relatively short time.