ACO-Based Global Optimal Transportation Path


Article Preview

This paper discusses how to address some issues when contemplating the global optimal transportation path (GOTP) such as dynamics, the ability of real-time analysis as well as complexity of prediction. Using shortest path methodology, this paper abstracts the real-life problem to a graphic context. Based on the solution of ant colony optimization (ACO) algorithm, the simulation indicates that this manner is efficient and effective in dealing with these problems. The indicators utilized ACO are achieved through simulation results analysis, providing the range of exact elements.



Advanced Materials Research (Volumes 488-489)

Edited by:

Wu Fan




W. H. Zhu and Y. Shen, "ACO-Based Global Optimal Transportation Path", Advanced Materials Research, Vols. 488-489, pp. 1680-1683, 2012

Online since:

March 2012




[1] Los, M. and C. Lardinois, Combinatorial programming, statistical optimization and the optimal transportation network problem* 1. Transportation Research Part B: Methodological, 1982. 16(2): pp.89-124.


[2] Xia, Q., Interior regularity of optimal transport paths. Calculus of Variations and Partial Differential Equations, 2004. 20(3): pp.283-299.


[3] Pallottino, S. and M.G. Scutella, Shortest path algorithms in transportation models: classical and innovative aspects. Equilibrium and advanced transportation modelling, 1998: pp.245-281.


[4] Villani, C., Optimal transport: old and new2009: Springer Verlag.

[5] Ali, M.K.M. and F. Kamoun, Neural networks for shortest path computation and routing in computer networks. Neural Networks, IEEE Transactions on, 1993. 4(6): pp.941-954.


[6] Tan, G., H. He, and S. Aaron, Global optimal path planning for mobile robot based on improved Dijkstra algorithm and ant system algorithm. Journal of Central South University of Technology, 2006. 13(1): pp.80-86.


[7] Huang, K.L. and C.J. Liao, Ant colony optimization combined with taboo search for the job shop scheduling problem. Computers & Operations Research, 2008. 35(4): pp.1030-1046.


[8] Dorigo, M. and L.M. Gambardella, Ant colony system: A cooperative learning approach to the traveling salesman problem. Evolutionary Computation, IEEE Transactions on, 1997. 1(1): pp.53-66.


[9] Okdem, S. and D. Karaboga, Routing in wireless sensor networks using an ant colony optimization (ACO) router chip. Sensors, 2009. 9(2): pp.909-921.


[10] Gutjahr, W.J., First steps to the runtime complexity analysis of ant colony optimization. Computers & Operations Research, 2008. 35(9): pp.2711-2727.


[11] Yagmahan, B. and M.M. Yenisey, Ant colony optimization for multi-objective flow shop scheduling problem. Computers & Industrial Engineering, 2008. 54(3): pp.411-420.


[12] Mazzeo, S. and I. Loiseau, An ant colony algorithm for the capacitated vehicle routing. Electronic Notes in Discrete Mathematics, 2004. 18: pp.181-186.


[13] Korosec, P., J. Silc, and B. Robic, Solving the mesh-partitioning problem with an ant-colony algorithm* 1. Parallel Computing, 2004. 30(5-6): pp.785-801.