{"id":"https://openalex.org/W4414288629","doi":"https://doi.org/10.1504/ijmor.2025.148626","title":"Enhanced non-dominated sorting genetic algorithms for fuzzy multi-objective multi-route shortest path problem","display_name":"Enhanced non-dominated sorting genetic algorithms for fuzzy multi-objective multi-route shortest path problem","publication_year":2025,"publication_date":"2025-01-01","ids":{"openalex":"https://openalex.org/W4414288629","doi":"https://doi.org/10.1504/ijmor.2025.148626"},"language":"en","primary_location":{"id":"doi:10.1504/ijmor.2025.148626","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmor.2025.148626","pdf_url":null,"source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","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, SV National Institute of Technology, Surat, Gujrat, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, SV National Institute of Technology, Surat, Gujrat, 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, SV National Institute of Technology, Surat, Gujrat, India"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, SV National Institute of Technology, Surat, Gujrat, 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.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.26345806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"32","issue":"1","first_page":"90","last_page":"122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.958299994468689,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.958299994468689,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9319000244140625,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7236999869346619},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.628600001335144},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.6122999787330627},{"id":"https://openalex.org/keywords/fuzzy-logic","display_name":"Fuzzy logic","score":0.5309000015258789},{"id":"https://openalex.org/keywords/genetic-algorithm","display_name":"Genetic algorithm","score":0.5127000212669373},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.4672999978065491},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4422999918460846},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4336000084877014}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7236999869346619},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.628600001335144},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6122999787330627},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.583299994468689},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.5309000015258789},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.5127000212669373},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.4672999978065491},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4528000056743622},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4422999918460846},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4336000084877014},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43320000171661377},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C2986080485","wikidata":"https://www.wikidata.org/wiki/Q1331926","display_name":"Decision maker","level":2,"score":0.38769999146461487},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3806000053882599},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.3610999882221222},{"id":"https://openalex.org/C1883856","wikidata":"https://www.wikidata.org/wiki/Q3407463","display_name":"Fuzzy number","level":4,"score":0.35569998621940613},{"id":"https://openalex.org/C127385683","wikidata":"https://www.wikidata.org/wiki/Q1475696","display_name":"Fuzzy classification","level":4,"score":0.3084000051021576},{"id":"https://openalex.org/C5263885","wikidata":"https://www.wikidata.org/wiki/Q1967302","display_name":"Membership function","level":4,"score":0.3012999892234802},{"id":"https://openalex.org/C2776548248","wikidata":"https://www.wikidata.org/wiki/Q12621536","display_name":"Judgement","level":2,"score":0.2937999963760376},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27799999713897705},{"id":"https://openalex.org/C195975749","wikidata":"https://www.wikidata.org/wiki/Q1475705","display_name":"Fuzzy control system","level":3,"score":0.25780001282691956},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C148671577","wikidata":"https://www.wikidata.org/wiki/Q5511133","display_name":"Fuzzy set operations","level":4,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1504/ijmor.2025.148626","is_oa":false,"landing_page_url":"https://doi.org/10.1504/ijmor.2025.148626","pdf_url":null,"source":{"id":"https://openalex.org/S135796719","display_name":"International Journal of Mathematics in Operational Research","issn_l":"1757-5850","issn":["1757-5850","1757-5869"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310317825","host_organization_name":"Inderscience Publishers","host_organization_lineage":["https://openalex.org/P4310317825"],"host_organization_lineage_names":["Inderscience Publishers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Mathematics in Operational Research","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":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,44],"study":[1],"examines":[2],"a":[3,15,60],"fuzzy":[4,29,40],"multi-objective":[5,17],"multi-route":[6,18],"short":[7],"path":[8,20],"problem":[9,21],"(FMOMRSPP)":[10],"by":[11],"transforming":[12],"it":[13],"into":[14],"crisp":[16],"shortest":[19],"(MOMRSPP)":[22],"using":[23],"possibility":[24],"distribution.":[25],"Using":[26],"\u03b1-level":[27],"sets,":[28],"judgement":[30],"is":[31,86,100,110],"categorised":[32],"for":[33,67],"the":[34,68,78,81,89,114,117],"decision":[35],"maker":[36],"(DM)":[37],"to":[38,58,76,112],"optimise":[39],"objective":[41,98],"function":[42],"scenarios.":[43],"paper":[45],"proposes":[46],"aspiration":[47],"level":[48],"(AL)-based":[49],"non-dominated":[50],"sorting":[51],"genetic":[52],"algorithm":[53],"(NSGA)-II":[54],"and":[55,91,105],"AL-based":[56],"NSGA-III":[57],"obtain":[59],"Pareto-optimal":[61],"solution":[62],"that":[63],"meets":[64],"DM":[65],"AL":[66],"FMOMRSPP.":[69],"A":[70,84],"numerical":[71],"example":[72],"has":[73],"been":[74],"provided":[75],"demonstrate":[77],"usage":[79],"of":[80,97,116],"presented":[82,87],"methodologies.":[83],"comparison":[85],"between":[88],"proposed":[90,118],"several":[92],"other":[93],"approaches.":[94],"The":[95,108],"sensitivity":[96],"functions":[99],"also":[101],"investigated":[102],"with":[103],"ALs":[104],"shape":[106],"parameters.":[107],"coverage":[109],"determined":[111],"evaluate":[113],"effectiveness":[115],"methods.":[119]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}