Abstract
According to the principle of the weak economy, mathematical model of emergency logistics routing optimization has been established in this paper, and the model is solved by the uniform mutation ant colony algorithm, simulation shows that the optimal results of uniform mutation ant colony algorithm are better than ant colony algorithm. At the same time, compared with the mathematical model of the smallest time, mathematical model of emergency logistics routing optimization reduce the distribution costs on the basis of time requirements which should be satisfied.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Liu, Z.: Features of the Regional Emergency Logistics. Statistics and Decision 1, 186–188 (2009)
Zhang, J.: Research of Medical Devices Vehicle Routing Problem. Taiyuan University of Ph.D. thesis, Taiyuan (2010)
Zhang, L., Liu, T., Sun, Y., Li, Q.: Research of genetic algorithm optimization neural network weights blind equalization algorithm based on real number coding. Computer Engineering and Applications 45(11), 162–164 (2009)
Tian, G., Li, M., Wei, X.: Several Solution of Traveling Salesman Problem (TSP). Computer Simulation 23(8), 153–158 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhang, J., Fei, T., Liu, T., Zhang, Ly., Zhao, X. (2011). Weak Economic Emergency Medical Devices Routing Optimization Based on Uniform Mutation Ant Colony Algorithm. In: Deng, H., Miao, D., Lei, J., Wang, F.L. (eds) Artificial Intelligence and Computational Intelligence. AICI 2011. Lecture Notes in Computer Science(), vol 7002. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23881-9_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-23881-9_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23880-2
Online ISBN: 978-3-642-23881-9
eBook Packages: Computer ScienceComputer Science (R0)