{"id":"https://openalex.org/W2961079568","doi":"https://doi.org/10.5267/j.ijiec.2019.6.002","title":"Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems","display_name":"Rao algorithms: Three metaphor-less simple algorithms for solving optimization problems","publication_year":2019,"publication_date":"2019-07-11","ids":{"openalex":"https://openalex.org/W2961079568","doi":"https://doi.org/10.5267/j.ijiec.2019.6.002","mag":"2961079568"},"language":"en","primary_location":{"id":"doi:10.5267/j.ijiec.2019.6.002","doi":"https://doi.org/10.5267/j.ijiec.2019.6.002","is_oa":true,"landing_page_url":"https://doi.org/10.5267/j.ijiec.2019.6.002","pdf_url":"https://doi.org/10.5267/j.ijiec.2019.6.002","source":{"id":"https://openalex.org/S159818241","display_name":"International Journal of Industrial Engineering Computations","issn_l":"1923-2926","issn":["1923-2926","1923-2934"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310312984","host_organization_name":"Growing Science","host_organization_lineage":["https://openalex.org/P4310312984"],"host_organization_lineage_names":["Growing Science"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Industrial Engineering Computations","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.5267/j.ijiec.2019.6.002","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069123141","display_name":"R. Venkata Rao","orcid":"https://orcid.org/0000-0002-9957-1086","observed_orcids":["https://orcid.org/0000-0002-9957-1086"]},"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":"Ravipudi Venkata Rao","raw_affiliation_strings":["Department of Mechanical Engineering , S.V. National Institute of Technology , Ichchanath , Surat , Gujarat - 395 007 , India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering , S.V. National Institute of Technology , Ichchanath , Surat , Gujarat - 395 007 , India","institution_ids":["https://openalex.org/I42014448"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5069123141"],"corresponding_institution_ids":["https://openalex.org/I42014448"],"apc_list":null,"apc_paid":null,"fwci":15.2929,"has_fulltext":true,"cited_by_count":352,"citation_normalized_percentile":{"value":0.99299648,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"107","last_page":"130"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":1.0,"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":1.0,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.0,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11195","display_name":"Simulation Techniques and Applications","score":0.0,"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/rao-algorithm","display_name":"Rao algorithm","score":0.9649999737739563},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.8069999814033508},{"id":"https://openalex.org/keywords/unconstrained-optimization","display_name":"unconstrained optimization","score":0.8700000047683716},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"constrained optimization","score":1.0},{"id":"https://openalex.org/keywords/benchmark-functions","display_name":"benchmark functions","score":0.6240000128746033},{"id":"https://openalex.org/keywords/multimodal-functions","display_name":"multimodal functions","score":0.953000009059906},{"id":"https://openalex.org/keywords/unimodal-functions","display_name":"unimodal functions","score":0.8040000200271606},{"id":"https://openalex.org/keywords/population-based-algorithms","display_name":"population-based algorithms","score":0.7979999780654907}],"concepts":[{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.7433420419692993},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7216110229492188},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6019212603569031},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5585887432098389},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5272713303565979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5154005289077759},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5013372898101807},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4994933605194092},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.4883689284324646},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4102882742881775},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3626856803894043},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.20412123203277588},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5267/j.ijiec.2019.6.002","doi":"https://doi.org/10.5267/j.ijiec.2019.6.002","is_oa":true,"landing_page_url":"https://doi.org/10.5267/j.ijiec.2019.6.002","pdf_url":"https://doi.org/10.5267/j.ijiec.2019.6.002","source":{"id":"https://openalex.org/S159818241","display_name":"International Journal of Industrial Engineering Computations","issn_l":"1923-2926","issn":["1923-2926","1923-2934"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310312984","host_organization_name":"Growing Science","host_organization_lineage":["https://openalex.org/P4310312984"],"host_organization_lineage_names":["Growing Science"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Industrial Engineering Computations","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:9f5e10e44924435d888ea062b7dac8cf","doi":null,"is_oa":true,"landing_page_url":"https://doaj.org/article/9f5e10e44924435d888ea062b7dac8cf","pdf_url":null,"source":{"id":"https://openalex.org/S4306401280","display_name":"DOAJ (DOAJ: Directory of Open Access Journals)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-sa","license_id":"https://openalex.org/licenses/cc-by-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"International Journal of Industrial Engineering Computations, Vol 11, Iss 1, Pp 107-130 (2020)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.5267/j.ijiec.2019.6.002","doi":"https://doi.org/10.5267/j.ijiec.2019.6.002","is_oa":true,"landing_page_url":"https://doi.org/10.5267/j.ijiec.2019.6.002","pdf_url":"https://doi.org/10.5267/j.ijiec.2019.6.002","source":{"id":"https://openalex.org/S159818241","display_name":"International Journal of Industrial Engineering Computations","issn_l":"1923-2926","issn":["1923-2926","1923-2934"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","poland-70","russia-white-list-1"],"host_organization":"https://openalex.org/P4310312984","host_organization_name":"Growing Science","host_organization_lineage":["https://openalex.org/P4310312984"],"host_organization_lineage_names":["Growing Science"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Industrial Engineering Computations","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2961079568.pdf","grobid_xml":"https://content.openalex.org/works/W2961079568.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4401916629","https://openalex.org/W4400886713","https://openalex.org/W4307030477","https://openalex.org/W7213674469","https://openalex.org/W4403585373","https://openalex.org/W3010933327","https://openalex.org/W4220699105","https://openalex.org/W4307157657","https://openalex.org/W1698059316","https://openalex.org/W4360965443"],"abstract_inverted_index":{"Three":[0],"simple":[1,99],"metaphor-less":[2],"optimization":[3,16,30,96,127],"algorithms":[4,18,40,66,100,116],"are":[5,19,88,106],"developed":[6],"in":[7],"this":[8],"paper":[9],"for":[10,121],"solving":[11,122],"the":[12,22,29,33,37,43,64,119],"unconstrained":[13,92,124],"and":[14,24,32,50,54,81,93,105,125],"constrained":[15,95,126],"problems.These":[17],"based":[20],"on":[21,72,90],"best":[23],"worst":[25],"solutions":[26],"obtained":[27],"during":[28],"process":[31],"random":[34],"interactions":[35],"between":[36],"candidate":[38],"solutions.These":[39],"require":[41,57],"only":[42],"common":[44],"control":[45,60],"parameters":[46],"like":[47],"population":[48],"size":[49],"number":[51],"of":[52,63,114],"iterations":[53],"do":[55],"not":[56],"any":[58],"algorithm-specific":[59],"parameters.The":[61],"performance":[62,104],"proposed":[65,98],"is":[67],"investigated":[68],"by":[69,117],"implementing":[70],"these":[71,115],"23":[73],"benchmark":[74],"functions":[75],"comprising":[76],"7":[77],"unimodal,":[78],"6":[79],"multimodal":[80,84],"10":[82],"fixed-dimension":[83],"functions.Additional":[85],"computational":[86],"experiments":[87],"conducted":[89],"25":[91],"2":[94],"problems.The":[97],"have":[101],"shown":[102],"good":[103],"quite":[107],"competitive.The":[108],"research":[109],"community":[110],"may":[111],"take":[112],"advantage":[113],"adapting":[118],"same":[120],"different":[123],"problems.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":40},{"year":2025,"cited_by_count":46},{"year":2024,"cited_by_count":62},{"year":2023,"cited_by_count":52},{"year":2022,"cited_by_count":64},{"year":2021,"cited_by_count":63},{"year":2020,"cited_by_count":23},{"year":2019,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2019-07-23T00:00:00"}