[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"detail-sidebar-cat-0-en-105":3,"doc-seo-458193-105":59,"doc-detail-458193-en":130},{"code":4,"msg":5,"data":6},0,"success",[7,13,18,23,28,33,38,43,48,51,55],{"id":8,"doc_module":4,"doc_module_name":9,"category_name":10,"show_sort_weight":11,"slug":12},1,"Document","Story & Novel",90,"story-novel",{"id":14,"doc_module":4,"doc_module_name":9,"category_name":15,"show_sort_weight":16,"slug":17},2,"Literature",80,"literature",{"id":19,"doc_module":4,"doc_module_name":9,"category_name":20,"show_sort_weight":21,"slug":22},4,"Exam",70,"exam",{"id":24,"doc_module":4,"doc_module_name":9,"category_name":25,"show_sort_weight":26,"slug":27},5,"Comic",60,"comic",{"id":29,"doc_module":4,"doc_module_name":9,"category_name":30,"show_sort_weight":31,"slug":32},6,"Technology",50,"technology",{"id":34,"doc_module":4,"doc_module_name":9,"category_name":35,"show_sort_weight":36,"slug":37},7,"Healthcare",40,"healthcare",{"id":39,"doc_module":4,"doc_module_name":9,"category_name":40,"show_sort_weight":41,"slug":42},8,"Research & Report",30,"research-report",{"id":44,"doc_module":4,"doc_module_name":9,"category_name":45,"show_sort_weight":46,"slug":47},9,"Religion & Spirituality",20,"religion-spirituality",{"id":46,"doc_module":4,"doc_module_name":9,"category_name":49,"show_sort_weight":46,"slug":50},"World Cup","world-cup",{"id":52,"doc_module":4,"doc_module_name":9,"category_name":53,"show_sort_weight":52,"slug":54},10,"Lifestyle","lifestyle",{"id":56,"doc_module":4,"doc_module_name":9,"category_name":57,"show_sort_weight":24,"slug":58},19,"General","general",{"code":4,"msg":60,"data":61},"ok",{"site_id":62,"language":63,"slug":64,"title":65,"keywords":66,"description":67,"schema_data":68,"social_meta":123,"head_meta":125,"extra_data":127,"updated_unix":129},105,"en","rank-charged-system-search-algorithm-for-optimization-and-operations-research-paper","Rank charged system search algorithm for optimization and operations research - paper","","Rank charged system search algorithm for optimization and operations research introduces CSSRank, an improved charged system search method for complex optimization tasks. It uses rank-based reduction to progressively decrease charged particles during electric force computation, strengthening exploitation. A ranking-based mutation strategy adds diversity early and refines solutions later. Experiments on benchmark suites CEC 2014/2024 and standard benchmark functions compare CSSRank with the original CSS and many state-of-the-art meta-heuristics. Results show superior performance on CEC 2014 and competitive results on CEC 2024, plus improved clustering and reliable reservoir operation optimization outcomes.",{"@graph":69,"@context":122},[70,84,105],{"@type":71,"itemListElement":72},"BreadcrumbList",[73,77,79,82],{"item":74,"name":75,"@type":76,"position":8},"https://docshare.wps.com","Home","ListItem",{"item":78,"name":9,"@type":76,"position":14},"https://docshare.wps.com/document/",{"item":80,"name":40,"@type":76,"position":81},"https://docshare.wps.com/document/research-report/",3,{"item":83,"name":65,"@type":76,"position":19},"https://docshare.wps.com/document/rank-charged-system-search-algorithm-for-optimization-and-operations-research-paper/458193/",{"url":83,"name":65,"@type":85,"image":86,"author":91,"headline":65,"publisher":94,"fileFormat":97,"inLanguage":63,"description":67,"dateModified":98,"datePublished":99,"encodingFormat":97,"isAccessibleForFree":100,"interactionStatistic":101},"DigitalDocument",{"url":87,"@type":88,"width":89,"height":90},"https://docshare.wps.com/thumbnails/rank-charged-system-search-algorithm-for-optimization-and-operations-research-paper/458193.png","ImageObject",300,407,{"name":92,"@type":93},"Valentina","Person",{"url":74,"name":95,"@type":96},"DocShare","Organization","application/pdf","2026-11-15","2026-09-30",true,{"@type":102,"interactionType":103,"userInteractionCount":39},"InteractionCounter",{"@type":104},"ViewAction",{"@type":106,"mainEntity":107},"FAQPage",[108,114,118],{"name":109,"@type":110,"acceptedAnswer":111},"What is CSSRank and how does it improve charged system search (CSS)?","Question",{"text":112,"@type":113},"CSSRank is an improved version of CSS designed for complex optimization. It enhances exploitation using a rank-based reduction strategy and improves exploration–exploitation balance with a ranking-based mutation strategy.","Answer",{"name":115,"@type":110,"acceptedAnswer":116},"How was CSSRank evaluated in the study?",{"text":117,"@type":113},"CSSRank was tested on standard benchmark functions and on two benchmark suites, CEC 2014 and CEC 2024. It was also compared against the original CSS and a wide range of state-of-the-art meta-heuristic algorithms.",{"name":119,"@type":110,"acceptedAnswer":120},"Where was CSSRank applied beyond benchmark functions?",{"text":121,"@type":113},"CSSRank was applied to six UCI clustering datasets and to three reservoir operation optimization problems, achieving higher clustering accuracy and more reliable objective values than baseline methods.","https://schema.org",{"og:url":83,"og:type":124,"og:title":65,"og:site_name":95,"og:description":67},"article",{"robots":126,"canonical":83},"index,follow",{"doc_id":128,"site_id":62},458193,1791442949,{"code":4,"msg":5,"data":131},{"doc_id":128,"user_id":132,"nickname":92,"user_avatar":133,"doc_module":4,"category_id":39,"category_name":40,"doc_title":65,"doc_description":67,"doc_content":134,"file_id":135,"file_url":136,"file_type":137,"file_size":138,"view_count":39,"is_deleted":4,"is_public":8,"is_downloadable":8,"audit_status":8,"page_count":139,"language":140,"language_code":63,"site_id":62,"html_lang":63,"table_of_contents":141,"faqs":142,"seo_title":143,"seo_description":67,"update_tm":144,"read_time":145,"preview_page_count":24,"preview_urls":146},13056703020460,"https://ap-avatar.wpscdn.com/avatar/be000253dac470eee5d?_k=1778207105932848923","[www. nature.com/scientificreports](www. nature.com/scientificreports)  \nOPEN  \nRank charged system search algorithm for optimization and operations research  \nMohamad Hosein Rabiei1, Elnaz Eilbeigi2, Siamak Talatahari3,4,5, Mohammadtaghi Alami1, Fang Chen3 & Amir H. Gandomi3,5,6􀀍  \nIn this paper, we introduce CSSRank, an improved version of the charged system search (CSS) algorithm, designed to address complex optimization problems more efficiently. CSSRank integratesa rank-based reduction selection strategy to enhance exploitation by progressively reducing the number of charged particles used in electric force calculations. To further balance exploration and exploitation, a ranking-based mutation strategy is incorporated, promoting diversity in early iterationsand precision in later stages. We evaluated CSSRank on a set of standard benchmark functions and compared its performance with the original CSS algorithm. In addition, CSSRank was tested on two major benchmark suites, CEC 2014 and CEC 2024, and compared against a wide range of stateof-the-art metaheuristic algorithms. The results show that CSSRank outperforms many existing methods on CEC 2014 and performs competitively and closetothe best-performing algorithms on CEC 2024, demonstrating both robustness and scalability. For real-world applications, CSSRank was applied to six UCI clustering datasets, where it consistently achieved higher clustering accuracy and more reliable objective values than baseline methods. It was also tested on three complex reservoir operation optimization problems, yielding superior engineering solutions with high reliability, and contributing to improvements in operational cost and resource efficiency. These results confirm the effectiveness, versatility, and reliability of CSSRank across both theoretical and practical optimization tasks, positioning it as a strong candidate for solving complex problems in optimization and operations research.  \nKeywords Charged system search, Rank-based method, Optimization, Meta-heuristic algorithms, Data clustering, Reservoir operation optimization  \nAbbreviations  \nCP qi fitbest  \nfitworst  \nfit(i) N  \nr  \nij X  \nbes X  \ni ε xi(0j)  \nxi,min  \nxi,max Pij F  \nj  \nCharged Particle  \nUniform charge density  \nThe value of the objective function for the best CP  \nThe value of the objective function for the worst CP  \nThe value of the objective function for the ith CP Total number ofCPs  \nSeparation distance between the ith and jth CPs Position of the best current CP  \nPosition of the ith CP Small positive number  \nInitial value of the ith variable for thejth CP Minimum allowable values for the ith variable  \nMaximum allowable values for the ith variable Probability of moving the ith-jth CPs Resultant force acting on the jth CP  \n1Department of Civil Engineering, University of Tabriz, Tabriz, Iran. 2Department of Biomedical Engineering, ET. C., Islamic Azad University, Tehran, Iran. 3Data Science Institute, Faculty of Engineering & Information Technology, University of Technology, Ultimo 2007, Australia. 4School of Computing, Macquarie University, Sydney, Australia.  \n5Department of Computer Science, Khazar University, Baku, Azerbaijan. 6University Research and Innovation Center (EKIK), Óbuda University, Budapest 1034, Hungary. 􀀍 email: [gandomi@uts.edu.au](gandomi@uts.edu.au)  \n[www. nature.com/scientificreports/](www. nature.com/scientificreports/)  \nXj,new  \nXj,old [V](Vj.new)[j.new](Vj.new)  \n[V](Vj.old)[j.old](Vj.old)  \nka  \nkv  \nrandj1, randj2 CM  \nCMCR  \nPAR  \na Sel(i)  \nSel(f ) it  \nMaxIt  \ncpp  \npm  \nRS  \nNew position of the jth CP Old position of the jth CP New velocity of the jth CP Old velocity of the jth CP Acceleration coefficients Velocity coefficients  \nTwo random numbers distributed in the range (0,1) Charged memory to save best CPs  \nProbability of using CM to generate new solution Probability of using neighboring of the best CP Radius of the charged sphere  \nInitial value of the selected percen","cbCaikKYw4eats3a","https://ap.wps.com/l/cbCaikKYw4eats3a","pdf",7088443,46,"English","# Introduction\n## Meta-heuristic algorithms background\n## Charged system search (CSS) and its mechanism\n## Practical limitations motivating CSSRank","[{\"question\":\"What is CSSRank and how does it improve charged system search (CSS)?\",\"answer\":\"CSSRank is an improved version of CSS designed for complex optimization. It enhances exploitation using a rank-based reduction strategy and improves exploration–exploitation balance with a ranking-based mutation strategy.\"},{\"question\":\"How was CSSRank evaluated in the study?\",\"answer\":\"CSSRank was tested on standard benchmark functions and on two benchmark suites, CEC 2014 and CEC 2024. It was also compared against the original CSS and a wide range of state-of-the-art meta-heuristic algorithms.\"},{\"question\":\"Where was CSSRank applied beyond benchmark functions?\",\"answer\":\"CSSRank was applied to six UCI clustering datasets and to three reservoir operation optimization problems, achieving higher clustering accuracy and more reliable objective values than baseline methods.\"}]","Rank charged system search algorithm for optimization and operations research - paper | PDF",1790752026,116,[147,151,155,159,163],{"page_no":8,"url":148,"width":149,"height":150},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/d6ecb394e2e91fce66b9e5c7b276df9d.webp",983,1291,{"page_no":14,"url":152,"width":153,"height":154},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/f52c26a2759ee995863a3b5ad9747f38.webp",982,1290,{"page_no":81,"url":156,"width":157,"height":158},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/7ac7b9493fe7ef9a0fc033c494bbefdc.webp",981,1289,{"page_no":19,"url":160,"width":161,"height":162},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/b0451afc9b7e8501fb2f435bd6fe356f.webp",980,1287,{"page_no":24,"url":164,"width":165,"height":166},"https://res-academy.cache.wpscdn.com/upload/kdocshare/2026-11-17/b2478b04cfbce430f9ea31d606aa7e3b.webp",979,1286]