{"id":"https://openalex.org/W2089372022","doi":"https://doi.org/10.1109/rait.2012.6194620","title":"Recursive Ant Colony Optimization for estimation of parameters of a function","display_name":"Recursive Ant Colony Optimization for estimation of parameters of a function","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2089372022","doi":"https://doi.org/10.1109/rait.2012.6194620","mag":"2089372022"},"language":"en","primary_location":{"id":"doi:10.1109/rait.2012.6194620","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rait.2012.6194620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 1st International Conference on Recent Advances in Information Technology (RAIT)","raw_type":"proceedings-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/A5034853815","display_name":"Deepak Gupta","orcid":"https://orcid.org/0000-0002-3019-7161"},"institutions":[{"id":"https://openalex.org/I189109744","display_name":"Indian Institute of Technology Dhanbad","ror":"https://ror.org/013v3cc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I189109744"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Deepak K. Gupta","raw_affiliation_strings":["Department of Applied Geophysics, Indian School of Mines Dhanbad, Dhanbad, India","Dept. of Applied Geophysics, Indian School of Mines, Dhanbad, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Geophysics, Indian School of Mines Dhanbad, Dhanbad, India","institution_ids":["https://openalex.org/I189109744"]},{"raw_affiliation_string":"Dept. of Applied Geophysics, Indian School of Mines, Dhanbad, India","institution_ids":["https://openalex.org/I189109744"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011375561","display_name":"Yogesh Arora","orcid":null},"institutions":[{"id":"https://openalex.org/I189109744","display_name":"Indian Institute of Technology Dhanbad","ror":"https://ror.org/013v3cc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I189109744"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Yogesh Arora","raw_affiliation_strings":["Department of Applied Geophysics, Indian School of Mines Dhanbad, Dhanbad, India","Dept. of Applied Geophysics, Indian School of Mines, Dhanbad, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Geophysics, Indian School of Mines Dhanbad, Dhanbad, India","institution_ids":["https://openalex.org/I189109744"]},{"raw_affiliation_string":"Dept. of Applied Geophysics, Indian School of Mines, Dhanbad, India","institution_ids":["https://openalex.org/I189109744"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103127123","display_name":"Upendra K. Singh","orcid":"https://orcid.org/0000-0001-7147-7971"},"institutions":[{"id":"https://openalex.org/I189109744","display_name":"Indian Institute of Technology Dhanbad","ror":"https://ror.org/013v3cc28","country_code":"IN","type":"education","lineage":["https://openalex.org/I189109744"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Upendra K. Singh","raw_affiliation_strings":["Department of Applied Geophysics, Indian School of Mines Dhanbad, Dhanbad, India","Dept. of Applied Geophysics, Indian School of Mines, Dhanbad, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Applied Geophysics, Indian School of Mines Dhanbad, Dhanbad, India","institution_ids":["https://openalex.org/I189109744"]},{"raw_affiliation_string":"Dept. of Applied Geophysics, Indian School of Mines, Dhanbad, India","institution_ids":["https://openalex.org/I189109744"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008444234","display_name":"Jai Prakash Gupta","orcid":"https://orcid.org/0009-0009-3233-7170"},"institutions":[{"id":"https://openalex.org/I145894827","display_name":"Indian Institute of Technology Kharagpur","ror":"https://ror.org/03w5sq511","country_code":"IN","type":"education","lineage":["https://openalex.org/I145894827"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Jai P. Gupta","raw_affiliation_strings":["Department of Computer Science & Engineering, Indian Institute of Technology, Kharagpur, India","Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Indian Institute of Technology, Kharagpur, India","institution_ids":["https://openalex.org/I145894827"]},{"raw_affiliation_string":"Department of Computer Science and Engineering Indian Institute of Technology Kharagpur India","institution_ids":["https://openalex.org/I145894827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.4228,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.94450785,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"448","last_page":"454"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998000264167786,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9975000023841858,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9757000207901001,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.8735288381576538},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.619060218334198},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.58725905418396},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5729784965515137},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5454561710357666},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5293900370597839},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.524286687374115},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.45398300886154175},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4398408532142639},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3363693952560425},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.297152578830719},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2759830057621002},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13198602199554443},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10389554500579834},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.06639215350151062}],"concepts":[{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.8735288381576538},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.619060218334198},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.58725905418396},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5729784965515137},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5454561710357666},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5293900370597839},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.524286687374115},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.45398300886154175},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4398408532142639},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3363693952560425},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.297152578830719},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2759830057621002},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13198602199554443},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10389554500579834},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.06639215350151062},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"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":"doi:10.1109/rait.2012.6194620","is_oa":false,"landing_page_url":"https://doi.org/10.1109/rait.2012.6194620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 1st International Conference on Recent Advances in Information Technology (RAIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.49000000953674316,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W139609527","https://openalex.org/W161004712","https://openalex.org/W1492640216","https://openalex.org/W1497256448","https://openalex.org/W1514875444","https://openalex.org/W1573676079","https://openalex.org/W1587263632","https://openalex.org/W1801849579","https://openalex.org/W2009151996","https://openalex.org/W2024060531","https://openalex.org/W2104670598","https://openalex.org/W2107941094","https://openalex.org/W2118051273","https://openalex.org/W2124253297","https://openalex.org/W2154061444","https://openalex.org/W2160576900","https://openalex.org/W2171211995","https://openalex.org/W2235047952","https://openalex.org/W2339500526","https://openalex.org/W2810232415","https://openalex.org/W3121748795","https://openalex.org/W3149025087","https://openalex.org/W4212899374","https://openalex.org/W4213261160","https://openalex.org/W4246598646","https://openalex.org/W4292408555","https://openalex.org/W6605724736"],"related_works":["https://openalex.org/W2553274123","https://openalex.org/W2347951034","https://openalex.org/W4283826969","https://openalex.org/W2377010080","https://openalex.org/W2388326823","https://openalex.org/W2366876790","https://openalex.org/W2071981049","https://openalex.org/W4285338599","https://openalex.org/W2381829748","https://openalex.org/W2353880500"],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,14,28,91,156,164],"new":[4],"optimization":[5],"technique":[6],"termed":[7],"as":[8],"Recursive":[9],"Ant":[10],"Colony":[11],"Optimization":[12],"(RACO),":[13],"modified":[15],"form":[16],"of":[17,36,49,63,86,107,121,159,188],"ant":[18,51],"colony":[19],"method":[20],"(ACO),":[21],"for":[22,114,123],"finding":[23],"best":[24],"probable":[25],"solution":[26],"to":[27,44,141,155,163,177],"combinatorial":[29],"problem.":[30],"ACO":[31,75,93],"simulates":[32],"the":[33,42,55,61,64,68,84,115,119,129,171,184],"social":[34],"behavior":[35],"ants,":[37],"optimizing":[38],"their":[39],"path":[40,57,69],"from":[41],"nest":[43],"food":[45],"source.":[46],"The":[47,132,173],"movement":[48],"an":[50,78],"is":[52,58,90,126,134],"random":[53],"and":[54,103,118,140,146,181,186],"shortest":[56],"found":[59,176],"on":[60,67,136],"basis":[62],"pheromone":[65],"laid":[66],"by":[70],"other":[71],"ants.":[72],"RACO":[73],"applies":[74],"recursively":[76],"introducing":[77],"additional":[79],"term":[80],"`depth'":[81],"which":[82],"decides":[83],"extent":[85],"recursion.":[87],"Each":[88],"depth":[89,109,117],"usual":[92],"with":[94],"three":[95],"steps":[96],"per":[97],"iteration,":[98],"`pheromone":[99,101],"tracking',":[100],"updating'":[102],"`city":[104],"selection'.":[105],"Results":[106],"each":[108,124],"contribute":[110],"towards":[111],"constructing":[112],"models":[113],"following":[116],"range":[120],"values":[122],"parameter":[125],"reduced":[127],"around":[128],"actual":[130],"solution.":[131],"algorithm":[133],"tested":[135],"two":[137],"simple":[138],"functions":[139],"further":[142],"test":[143],"its":[144],"efficiency":[145],"stability":[147],"in":[148],"real":[149],"world,":[150],"it":[151],"has":[152],"been":[153],"applied":[154],"geophysical":[157],"problem":[158],"self-potential":[160],"anomaly":[161],"due":[162],"inclined":[165],"sheet":[166],"like":[167],"body":[168],"buried":[169],"inside":[170],"earth.":[172],"results":[174],"are":[175],"be":[178],"very":[179],"good":[180],"they":[182],"describe":[183],"effectiveness":[185],"practicability":[187],"this":[189],"method.":[190]},"counts_by_year":[{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":6},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}