{"id":"https://openalex.org/W4405704887","doi":"https://doi.org/10.1142/s0218488524500302","title":"Enhanced Non-Dominated Sorting Genetic Algorithms for Uncertain Multi-Objective Shortest Path Problem: Application to Fire Prevention Services","display_name":"Enhanced Non-Dominated Sorting Genetic Algorithms for Uncertain Multi-Objective Shortest Path Problem: Application to Fire Prevention Services","publication_year":2024,"publication_date":"2024-11-01","ids":{"openalex":"https://openalex.org/W4405704887","doi":"https://doi.org/10.1142/s0218488524500302"},"language":"en","primary_location":{"id":"doi:10.1142/s0218488524500302","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218488524500302","pdf_url":null,"source":{"id":"https://openalex.org/S69518169","display_name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","issn_l":"0218-4885","issn":["0218-4885","1793-6411"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5052572970","display_name":"Aniket Todkar","orcid":"https://orcid.org/0000-0003-2481-1898"},"institutions":[{"id":"https://openalex.org/I42014448","display_name":"Sardar Vallabhbhai National Institute of Technology Surat","ror":"https://ror.org/02y394t43","country_code":"IN","type":"education","lineage":["https://openalex.org/I42014448"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Aniket S. Todkar","raw_affiliation_strings":["Department of Mathematics, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat, India","institution_ids":["https://openalex.org/I42014448"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034926746","display_name":"Jayesh M. Dhodiya","orcid":"https://orcid.org/0000-0001-9675-412X"},"institutions":[{"id":"https://openalex.org/I42014448","display_name":"Sardar Vallabhbhai National Institute of Technology Surat","ror":"https://ror.org/02y394t43","country_code":"IN","type":"education","lineage":["https://openalex.org/I42014448"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jayesh M. Dhodiya","raw_affiliation_strings":["Department of Mathematics, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Sardar Vallabhbhai National Institute of Technology, Surat, Gujarat, India","institution_ids":["https://openalex.org/I42014448"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5052572970"],"corresponding_institution_ids":["https://openalex.org/I42014448"],"apc_list":null,"apc_paid":null,"fwci":0.9037,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.76426011,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":98},"biblio":{"volume":"32","issue":"08","first_page":"1215","last_page":"1244"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10050","display_name":"Multi-Criteria Decision Making","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.7758850455284119},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7190568447113037},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5791136026382446},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5490657091140747},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.531389594078064},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4433276355266571},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4410012364387512},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.2438497245311737},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19129815697669983},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.16557440161705017},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06973055005073547},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.06972160935401917}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.7758850455284119},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7190568447113037},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5791136026382446},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5490657091140747},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.531389594078064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4433276355266571},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4410012364387512},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.2438497245311737},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19129815697669983},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16557440161705017},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06973055005073547},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06972160935401917}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218488524500302","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218488524500302","pdf_url":null,"source":{"id":"https://openalex.org/S69518169","display_name":"International Journal of Uncertainty Fuzziness and Knowledge-Based Systems","issn_l":"0218-4885","issn":["0218-4885","1793-6411"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":32,"referenced_works":["https://openalex.org/W33891176","https://openalex.org/W119169328","https://openalex.org/W566531027","https://openalex.org/W782650926","https://openalex.org/W1928381443","https://openalex.org/W1998259641","https://openalex.org/W2007572995","https://openalex.org/W2022485595","https://openalex.org/W2026221530","https://openalex.org/W2031294154","https://openalex.org/W2034204928","https://openalex.org/W2046236705","https://openalex.org/W2048608180","https://openalex.org/W2062568266","https://openalex.org/W2066426639","https://openalex.org/W2071736369","https://openalex.org/W2116661285","https://openalex.org/W2128530362","https://openalex.org/W2144050074","https://openalex.org/W2156431668","https://openalex.org/W2167159964","https://openalex.org/W2169528473","https://openalex.org/W2227557434","https://openalex.org/W2469035159","https://openalex.org/W2484638022","https://openalex.org/W2727425522","https://openalex.org/W2809617364","https://openalex.org/W2899474162","https://openalex.org/W2981896566","https://openalex.org/W3082809801","https://openalex.org/W4285142406","https://openalex.org/W4394965673"],"related_works":["https://openalex.org/W2739612537","https://openalex.org/W2349174696","https://openalex.org/W2360241746","https://openalex.org/W3006936859","https://openalex.org/W2040827484","https://openalex.org/W1987040457","https://openalex.org/W2378502887","https://openalex.org/W2366525864","https://openalex.org/W2184492720","https://openalex.org/W2731989356"],"abstract_inverted_index":{"This":[0],"paper":[1],"examines":[2],"a":[3,14,82],"multi-objective":[4,53],"shortest":[5],"path":[6],"problem":[7,86],"(MOSPP)":[8],"under":[9],"an":[10,80],"uncertain":[11,19,26,35],"environment":[12],"for":[13],"directed":[15],"graph.":[16],"The":[17,28],"zigzag":[18],"variables":[20],"are":[21,77],"used":[22],"to":[23,125],"represent":[24],"the":[25,74,91,100,118,127,130,133],"parameters.":[27],"expected":[29],"and":[30,41,57,71,103,121],"optimistic":[31],"value":[32],"models":[33,76],"of":[34,93,109,129],"MOSPP":[36],"(UMOSPP)":[37],"have":[38],"been":[39,88,114],"formulated,":[40],"their":[42],"correlated":[43],"deterministic":[44,75],"transformation":[45],"is":[46,97,137],"also":[47,113],"provided.":[48],"Moreover,":[49],"using":[50],"three":[51],"existing":[52],"genetic":[54,68],"algorithms":[55],"(MOGAs)":[56],"two":[58],"proposed":[59,101,131],"aspiration":[60,122],"level":[61],"(AL)":[62],"based":[63],"algorithms:":[64],"AL-based":[65,72],"non-dominated":[66],"sorting":[67],"algorithm":[69],"(NSGA)-II,":[70],"NSGA-III,":[73],"solved.":[78],"As":[79],"application,":[81],"mock":[83],"fire":[84],"drill":[85],"has":[87,112],"considered":[89],"in":[90],"context":[92],"UMOSPP.":[94],"A":[95,106],"comparison":[96],"presented":[98],"between":[99],"methods":[102],"several":[104],"MOGAs.":[105],"sensitivity":[107],"analysis":[108],"objective":[110],"functions":[111],"carried":[115],"out":[116],"regarding":[117],"shape":[119],"parameter":[120],"level.":[123],"Finally,":[124],"show":[126],"effectiveness":[128],"methods,":[132],"performance":[134],"measure":[135],"coverage":[136],"calculated.":[138]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2}],"updated_date":"2026-05-21T09:19:25.381259","created_date":"2025-10-10T00:00:00"}