{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:51:24Z","timestamp":1742982684036,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031008276"},{"type":"electronic","value":"9783031008283"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-00828-3_31","type":"book-chapter","created":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T20:03:31Z","timestamp":1651608211000},"page":"311-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Most Profitable Currency Exchange for ASEAN Countries Using Dijkstra\u2019s Algorithm"],"prefix":"10.1007","author":[{"given":"Riswan","family":"Efendi","sequence":"first","affiliation":[]},{"given":"Sri Widya","family":"Rahayu","sequence":"additional","affiliation":[]},{"given":"Rohaidah","family":"Masri","sequence":"additional","affiliation":[]},{"given":"Nor Azah","family":"Samsudin","sequence":"additional","affiliation":[]},{"family":"Rasyidah","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,4]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.procs.2019.11.298","volume":"162","author":"Y Ma","year":"2019","unstructured":"Ma, Y., Chang, D., Wang, H., Tang, M.: Optimal shipping path algorithm design for coastal port. Proc. Comput. Sci. 162, 375\u2013382 (2019)","journal-title":"Proc. Comput. Sci."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Wei, K., Gao, Y., Zhang, W., Lin, S.: A modified Dijkstra\u2019s algorithm for solving the problem of finding the maximum load path. In: Proceeding of IEEE 2nd ICICT, pp. 10\u201313 (2019)","DOI":"10.1109\/INFOCT.2019.8711024"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"1329","DOI":"10.1007\/s00521-020-05034-y","volume":"33","author":"M Akram","year":"2021","unstructured":"Akram, M., Habib, A., Alcantud, J.C.R.: An optimization study based on Dijkstra algorithm for a network with picture trapezoidal fuzzy number. Neural Comput. Appl. 33, 1329\u20131342 (2021)","journal-title":"Neural Comput. Appl."},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Alam, Md.A., Faruq, Md.O.: Finding shortest path for road network using Dijkstra\u2019s algorithm. Bangladesh J. Multi. Sci. Res. 1, 41\u201345 (2019)","DOI":"10.46281\/bjmsr.v1i2.366"},{"key":"31_CR5","first-page":"25","volume":"1","author":"Y Anshori","year":"2018","unstructured":"Anshori, Y., Joefrie, Y., Nadyanti, Y.: Implementasi algoritma Dijkstra dalam pembuatan aplikasi pesona palu. Sci.: Compt. Sci. Inf. J. 1, 25\u201331 (2018)","journal-title":"Sci.: Compt. Sci. Inf. J."},{"key":"31_CR6","first-page":"27","volume":"6","author":"A Cantona","year":"2020","unstructured":"Cantona, A., Fauziah, F., Winarsih, W.: Implementasi algoritma Dijkstra Pada Pencarian Rute Terpendek ke Museum di Jakarta. J. Tek. Dan Man. Inf. 6, 27\u201334 (2020)","journal-title":"J. Tek. Dan Man. Inf."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.33480\/pilar.v16i1.1199","volume":"16","author":"S Lestari","year":"2020","unstructured":"Lestari, S., Ardiansyah, A., Giovani, A.P., Dwijayanti, D.: Dijkstra algorithm implementation in determining shortest route to mosque in residential Citra Indah City. J. Pilar Nusa Mandiri. 16, 65\u201370 (2020)","journal-title":"J. Pilar Nusa Mandiri."},{"key":"31_CR8","first-page":"8","volume":"7","author":"TS Darmawan","year":"2018","unstructured":"Darmawan, T.S.: Comparison of Dijkstra and Floyd-Warshall algorithm to determine the best route of train. Int. J. Inf. Dev. 7, 8\u201313 (2018)","journal-title":"Int. J. Inf. Dev."},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Bozyi\u011fit A., Alanku\u015f, G., Nasibo\u011flu, E.: Public transport route planning: modified dijkstra\u2019s algorithm. In: Proceeding on Computer Science and Engineering (UBMK), pp. 502\u2013505 (2017)","DOI":"10.1109\/UBMK.2017.8093444"},{"key":"31_CR10","unstructured":"Melissa, Y.: Dijkstra\u2019s algorithm. Lecture note. Massachusetts Institute of Technology, Regexstr (2014)"},{"key":"31_CR11","unstructured":"Sedgewick, R.: Algorithms (4th edition) in Java. Chapter 21 (2011)"},{"key":"31_CR12","first-page":"012061","volume":"1566","author":"D Rachmawati","year":"2020","unstructured":"Rachmawati, D., Gustin, L.: Analysis of Dijkstra\u2019s algorithm and A*Algorithm in shortest path problem. J. Phys. 1566, 012061 (2020)","journal-title":"J. Phys."},{"key":"31_CR13","unstructured":"www.ValutaFx.com"},{"key":"31_CR14","unstructured":"https:\/\/reasonabledeviations.com\/2019\/03\/02\/currency-arbitrage-graphs\/"}],"container-title":["Lecture Notes in Networks and Systems","Recent Advances in Soft Computing and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-00828-3_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T20:05:12Z","timestamp":1651608312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-00828-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031008276","9783031008283"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-00828-3_31","relation":{},"ISSN":["2367-3370","2367-3389"],"issn-type":[{"type":"print","value":"2367-3370"},{"type":"electronic","value":"2367-3389"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"4 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SCDM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Soft Computing and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 May 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"scdm2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/scdm.uthm.edu.my\/scdm2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}