[1] McQuillan, J., Richer, I., & Rosen, E., The new routing algorithm for the ARPANET, IEEE Transactions on Communications, 28(5), 1980, 711-719.
[2] Frank, H., Shortest paths in probabilistic graphs, Operations Research, 17(4), 1969, 583-599.
[3] Beigy, H., & Meybodi, M. R., Utilizing distributed learning automata to solve stochastic shortest path problems, International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 14(05), 2006, 591-615.
[4] Misra, S., & Oommen, B. J., Dynamic algorithms for the shortest path routing problem: learning automata-based solutions, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 35(6), 2005, 1179-1192.
[5] Burton, D., On the inverse shortest path problem, Département de Mathématique, Faculté des Sciences, Facultés Universitaires Notre-Dame de la Paix de Namur, 1993.
[6] Waller, S. T., & Ziliaskopoulos, A. K., On the online shortest path problem with limited arc cost dependencies, Networks: An International Journal, 40(4), 2002, 216-227.
[7] Pritchard, D., & Thurimella, R., Fast computation of small cuts via cycle space sampling, ACM Transactions on Algorithms (TALG), 7(4), 2011, 46.
[8] T. time-volume function Studies, Tehran Comprehensive Transportation and Traffic Studies (TCTTS), a division of the Municipality of Tehran, Tehran, 1995.
[9] Zitzler, E., Evolutionary algorithms for multiobjective optimization: Methods and applications, ed. 63, Ithaca: Shaker, 1999.
[10] Satoh, H., Minimal generation gap model for GAs considering both exploration and exploitation, In Proc. of the 4th International Conference on Fuzzy Logic, Neural Nets and Soft Computing, 1996, 494-497.
[11] Pourtakdoust, S. H., & Zandavi, S. M., A hybrid simplex non-dominated sorting genetic algorithm for multi-objective optimization, International Journal of Swarm Intelligence & Evolutionary Computation, 5(3), 2016, 1-11.
[12] Gouveia, L., Simonetti, L., & Uchoa, E., Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs, Mathematical Programming, 128(1-2), 2011, 123-148.
[13] Hao, H., & Barooah, P., Stability and robustness of large platoons of vehicles with doubleāintegrator models and nearest neighbor interaction, International Journal of Robust and Nonlinear Control, 23(18), 2013, 2097-2122.
[14] Alam, A., Fuel-efficient heavy-duty vehicle platooning, Doctoral dissertation, KTH Royal Institute of Technology, 2014.
[15] Lenzen, C., & Patt-Shamir, B., Fast routing table construction using small messages, In Proceedings of the Forty-Fifth Annual ACM Symposium on Theory of Computing, 2013, 381-390.