<?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>67ee4b03-09a2-4815-b03f-27508e21d41e</doi_batch_id>
<depositor>
<name>beie</name>
<email_address>director@blueeyesintelligence.org</email_address>
</depositor>
</head>
<body>
<doi_citations>
<doi>10.35940/ijitee.F8786.0410621</doi>
<citation_list><citation key="ref0"><unstructured_citation>LV H.L., WANG J.L. &amp; DENG F, A Recommendation Algorithm for Individualized Travelling Route. Network New Media</unstructured_citation></citation><citation key="ref1"><unstructured_citation>Ying Xu, Tao Hu, Ying Li &quot;A Travel Route Recommendation Algorithm with Personal Preference&quot; 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD) 2016</unstructured_citation></citation><citation key="ref2"><doi>10.1109/CyberC.2016.81</doi><unstructured_citation>N. Ganganath, C.-T. Cheng, and C. K. Tse, &quot;Rapidly replanning A*,&quot; in International Conference on Cyber Enabled Distributed Computing and Knowledge Discovery (CyberC). IEEE, 2016, pp. 386-389.</unstructured_citation></citation><citation key="ref3"><doi>10.1016/j.artint.2007.11.009</doi><unstructured_citation>M. Likhachev, D. Ferguson, G. Gordon, A. Stentz, and S. Thrun, &quot;Anytime search in dynamic graphs,&quot; Artificial Intelligence, vol. 172, no. 14, pp. 1613 - 1643, 2008.</unstructured_citation></citation><citation key="ref4"><unstructured_citation>Alshattnawi, Sawsan &amp; Doush, Iyad &amp; Alsobeh, Anas. (2019). ONLINE MOBILE-BASED PERSONAL TOUR APPLICATION USING ARTIFICIAL BEE COLONY OPTIMIZATION ALGORITHM. Journal of Theoretical and Applied Information Technology.</unstructured_citation></citation><citation key="ref5"><doi>10.1109/TII.2015.2413355</doi><unstructured_citation>N. Ganganath, C.-T. Cheng, and C. K. Tse, &quot;A constraint-aware heuristic path planner for finding energy-efficient paths on uneven terrains,&quot; IEEE Transactions on Industrial Informatics, vol. 11, no. 3, pp. 601-611,2015.</unstructured_citation></citation><citation key="ref6"><unstructured_citation>Wanmai Yuan, Nuwan Ganganath, Chi-Tsun Cheng, Guo Qing, and Francis C.M. Lau &quot;A Consistent Heuristic for Efficient Path Planning on Mobility Maps&quot; Department of Electronic and Information Engineering, the Hong Kong Polytechnic University (Projects RUWM and GYBKH) and NSF of China (Grant No. 61372095).</unstructured_citation></citation><citation key="ref7"><unstructured_citation>Kazuya Murata and Takayuki Fujimoto &quot;Proposal of Multiple Travel Scheduling System based on Inverse Operation Method&quot; 978-14799- 8679-8/15/$31.00 copyright 2015 IEEE ICIS 2015 June 28-July 1 2015, Las Vegas, USA.</unstructured_citation></citation><citation key="ref8"><unstructured_citation>Kanak Divya &quot;Study and reviews of smart city-based tourism mobile app&quot;. International Journal of Computer Trends and Technology (IJCTT) V35(5):226-230, May 2016. ISSN:2231-2803. www.ijcttjournal.org. Published by Seventh Sense Research Group</unstructured_citation></citation><citation key="ref9"><unstructured_citation>Achaliya, Parag. (2012). Smart Travel Guide: Application for Android Mobile.</unstructured_citation></citation><citation key="ref10"><unstructured_citation>https://www.researchgate.net/figure/2714580 21_fig2_Figure-2-Classification-of-DynamicRoute-Planning-Algorithms</unstructured_citation></citation><citation key="ref11"><unstructured_citation>Chin-Jung Huang, Ying-Hong Lin,The Approximate Shortest Distance Route Intelligent System for Travelling for Taiwan Innovative Computing Information and Control, 2006</unstructured_citation></citation><citation key="ref12"><unstructured_citation>K. Ogawa, Y. Sugimoto, K. Naito, T. Hishida, T. Mizuno, &quot;Basic design of a sightseeing recommendation system using Characteristic Words&quot;, IPSJ SIG technical reports 2014-MBL-71(14), 16, 2014-05-08.</unstructured_citation></citation><citation key="ref13"><doi>10.1080/08839510802379626</doi><unstructured_citation>W. Souffriau, P. Vansteenwegen, J. Vertommen, G. V. Berghe, and D. V. Oudheusden. a Personalized Tourist Trip Design Algorithm for Mobile Tourist Guides. Applied Artificial Intelligence, 22(10):964- 985, Oct. 2008.</unstructured_citation></citation><citation key="ref14"><doi>10.1109/ICDE.1993.344080</doi><unstructured_citation>S. Shekhar, A. Kohli and M. Coyle, &quot;Path computation algorithms for advanced traveler information system (ATIS),&quot; Proceedings of IEEE 9th International Conference on Data Engineering, Vienna, Austria, 1993, pp. 31-39, doi: 10.1109/ICDE.1993.344080.</unstructured_citation></citation><citation key="ref15"><unstructured_citation>JianMeng, NengXu, &quot;A Mobile Tourist Guide System Based on Mashup Technology &quot;ISBN978-1-4244- 7618-3 /10 ©2010 IEEE.</unstructured_citation></citation><citation key="ref16"><journal_title>10</journal_title><author>Glabowski</author><cYear>2014</cYear><doi>10.1007/978-3-319-01622-1_36</doi><article_title>An Algorithm for Finding Shortest Path Tree Using Ant Colony Optimization Metaheuristic</article_title><unstructured_citation>Glabowski, Mariusz &amp; Musznicki, Bartosz &amp; Nowak, Przemysław &amp; Zwierzykowski, Piotr. (2014). An Algorithm for Finding Shortest Path Tree Using Ant Colony Optimization Metaheuristic. 10.1007/978-3-319-01622-1_36.</unstructured_citation></citation><citation key="ref17"><unstructured_citation>&quot;Smart City Traveller&quot;, International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.7, Issue 2, page no. pp279-284, February 2020</unstructured_citation></citation><citation key="ref18"><unstructured_citation>en.wikipedia.org</unstructured_citation></citation></citation_list>
</doi_citations>
</body>
</doi_batch>
