{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:56:58Z","timestamp":1770994618990,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"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":["Soft Comput"],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1007\/s00500-022-06871-w","type":"journal-article","created":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T08:04:33Z","timestamp":1646640273000},"page":"3217-3226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":24,"title":["An improved weighted sum-fuzzy Dijkstra\u2019s algorithm for shortest path problem (iWSFDA)"],"prefix":"10.1007","volume":"26","author":[{"given":"Chanchal","family":"Dudeja","sequence":"first","affiliation":[]},{"given":"Pawan","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,7]]},"reference":[{"key":"6871_CR1","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/978-3-030-00045-5_25","volume-title":"Fuzzy multi-criteria decision-making using neutrosophic sets","author":"E Bolt\u00fcrk","year":"2019","unstructured":"Bolt\u00fcrk E, Kara\u015fan A, Kahraman C (2019) Simple additive weighting and weighted product methods using neutrosophic sets. Fuzzy multi-criteria decision-making using neutrosophic sets. Springer, Cham, pp 647\u2013676"},{"issue":"7","key":"6871_CR2","doi-asserted-by":"publisher","first-page":"1092","DOI":"10.1080\/00405000.2018.1541434","volume":"110","author":"Z Chourabi","year":"2019","unstructured":"Chourabi Z, Khedher F, Babay A, Cheikhrouhou M (2019) Multi-criteria decision making in workforce choice using AHP, WSM and WPM. J Text Inst 110(7):1092\u20131101","journal-title":"J Text Inst"},{"issue":"10","key":"6871_CR3","doi-asserted-by":"publisher","first-page":"6733","DOI":"10.1007\/s00521-018-3505-2","volume":"31","author":"N Deepa","year":"2019","unstructured":"Deepa N, Ganesan K, Sethuramasamyraja B (2019) Predictive mathematical model for solving multi-criteria decision-making problems. Neural Comput Appl 31(10):6733\u20136746","journal-title":"Neural Comput Appl"},{"key":"6871_CR4","doi-asserted-by":"crossref","unstructured":"Dewangan RK, Shukla A and Godfrey WW (2019) Path planning for multiple mobile robots by priority assignment. In: Computational intelligence: theories, applications and future directions, II: 161\u2013172.","DOI":"10.1007\/978-981-13-1135-2_13"},{"issue":"17","key":"6871_CR5","doi-asserted-by":"publisher","first-page":"8321","DOI":"10.1007\/s00500-019-04112-1","volume":"23","author":"C Dudeja","year":"2019","unstructured":"Dudeja C (2019) Fuzzy-based modified particle swarm optimization algorithm for shortest path problems. Soft Comput 23(17):8321\u20138331","journal-title":"Soft Comput"},{"issue":"3","key":"6871_CR6","doi-asserted-by":"crossref","first-page":"1085","DOI":"10.3934\/jimo.2018086","volume":"15","author":"S Erg\u00fcn","year":"2019","unstructured":"Erg\u00fcn S, G\u00f6k SZA, Aydo\u01e7an T, Weber GW (2019) Performance analysis of a cooperative flow game algorithm in ad hoc networks and a comparison to Dijkstra\u2019s algorithm. J Ind Manag Opt 15(3):1085\u20131100","journal-title":"J Ind Manag Opt"},{"key":"6871_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.jclepro.2019.02.0424","author":"LMS Farias","year":"2019","unstructured":"Farias LMS, Santos LC, Gohr CF, de Oliveira LC, da Silva Amorim MH (2019) Criteria and practices for lean and green performance assessment: systematic review and conceptual framework. J Cleaner Prod. https:\/\/doi.org\/10.1016\/j.jclepro.2019.02.0424","journal-title":"J Cleaner Prod"},{"issue":"1115\/1","key":"6871_CR8","first-page":"4044326","volume":"10","author":"GA Hazelrigg","year":"2019","unstructured":"Hazelrigg GA (2019) A note on the weighted sum method. J Mech Des 10(1115\/1):4044326","journal-title":"J Mech Des"},{"key":"6871_CR9","unstructured":"He E, Boland N, Nemhauser G and Savelsbergh M (2019) Computational complexity of time-dependent shortest path problems. Optimization Online, 12."},{"key":"6871_CR10","unstructured":"Hua TK and Abdullah N Weighted Sum-Dijkstra\u2019s Algorithm in Best Path Identification based on Multiple Criteria."},{"issue":"1","key":"6871_CR11","doi-asserted-by":"publisher","first-page":"5","DOI":"10.3390\/mti4010005","volume":"4","author":"K Kabassi","year":"2020","unstructured":"Kabassi K, Karydis C, Botonis A (2020) AHP, Fuzzy SAW, and Fuzzy WPM for the Evaluation of Cultural Websites. Multimodal Technol Interact 4(1):5","journal-title":"Multimodal Technol Interact"},{"key":"6871_CR12","unstructured":"Kainer M and Tr\u00e4ff JL (2019) More parallelism in Dijkstra's single-source shortest path algorithm. arXiv preprint arXiv:1903.12085."},{"key":"6871_CR13","doi-asserted-by":"publisher","DOI":"10.1145\/3335772.3335782","volume-title":"Concurrency: the works of leslie lamport","author":"L Lamport","year":"2019","unstructured":"Lamport L (2019) A new solution of Dijkstra\u2019s concurrent programming problem. In: Malkhi D (ed) Concurrency: the works of leslie lamport. Association for Computing Machinery. https:\/\/doi.org\/10.1145\/3335772.3335782"},{"key":"6871_CR14","doi-asserted-by":"publisher","DOI":"10.14569\/IJACSA.2019.0100548","author":"R Masadeh","year":"2019","unstructured":"Masadeh R, Basel A, Sharieh A (2019) Sea lion optimization algorithm. Int J Adv Comput Sci Appl. https:\/\/doi.org\/10.14569\/IJACSA.2019.0100548","journal-title":"Int J Adv Comput Sci Appl"},{"key":"6871_CR15","doi-asserted-by":"publisher","first-page":"121538","DOI":"10.1016\/j.physa.2019.121538","volume":"529","author":"H Mo","year":"2019","unstructured":"Mo H, Deng Y (2019) Identifying node importance based on evidence theory in complex networks. Physica A: Stat Mech Appl 529:121538","journal-title":"Physica A: Stat Mech Appl"},{"key":"6871_CR16","doi-asserted-by":"crossref","unstructured":"Prakash BG, Chelliah CB and Ramanujam RS (2019) HHFDS: Heterogeneous hybridized fuzzy\u2010based Dijkstra's multitask scheduling in WSN. Concurrency and Computation: Practice and Experience, e5354.","DOI":"10.1002\/cpe.5354"},{"issue":"5","key":"6871_CR17","doi-asserted-by":"publisher","first-page":"1040","DOI":"10.3390\/s19051040","volume":"19","author":"M Razzaq","year":"2019","unstructured":"Razzaq M, Shin S (2019) Fuzzy-logic dijkstra-based energy-efficient algorithm for data transmission in WSNs. Sensors 19(5):1040","journal-title":"Sensors"},{"key":"6871_CR18","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-030-25209-0_10","volume-title":"Sequential and parallel algorithms and data structures: the basic toolbox","author":"P Sanders","year":"2019","unstructured":"Sanders P, Mehlhorn K, Dietzfelbinger M, Dementiev R (2019) Shortest paths. In: Sanders P, Mehlhorn K, Dietzfelbinger M, Dementiev R (eds) Sequential and parallel algorithms and data structures: the basic toolbox. Springer International Publishing, Cham, pp 301\u2013332. https:\/\/doi.org\/10.1007\/978-3-030-25209-0_10"},{"issue":"3","key":"6871_CR19","doi-asserted-by":"publisher","first-page":"57","DOI":"10.13189\/ms.2019.070301","volume":"7","author":"S Sorooshian","year":"2019","unstructured":"Sorooshian S, Parsia Y (2019) Modified Weighted Sum Method for Decisions with Altered Sources of Information. Mathematics and Statistics 7(3):57\u201360","journal-title":"Mathematics and Statistics"},{"key":"6871_CR20","doi-asserted-by":"crossref","unstructured":"Yamaguchi Y (2019) A Dijkstra-based efficient algorithm for finding a shortest non-zero path in group-labeled graphs. arXiv preprint arXiv:1906.04062.","DOI":"10.1137\/1.9781611975994.118"},{"key":"6871_CR21","unstructured":"Yamane Y and Kobayashi K (2019) A New Fast Weighted all-pairs shortest path search algorithm based on pruning by shortest path trees. arXiv preprint arXiv:1908.06798."},{"key":"6871_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2019\/9728742","volume":"2019","author":"Y Yang","year":"2019","unstructured":"Yang Y, Lei Y, Zhou Z, Chen Y, Kou T (2019) Node importance ranking in complex networks based on multicriteria decision making. Math Prob Eng 2019:1\u201312. https:\/\/doi.org\/10.1155\/2019\/9728742","journal-title":"Math Prob Eng"},{"issue":"12","key":"6871_CR23","doi-asserted-by":"publisher","first-page":"4262","DOI":"10.1109\/TITS.2018.2883766","volume":"20","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Wang J, Yang H (2019) Resilience of transportation systems: concepts and comprehensive review. IEEE Trans Intell Trans Syst 20(12):4262\u20134276. https:\/\/doi.org\/10.1109\/TITS.2018.2883766","journal-title":"IEEE Trans Intell Trans Syst"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-06871-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-022-06871-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-022-06871-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T21:20:55Z","timestamp":1726780855000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-022-06871-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,7]]},"references-count":23,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,4]]}},"alternative-id":["6871"],"URL":"https:\/\/doi.org\/10.1007\/s00500-022-06871-w","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,7]]},"assertion":[{"value":"12 January 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Chanchal\u00a0Dudeja\u00a0and\u00a0Pawan Kumar\u00a0declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}