Bellman-Ford 算法和 Dijkstra 算法在多层建筑中优化疏散路线规划的比较分析

{"title":"Bellman-Ford 算法和 Dijkstra 算法在多层建筑中优化疏散路线规划的比较分析","authors":"Ritesh Bhat, P. K. Rao, C. R. Kamath, Vipin Tandon, Prashant Vizzapu","doi":"10.1080/23311916.2024.2319394","DOIUrl":null,"url":null,"abstract":"","PeriodicalId":10464,"journal":{"name":"Cogent Engineering","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2024-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Comparative analysis of Bellman-Ford and Dijkstra’s algorithms for optimal evacuation route planning in multi-floor buildings\",\"authors\":\"Ritesh Bhat, P. K. Rao, C. R. Kamath, Vipin Tandon, Prashant Vizzapu\",\"doi\":\"10.1080/23311916.2024.2319394\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"\",\"PeriodicalId\":10464,\"journal\":{\"name\":\"Cogent Engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-04-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Cogent Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/23311916.2024.2319394\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cogent Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/23311916.2024.2319394","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}