<?xml version="1.0" encoding="UTF-8"?>
<doi_batch version="4.3.0" xmlns="http://www.crossref.org/doi_resources_schema/4.3.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.crossref.org/doi_resources_schema/4.3.0 http://www.crossref.org/schema/deposit/doi_resources4.3.0.xsd">
<head>
<doi_batch_id>eae69aa1-9ce7-43d9-b767-54237bd49e8c</doi_batch_id>
<depositor>
<name>beie</name>
<email_address>director@blueeyesintelligence.org</email_address>
</depositor>
</head>
<body>
<doi_citations>
<doi>10.35940/ijrte.E5210.019521</doi>
<citation_list><citation key="ref0"><unstructured_citation>Aparnasree R, Ani Sunny, and Surekha Mariam Varghese, &quot;Real time traffic congestion detection and optimal path selection using big data processing,&quot; in International Journal of Control Theory and Applications, 2016.</unstructured_citation></citation><citation key="ref1"><unstructured_citation>Neena Thomas, Athira Balagopal, and Surekha Mariam Varghese, &quot;Green route: an ecofriendly route suggestion and description based on congestion and air quality,&quot; in International Journal of Innovative Technology and Exploring Engineering, 2019.</unstructured_citation></citation><citation key="ref2"><doi>10.1007/3-540-45724-0_8</doi><unstructured_citation>C. J. Eyckelhof, and M. Snoek, &quot;Ant systems for a dynamic TSP: Ants caught in a traffic jam,&quot; in Proc. ANTS 2002, 2002, pp. 88-89.</unstructured_citation></citation><citation key="ref3"><doi>10.1007/s40747-020-00138-3</doi><unstructured_citation>Yahui Liu, Buyang Co, and Hehua Li, &quot;Improving ant colony optimization algorithm with epsilon greedy and Levy flight,&quot; in Complex and Intelligent Systems, 2020.</unstructured_citation></citation><citation key="ref4"><doi>10.1109/TMAG.2007.892486</doi><unstructured_citation>F. G. Guimaraes, F. Campelo, H. Igarashi, D. A. Lowther, and J. A. Ramirez, &quot;Optimization of cost functions using evolutionary algorithms with local learning and local search,&quot; in IEEE Trans Magn, 2007, pp. 1641-1644.</unstructured_citation></citation><citation key="ref5"><unstructured_citation>C. Qian, Y. Yu, and Z. H. Zhou, &quot;Pareto ensemble pruning,&quot; in Twenty-ninth AAAI Conference on Artificial Intelligence, 2015.</unstructured_citation></citation><citation key="ref6"><doi>10.1109/TEVC.2017.2749263</doi><unstructured_citation>C. Qian, J. C. Shi, K. Tang, and Z. H. Zhou, &quot;Constrained monotone k-submodular function maximization using multiobjective evolutionary algorithms with theoretical guarantee,&quot; in IEEE Trans Evol Comput, 2017, pp. 595-608.</unstructured_citation></citation><citation key="ref7"><doi>10.1007/s10898-016-0417-5</doi><unstructured_citation>T. Weise, Y. Wu, R. Chiong, K. Tang, and J. Lassig, &quot;Global versus local search: The impact of population sizes on evolutionary algorithm performance,&quot; in J Glob Optim, 2016, pp. 511-534.</unstructured_citation></citation><citation key="ref8"><unstructured_citation>Andrei Lissovoi, &quot;Analysis of ant colony optimization for dynamic shortest path problems,&quot; Master's Thesis, Department of Informatics and Mathematical Modeling, Technical University of Denmark, 2012.</unstructured_citation></citation></citation_list>
</doi_citations>
</body>
</doi_batch>
