{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T09:34:36Z","timestamp":1780047276099,"version":"3.53.1"},"reference-count":43,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T00:00:00Z","timestamp":1614902400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Malaysia FRGS","award":["[FRGS\/1\/2018\/TK08\/MMU\/02\/1]"],"award-info":[{"award-number":["[FRGS\/1\/2018\/TK08\/MMU\/02\/1]"]}]},{"DOI":"10.13039\/501100010693","name":"TM","doi-asserted-by":"publisher","award":["[MMUE\/180025]"],"award-info":[{"award-number":["[MMUE\/180025]"]}],"id":[{"id":"10.13039\/501100010693","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Symmetry"],"abstract":"<jats:p>The shortest path-searching with the minimal weight for multiple destinations is a crucial need in an indoor applications, especially in supermarkets, warehouses, libraries, etc. However, when it is used for multiple item searches, its weight becomes higher as it searches only the shortest path between the single sources to each destination item separately. If the conventional Dijkstra algorithm is modified to multi-destination mode then the weight is decreased, but the output path is not considered as the real shortest path among multiple destinations items. Our proposed algorithm is more efficient for finding the shortest path among multiple destination items with minimum weight, compared to the single source single destination and modified multi-destinations of Dijkstra\u2019s algorithm. In this research, our proposed method has been validated by real-world data as well as by simulated random solutions. Our advancement is more applicable in indoor environment applications based on multiple items or destinations searching.<\/jats:p>","DOI":"10.3390\/sym13030421","type":"journal-article","created":{"date-parts":[[2021,3,5]],"date-time":"2021-03-05T11:46:09Z","timestamp":1614944769000},"page":"421","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["An Efficient Shortest Path Algorithm: Multi-Destinations in an Indoor Environment"],"prefix":"10.3390","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6378-5931","authenticated-orcid":false,"given":"Mina","family":"Asaduzzaman","sequence":"first","affiliation":[{"name":"Faculty of Information Science and Technology, Multimedia University, Melaka 75450, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tan Kim","family":"Geok","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Technology, Multimedia University, Melaka 75450, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0444-7320","authenticated-orcid":false,"given":"Ferdous","family":"Hossain","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Technology, Multimedia University, Melaka 75450, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shohel","family":"Sayeed","sequence":"additional","affiliation":[{"name":"Faculty of Information Science and Technology, Multimedia University, Melaka 75450, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Azlan","family":"Abdaziz","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Technology, Multimedia University, Melaka 75450, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hin-Yong","family":"Wong","sequence":"additional","affiliation":[{"name":"Faculty of Engineering, Multimedia University, Cyberjaya 63100, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C. P.","family":"Tso","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Technology, Multimedia University, Melaka 75450, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sharif","family":"Ahmed","sequence":"additional","affiliation":[{"name":"Faculty of Engineering and Technology, Multimedia University, Melaka 75450, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Md Ahsanul","family":"Bari","sequence":"additional","affiliation":[{"name":"Faculty of Information Science and Technology, Multimedia University, Melaka 75450, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2021,3,5]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Adamatzky, A. (2018). Shortest Path Solvers. From Software to Wetware, Springer.","DOI":"10.1007\/978-3-319-77510-4"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/s10618-011-0224-z","article-title":"Community detection in social media, performance and application considerations","volume":"24","author":"Papadopoulos","year":"2012","journal-title":"J. Data Min. Knowl. Discov."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Kwon, Y.S., and Sohn, M.Y. (2020). Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5. Symmetry, 12.","DOI":"10.3390\/sym12121944"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Yang, L., Li, D., and Tan, R. (2020). Shortest Path Solution of Trapezoidal Fuzzy Neutrosophic Graph Based on Circle-Breaking Algorithm. Symmetry, 12.","DOI":"10.3390\/sym12081360"},{"key":"ref_5","unstructured":"Kalaitzakis, A. (1939). Comparative Study of Community Detection Algorithms in Social Networks. [Ph.D. Thesis, Technological Educational Institute of Crete]."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","article-title":"Routing to Multiple Destinations in Computer Networks","volume":"31","author":"Jaffe","year":"1983","journal-title":"IEEE Trans. Commun."},{"key":"ref_7","unstructured":"Ben Ticha, H., and Absi, N. (2017). A Solution Method for the Multi-Destination Bi-Objectives Shortest Path Problem, Elsevier."},{"key":"ref_8","first-page":"3620895","article-title":"Disordered and Multiple Destinations Path Planning Methods for Mobile Robot in Dynamic Environment","volume":"2016","author":"Dong","year":"2016","journal-title":"J. Electr. Comput. Eng."},{"key":"ref_9","first-page":"154","article-title":"An Algorithm to Select the Optimal Composition of the Services","volume":"8","author":"Sepehrifar","year":"2009","journal-title":"J. Theor. Appl. Inf. Technol."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1504\/IJGUC.2020.108456","article-title":"Evaluation of navigation based on system optimal traffic assignment for connected cars","volume":"11","author":"Wang","year":"2020","journal-title":"Int. J. Grid Util. Comput."},{"key":"ref_11","unstructured":"Burga\u00f1a, J.L. (2017). Design and evaluation of a link-state routing protocol for Internet-Wide Geocasting. [Master\u2019s Thesis, University of Twente]."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"3223","DOI":"10.1007\/s13369-020-04340-w","article-title":"Shortest Path Computation in a Network with Multiple Destinations","volume":"45","author":"Sepehrifar","year":"2020","journal-title":"Arab. J. Sci. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Jubair, F., and Hawa, M. (2020). Exploiting Obstacle Geometry to Reduce Search Time in Grid-Based Pathfinding. Symmetry, 12.","DOI":"10.3390\/sym12071186"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1016\/j.akcej.2019.12.011","article-title":"A survey on pairwise compatibility graphs","volume":"17","author":"Rahman","year":"2020","journal-title":"AKCE Int. J. Graphs Comb."},{"key":"ref_15","first-page":"102","article-title":"An enhanced view of incidence functions for applying graph theory to modeling network intrusions","volume":"15","author":"Easttom","year":"2020","journal-title":"WSEAS Trans. Inf. Sci. Appl."},{"key":"ref_16","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., and Stein, C. (2009). Introduction to Algorithms, MIT Press."},{"key":"ref_17","first-page":"772","article-title":"A Path-Compression Approach for Improving Shortest-Path Algorithms","volume":"5","author":"Arman","year":"2015","journal-title":"Int. J. Electr. Comput. Eng."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Hakeem, A., Gehani, N., Ding, X., Curtmola, R., and Borcea, C. (2019, January 12\u201314). Multi-destination vehicular route planning with parking and traffic constraints. Proceedings of the 16th EAI International Conference on Mobile and Ubiquitous Systems: Computing, Networking and Services, Houston, TX, USA.","DOI":"10.1145\/3360774.3360824"},{"key":"ref_19","first-page":"757","article-title":"Optimal Route Planning System for Logistics Vehicles Based on Artificial Intelligence","volume":"21","author":"Hu","year":"2020","journal-title":"J. Internet Technol."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"47993","DOI":"10.1109\/ACCESS.2020.2979687","article-title":"Optimal Mobile Relays Positions and Resource Allocation for Multi-Relay Multi-Destination Wireless Networks","volume":"8","author":"Li","year":"2020","journal-title":"IEEE Access"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"An\u0111eli\u0107, M., and \u017divkovi\u0107, D. (2020). Efficient Algorithm for Generating Maximal L-Reflexive Trees. Symmetry, 12.","DOI":"10.3390\/sym12050809"},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Zhang, H., and Zhang, Z. (2020). AOA-Based Three-Dimensional Positioning and Tracking Using the Factor Graph Technique. Symmetry, 12.","DOI":"10.3390\/sym12091400"},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Pani\u0107, B., Kontrec, N., Vujo\u0161evi\u0107, M., and Pani\u0107, S. (2020). A Novel Approach for Determination of Reliability of Covering a Node from K Nodes. Symmetry, 12.","DOI":"10.3390\/sym12091461"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Slamin, S., Adiwijaya, N.O., Hasan, M.A., Dafik, D., and Wijaya, K. (2020). Local Super Antimagic Total Labeling for Vertex Coloring of Graphs. Symmetry, 12.","DOI":"10.3390\/sym12111843"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, A.C., Garc\u00eda, S.C., Garc\u00eda, A.C., and Del Rio, A.M.G. (2020). On the Outer-Independent Roman Domination in Graphs. Symmetry, 12.","DOI":"10.3390\/sym12111846"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Mart\u00ednez, A.C., Estrada-Moreno, A., and Rodr\u00edguez-Vel\u00e1zquez, J.A. (2020). Secure w-Domination in Graphs. Symmetry, 12.","DOI":"10.3390\/sym12121948"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Lv, Y., Liu, M., and Xiang, Y. (2020). Fast Searching Density Peak Clustering Algorithm Based on Shared Nearest Neighbor and Adaptive Clustering Center. Symmetry, 12.","DOI":"10.3390\/sym12122014"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/j.ejor.2012.09.045","article-title":"Hierarchical approach for survivable network design","volume":"225","author":"Balakrishnan","year":"2013","journal-title":"Eur. J. Oper. Res."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"J. ACM"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Qu, T., and Cai, Z. (2015). A Fast Isomap Algorithm Based on Fibonacci Heap. International Conference in Swarm Intelligence, Springer.","DOI":"10.1007\/978-3-319-20469-7_25"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"6401","DOI":"10.1016\/j.amc.2011.01.019","article-title":"Finding the shortest paths by node combination","volume":"217","author":"Lu","year":"2011","journal-title":"Appl. Math. Comput."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.jda.2009.03.001","article-title":"A faster algorithm for the single source shortest path problem with few distinct positive lengths","volume":"8","author":"Orlin","year":"2010","journal-title":"J. Discret. Algorithms"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1145\/316542.316548","article-title":"Undirected single-source shortest paths with positive integer weights in linear time","volume":"46","author":"Thorup","year":"1999","journal-title":"J. ACM"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S0097539795288246","article-title":"On RAM Priority Queues","volume":"30","author":"Thorup","year":"2000","journal-title":"SIAM J. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"MacCormick, J. (2018). What Can Be Computed? A Practical Guide to the Theory of Computation, Princeton University Press.","DOI":"10.1353\/book.109720"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/j.amc.2006.06.094","article-title":"An improved Dijkstra\u2019s shortest path algorithm for sparse network","volume":"185","author":"Xu","year":"2007","journal-title":"Appl. Math. Comput."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1145\/1064546.1180616","article-title":"Combining speed-up techniques for shortest-path computations","volume":"10","author":"Holzer","year":"2005","journal-title":"ACM J. Exp. Algorithmics"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/j.proeng.2014.04.023","article-title":"Path Optimization Study for Vehicles Evacuation based on Dijkstra Algorithm","volume":"71","author":"Chen","year":"2014","journal-title":"Procedia Eng."},{"key":"ref_39","unstructured":"Madkour, A., Aref, W.G., Rehman, F.U., Rahman, M.A., and Basalamah, S. (2017). A survey of shortest-path algorithms. arXiv."},{"key":"ref_40","unstructured":"Okengwu, U.A., Nwachukwu, E.O., and Osegi, E.N. (2015). Modified Dijkstra algorithm with invention hierarchies applied to a conic graph. arXiv."},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s10957-018-1386-2","article-title":"Priority-Oriented Route Network Planning for Evacuation in Constrained Space Scenarios","volume":"181","author":"Hong","year":"2019","journal-title":"J. Optim. Theory Appl."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"2975","DOI":"10.1016\/j.cor.2013.07.005","article-title":"Finding the K shortest paths in a time-schedule network with constraints on arcs","volume":"40","author":"Jin","year":"2013","journal-title":"Comput. Oper. Res."},{"key":"ref_43","first-page":"21017","article-title":"Multicasting with the extended Dijkstra\u2019s shortest path algorithm for software defined networking","volume":"9","author":"Ananta","year":"2014","journal-title":"Int. J. Appl. Eng. Res."}],"container-title":["Symmetry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/3\/421\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T05:33:25Z","timestamp":1760160805000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-8994\/13\/3\/421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,5]]},"references-count":43,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2021,3]]}},"alternative-id":["sym13030421"],"URL":"https:\/\/doi.org\/10.3390\/sym13030421","relation":{},"ISSN":["2073-8994"],"issn-type":[{"value":"2073-8994","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,5]]}}}