[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.

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

DOI: 10.1007/s00526-003-0237-6
[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.

DOI: 10.1007/978-1-4615-5757-9_11
[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.

DOI: 10.1109/72.286889
[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.

DOI: 10.1007/s11771-006-0111-8
[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.

DOI: 10.1016/j.cor.2006.07.003
[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.

DOI: 10.1109/4235.585892
[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.

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

DOI: 10.1016/j.cor.2006.12.017
[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.

DOI: 10.1016/j.cie.2007.08.003
[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.

DOI: 10.1016/j.endm.2004.06.029
[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.

DOI: 10.1016/j.parco.2004.07.002