{"id":"https://openalex.org/W2252572244","doi":null,"title":"REVISED MAXSMINT ROUTING TECHNIQUE FOR OPTIMIZATION","display_name":"REVISED MAXSMINT ROUTING TECHNIQUE FOR OPTIMIZATION","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2252572244","mag":"2252572244"},"language":"en","primary_location":{"id":"pmh:oai:ijma.info:article/792","doi":null,"is_oa":false,"landing_page_url":"https://ijma.info/index.php/ijma/article/view/792","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/A5020417951","display_name":"G.R. Brindha","orcid":"https://orcid.org/0000-0001-5911-8327","observed_orcids":["https://orcid.org/0000-0001-5911-8327"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Brindha G.R","raw_affiliation_strings":["ijma-home International Journal of Mathematical Archive"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ijma-home International Journal of Mathematical Archive","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085114560","display_name":"S. Krishna Anand","orcid":"https://orcid.org/0000-0001-8816-9553","observed_orcids":["https://orcid.org/0000-0001-8816-9553"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"S. Krishna Anand","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0001-8816-9553","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"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":"2","issue":"12","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9711999893188477,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9711999893188477,"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/T12292","display_name":"Graph Theory and Algorithms","score":0.020099999383091927,"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/T11568","display_name":"Railway Systems and Energy Efficiency","score":0.004000000189989805,"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","display_name":"shortest path","score":0.847000002861023},{"id":"https://openalex.org/keywords/time-expanded-network","display_name":"time-expanded network","score":0.7429999709129333},{"id":"https://openalex.org/keywords/depth-first-search","display_name":"depth-first search","score":0.7099999785423279},{"id":"https://openalex.org/keywords/directed-graphs","display_name":"directed graphs","score":0.7210000157356262}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7768369317054749},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.726078987121582},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.672539472579956},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.6615806818008423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6478556394577026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5835120677947998},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.5204170346260071},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.5129684805870056},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4894477427005768},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4392373263835907},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39590439200401306},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3384086489677429},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.3241698145866394},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2534562349319458},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16771981120109558},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:ijma.info:article/792","doi":null,"is_oa":false,"landing_page_url":"https://ijma.info/index.php/ijma/article/view/792","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"},{"id":"mag:2252572244","doi":null,"is_oa":false,"landing_page_url":"https://www.ijma.info/index.php/ijma/article/view/792","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":null,"is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Mathematical Archive","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/9","score":0.7207000255584717,"display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1993901614","https://openalex.org/W1999545213","https://openalex.org/W2030752450","https://openalex.org/W2042068919","https://openalex.org/W2044089388","https://openalex.org/W2050560064","https://openalex.org/W2089338760","https://openalex.org/W2093506709","https://openalex.org/W2111160151","https://openalex.org/W2132523953","https://openalex.org/W2135810626","https://openalex.org/W2139539792","https://openalex.org/W2144050074","https://openalex.org/W2149742236","https://openalex.org/W2154356512","https://openalex.org/W2160365857"],"related_works":["https://openalex.org/W2030752450","https://openalex.org/W2342356477","https://openalex.org/W2105824380","https://openalex.org/W2390543351","https://openalex.org/W2129673493","https://openalex.org/W1975038761","https://openalex.org/W614128420","https://openalex.org/W2383820644","https://openalex.org/W571152315","https://openalex.org/W2383942603"],"abstract_inverted_index":{"One":[0],"of":[1,4,30],"the":[2,6,25,33,54,67,81,87,100,126],"concepts":[3],"networks,":[5],"shortest":[7,26,55,68,83],"path":[8,84],"technique":[9,85,95],"has":[10],"been":[11],"analyzed":[12],"extensively":[13],"for":[14,51],"many":[15,20],"years.":[16],"Though":[17],"there":[18],"are":[19],"techniques":[21],"to":[22,91,98,117],"find":[23],"out":[24,53],"path,":[27],"only":[28],"few":[29],"them":[31],"handled":[32],"problem":[34],"based":[35,103],"on":[36,86,105],"time.":[37,93],"This":[38,61,109],"paper":[39],"introduces":[40],"an":[41],"innovative":[42],"algorithm,":[43],"Revised":[44],"MAXSMINT":[45],"(Maximizing":[46],"Speed":[47],"and":[48,79,114,121],"Minimizing":[49],"Time)":[50],"finding":[52],"route":[56,71,104],"in":[57],"a":[58,106],"railway":[59],"network.":[60],"new":[62],"algorithm":[63],"deals":[64],"with":[65],"determining":[66],"time":[69,88,102,124],"taking":[70],"which":[72],"applies":[73],"depth":[74],"first":[75],"search,":[76],"pruning,":[77],"backtracking,":[78],"also":[80],"basic":[82,127],"expanded":[89],"diagraph":[90],"optimize":[92],"Our":[94],"is":[96,111,115],"applied":[97],"get":[99],"optimum":[101],"directed":[107],"graph.":[108],"approach":[110],"more":[112],"comprehensive":[113],"verified":[116],"provide":[118],"greater":[119],"efficiency":[120],"lesser":[122],"process":[123],"than":[125],"methodologies.":[128]},"counts_by_year":[],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}