A recent set of overused population-based methods have been published in recent years. Despite their popularity, most of them have uncertain, immature performance, partially done verifications, similar overused metaphors, similar immature exploration and exploitation components and operations, and an insecure tradeoff between exploration and exploitation trends in most of the new real-world cases. Therefore, all users need to extensively modify and adjust their operations based on main evolutionary methods to reach faster convergence, more stable balance, and high-quality results. To move the optimization community one step ahead toward more focus on performance rather than change of metaphor, a general-purpose population-based optimization technique called Hunger Games Search (HGS) is proposed in this research with a simple structure, special stability features and very competitive performance to realize the solutions of both constrained and unconstrained problems more effectively. The proposed HGS is designed according to the hunger-driven activities and behavioural choice of animals. This dynamic, fitness-wise search method follows a simple concept of “Hunger” as the most crucial homeostatic motivation and reason for behaviours, decisions, and actions in the life of all animals to make the process of optimization more understandable and consistent for new users and decision-makers. The Hunger Games Search incorporates the concept of hunger into the feature process; in other words, an adaptive weight based on the concept of hunger is designed and employed to simulate the effect of hunger on each search step. It follows the computationally logical rules (games) utilized by almost all animals and these rival activities and games are often adaptive evolutionary by securing higher chances of survival and food acquisition. This method's main feature is its dynamic nature, simple structure, and high performance in terms of convergence and acceptable quality of solutions, proving to be more efficient than the current optimization methods. The effectiveness of HGS was verified by comparing HGS with a comprehensive set of popular and advanced algorithms on 23 well-known optimization functions and the IEEE CEC 2014 benchmark test suite. Also, the HGS was applied to several engineering problems to demonstrate its applicability. The results validate the effectiveness of the proposed optimizer compared to popular essential optimizers, several advanced variants of the existing methods, and several CEC winners and powerful differential evolution (DE)-based methods abbreviated as LSHADE, SPS_L_SHADE_EIG, LSHADE_cnEpSi, SHADE, SADE, MPEDE, and JDE methods in handling many single-objective problems. We designed this open-source population-based method to be a standard tool for optimization in different areas of artificial intelligence and machine learning with several new exploratory and exploitative features, high performance, and high optimization capacity. The method is very flexible and scalable to be extended to fit more form of optimization cases in both structural aspects and application sides. This paper's source codes, supplementary files, Latex and office source files, sources of plots, a brief version and pseudocode, and an open-source software toolkit for solving optimization problems with Hunger Games Search and online web service for any question, feedback, suggestion, and idea on HGS algorithm will be available to the public at https://aliasgharheidari.com/HGS.html .

Hunger games search: Visions, conception, implementation, deep analysis, perspectives, and towards performance shifts

The optimization field suffers from the metaphor-based “pseudo-novel” or “fancy” optimizers. Most of these cliche methods mimic animals' searching trends and possess a small contribution to the optimization process itself. Most of these cliche methods suffer from the locally efficient performance, biased verification methods on easy problems, and high similarity between their components' interactions. This study attempts to go beyond the traps of metaphors and introduce a novel metaphor-free population-based optimization method based on the mathematical foundations and ideas of the Runge Kutta (RK) method widely well-known in mathematics. The proposed RUNge Kutta optimizer (RUN) was developed to deal with various types of optimization problems in the future. The RUN utilizes the logic of slope variations computed by the RK method as a promising and logical searching mechanism for global optimization. This search mechanism benefits from two active exploration and exploitation phases for exploring the promising regions in the feature space and constructive movement toward the global best solution. Furthermore, an enhanced solution quality (ESQ) mechanism is employed to avoid the local optimal solutions and increase convergence speed. The RUN algorithm's efficiency was evaluated by comparing with other metaheuristic algorithms in 50 mathematical test functions and four real-world engineering problems. The RUN provided very promising and competitive results, showing superior exploration and exploitation tendencies, fast convergence rate, and local optima avoidance. In optimizing the constrained engineering problems, the metaphor-free RUN demonstrated its suitable performance as well. The authors invite the community for extensive evaluations of this deep-rooted optimizer as a promising tool for real-world optimization. The source codes, supplementary materials, and guidance for the developed method will be publicly available at different hubs at http://imanahmadianfar.com and http://aliasgharheidari.com/RUN.html .

RUN beyond the metaphor: An efficient optimization algorithm based on Runge Kutta method

Multilevel threshold image segmentation with diffusion association slime mould algorithm and Renyi's entropy for chronic obstructive pulmonary disease.

In recent years, a variety of meta-heuristic nature-inspired algorithms have been proposed to solve complex optimization problems. However, these algorithms suffer from the shortcoming that multiple hyperparameters need to be set carefully. Therefore, to solve the problem, the kernel search optimization (KSO) algorithm inspired by the kernel method has been proposed. KSO can simplify the optimization process by transforming the optimization process of nonlinear function into the linear optimization process. Despite its advantage, the original KSO requires a large amount of computation, and has no powerful exploitation search, resulting in its inability to obtain more accurate results. In the present study, a local search of the hill-climbing algorithm is adopted, and the calculation of the kernel parameter is simplified to improve the original KSO. In an experiment using 50 benchmark functions, the new algorithm outperformed KSO and some well-known algorithms in accuracy and running time. Moreover, when applied in the real-world economic emission dispatch problem, the improved algorithm achieved a better performance than other algorithms compared. An online repository will support this research at https://aliasgharheidari.com .

Boosted kernel search: Framework, analysis and case studies on the economic emission dispatch problem

Modeling groundwater potential using novel GIS-based machine-learning ensemble techniques

\n History matching is a typical inverse problem that adjusts the uncertainty parameters of the reservoir numerical model with limited dynamic response data. In most situations, various parameter combinations can result in the same data fit, termed as nonuniqueness of inversion. It is desirable to find as many global or local optima as possible in a single optimization run, which may help to reveal the distribution of the uncertainty parameters in the posterior space, which is particularly important for robust optimization, risk analysis, and decision making in reservoir management. However, many factors, such as the nonlinearity of inversion problems and the time-consuming numerical simulation, limit the performance of most existing inverse algorithms. In this paper, we propose a novel data-driven niching differential evolution algorithm with adaptive parameter control for nonuniqueness of inversion, called DNDE-APC. On the basis of a differential evolution (DE) framework, the proposed algorithm integrates a clustering approach, niching technique, and local surrogate assistant method, which is designed to balance exploration and convergence in solving the multimodal inverse problems. Empirical studies on three benchmark problems demonstrate that the proposed algorithm is able to locate multiple solutions for complex multimodal problems on a limited computational budget. Integrated with convolutional variational autoencoder (CVAE) for parameterization of the high-dimensional uncertainty parameters, a history matching workflow is developed. The effectiveness of the proposed workflow is validated with heterogeneous waterflooding reservoir case studies. By analyzing the fitting and prediction of production data, history-matched realizations, the distribution of inversion parameters, and uncertainty quantization of forecasts, the results indicate that the new method can effectively tackle the nonuniqueness of inversion, and the prediction result is more robust.

Data-Driven Niching Differential Evolution with Adaptive Parameters Control for History Matching and Uncertainty Quantification

Handle everyday research tasks with reliable, citation-backed results

Your personal Research Agent to handle research tasks with citation-backed results

Popular Tasks used by Researchers

How can I help with your research?

Meet SciSpace

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Wang Jian

Author Tools

Chat about Author

Papers

Data-Driven Niching Differential Evolution with Adaptive Parameters Control for History Matching and Uncertainty Quantification