{"id":"https://openalex.org/W962009264","doi":null,"title":"STATE OF ART HYBRIDIZED ALGORITHM FOR FUZZY SHORTEST PATH PROBLEM \u2013 HYBRIDIZED GENETIC ANT (HGA) ALGORITHM","display_name":"STATE OF ART HYBRIDIZED ALGORITHM FOR FUZZY SHORTEST PATH PROBLEM \u2013 HYBRIDIZED GENETIC ANT (HGA) ALGORITHM","publication_year":2015,"publication_date":"2015-04-27","ids":{"openalex":"https://openalex.org/W962009264","mag":"962009264"},"language":"en","primary_location":{"id":"pmh:oai:ijma.info:article/3473","doi":null,"is_oa":false,"landing_page_url":"https://ijma.info/index.php/ijma/article/view/3473","pdf_url":null,"source":{"id":"https://openalex.org/S2765050259","display_name":"International Journal of Mathematical Archive","issn_l":"2229-5046","issn":["2229-5046"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2229-5046","raw_type":"info:eu-repo/semantics/article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5055813834","display_name":"V. Anusuya","orcid":"https://orcid.org/0000-0002-1366-0214","observed_orcids":["https://orcid.org/0000-0002-1366-0214"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Anusuya, V.","raw_affiliation_strings":["ijma Archive-International Journal of Mathematical Archive (IJMA)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ijma Archive-International Journal of Mathematical Archive (IJMA)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5041763117","display_name":"Ramaswami Jothi Kavitha","orcid":"https://orcid.org/0009-0000-1450-980X","observed_orcids":["https://orcid.org/0009-0000-1450-980X"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Kavitha*, R.","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5041763117"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.4458000063896179,"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"}},"topics":[{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.4458000063896179,"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"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.19740000367164612,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11671","display_name":"Fuzzy and Soft Set Theory","score":0.11540000140666962,"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/genetic-algorithm","display_name":"genetic algorithm","score":0.7080000042915344},{"id":"https://openalex.org/keywords/ant-colony-optimization","display_name":"ant colony optimization","score":0.9919999837875366},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.6140000224113464},{"id":"https://openalex.org/keywords/hybrid-metaheuristic-algorithm","display_name":"hybrid metaheuristic","score":0.6700000166893005}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8665074706077576},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.6524019241333008},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6259307861328125},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6133145689964294},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6037180423736572},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.5677531361579895},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5619140267372131},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5481120944023132},{"id":"https://openalex.org/C58166","wikidata":"https://www.wikidata.org/wiki/Q224821","display_name":"Fuzzy logic","level":2,"score":0.46547505259513855},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.45168453454971313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42972850799560547},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41304266452789307},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3938678205013275},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.18824687600135803},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16259977221488953},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.11211398243904114},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.048833370208740234},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:ijma.info:article/3473","doi":null,"is_oa":false,"landing_page_url":"https://ijma.info/index.php/ijma/article/view/3473","pdf_url":null,"source":{"id":"https://openalex.org/S2765050259","display_name":"International Journal of Mathematical Archive","issn_l":"2229-5046","issn":["2229-5046"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320480","host_organization_name":"Scientific Research Publishing","host_organization_lineage":["https://openalex.org/P4310320480"],"host_organization_lineage_names":["Scientific Research Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2229-5046","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7097810840","https://openalex.org/W1985261575","https://openalex.org/W2039676647","https://openalex.org/W2417190917","https://openalex.org/W2784722577","https://openalex.org/W1602542295","https://openalex.org/W2103575395","https://openalex.org/W2073914408","https://openalex.org/W2903389907","https://openalex.org/W3151893132"],"abstract_inverted_index":{"The":[0,27],"evolution":[1],"of":[2,18],"fuzzy":[3],"shortest":[4,8],"path":[5,9],"from":[6],"the":[7,12,16],"problem":[10,14,36],"overcomes":[11],"uncertainty":[13,35],"in":[15,23,37],"usage":[17],"real":[19,24,38],"numbers":[20],"as":[21],"parameters":[22],"time":[25,39],"applications.":[26],"major":[28],"difference":[29],"that":[30],"has":[31],"evolved":[32],"to":[33],"solve":[34],"applications":[40],"are":[41],"appears":[42],"to...":[43]},"counts_by_year":[],"updated_date":"2026-10-03T13:16:28.481748","created_date":"2026-10-02T00:00:00"}