{"id":"https://openalex.org/W4311508041","doi":"https://doi.org/10.1142/s0218488522500337","title":"Ant Lion Optimized Lexicographic Model for Shortest Path Identification","display_name":"Ant Lion Optimized Lexicographic Model for Shortest Path Identification","publication_year":2022,"publication_date":"2022-12-01","ids":{"openalex":"https://openalex.org/W4311508041","doi":"https://doi.org/10.1142/s0218488522500337"},"language":"en","primary_location":{"id":"doi:10.1142/s0218488522500337","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218488522500337","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/A5057543537","display_name":"Sunita Kumawat","orcid":"https://orcid.org/0000-0002-6802-0230"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sunita Kumawat","raw_affiliation_strings":["Department of Mathematics, Amity School of Applied Sciences, Amity University Haryana, Gurugram 122413, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Amity School of Applied Sciences, Amity University Haryana, Gurugram 122413, India","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5038395173","display_name":"Chanchal Dudeja","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chanchal Dudeja","raw_affiliation_strings":["Department of Mathematics, Amity School of Applied Sciences, Amity University Haryana, Gurugram 122413, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Amity School of Applied Sciences, Amity University Haryana, Gurugram 122413, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100711939","display_name":"Pawan Kumar","orcid":"https://orcid.org/0000-0003-4140-1006"},"institutions":[{"id":"https://openalex.org/I4210133503","display_name":"Central University of Haryana","ror":"https://ror.org/03mtwkv54","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210133503"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Pawan Kumar","raw_affiliation_strings":["Department of Mathematics, Central University of Haryana, Mahendergarh 123031, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Central University of Haryana, Mahendergarh 123031, India","institution_ids":["https://openalex.org/I4210133503"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038395173"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1487,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.41993932,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":"30","issue":"06","first_page":"1065","last_page":"1087"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9746999740600586,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9746999740600586,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11344","display_name":"Traffic Prediction and Management Techniques","score":0.9297000169754028,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9218999743461609,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.8773846626281738},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6642906665802002},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.6605858206748962},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.5985189080238342},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5979995131492615},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.5181942582130432},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.4962678551673889},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.49528828263282776},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.45826229453086853},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.4269244074821472},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.42393261194229126},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4131217300891876},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27787813544273376},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.2735264301300049},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.12154772877693176}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8773846626281738},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6642906665802002},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.6605858206748962},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5985189080238342},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5979995131492615},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.5181942582130432},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.4962678551673889},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.49528828263282776},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.45826229453086853},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.4269244074821472},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.42393261194229126},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4131217300891876},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27787813544273376},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.2735264301300049},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12154772877693176},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0218488522500337","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0218488522500337","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W414544266","https://openalex.org/W427224453","https://openalex.org/W1709218714","https://openalex.org/W1857943312","https://openalex.org/W1868857639","https://openalex.org/W2055763674","https://openalex.org/W2065329711","https://openalex.org/W2066426639","https://openalex.org/W2187028603","https://openalex.org/W2218043766","https://openalex.org/W2266720707","https://openalex.org/W2290868822","https://openalex.org/W2329757582","https://openalex.org/W2461102131","https://openalex.org/W2461759988","https://openalex.org/W2481453975","https://openalex.org/W2499024707","https://openalex.org/W2578319993","https://openalex.org/W2607618241","https://openalex.org/W2617655309","https://openalex.org/W2788782919","https://openalex.org/W2883614163","https://openalex.org/W2898328298","https://openalex.org/W2898975971","https://openalex.org/W2903389907","https://openalex.org/W3118505512","https://openalex.org/W4211130072","https://openalex.org/W4255328724"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2040572217","https://openalex.org/W2375775343","https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2352094194","https://openalex.org/W2612665926","https://openalex.org/W2183811469","https://openalex.org/W2068319819"],"abstract_inverted_index":{"Associated":[0],"path":[1,13,17,131,151],"detection":[2,37],"is":[3,18,45,78,132],"considered":[4],"as":[5],"the":[6,10,22,26,31,50,64,71,82,90,94,106,116,125,128,136,156,173,178,181,190,195],"major":[7],"concern":[8],"of":[9,58,103,112,155,180,194],"traditional":[11],"shortest":[12,23,51,83,95,117,130,150,158],"issue.":[14],"The":[15],"associated":[16,41],"generally":[19],"represented":[20],"by":[21,100],"distance":[24,34,52,118,122,161],"among":[25],"source":[27],"and":[28,60,153,168,192],"destination.":[29],"In":[30,68],"transportation":[32],"network,":[33],"or":[35,162],"cost":[36],"may":[38],"identify":[39],"this":[40,69,144],"path.":[42,159],"Specifically,":[43],"it":[44,61],"very":[46],"important":[47],"to":[48,80,114,176],"discover":[49,81],"that":[53],"has":[54],"a":[55,86,98,110],"minimum":[56,121],"number":[57],"nodes,":[59],"will":[62],"give":[63],"most":[65],"optimized":[66],"result.":[67],"paper,":[70],"Fuzzy":[72],"based":[73,119,134],"Pareto":[74],"Optimal":[75],"(FPO)":[76],"approach":[77],"used":[79,175],"paths":[84,96],"in":[85,97],"network":[87,99],"graph.":[88],"Initially,":[89],"FPO":[91],"technique":[92,183],"finds":[93],"using":[101],"set":[102,111],"rules.":[104],"Then,":[105],"Lexicographical":[107],"model":[108],"uses":[109],"rules":[113],"rank":[115],"on":[120,135],"value.":[123],"From":[124],"ranking":[126,152],"results,":[127],"optimal":[129,157],"selected":[133],"proposed":[137,182,196],"Ant":[138],"Lion":[139],"Optimization":[140],"(ALO)":[141],"algorithm.":[142],"So,":[143],"paper":[145],"achieves":[146],"multi":[147],"objectives":[148],"like":[149],"selection":[154],"Time,":[160],"cost,":[163],"convergence":[164],"time,":[165],"fitness":[166],"function,":[167],"mean":[169],"square":[170],"error":[171],"are":[172],"parameters":[174],"relate":[177],"performance":[179],"with":[184,198],"state-of-the-art":[185],"techniques.":[186],"Comparative":[187],"results":[188],"display":[189],"robustness":[191],"proficiency":[193],"system":[197],"several":[199],"works.":[200]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}