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.
This work was supported by National Nature Science Foundation of China under Grant 60674071.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ravindra, K., Ahuja, T., James, B.: Network Flows: Theory, Algorithms, and Applications. China machine press, Beijing (2005)
Dorigo, M.: Optimization, Learning and Natural Algorithms, Milano Italy Dipartimento di Elettronica, Politecnico di Milano, Italy (1992)
Dorigo, M., Gambardella, L.: Ant Colony System: A Cooperative Learning Approach to the Traveling salesman Problem. IEEE Transactions on Evolutionary Computation 1(1), 53–66 (1997)
Gambardella, L., Dorigo, M.: Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem. In: Proceedings of the 12th International Conference on Machine Learning, pp. 252–260. Morgan Kaufmann, Tahoe City (1995)
Maniezzo, V., Colorni, A., Dorigo, M.: The Ant System Applied to the Quadratic Assignment Problem, IRIDIA/94-28. Belgium, Universite de Bruxelles (1994)
Colorni, A., Dorigo, M., Maniezzo, V., et al.: Ant System for Job-shop Scheduling. Belgian Journal of Operations Research, Statistics and Computer Science 34, 39–53 (1994)
Xie, M., Gao, L.: Ant Algorithm Applied in Optimal Path Planning. Computer Engineering and Application (2008)
Li, S., Chen, Y., Li, Y.: Ant Colony Algorithms with Applications. Harbin Industry University Press, Harbin (2004)
Duan, H.: Ant Colony Algorithm: Theory and Applications. Science Press, Beijing (2005)
Ning, X.: A Mixed Labelling Algorithm for Solving Minimum Cost Flow Problem in the Network. Systems Engineering-theory & Practice 5(3), 1 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xie, M., Gao, L., Guan, H. (2008). Ant Algorithm Applied in the Minimal Cost Maximum Flow Problem. In: Huang, DS., Wunsch, D.C., Levine, D.S., Jo, KH. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2008. Lecture Notes in Computer Science(), vol 5227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85984-0_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-85984-0_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85983-3
Online ISBN: 978-3-540-85984-0
eBook Packages: Computer ScienceComputer Science (R0)