{"id":"https://openalex.org/W4387251730","doi":"https://doi.org/10.1109/ccis59572.2023.10262940","title":"Hybrid algorithm of invasive weeds and particle swarm optimization","display_name":"Hybrid algorithm of invasive weeds and particle swarm optimization","publication_year":2023,"publication_date":"2023-08-12","ids":{"openalex":"https://openalex.org/W4387251730","doi":"https://doi.org/10.1109/ccis59572.2023.10262940"},"language":"en","primary_location":{"id":"doi:10.1109/ccis59572.2023.10262940","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ccis59572.2023.10262940","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 9th International Conference on Cloud Computing and Intelligent Systems (CCIS)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5010665898","display_name":"Xianjun Du","orcid":"https://orcid.org/0000-0002-8137-0286"},"institutions":[{"id":"https://openalex.org/I22716506","display_name":"Lanzhou University of Technology","ror":"https://ror.org/03panb555","country_code":"CN","type":"education","lineage":["https://openalex.org/I22716506"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xianjun Du","raw_affiliation_strings":["Lanzhou Univ. of Tech,College of Electrical Engineering and Information Engineering,Lanzhou,China,730050","Key Laboratory of Gansu Advanced Control for Industrial Process, Lanzhou Univ. of Tech, Lanzhou, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lanzhou Univ. of Tech,College of Electrical Engineering and Information Engineering,Lanzhou,China,730050","institution_ids":["https://openalex.org/I22716506"]},{"raw_affiliation_string":"Key Laboratory of Gansu Advanced Control for Industrial Process, Lanzhou Univ. of Tech, Lanzhou, China","institution_ids":["https://openalex.org/I22716506"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063107365","display_name":"Zhuohang Li","orcid":"https://orcid.org/0000-0001-5559-4094"},"institutions":[{"id":"https://openalex.org/I22716506","display_name":"Lanzhou University of Technology","ror":"https://ror.org/03panb555","country_code":"CN","type":"education","lineage":["https://openalex.org/I22716506"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Zhuohang Li","raw_affiliation_strings":["Lanzhou Univ. of Tech,College of Electrical Engineering and Information Engineering,Lanzhou,China,730050"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lanzhou Univ. of Tech,College of Electrical Engineering and Information Engineering,Lanzhou,China,730050","institution_ids":["https://openalex.org/I22716506"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I22716506"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13727015,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"537","last_page":"541"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9984999895095825,"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.9984999895095825,"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/T13717","display_name":"Advanced Algorithms and Applications","score":0.9937999844551086,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9861000180244446,"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/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.7970721125602722},{"id":"https://openalex.org/keywords/multi-swarm-optimization","display_name":"Multi-swarm optimization","score":0.7569677829742432},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6671635508537292},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.659562349319458},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5696878433227539},{"id":"https://openalex.org/keywords/hybrid-algorithm","display_name":"Hybrid algorithm (constraint satisfaction)","score":0.5644593238830566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5562282204627991},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5546398162841797},{"id":"https://openalex.org/keywords/local-optimum","display_name":"Local optimum","score":0.49831652641296387},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.48356983065605164},{"id":"https://openalex.org/keywords/imperialist-competitive-algorithm","display_name":"Imperialist competitive algorithm","score":0.4731922149658203},{"id":"https://openalex.org/keywords/test-functions-for-optimization","display_name":"Test functions for optimization","score":0.46038129925727844},{"id":"https://openalex.org/keywords/metaheuristic","display_name":"Metaheuristic","score":0.45992526412010193},{"id":"https://openalex.org/keywords/derivative-free-optimization","display_name":"Derivative-free optimization","score":0.4302270710468292},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21912285685539246}],"concepts":[{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.7970721125602722},{"id":"https://openalex.org/C122357587","wikidata":"https://www.wikidata.org/wiki/Q6934508","display_name":"Multi-swarm optimization","level":3,"score":0.7569677829742432},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6671635508537292},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.659562349319458},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5696878433227539},{"id":"https://openalex.org/C62469222","wikidata":"https://www.wikidata.org/wiki/Q17092103","display_name":"Hybrid algorithm (constraint satisfaction)","level":5,"score":0.5644593238830566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5562282204627991},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5546398162841797},{"id":"https://openalex.org/C141934464","wikidata":"https://www.wikidata.org/wiki/Q3305386","display_name":"Local optimum","level":2,"score":0.49831652641296387},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.48356983065605164},{"id":"https://openalex.org/C101219045","wikidata":"https://www.wikidata.org/wiki/Q10859646","display_name":"Imperialist competitive algorithm","level":4,"score":0.4731922149658203},{"id":"https://openalex.org/C150185637","wikidata":"https://www.wikidata.org/wiki/Q7705773","display_name":"Test functions for optimization","level":4,"score":0.46038129925727844},{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.45992526412010193},{"id":"https://openalex.org/C29282572","wikidata":"https://www.wikidata.org/wiki/Q16977029","display_name":"Derivative-free optimization","level":4,"score":0.4302270710468292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21912285685539246},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C176783269","wikidata":"https://www.wikidata.org/wiki/Q5164378","display_name":"Constraint logic programming","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccis59572.2023.10262940","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1109/ccis59572.2023.10262940","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE 9th International Conference on Cloud Computing and Intelligent Systems (CCIS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2025148441","https://openalex.org/W2152195021","https://openalex.org/W2159041583","https://openalex.org/W2171211995","https://openalex.org/W3000029516","https://openalex.org/W4285029663","https://openalex.org/W4308831984","https://openalex.org/W4313479115","https://openalex.org/W4313531156","https://openalex.org/W4318323524","https://openalex.org/W4321379186"],"related_works":["https://openalex.org/W2113650225","https://openalex.org/W2393398569","https://openalex.org/W2107369277","https://openalex.org/W2391889613","https://openalex.org/W1971866155","https://openalex.org/W2913024632","https://openalex.org/W3128836657","https://openalex.org/W2359381975","https://openalex.org/W4255726574","https://openalex.org/W4244439700"],"abstract_inverted_index":{"Aiming":[0],"at":[1],"the":[2,24,39,47,69,79],"disadvantages":[3],"of":[4,15,38],"low":[5],"optimization":[6,18,31,92,96],"accuracy":[7],"and":[8,28,44,65,93],"easy":[9,87],"to":[10,88],"fall":[11,89],"into":[12,51,90],"local":[13,52,91],"optimum":[14],"particle":[16,29],"swarm":[17,30],"algorithm,":[19],"a":[20],"hybrid":[21,40,80],"algorithm":[22,27,32,41,48,81],"combining":[23],"invasive":[25],"weed":[26],"is":[33,42,57,76,85],"proposed.":[34],"The":[35,54],"main":[36],"structure":[37],"PSO,":[43],"IWO":[45],"makes":[46],"avoid":[49],"falling":[50],"optimum.":[53],"simulation":[55],"test":[56,63],"carried":[58],"out":[59],"with":[60,68],"11":[61],"benchmark":[62],"functions,":[64],"through":[66],"comparison":[67],"other":[70],"two":[71],"improved":[72],"PSO":[73],"algorithms,":[74],"it":[75],"concluded":[77],"that":[78],"in":[82],"this":[83],"paper":[84],"not":[86],"has":[94],"high":[95],"accuracy.":[97]},"counts_by_year":[],"updated_date":"2026-08-21T09:56:20.448147","created_date":"2025-10-10T00:00:00"}