**Abbreviations**


*Operations Management - Emerging Trend in the Digital Era*

**References**

2020-08-08]

[1] Mobile Tech Spurs Financial Inclusion in Developing Nations. shorturl.at/bjyOZ [Accessed in:

*DOI: http://dx.doi.org/10.5772/intechopen.93860*

*Multi-Strategy* MAX-MIN *Ant System for Solving Quota Traveling Salesman…*

[7] J. Pedro Schmitt, F. Baldo and R. Stubs Parpinelli. A MAX-MIN Ant System with Short-Term Memory Applied to the Dynamic and Asymmetric Traveling Salesman Problem. 2018 7th Brazilian Conference on Intelligent Systems (BRACIS), Sao Paulo, 2018, pp. 1–6, https://doi.org/ 10.1109/BRACIS.2018.00009. [Accessed in: 2020-08-04]

[8] J. Pedro Schmitt, R. Stubs Parpinelli and F. Baldo. (2019). Analysis of Max-Min Ant System with Local Search Applied to the Asymmetric and Dynamic Travelling Salesman Problem with Moving Vehicle. In International

Symposium on Experimental Algorithms (pp. 202–218). Springer, Cham.https://doi.org/10.1007/978-3- 030-34029-2\$\_\$14[Accessed in:

[9] Yang, K., You, X., Liu, S. et al. A novel ant colony optimization based on game for traveling salesman problem. Appl Intell (2020). https://doi.org/ 10.1007/s10489-020-01799-w [Accessed in: 2020-08-04]

[10] R. Skinderowicz. Implementing a GPU-based parallel MAX–MIN Ant System, Future Generation Computer Systems,Volume 106, 2020, Pages 277– 295, ISSN 0167-739X. https://doi.org/ 10.1016/j.future.2020.01.011 [Accessed

[11] S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. Greedy randomized adaptive search procedures for the steiner problem in graphs. In P. M. Pardalos, S. Rajasekaran, and J. Rolim, editors, Randomization methods in algorithmic design, volume 43 of

Mathematics and Theoretical Computer Science, pages 133–145. American Mathematical Society, 1999. https://b ookstore.ams.org/dimacs-43. [Accessed

DIMACS Series on Discrete

2020-08-04]

in: 2020-08-04]

in: 2020-08-04]

[2] Hensher D., Ho C., Mulley C., Nelson J., Smith G., Wong Y. (2020). Understanding Mobility as a Service (MaaS): Past, Present and Future. h ttps://doi.org/10.1016/C2019-0- 00508-0 [Accessed in: 2020-08-08]

[3] Sin C. Ho, W.Y. Szeto, Yong-Hong Kuo, Janny M.Y. Leung, Matthew Petering, Terence W.H. Tou, A survey of dial-a-ride problems: Literature review and recent developments, Transportation Research Part B: Methodological, Volume 111, 2018, Pages 395–421, ISSN 0191–2615.https:// doi.org/10.1016/j.trb.2018.02.001 [Accessed in: 2020-08-02]

[4] de Lira, V. M., Perego, R., Renso, C., Rinzivillo, S., Times, V. C. (2018). Boosting ride sharing with alternative destinations. IEEE Transactions on Intelligent Transportation Systems, 19 (7), 2290–2300. https://doi.org/10.1109/

TITS.2018.2836395 [Accessed in:

[5] Bruno C.H. Silva, Islame F.C. Fernandes, Marco C. Goldbarg, Elizabeth F.G. Goldbarg. Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by antbased algorithms. Computers & Operations Research, Volume 120, 2020, 104950, ISSN 0305–0548. https:// doi.org/10.1016/j.cor.2020.104950.

[Accessed in: 2020-08-02]

[6] M. Dorigo, M. Birattari and T. Stutzle, "Ant colony optimization," in IEEE Computational Intelligence Magazine, vol. 1, no. 4, pp. 28–39, Nov.

2006, https://doi.org/10.1109/ MCI.2006.329691. [Accessed in:

2020-08-04]

**93**

2020-08-02]
