{"id":"https://openalex.org/W2413635266","doi":"https://doi.org/10.5121/ijaia.2016.7304","title":"A Modified Vortex Search Algorithm for Numerical Function Optimization","display_name":"A Modified Vortex Search Algorithm for Numerical Function Optimization","publication_year":2016,"publication_date":"2016-05-30","ids":{"openalex":"https://openalex.org/W2413635266","doi":"https://doi.org/10.5121/ijaia.2016.7304","mag":"2413635266"},"language":"en","primary_location":{"id":"doi:10.5121/ijaia.2016.7304","doi":"https://doi.org/10.5121/ijaia.2016.7304","is_oa":true,"landing_page_url":"http://doi.org/10.5121/ijaia.2016.7304","pdf_url":"https://doi.org/10.5121/ijaia.2016.7304","source":{"id":"https://openalex.org/S115674417","display_name":"International Journal of Artificial Intelligence & Applications","issn_l":"0975-900X","issn":["0975-900X","0976-2191"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Artificial Intelligence & Applications","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.5121/ijaia.2016.7304","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Berat Dogan","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I20126385","display_name":"Inonu University","ror":"https://ror.org/04asck240","country_code":"TR","type":"education","lineage":["https://openalex.org/I20126385"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"Berat Dogan","raw_affiliation_strings":["Department of Biomedical Engineering , Inonu University , Malatya , Turkey"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Biomedical Engineering , Inonu University , Malatya , Turkey","institution_ids":["https://openalex.org/I20126385"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I20126385"],"apc_list":null,"apc_paid":null,"fwci":0.3973,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.67325572,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":97},"biblio":{"volume":"7","issue":"3","first_page":"37","last_page":"54"},"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/T12391","display_name":"Artificial Immune Systems Applications","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/vortex-search-algorithm","display_name":"vortex search algorithm","score":0.9800000190734863},{"id":"https://openalex.org/keywords/metaheuristic-optimization","display_name":"metaheuristic optimization","score":0.9089999794960022},{"id":"https://openalex.org/keywords/numerical-function-optimization","display_name":"numerical function optimization","score":0.8550000190734863},{"id":"https://openalex.org/keywords/local-minima","display_name":"local minima","score":0.7039999961853027},{"id":"https://openalex.org/keywords/local-optima-trapping","display_name":"local optima trapping","score":0.5910000205039978},{"id":"https://openalex.org/keywords/global-search-ability","display_name":"global search ability","score":0.8190000057220459},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"swarm intelligence","score":0.4959999918937683},{"id":"https://openalex.org/keywords/benchmark-functions","display_name":"benchmark functions","score":0.4749999940395355}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7034000158309937},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.5971999764442444},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5497000217437744},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5447999835014343},{"id":"https://openalex.org/C135320971","wikidata":"https://www.wikidata.org/wiki/Q1868524","display_name":"Local search (optimization)","level":2,"score":0.4828999936580658},{"id":"https://openalex.org/C3561768","wikidata":"https://www.wikidata.org/wiki/Q5275267","display_name":"Difference-map algorithm","level":2,"score":0.4366999864578247},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4366999864578247},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.4262000024318695},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42570000886917114},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.40369999408721924},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.3774999976158142},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37619999051094055},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.367000013589859},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C140820882","wikidata":"https://www.wikidata.org/wiki/Q732722","display_name":"Vortex","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.31310001015663147},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.3118000030517578},{"id":"https://openalex.org/C184497298","wikidata":"https://www.wikidata.org/wiki/Q7229773","display_name":"Population-based incremental learning","level":3,"score":0.3057999908924103},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.2987000048160553},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.2930999994277954},{"id":"https://openalex.org/C135450995","wikidata":"https://www.wikidata.org/wiki/Q820272","display_name":"Hill climbing","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C46011968","wikidata":"https://www.wikidata.org/wiki/Q830527","display_name":"Best-first search","level":4,"score":0.2745000123977661},{"id":"https://openalex.org/C500300565","wikidata":"https://www.wikidata.org/wiki/Q925667","display_name":"Computer simulation","level":2,"score":0.2653999924659729},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.2632000148296356},{"id":"https://openalex.org/C8880873","wikidata":"https://www.wikidata.org/wiki/Q187787","display_name":"Genetic algorithm","level":2,"score":0.26080000400543213},{"id":"https://openalex.org/C123370116","wikidata":"https://www.wikidata.org/wiki/Q1424540","display_name":"Tabu search","level":2,"score":0.2590000033378601},{"id":"https://openalex.org/C2776003309","wikidata":"https://www.wikidata.org/wiki/Q1988072","display_name":"Adaptive algorithm","level":2,"score":0.25440001487731934},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.25189998745918274},{"id":"https://openalex.org/C133824558","wikidata":"https://www.wikidata.org/wiki/Q16893660","display_name":"Out-of-kilter algorithm","level":5,"score":0.25130000710487366},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.2508000135421753}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5121/ijaia.2016.7304","doi":"https://doi.org/10.5121/ijaia.2016.7304","is_oa":true,"landing_page_url":"http://doi.org/10.5121/ijaia.2016.7304","pdf_url":"https://doi.org/10.5121/ijaia.2016.7304","source":{"id":"https://openalex.org/S115674417","display_name":"International Journal of Artificial Intelligence & Applications","issn_l":"0975-900X","issn":["0975-900X","0976-2191"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Artificial Intelligence & Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1606.02710","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1606.02710","pdf_url":"https://arxiv.org/pdf/1606.02710","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.1606.02710","doi":"https://doi.org/10.48550/arxiv.1606.02710","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1606.02710","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"doi:10.5121/ijaia.2016.7304","doi":"https://doi.org/10.5121/ijaia.2016.7304","is_oa":true,"landing_page_url":"http://doi.org/10.5121/ijaia.2016.7304","pdf_url":"https://doi.org/10.5121/ijaia.2016.7304","source":{"id":"https://openalex.org/S115674417","display_name":"International Journal of Artificial Intelligence & Applications","issn_l":"0975-900X","issn":["0975-900X","0976-2191"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Artificial Intelligence & Applications","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/W2413635266.pdf","grobid_xml":"https://content.openalex.org/works/W2413635266.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W240568961","https://openalex.org/W1492640216","https://openalex.org/W1497256448","https://openalex.org/W1531888047","https://openalex.org/W1578580665","https://openalex.org/W1595159159","https://openalex.org/W1820051232","https://openalex.org/W1978062261","https://openalex.org/W1987092188","https://openalex.org/W1987115965","https://openalex.org/W1998674867","https://openalex.org/W2019337264","https://openalex.org/W2024060531","https://openalex.org/W2064586382","https://openalex.org/W2088609193","https://openalex.org/W2091564852","https://openalex.org/W2143560894","https://openalex.org/W2144317842","https://openalex.org/W2154061444","https://openalex.org/W2169064301","https://openalex.org/W2253755793","https://openalex.org/W2287814884","https://openalex.org/W2408324482","https://openalex.org/W2543580944","https://openalex.org/W3137715965","https://openalex.org/W4234185890","https://openalex.org/W4302364882","https://openalex.org/W6630467700"],"related_works":["https://openalex.org/W2396876407","https://openalex.org/W2088609193","https://openalex.org/W2586574318","https://openalex.org/W2901329155","https://openalex.org/W2811199402","https://openalex.org/W4292210211","https://openalex.org/W4312745012","https://openalex.org/W4320477942","https://openalex.org/W2734832862","https://openalex.org/W2603214442"],"abstract_inverted_index":{"The":[0],"Vortex":[1,168],"Search":[2,169],"(VS)":[3],"algorithm":[4,26,71,102,137,154,170,218,224],"is":[5,27,129,172,219],"one":[6],"of":[7,20,37,87,124,179,195,207,214],"the":[8,17,21,24,35,46,54,70,81,101,112,119,122,125,136,153,161,180,184,187,205,210,215,222,226,235],"recently":[9],"proposed":[10,173],"metaheuristic":[11],"algorithms":[12,233],"which":[13],"was":[14],"inspired":[15],"from":[16,157],"vortical":[18],"flow":[19],"stirred":[22],"fluids.Although":[23],"VS":[25,47,120,182,217,228],"shown":[28],"to":[29,69,76,91,96,103,111,155,174],"be":[30],"a":[31,60,85,93,107,140,166,193],"good":[32],"candidate":[33,49,98,127,188],"for":[34,80,152,234],"solution":[36,57],"certain":[38],"optimization":[39],"problems,":[40],"it":[41,73,147],"also":[42,74],"has":[43],"some":[44,77],"drawbacks.In":[45],"algorithm,":[48,121,186,229],"solutions":[50,99,128,189],"are":[51,190],"generated":[52,191],"around":[53,192],"current":[55],"best":[56],"by":[58],"using":[59],"Gaussian":[61],"distribution":[62],"at":[63,131,197],"each":[64,132,198],"iteration":[65,133,199],"pass.This":[66],"provides":[67],"simplicity":[68],"but":[72],"leads":[75,100],"problems":[78],"along.Especially,":[79],"functions":[82],"those":[83],"have":[84],"number":[86,194],"local":[88,108,141],"minimum":[89,109],"points,":[90],"select":[92],"single":[94],"point":[95,142,159],"generate":[97],"being":[104],"trapped":[105],"into":[106],"point.Due":[110],"adaptive":[113],"step-size":[114],"adjustment":[115],"scheme":[116],"used":[117],"in":[118,160],"locality":[123],"created":[126],"increased":[130],"pass.Therefore,":[134],"if":[135],"cannot":[138],"escape":[139,156],"as":[143,145],"quickly":[144],"possible,":[146],"becomes":[148],"much":[149],"more":[150],"difficult":[151],"that":[158,203],"latter":[162],"iterations.In":[163],"this":[164,208],"study,":[165],"modified":[167],"(MVS)":[171],"overcome":[175],"above":[176],"mentioned":[177],"drawback":[178],"existing":[181,216,227],"algorithm.In":[183],"MVS":[185,223],"points":[196],"pass.Computational":[200],"results":[201],"showed":[202],"with":[204],"help":[206],"modification":[209],"global":[211],"search":[212],"ability":[213],"improved":[220],"and":[221,231],"outperformed":[225],"PSO2011":[230],"ABC":[232],"benchmark":[236],"numerical":[237],"function":[238],"set.":[239]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2026-11-10T11:39:43.021295","created_date":"2016-06-24T00:00:00"}