Smart Mobile Device to Trace Moving Rogue Objects in Smart City Utilizing Dynamic Source Dynamic Destination Tracking Algorithm

References

• A. Dixit, A. Mishra, and A. Shukla, “Vehicle routing problem with time windows using meta-heuristic algorithms: a survey,” in Harmony Search and Nature Inspired Optimization Algorithms, N. Yadav, A. Yadav, J. Bansal, K. Deep, and J. Kim, Ed. Singapore: Springer, 2019, pp. 539–46.
   Google Scholar
• S. Mirjalili, J. S. Dong, and A. Lewis, “Ant colony optimizer: Theory, literature review, and application in auv path planning,” in Nature-Inspired Optimizers, S. Mirjalili, J. Song Dong, and  A. Lewis, Ed. Cham: Springer, 2020, pp. 7–21.
   Google Scholar
• M. Sama, P. Pellegrini, A. D’Ariano, J. Rodriguez, and D. Pacciarelli, “Ant colony optimization for the real-time train routing selection problem,” Transp. Res. B, Methodol., Vol. 85, pp. 89–108, 2016. DOI:10.1016/j.trb.2016.01.005.
   Web of Science ®Google Scholar
• M. M. Othman, S. A. Adeshina, and M. M. Boukar, “Development of road anomaly data transmission using ant colony optimization algorithm in a vehicle-to-vehicle communication,” in 2019 15th International Conference on Electronics, Computer and Computation (ICECCO), Abuja, Nigeria: IEEE, 2019, pp. 1–6.
   Google Scholar
• N. Rida, M. Ouadoud, and A. Hasbi, “Ant colony optimization for real time traffic lights control on a single intersection,” Int J Interactive Mobile Technol, Vol. 14, no. 02, pp. 196–214, 2020. DOI:10.3991/ijim.v14i02.10332.
   Google Scholar
• R. Bajaj, S. L. Ranaweera, and D. P. Agrawal, “Gps: Location-tracking technology,” Computer, Vol. 35, no. 4, pp. 92–94, 2002. DOI:10.1109/MC.2002.993780.
   Web of Science ®Google Scholar
• D. P. Martin, “Dynamic shortest path and transitive closure algorithms: A survey,” CoRR, Vol. Abs/1709.00553, 2017.
   Google Scholar
• D. Garg, et al., “Dynamizing dijkstra: A solution to dynamic shortest path problem through retroactive priority queue,” J. King Saud University-Comput. Inf. Sci., Vol. 33, pp. 364–373, 2018.
   Google Scholar
• S. Koenig, M. Likhachev, and D. Furcy, “Lifelong planning a*,” Artif. Intell., Vol. 155, no. 1–2, pp. 93–146, 2004. DOI:10.1016/j.artint.2003.12.001.
   Web of Science ®Google Scholar
• A. Sokolov, T. Fetisova, A. Bakulev, and M. Bakuleva, “Development of the algorithm for finding the optimal path in a transport network with dynamic parameters based on the multidimensional data model,” in 2019 8th Mediterranean Conference on Embedded Computing (MECO), Budva, Montenegro: IEEE, 2019, pp. 1–4.
   Google Scholar
• U. Ritzinger, J. Puchinger, and R. F. Hartl, “A survey on dynamic and stochastic vehicle routing problems,” Int. J. Prod. Res., Vol. 54, no. 1, pp. 215–31, 2016. DOI:10.1080/00207543.2015.1043403.
   Web of Science ®Google Scholar
• A. Madkour, W. G. Aref, F. U. Rehman, M. A. Rahman, and S. Basalamah. “A survey of shortest-path algorithms,” arXiv preprint arXiv:1705.02044, 2017.
   Google Scholar
• S. E. Dreyfus, “An appraisal of some shortest-path algorithms,” Oper. Res., Vol. 17, no. 3, pp. 395–412, 1969. DOI:10.1287/opre.17.3.395.
   Web of Science ®Google Scholar
• L. Roditty, and U. Zwick, “Dynamic approximate all-pairs shortest paths in undirected graphs,” in 45th Annual IEEE Symposium on Foundations of Computer Science,  Rome, Italy, Oct 2004, pp. 499–508.
   Google Scholar
• M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun, “Anytime dynamic a*: An anytime, replanning algorithm,” in Proceedings of the Fifteenth International Conference on International Conference on Automated Planning and Scheduling, ICAPS’05, AAAI Press, 2005, pp. 262–71.
   Google Scholar
• P. Narvaez, K.-Y. Siu, and H.-Y. Tzeng, “New dynamic algorithms for shortest path tree computation,” IEEE/ACM Trans. Netw, Vol. 8, pp. 734–746, Dec. 2000. DOI:10.1109/90.893870.
   Web of Science ®Google Scholar
• Maze Exploration Algorithm for Small Mobile Platforms - Scientific Figure on Research Gate. Available https://www.researchgate.net/figure/Sample-maze-used-in-computer- simulations_fig6_315969093.
   Google Scholar
• T. Chakraborty, S. Chakrabarti, and B. Hazra, “Study of β, ρ and q0 parameters for shortest path estimation using ant colony optimization,” in 2019 IEEE Region 10 Symposium (TENSYMP), Kolkata, India, 2019, pp. 813–8.
   Google Scholar
• M. Kairanbay, and H. Mat Jani, “A review and evaluations of shortest path algorithms,” Int J. Sci. Technol. Res., Vol. 2, pp. 99–104, 01 2013.
   Google Scholar
• J. Medak, and P. P. Gogoi, “Review and analysis of single-source shortest path problem using dijkstra’s algorithm,” IOSR J. Comput. Eng., Vol. 20, pp. 10–15, 03 2018.
   Google Scholar
• F. Duchon, A. Babinec, M. Kajan, P. Beno, M. Florek, T. Fico, and L. Jurisica, “Path planning with modified a star algorithm for a mobile robot,” Procedia. Eng., Vol. 96, pp. 59–69, 2014. Modelling of Mechanical and Mechatronic Systems. DOI:10.1016/j.proeng.2014.12.098.
   Google Scholar
• Y.-I. Lee, S. Lee, S. Lee, and J. Chon, “A dynamic shortest path algorithm using multi-step ahead link travel time prediction,” Int. J. Urban Sci., Vol. 8, no. 2, pp. 156–66, 2004. DOI:10.1080/12265934.2004.9693559.
   Google Scholar