Um die anderen Arten von Veröffentlichungen zu diesem Thema anzuzeigen, folgen Sie diesem Link: METAHEURISTIC OPTIMIZATION TECHNIQUES.
Zeitschriftenartikel zum Thema „METAHEURISTIC OPTIMIZATION TECHNIQUES“
Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an
Machen Sie sich mit Top-50 Zeitschriftenartikel für die Forschung zum Thema "METAHEURISTIC OPTIMIZATION TECHNIQUES" bekannt.
Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.
Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.
Sehen Sie die Zeitschriftenartikel für verschiedene Spezialgebieten durch und erstellen Sie Ihre Bibliographie auf korrekte Weise.
1
Rahman, Md Ashikur, Rajalingam Sokkalingam, Mahmod Othman, Kallol Biswas, Lazim Abdullah und Evizal Abdul Kadir. „Nature-Inspired Metaheuristic Techniques for Combinatorial Optimization Problems: Overview and Recent Advances“. Mathematics 9, Nr. 20 (19.10.2021): 2633. http://dx.doi.org/10.3390/math9202633.
Der volle Inhalt der QuelleAnnotation:
Combinatorial optimization problems are often considered NP-hard problems in the field of decision science and the industrial revolution. As a successful transformation to tackle complex dimensional problems, metaheuristic algorithms have been implemented in a wide area of combinatorial optimization problems. Metaheuristic algorithms have been evolved and modified with respect to the problem nature since it was recommended for the first time. As there is a growing interest in incorporating necessary methods to develop metaheuristics, there is a need to rediscover the recent advancement of metaheuristics in combinatorial optimization. From the authors’ point of view, there is still a lack of comprehensive surveys on current research directions. Therefore, a substantial part of this paper is devoted to analyzing and discussing the modern age metaheuristic algorithms that gained popular use in mostly cited combinatorial optimization problems such as vehicle routing problems, traveling salesman problems, and supply chain network design problems. A survey of seven different metaheuristic algorithms (which are proposed after 2000) for combinatorial optimization problems is carried out in this study, apart from conventional metaheuristics like simulated annealing, particle swarm optimization, and tabu search. These metaheuristics have been filtered through some key factors like easy parameter handling, the scope of hybridization as well as performance efficiency. In this study, a concise description of the framework of the selected algorithm is included. Finally, a technical analysis of the recent trends of implementation is discussed, along with the impacts of algorithm modification on performance, constraint handling strategy, the handling of multi-objective situations using hybridization, and future research opportunities.
2
Feitosa Neto, Antonino, Anne Canuto und João Xavier-Junior. „Hybrid Metaheuristics to the Automatic Selection of Features and Members of Classifier Ensembles“. Information 9, Nr. 11 (26.10.2018): 268. http://dx.doi.org/10.3390/info9110268.
Der volle Inhalt der QuelleAnnotation:
Metaheuristic algorithms have been applied to a wide range of global optimization problems. Basically, these techniques can be applied to problems in which a good solution must be found, providing imperfect or incomplete knowledge about the optimal solution. However, the concept of combining metaheuristics in an efficient way has emerged recently, in a field called hybridization of metaheuristics or, simply, hybrid metaheuristics. As a result of this, hybrid metaheuristics can be successfully applied in different optimization problems. In this paper, two hybrid metaheuristics, MAMH (Multiagent Metaheuristic Hybridization) and MAGMA (Multiagent Metaheuristic Architecture), are adapted to be applied in the automatic design of ensemble systems, in both mono- and multi-objective versions. To validate the feasibility of these hybrid techniques, we conducted an empirical investigation, performing a comparative analysis between them and traditional metaheuristics as well as existing existing ensemble generation methods. Our findings demonstrate a competitive performance of both techniques, in which a hybrid technique provided the lowest error rate for most of the analyzed objective functions.
3
Misevičius, Alfonsas, Vytautas Bukšnaitis und Jonas Blonskis. „Kombinatorinis optmizavimas ir metaeuristiniai metodai: teoriniai aspektai“. Informacijos mokslai 42, Nr. 43 (01.01.2008): 213–19. http://dx.doi.org/10.15388/im.2008.0.3417.
Der volle Inhalt der QuelleAnnotation:
Straipsnyje aptariami kombinatorinio optimizavimo ir intelektualių optimizavimo priemonių, t. y. metaeuristinių metodų (metaeuristikų), teoriniai aspektai. Apibūdinami kombinatorinio optimizavimo uždaviniai, jų savybės, specifika. Pagrindinis dėmesys skiriamas metaeuristinių optimizavimo metodų charakterizavimui būtent kombinatorinio optimizavimo kontekste. Trumpai formuluojami metaeuristinių metodų tikslai, bendrosios nuostatos, taip pat akcentuojamas šių metodų savitumas, modernumas.Išsamiau apžvelgiami skiriamieji metaeuristikų bruožai, aprašomos svarbesnės teorinės metaeuristinių metodų aiškinimo kryptys. Pabaigoje pateikiamos apibendrinamosios pastabos.Combinatorial optimization and metaheuristic methods: theoretical aspectsAlfonsas Misevičius, Vytautas Bukšnaitis, Jonas Blonskis SummaryIn this paper, theoretical aspects of combinatorial optimization (CO) and intelligent optimization techniques, i. e. metaheuristic methods (metaheuristics) are discussed. The combinatorial optimization problems and their basic properties are shortly introduced. Much of our attention is paid to the characterization of the metaheuristic methods, in particular for solving CO problems. We formulate the main goals of the metaheuristic methods, also focusing on the special theoretical issues and features of these methods. The most important interpretations of the metaheuristic methods are described in more details. The paper is completed with the concluding remarks.
4
Sahoo, Rashmi Rekha, und Mitrabinda Ray. „Metaheuristic Techniques for Test Case Generation“. Journal of Information Technology Research 11, Nr. 1 (Januar 2018): 158–71. http://dx.doi.org/10.4018/jitr.2018010110.
Der volle Inhalt der QuelleAnnotation:
The primary objective of software testing is to locate bugs as many as possible in software by using an optimum set of test cases. Optimum set of test cases are obtained by selection procedure which can be viewed as an optimization problem. So metaheuristic optimizing (searching) techniques have been immensely used to automate software testing task. The application of metaheuristic searching techniques in software testing is termed as Search Based Testing. Non-redundant, reliable and optimized test cases can be generated by the search based testing with less effort and time. This article presents a systematic review on several meta heuristic techniques like Genetic Algorithms, Particle Swarm optimization, Ant Colony Optimization, Bee Colony optimization, Cuckoo Searches, Tabu Searches and some modified version of these algorithms used for test case generation. The authors also provide one framework, showing the advantages, limitations and future scope or gap of these research works which will help in further research on these works.
5
Funes Lora, Miguel Angel, Edgar Alfredo Portilla-Flores, Raul Rivera Blas, Emmanuel Alejandro Merchán Cruz und Manuel Faraón Carbajal Romero. „Metaheuristic techniques comparison to optimize robotic end-effector behavior and its workspace“. International Journal of Advanced Robotic Systems 15, Nr. 5 (01.09.2018): 172988141880113. http://dx.doi.org/10.1177/1729881418801132.
Der volle Inhalt der QuelleAnnotation:
Many robots are dedicated to replicate trajectories recorded manually; the recorded trajectories may contain singularities, which occur when positions and/or orientations are not achievable by the robot. The optimization of those trajectories is a complex issue and classical optimization methods present a deficient performance when solving them. Metaheuristics are well-known methodologies for solving hard engineering problems. In this case, they are applied to obtain alternative trajectories that pass as closely as possible to the original one, reorienting the end-effector and displacing its position to avoid the singularities caused by limitations of inverse kinematics equations, the task, and the workspace. In this article, alternative solutions for an ill-posed problem concerning the behavior of the robotic end-effector position and orientation are proposed using metaheuristic algorithms such as cuckoo search, differential evolution, and modified artificial bee colony. The case study for this work considers a three-revolute robot (3R), whose trajectories can contain or not singularities, and an optimization problem is defined to minimize the objective function that represents the error of the alternative trajectories. A tournament in combination with a constant of proportionality allows the metaheuristics to modify the gradual orientation and position of the robot when a singularity is present. Consequently, the procedure selects from all the possible elbow-configurations the best that fits the trajectory. A classical numerical technique, Newton’s method, is used to compare the results of the applied metaheuristics, to evaluate their quality. The results of this implementation indicate that metaheuristic algorithms are an efficient tool to solve the problem of optimizing the end-effector behavior, because of the quality of the alternative trajectory produced.
6
Radhika, Sajja, und Aparna Chaparala. „Optimization using evolutionary metaheuristic techniques: a brief review“. Brazilian Journal of Operations & Production Management 15, Nr. 1 (10.05.2018): 44–53. http://dx.doi.org/10.14488/bjopm.2018.v15.n1.a17.
Der volle Inhalt der QuelleAnnotation:
Optimization is necessary for finding appropriate solutions to a range of real life problems. Evolutionary-approach-based meta-heuristics have gained prominence in recent years for solving Multi Objective Optimization Problems (MOOP). Multi Objective Evolutionary Approaches (MOEA) has substantial success across a variety of real-world engineering applications. The present paper attempts to provide a general overview of a few selected algorithms, including genetic algorithms, ant colony optimization, particle swarm optimization, and simulated annealing techniques. Additionally, the review is extended to present differential evolution and teaching-learning-based optimization. Few applications of the said algorithms are also presented. This review intends to serve as a reference for further work in this domain.
7
Augusto, Adriano, Marlon Dumas, Marcello La Rosa, Sander J. J. Leemans und Seppe K. L. M. vanden Broucke. „Optimization framework for DFG-based automated process discovery approaches“. Software and Systems Modeling 20, Nr. 4 (27.02.2021): 1245–70. http://dx.doi.org/10.1007/s10270-020-00846-x.
Der volle Inhalt der QuelleAnnotation:
AbstractThe problem of automatically discovering business process models from event logs has been intensely investigated in the past two decades, leading to a wide range of approaches that strike various trade-offs between accuracy, model complexity, and execution time. A few studies have suggested that the accuracy of automated process discovery approaches can be enhanced by means of metaheuristic optimization techniques. However, these studies have remained at the level of proposals without validation on real-life datasets or they have only considered one metaheuristic in isolation. This article presents a metaheuristic optimization framework for automated process discovery. The key idea of the framework is to construct a directly-follows graph (DFG) from the event log, to perturb this DFG so as to generate new candidate solutions, and to apply a DFG-based automated process discovery approach in order to derive a process model from each DFG. The framework can be instantiated by linking it to an automated process discovery approach, an optimization metaheuristic, and the quality measure to be optimized (e.g., fitness, precision, F-score). The article considers several instantiations of the framework corresponding to four optimization metaheuristics, three automated process discovery approaches (Inductive Miner—directly-follows, Fodina, and Split Miner), and one accuracy measure (Markovian F-score). These framework instances are compared using a set of 20 real-life event logs. The evaluation shows that metaheuristic optimization consistently yields visible improvements in F-score for all the three automated process discovery approaches, at the cost of execution times in the order of minutes, versus seconds for the baseline approaches.
8
Navarro-Acosta, Jesús Alejandro, Irma D. García-Calvillo, Vanesa Avalos-Gaytán und Edgar O. Reséndiz-Flores. „Metaheuristics and Support Vector Data Description for Fault Detection in Industrial Processes“. Applied Sciences 10, Nr. 24 (21.12.2020): 9145. http://dx.doi.org/10.3390/app10249145.
Der volle Inhalt der QuelleAnnotation:
In this study, a system for faults detection using a combination of Support Vector Data Description (SVDD) with metaheuristic algorithms is presented. The presented approach is applied to a real industrial process where the set of measured faults is scarce. The original contribution in this work is the industrial context of application and the comparison of swarm intelligence algorithms to optimize the SVDD hyper-parameters. Four recent metaheuristics are compared hereby to solve the corresponding optimization problem in an efficient manner. These optimization techniques are then implemented for fault detection in a multivariate industrial process with non-balanced data. The obtained numerical results seem to be promising when the considered optimization techniques are combined with SVDD. In particular, the Spotted Hyena algorithm outperforms other metaheuristics reaching values of F1 score near 100% in fault detection.
9
Fidanova, Stefka Stoyanova, und Olympia Nikolaeva Roeva. „Metaheuristic Techniques for Optimization of anE. ColiCultivation Model“. Biotechnology & Biotechnological Equipment 27, Nr. 3 (Januar 2013): 3870–76. http://dx.doi.org/10.5504/bbeq.2012.0136.
Der volle Inhalt der Quelle
10
Tahami, Hesamoddin, und Hengameh Fakhravar. „A Literature Review on Combining Heuristics and Exact Algorithms in Combinatorial Optimization“. European Journal of Information Technologies and Computer Science 2, Nr. 2 (29.04.2022): 6–12. http://dx.doi.org/10.24018/compute.2022.2.2.50.
Der volle Inhalt der QuelleAnnotation:
There are several approaches for solving hard optimization problems. Mathematical programming techniques such as (integer) linear programming-based methods and metaheuristic approaches are two extremely effective streams for combinatorial problems. Different research streams, more or less in isolation from one another, created these two. Only several years ago, many scholars noticed the advantages and enormous potential of building hybrids of combining mathematical programming methodologies and metaheuristics. In reality, many problems can be solved much better by exploiting synergies between these approaches than by “pure” classical algorithms. The key question is how to integrate mathematical programming methods and metaheuristics to achieve such benefits. This paper reviews existing techniques for such combinations and provides examples of using them for vehicle routing problems.
11
Palominos, Pedro, Carla Ortega, Miguel Alfaro, Guillermo Fuertes, Manuel Vargas, Mauricio Camargo, Victor Parada und Gustavo Gatica. „Chaotic Honeybees Optimization Algorithms Approach for Traveling Salesperson Problem“. Complexity 2022 (11.10.2022): 1–17. http://dx.doi.org/10.1155/2022/8903005.
Der volle Inhalt der QuelleAnnotation:
Due to the difficulty in solving combinatorial optimization problems, it is necessary to improve the performance of the algorithms by improving techniques to deal with complex optimizations. This research addresses the metaheuristics of marriage in honey-bees optimization (MBO) based on the behavior of bees. The current study proposes a technique for solving combinatorial optimization problems within proper computation times. The purpose of this study focuses on the travelling salesperson problem and the application of chaotic methods in important sections of the MBO metaheuristic. Three experiments were conducted to measure the efficiency and quality of the solutions: (1) MBO with chaos to generate initial solutions (MBO2); (2) MBO with chaos in the workers (MBO3); and (3) MBO with chaos to generate initial solutions and the workers (MBO4). The application of chaotic functions in MBO was significantly better at solving the travelling salesperson problem.
12
Soto, Ricardo, Broderick Crawford, Boris Almonacid und Fernando Paredes. „Efficient Parallel Sorting for Migrating Birds Optimization When Solving Machine-Part Cell Formation Problems“. Scientific Programming 2016 (2016): 1–39. http://dx.doi.org/10.1155/2016/9402503.
Der volle Inhalt der QuelleAnnotation:
The Machine-Part Cell Formation Problem (MPCFP) is a NP-Hard optimization problem that consists in grouping machines and parts in a set of cells, so that each cell can operate independently and the intercell movements are minimized. This problem has largely been tackled in the literature by using different techniques ranging from classic methods such as linear programming to more modern nature-inspired metaheuristics. In this paper, we present an efficient parallel version of the Migrating Birds Optimization metaheuristic for solving the MPCFP. Migrating Birds Optimization is a population metaheuristic based on the V-Flight formation of the migrating birds, which is proven to be an effective formation in energy saving. This approach is enhanced by the smart incorporation of parallel procedures that notably improve performance of the several sorting processes performed by the metaheuristic. We perform computational experiments on 1080 benchmarks resulting from the combination of 90 well-known MPCFP instances with 12 sorting configurations with and without threads. We illustrate promising results where the proposal is able to reach the global optimum in all instances, while the solving time with respect to a nonparallel approach is notably reduced.
13
Roeva, Olympia, Dafina Zoteva und Velislava Lyubenova. „Escherichia coli Cultivation Process Modelling Using ABC-GA Hybrid Algorithm“. Processes 9, Nr. 8 (16.08.2021): 1418. http://dx.doi.org/10.3390/pr9081418.
Der volle Inhalt der QuelleAnnotation:
In this paper, the artificial bee colony (ABC) algorithm is hybridized with the genetic algorithm (GA) for a model parameter identification problem. When dealing with real-world and large-scale problems, it becomes evident that concentrating on a sole metaheuristic algorithm is somewhat restrictive. A skilled combination between metaheuristics or other optimization techniques, a so-called hybrid metaheuristic, can provide more efficient behavior and greater flexibility. Hybrid metaheuristics combine the advantages of one algorithm with the strengths of another. ABC, based on the foraging behavior of honey bees, and GA, based on the mechanics of nature selection, are among the most efficient biologically inspired population-based algorithms. The performance of the proposed ABC-GA hybrid algorithm is examined, including classic benchmark test functions. To demonstrate the effectiveness of ABC-GA for a real-world problem, parameter identification of an Escherichia coli MC4110 fed-batch cultivation process model is considered. The computational results of the designed algorithm are compared to the results of different hybridized biologically inspired techniques (ant colony optimization (ACO) and firefly algorithm (FA))—hybrid algorithms as ACO-GA, GA-ACO and ACO-FA. The algorithms are applied to the same problems—a set of benchmark test functions and the real nonlinear optimization problem. Taking into account the overall searchability and computational efficiency, the results clearly show that the proposed ABC–GA algorithm outperforms the considered hybrid algorithms.
14
Adekanmbi, Oluwole, und Paul Green. „Conceptual Comparison of Population Based Metaheuristics for Engineering Problems“. Scientific World Journal 2015 (2015): 1–9. http://dx.doi.org/10.1155/2015/936106.
Der volle Inhalt der QuelleAnnotation:
Metaheuristic algorithms are well-known optimization tools which have been employed for solving a wide range of optimization problems. Several extensions of differential evolution have been adopted in solving constrained and nonconstrained multiobjective optimization problems, but in this study, the third version of generalized differential evolution (GDE) is used for solving practical engineering problems. GDE3 metaheuristic modifies the selection process of the basic differential evolution and extends DE/rand/1/bin strategy in solving practical applications. The performance of the metaheuristic is investigated through engineering design optimization problems and the results are reported. The comparison of the numerical results with those of other metaheuristic techniques demonstrates the promising performance of the algorithm as a robust optimization tool for practical purposes.
15
Saber, Mohamed, Abdelaziz A. Abdelhamid und Abdelhameed Ibrahim. „Metaheuristic Optimization Review: Algorithms and Applications“. Journal of Artificial Intelligence and Metaheuristics 3, Nr. 1 (2023): 21–30. http://dx.doi.org/10.54216/jaim.030102.
Der volle Inhalt der QuelleAnnotation:
Metaheuristic optimisation algorithms have become more well liked in recent years due to their success in solving challenging optimisation problems. Only a few of the metaheuristic optimisation techniques covered in this work include genetic algorithms, particle swarm optimisation, simulated annealing, ant colony optimisation, and many others. This paper discusses the history, operation, and applications of each method, including applications in engineering, finance, and bioinformatics.
16
Vaiyapuri, Thavavel, Ashit Kumar Dutta, Mohamed Yacin Sikkandar, Deepak Gupta, Bader Alouffi, Abdullah Alharbi, Hafiz Tayyab Rauf und Seifedine Kadry. „Design of Metaheuristic Optimization-Based Vascular Segmentation Techniques for Photoacoustic Images“. Contrast Media & Molecular Imaging 2022 (30.01.2022): 1–12. http://dx.doi.org/10.1155/2022/4736113.
Der volle Inhalt der QuelleAnnotation:
Biomedical imaging technologies are designed to offer functional, anatomical, and molecular details related to the internal organs. Photoacoustic imaging (PAI) is becoming familiar among researchers and industrialists. The PAI is found useful in several applications of brain and cancer imaging such as prostate cancer, breast cancer, and ovarian cancer. At the same time, the vessel images hold important medical details which offer strategies for a qualified diagnosis. Recently developed image processing techniques can be employed to segment vessels. Since vessel segmentation on PAI is a difficult process, this paper employs metaheuristic optimization-based vascular segmentation techniques for PAI. The proposed model involves two distinct kinds of vessel segmentation approaches such as Shannon’s entropy function (SEF) and multilevel Otsu thresholding (MLOT). Moreover, the threshold value and entropy function in the segmentation process are optimized using three metaheuristics such as the cuckoo search (CS), equilibrium optimizer (EO), and harmony search (HS) algorithms. A detailed experimental analysis is made on benchmark PAI dataset, and the results are inspected under varying aspects. The obtained results pointed out the supremacy of the presented model with a higher accuracy of 98.71%.
17
Diyaley, Sunny, und Shankar Chakraborty. „OPTIMIZATION OF MULTI-PASS FACE MILLING PARAMETERS USING METAHEURISTIC ALGORITHMS“. Facta Universitatis, Series: Mechanical Engineering 17, Nr. 3 (29.11.2019): 365. http://dx.doi.org/10.22190/fume190605043d.
Der volle Inhalt der QuelleAnnotation:
In this paper, six metaheuristic algorithms, in the form of artificial bee colony optimization, ant colony optimization, particle swarm optimization, differential evolution, firefly algorithm and teaching-learning-based optimization techniques are applied for parametric optimization of a multi-pass face milling process. Using those algorithms, the optimal values of cutting speed, feed rate and depth of cut for both roughing and finishing operations are determined for having minimum total production time and total production cost. It is observed that the teaching-learning-based optimization algorithm outperforms the others with respect to accuracy and consistency of the derived solutions as well as computational speed. Two statistical tests, i.e. paired t-test and Wilcoxson signed rank test also confirm its superiority over the remaining algorithms. Finally, these metaheuristics are employed for multi-objective optimization of the considered multi-pass milling process while concurrently minimizing both the objectives.
18
Gordan, Meisam, Zubaidah Binti Ismail, Hashim Abdul Razak, Khaled Ghaedi und Haider Hamad Ghayeb. „Optimization-Based Evolutionary Data Mining Techniques for Structural Health Monitoring“. Journal of Civil Engineering and Construction 9, Nr. 1 (15.02.2020): 14–23. http://dx.doi.org/10.32732/jcec.2020.9.1.14.
Der volle Inhalt der QuelleAnnotation:
In recent years, data mining technology has been employed to solve various Structural Health Monitoring (SHM) problems as a comprehensive strategy because of its computational capability. Optimization is one the most important functions in Data mining. In an engineering optimization problem, it is not easy to find an exact solution. In this regard, evolutionary techniques have been applied as a part of procedure of achieving the exact solution. Therefore, various metaheuristic algorithms have been developed to solve a variety of engineering optimization problems in SHM. This study presents the most applicable as well as effective evolutionary techniques used in structural damage identification. To this end, a brief overview of metaheuristic techniques is discussed in this paper. Then the most applicable optimization-based algorithms in structural damage identification are presented, i.e. Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Imperialist Competitive Algorithm (ICA) and Ant Colony Optimization (ACO). Some related examples are also detailed in order to indicate the efficiency of these algorithms.
19
Abbas, Ghulam, Irfan Ahmad Khan, Naveed Ashraf, Muhammad Taskeen Raza, Muhammad Rashad und Raheel Muzzammel. „On Employing a Constrained Nonlinear Optimizer to Constrained Economic Dispatch Problems“. Sustainability 15, Nr. 13 (21.06.2023): 9924. http://dx.doi.org/10.3390/su15139924.
Der volle Inhalt der QuelleAnnotation:
Recently, different metaheuristic techniques, their variants, and hybrid forms have been extensively used to solve economic load dispatch (ELD) problems with and without valve point loading (VPL) effects. Due to the randomization involved in these metaheuristic techniques, one has to perform extensive runs for each experiment to get an optimal solution. The process may sometimes become laborious and time-consuming to converge to an optimal solution. On the other hand, advanced calculus-based techniques, being deterministic, perform iteration systematically and come up with the same solution on each run of the experiment. Since ELD problems are constrained optimization problems, we are proposing the constrained (deterministic) optimization algorithm for their solutions. Various 13–unit, 38-unit, and 40-unit thermal test systems are considered. Valve point loading (VPL) effects are also considered in some cases. Computer-based numerical results depict that the constrained optimization algorithm shows evidence of being almost as competitive in a total fuel cost as the metaheuristic optimization techniques, especially for the less-constrained ELD problems but with far reduced computation time. This finding validates the application of the constrained optimization technique to solve the economic dispatch problem.
20
Rahman, Muhammad Affiq Abd, Bazilah Ismail, Kanendra Naidu und Mohd Khairil Rahmat. „Review on population-based metaheuristic search techniques for optimal power flow“. Indonesian Journal of Electrical Engineering and Computer Science 15, Nr. 1 (01.07.2019): 373. http://dx.doi.org/10.11591/ijeecs.v15.i1.pp373-381.
Der volle Inhalt der QuelleAnnotation:
<span>Optimal power flow (OPF) is a non-linear solution which is significantly important in order to analyze the power system operation. The use of optimization algorithm is essential in order to solve OPF problems. <br /> The emergence of machine learning presents further techniques which capable to solve the non-linear problem. The performance and the key aspects which enhances the effectiveness of these optimization techniques are compared within several metaheuristic search techniques. This includes the operation of particle swarm optimization (PSO) algorithm, firefly algorithm (FA), artificial bee colony (ABC) algorithm, ant colony optimization (ACO) algorithm and differential evolution (DE) algorithm. This paper reviews on the key elements that need to be considered when selecting metaheuristic techniques to solve OPF problem in power <br /> system operation.</span>
21
Nguyen, Trung Kien, In-Gon Lee, Obum Kwon, Yoon-Jae Kim und Ic-Pyo Hong. „Metaheuristic Optimization Techniques for an Electromagnetic Multilayer Radome Design“. Journal of Electromagnetic Engineering and Science 19, Nr. 1 (31.01.2019): 31–36. http://dx.doi.org/10.26866/jees.2019.19.1.31.
Der volle Inhalt der Quelle
22
Becerra-Rozas, Marcelo, José Lemus-Romani, Felipe Cisternas-Caneo, Broderick Crawford, Ricardo Soto und José García. „Swarm-Inspired Computing to Solve Binary Optimization Problems: A Backward Q-Learning Binarization Scheme Selector“. Mathematics 10, Nr. 24 (15.12.2022): 4776. http://dx.doi.org/10.3390/math10244776.
Der volle Inhalt der QuelleAnnotation:
In recent years, continuous metaheuristics have been a trend in solving binary-based combinatorial problems due to their good results. However, to use this type of metaheuristics, it is necessary to adapt them to work in binary environments, and in general, this adaptation is not trivial. The method proposed in this work evaluates the use of reinforcement learning techniques in the binarization process. Specifically, the backward Q-learning technique is explored to choose binarization schemes intelligently. This allows any continuous metaheuristic to be adapted to binary environments. The illustrated results are competitive, thus providing a novel option to address different complex problems in the industry.
23
García, José, Gino Astorga und Víctor Yepes. „An Analysis of a KNN Perturbation Operator: An Application to the Binarization of Continuous Metaheuristics“. Mathematics 9, Nr. 3 (24.01.2021): 225. http://dx.doi.org/10.3390/math9030225.
Der volle Inhalt der QuelleAnnotation:
The optimization methods and, in particular, metaheuristics must be constantly improved to reduce execution times, improve the results, and thus be able to address broader instances. In particular, addressing combinatorial optimization problems is critical in the areas of operational research and engineering. In this work, a perturbation operator is proposed which uses the k-nearest neighbors technique, and this is studied with the aim of improving the diversification and intensification properties of metaheuristic algorithms in their binary version. Random operators are designed to study the contribution of the perturbation operator. To verify the proposal, large instances of the well-known set covering problem are studied. Box plots, convergence charts, and the Wilcoxon statistical test are used to determine the operator contribution. Furthermore, a comparison is made using metaheuristic techniques that use general binarization mechanisms such as transfer functions or db-scan as binarization methods. The results obtained indicate that the KNN perturbation operator improves significantly the results.
24
Moayedi, Kalantar, Foong, Tien Bui und Motevalli. „Application of Three Metaheuristic Techniques in Simulation of Concrete Slump“. Applied Sciences 9, Nr. 20 (15.10.2019): 4340. http://dx.doi.org/10.3390/app9204340.
Der volle Inhalt der QuelleAnnotation:
Slump is a workability-related characteristic of concrete mixture. This paper investigates the efficiency of a novel optimizer, namely ant lion optimization (ALO), for fine-tuning of a neural network (NN) in the field of concrete slump prediction. Two well-known optimization techniques, biogeography-based optimization (BBO) and grasshopper optimization algorithm (GOA), are also considered as benchmark models to be compared with ALO. Considering seven slump effective factors, namely cement, slag, water, fly ash, superplasticizer (SP), fine aggregate (FA), and coarse aggregate (CA), the mentioned algorithms are synthesized with a neural network to determine the best-fitted neural parameters. The most appropriate complexity of each ensemble is also found by a population-based sensitivity analysis. The findings revealed that the proposed ALO-NN model acquires a good approximation of concrete slump, regarding the calculated root mean square error (RMSE = 3.7788) and mean absolute error (MAE = 3.0286). It also outperformed both BBO-NN (RMSE = 4.1859 and MAE = 3.3465) and GOA-NN (RMSE = 4.9553 and MAE = 3.8576) ensembles.
25
Ammar, Hossam Hassan, Ahmad Taher Azar, Raafat Shalaby und M. I. Mahmoud. „Metaheuristic Optimization of Fractional Order Incremental Conductance (FO-INC) Maximum Power Point Tracking (MPPT)“. Complexity 2019 (28.11.2019): 1–13. http://dx.doi.org/10.1155/2019/7687891.
Der volle Inhalt der QuelleAnnotation:
This paper seeks to improve the photovoltaic (PV) system efficiency using metaheuristic, optimized fractional order incremental conductance (FO-INC) control. The proposed FO-INC controls the output voltage of the PV arrays to obtain maximum power point tracking (MPPT). Due to its simplicity and efficiency, the incremental conductance MPPT (INC-MPPT) is one of the most popular algorithms used in the PV scheme. However, owing to the nonlinearity and fractional order (FO) nature of both PV and DC-DC converters, the conventional INC algorithm provides a trade-off between monitoring velocity and tracking precision. Fractional calculus is used to provide an enhanced dynamical model of the PV system to describe nonlinear characteristics. Moreover, three metaheuristic optimization techniques are applied; Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO), and AntLion Optimizer (ALO) are used for tuning the FO parameters of the proposed INC-MPPT. A MATLAB-Simulink-based model of the PV and optimization have been developed and simulated for different INC-MPPT techniques. Different techniques aim to control the boost DC-DC converter towards the MPP. The proposed optimization algorithms are, also, developed and implemented in MATLAB to tune the target parameters. Four performance indices are also introduced in this research to show the reliability of the comparative analysis of the proposed FO-INC with metaheuristic optimization and the conventional INC-MPPT algorithms when applied to a dynamical PV system under rapidly changing weather conditions. The simulation results show the effective performance of the proposed metaheuristic optimized FO-INC as a MPPT control for different climatic conditions with disturbance rejection and robustness analysis.
26
Dutta, Pijush, Supradip Kumar Biswas und Madhurima Majumder. „Parametric optimization of Solar Parabolic Collector using metaheuristic Optimization“. Computational Intelligence and Machine Learning 2, Nr. 1 (20.04.2021): 26–32. http://dx.doi.org/10.36647/ciml/02.01.a004.
Der volle Inhalt der QuelleAnnotation:
Estimation of an exceptionally exact model for solar parabolic collector from the experimental data is an important task for the researchers for the recreation, assessment, control and plan. Efficient optimization techniques are fundamental to accomplish this undertaking. In this paper a modified optimization technique is proposed for productive and precise estimation of the parameters of solar parabolic collector. The proposed algorithm is concentrated on the modification of Elephant Swarm Water Search Algorithm. This algorithm tested on parabolic collector parameters, namely reflectivity, Absorptivity & period of sun incidence. Response surface methodology has been used to implement the non linear model between the input & output parameters of the process. In addition, the proposed ESWSA optimization technique has been tested against the manufacture datasheet of solar parabolic reflector. Results show the effectiveness of ESWSA algorithm for modeling of the solar parabolic systems. Keyword : Solar parabolic Collector, Parameters, ESWSA, Optimization
27
López, Luis Fernando de Mingo, Francisco Serradilla García, José Eugenio Naranjo Hernández und Nuria Gómez Blas. „Speed Proportional Integrative Derivative Controller: Optimization Functions in Metaheuristic Algorithms“. Journal of Advanced Transportation 2021 (03.11.2021): 1–12. http://dx.doi.org/10.1155/2021/5538296.
Der volle Inhalt der QuelleAnnotation:
Recent advancements in computer science include some optimization models that have been developed and used in real applications. Some metaheuristic search/optimization algorithms have been tested to obtain optimal solutions to speed controller applications in self-driving cars. Some metaheuristic algorithms are based on social behaviour, resulting in several search models, functions, and parameters, and thus algorithm-specific strengths and weaknesses. The present paper proposes a fitness function on the basis of the mathematical description of proportional integrative derivate controllers showing that mean square error is not always the best measure when looking for a solution to the problem. The fitness developed in this paper contains features and equations from the mathematical background of proportional integrative derivative controllers to calculate the best performance of the system. Such results are applied to quantitatively evaluate the performance of twenty-one optimization algorithms. Furthermore, improved versions of the fitness function are considered, in order to investigate which aspects are enhanced by applying the optimization algorithms. Results show that the right fitness function is a key point to get a good performance, regardless of the chosen algorithm. The aim of this paper is to present a novel objective function to carry out optimizations of the gains of a PID controller, using several computational intelligence techniques to perform the optimizations. The result of these optimizations will demonstrate the improved efficiency of the selected control schema.
28
Rawat, Devendra, Mukul Kumar Gupta und Abhinav Sharma. „Trajectory Control of Robotic Manipulator using Metaheuristic Algorithms“. International Journal of Mathematical, Engineering and Management Sciences 8, Nr. 2 (01.04.2023): 264–81. http://dx.doi.org/10.33889/ijmems.2023.8.2.016.
Der volle Inhalt der QuelleAnnotation:
Robotic manipulators are extremely nonlinear complex and, uncertain systems. They have multi-input multi-output (MIMO) dynamics, which makes controlling manipulators difficult. Robotic manipulators have wide applications in many industries like processes, medicine, and space. Effective control of these manipulators is extremely important to perform these industrial tasks. Researchers are working on the control of robotic manipulators using conventional and intelligent control methods. Conventional control methods are proportional integral and derivative (PID), Fractional order proportional integral and derivative (FOPID), sliding mode control (SMC), and optimal & robust control while intelligent control method includes Artificial Neural network (ANN), Fuzzy logic control (FLC) and metaheuristic optimization algorithms based control schemes. This paper presents the trajectory control of a robotic manipulator using a PID controller. Four different meta-heuristic algorithms namely Sooty tern optimization (STO), Spotted Hyena optimizer (SHO), Atom Search optimization (ASO), and Arithmetic Optimization algorithm (AOA) are used to optimize the gains of PID controller for trajectory control of a two-link robotic manipulator and a novel hybrid sooty tern and particle swarm optimization (STOPSO) has been designed. These optimization techniques are nature-inspired algorithms that give the optimal gain values while minimizing the performance indices. A performance index comprising Integral time absolute error (ITAE) having weights for both links has been considered to achieve the desired trajectory. These optimization techniques are stochastic in nature so statistical analysis and Freidman’s ranking test has been performed to evaluate the effectiveness of these algorithms. The proposed hybrid STOPSO provided a fitness value of 0.04541 and showed a standard deviation of 0.0002. A comparative study of these optimization techniques is presented and as a result, hybrid STOPSO provides the best results with minimum fitness value followed by STO, AOA, ASO, and SHO algorithms.
29
Munien, Chanaleä, und Absalom E. Ezugwu. „Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications“. Journal of Intelligent Systems 30, Nr. 1 (01.01.2021): 636–63. http://dx.doi.org/10.1515/jisys-2020-0117.
Der volle Inhalt der QuelleAnnotation:
Abstract The bin-packing problem (BPP) is an age-old NP-hard combinatorial optimization problem, which is defined as the placement of a set of different-sized items into identical bins such that the number of containers used is optimally minimized. Besides, different variations of the problem do exist in practice depending on the bins dimension, placement constraints, and priority. More so, there are several important real-world applications of the BPP, especially in cutting industries, transportation, warehousing, and supply chain management. Due to the practical relevance of this problem, researchers are consistently investigating new and improved techniques to solve the problem optimally. Nature-inspired metaheuristics are powerful algorithms that have proven their incredible capability of solving challenging and complex optimization problems, including several variants of BPPs. However, no comprehensive literature review exists on the applications of the metaheuristic approaches to solve the BPPs. Therefore, to fill this gap, this article presents a survey of the recent advances achieved for the one-dimensional BPP, with specific emphasis on population-based metaheuristic algorithms. We believe that this article can serve as a reference guide for researchers to explore and develop more robust state-of-the-art metaheuristics algorithms for solving the emerging variants of the bin-parking problems.
30
Sağ, Tahir. „Approaches Used In Adapting Metaheuristic Optimization Algorithms Developed For Continuous Problems to Discrete Problems“. Proceedings of The International Conference on Academic Research in Science, Technology and Engineering 1, Nr. 1 (09.05.2023): 1–11. http://dx.doi.org/10.33422/icarste.v1i1.12.
Der volle Inhalt der QuelleAnnotation:
Many real-world problems such as determining the type and number of wind turbines, facility placement problems, job scheduling problems, are in the category of combinatorial optimization problems in terms of the type of decision variables. However, since many of the evolutionary optimization algorithms are developed for solving continuous optimization problems, they cannot be directly applied to optimization problems with discrete decision variables. Therefore, the continuous decision variable values generated by these metaheuristics need to be converted to binary values using some techniques. In other words, to apply such algorithms to discrete optimization problems, it is necessary to adapt the candidate solution vectors of the algorithms to discrete values and make changes in their working structures. In this study, firstly, adaptation methods that are frequently used in previous studies in transforming metaheuristic optimization algorithms designed for the solution of continuous optimization problems into discrete optimization algorithms are explained. Then, the popular location update strategies used in solving discrete optimization problems are explained. The presented work summarizes the process of adapting continuous optimization algorithms to solve combinatorial problems step by step.
31
Niyonteze, Jean De Dieu, Fumin Zou, Godwin Norense Osarumwense Asemota, Walter Nsengiyumva, Noel Hagumimana, Longyun Huang, Aphrodis Nduwamungu und Samuel Bimenyimana. „Applications of Metaheuristic Algorithms in Solar Air Heater Optimization: A Review of Recent Trends and Future Prospects“. International Journal of Photoenergy 2021 (27.04.2021): 1–36. http://dx.doi.org/10.1155/2021/6672579.
Der volle Inhalt der QuelleAnnotation:
A transition to solar energy systems is considered one of the most important alternatives to conventional fossil fuels. Until recently, solar air heaters (SAHs) were among the other solar energy systems that have been widely used in various households and industrial applications. However, the recent literature reveals that efficiencies of SAHs are still low. Some metaheuristic algorithms have been used to enhance the efficiencies of these SAH systems. In the paper, we do not only discuss the techniques used to enhance the performance of SAHs, but we also reviewed a majority of published papers on the applications of SAH optimization. The metaheuristic algorithms include simulated annealing (SA), particle swarm optimization (PSO), genetic algorithm (GA), artificial bee colony (ABC), teaching-learning-based optimization (TLBO), and elitist teaching-learning-based optimization (ETLBO). For this research, it should be noted that this study is mostly based on the literature published in the last ten years in good energy top journals. Therefore, this paper clearly shows that the use of all six proposed metaheuristic algorithms results in significant efficiency improvements through the selection of the optimal design set and operating parameters for SAHs. Based on the past literature and on the outcomes of this paper, ETLBO is unquestionably more competitive than ABC, GA, PSO, SA, and TLBO for the optimization of SAHs for the same considered problem. Finally, based on the covered six state-of-the-art metaheuristic techniques, some perspectives and recommendations for the future outlook of SAH optimization are proposed. This paper is the first-ever attempt to present the current developments to a large audience on the applications of metaheuristic methods in SAH optimization. Thus, researchers can use this paper for further research and for the advancement of the proposed and other recommended algorithms to generate the best performance for the various SAHs.
32
A. Bewoor, Laxmi, V. Chandra Prakash und Sagar U. Sapkal. „Comparative Analysis of Metaheuristic Approaches for Makespan Minimization for No Wait Flow Shop Scheduling Problem“. International Journal of Electrical and Computer Engineering (IJECE) 7, Nr. 1 (01.02.2017): 417. http://dx.doi.org/10.11591/ijece.v7i1.pp417-423.
Der volle Inhalt der QuelleAnnotation:
This paper provides comparative analysis of various metaheuristic approaches for m-machine no wait flow shop scheduling (NWFSS) problem with makespan as an optimality criterion. NWFSS problem is NP hard and brute force method unable to find the solutions so approximate solutions are found with metaheuristic algorithms. The objective is to find out the scheduling sequence of jobs to minimize total completion time. In order to meet the objective criterion, existing metaheuristic techniques viz. Tabu Search (TS), Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) are implemented for small and large sized problems and effectiveness of these techniques are measured with statistical metric.
33
Abbas, Farkhanda, Feng Zhang, Muhammad Ismail, Garee Khan, Javed Iqbal, Abdulwahed Fahad Alrefaei und Mohammed Fahad Albeshr. „Optimizing Machine Learning Algorithms for Landslide Susceptibility Mapping along the Karakoram Highway, Gilgit Baltistan, Pakistan: A Comparative Study of Baseline, Bayesian, and Metaheuristic Hyperparameter Optimization Techniques“. Sensors 23, Nr. 15 (01.08.2023): 6843. http://dx.doi.org/10.3390/s23156843.
Der volle Inhalt der QuelleAnnotation:
Algorithms for machine learning have found extensive use in numerous fields and applications. One important aspect of effectively utilizing these algorithms is tuning the hyperparameters to match the specific task at hand. The selection and configuration of hyperparameters directly impact the performance of machine learning models. Achieving optimal hyperparameter settings often requires a deep understanding of the underlying models and the appropriate optimization techniques. While there are many automatic optimization techniques available, each with its own advantages and disadvantages, this article focuses on hyperparameter optimization for well-known machine learning models. It explores cutting-edge optimization methods such as metaheuristic algorithms, deep learning-based optimization, Bayesian optimization, and quantum optimization, and our paper focused mainly on metaheuristic and Bayesian optimization techniques and provides guidance on applying them to different machine learning algorithms. The article also presents real-world applications of hyperparameter optimization by conducting tests on spatial data collections for landslide susceptibility mapping. Based on the experiment’s results, both Bayesian optimization and metaheuristic algorithms showed promising performance compared to baseline algorithms. For instance, the metaheuristic algorithm boosted the random forest model’s overall accuracy by 5% and 3%, respectively, from baseline optimization methods GS and RS, and by 4% and 2% from baseline optimization methods GA and PSO. Additionally, for models like KNN and SVM, Bayesian methods with Gaussian processes had good results. When compared to the baseline algorithms RS and GS, the accuracy of the KNN model was enhanced by BO-TPE by 1% and 11%, respectively, and by BO-GP by 2% and 12%, respectively. For SVM, BO-TPE outperformed GS and RS by 6% in terms of performance, while BO-GP improved results by 5%. The paper thoroughly discusses the reasons behind the efficiency of these algorithms. By successfully identifying appropriate hyperparameter configurations, this research paper aims to assist researchers, spatial data analysts, and industrial users in developing machine learning models more effectively. The findings and insights provided in this paper can contribute to enhancing the performance and applicability of machine learning algorithms in various domains.
34
Kumpanya, Danupon, Sattarpoom Thaiparnat und Deacha Puangdownreong. „Parameter Identification of BLDC Motor Model Via Metaheuristic Optimization Techniques“. Procedia Manufacturing 4 (2015): 322–27. http://dx.doi.org/10.1016/j.promfg.2015.11.047.
Der volle Inhalt der Quelle
35
Al-Shamma’a, Abdullrahman A., Hassan M. Hussein Farh, Abdullah M. Noman, Abdullah M. Al-Shaalan und Abdulaziz Alkuhayli. „Optimal Sizing of a Hybrid Renewable Photovoltaic-Wind System-Based Microgrid Using Harris Hawk Optimizer“. International Journal of Photoenergy 2022 (23.06.2022): 1–13. http://dx.doi.org/10.1155/2022/4825411.
Der volle Inhalt der QuelleAnnotation:
Hybrid renewable energy microgrid has become an attractive solution to electrify urban areas. This research proposes a microgrid design problem including photovoltaic (PV) arrays, wind turbine, diesel, and batteries for which Harris hawk optimization (HHO), a metaheuristic technique, is applied. Based on a long-term techno-economic assessment, the HHO approach is used to determine the best hybrid microgrid size for a community in Saudi Arabia’s northern region. The efficacy of HHO is investigated, and its performance was compared with seven metaheuristic techniques, grasshopper optimization algorithm (GOA), cuckoo search optimizer (CSO), genetic algorithm (GA), Big Bang–Big Crunch (BBBC), coyote optimizer, crow search, and butterfly optimization algorithm (BOA), to attain the HRE microgrid optimal sizing based on annualized system cost (ASC) reduction. Some benchmarks (optimum and worst solutions, mean, median, standard deviation, and rate of convergence) are used to distinguish and analyze the performance of these eight metaheuristic-based approaches. The HHO surpassed the other seven metaheuristic techniques in achieving the best HRE microgrid solution with the lowest ASC (USD 149229.9) followed by GOA (USD 149380.5) and CSO (USD 149382.5). The findings revealed that the HHO, GOA, CSO, and coyote have acceptable performance in terms of capturing the global solution and the speed of convergence, with only minimal oscillations. The BBBC, crow search, GA, and BA, on the other hand, have unacceptably poor performance, trapping to the local solution, oscillations, and a long convergence time. In terms of optimal solution and convergence rate, the BBBC and GA both perform poorly when compared to the other metaheuristic techniques.
36
Abdelhafeez, Ahmed, Ahmed E. Fakhry und Nariman A. Khalil. „Neutrosophic Sets and Metaheuristic Optimization: A Survey“. Neutrosophic and Information Fusion 1, Nr. 1 (2023): 41–47. http://dx.doi.org/10.54216/nif.010105.
Der volle Inhalt der QuelleAnnotation:
Smarandache presents neutrosophic sets and provides a domain area that is made up of three separate subsets to reflect the various kinds of uncertainty. Neutrosophic sets are defined as the sets where every other element of the universe possesses a degree of truthiness, indeterminacy, and falsity, which range from 0 to 1, and where these degrees are subsets of the neutrosophic sets that are independent of each other. Neutrosophic sets are also known as neutrosophical subsets. In the neutrosophic sets, impreciseness is represented as truth and falsity functions, but the indeterminacy function represents degrees of belongingness and non-belongingness and differentiates between absoluteness and relativeness. Neutrosophic sets can deal with the unpredictability of the system and cut down on the paralysis brought on by conflicting information thanks to this notation. As a result, one might argue that this capacity is the single most significant benefit offered by neutrosophic sets in comparison to the many other forms of fuzzy extensions. By making use of these three functions, neutrosophic sets are able to create a domain area. This area makes it possible for various kinds of mathematical operations to be carried out separately despite the presence of uncertainty. Due to the fact that the behavior of these methodologies is inspired by Nature and its capacity for adapting to issues, in addition to the potential for combining more than one method to reach the best alternatives, metaheuristic algorithms are employed to initiate the finest or the best possible alternatives to a lot of optimization techniques. This is possible because metaheuristic algorithms have the ability to adapt to problems. The fact that numerous academics have utilized these techniques with neutrosophic science to offer several systems in recent years was the impetus for writing this overview study in the first place, which was based on the above rationale.
37
Dhareula, Priyanka. „Comparative Analysis of Efficacious Metaheuristic Technique with Genetically Modified- Flower Pollination Algorithm (GM-FPA) for Test Case Prioritization in Regression Testing“. International Journal for Research in Applied Science and Engineering Technology 10, Nr. 7 (31.07.2022): 221–26. http://dx.doi.org/10.22214/ijraset.2022.45247.
Der volle Inhalt der QuelleAnnotation:
Abstract: Regression Testing is most imperative activity of software development life cycle. Test case prioritization being one of the most adopted branch for regression testing and with the invent of nature inspired metaheuristic techniques in optimization, this study makes an attempt to augments the features of test case prioritization with nature inspired metaheuristic techniques to determine the most efficacious metaheuristic techniques from Cuckoo Searh (CS) algorithm, Genetic Algorithm (GA) and Flower Pollination Algorithm (FPA) for three different case studies. APFD metrics is used to compare the algorithms. Further the study compares the most efficacious technique with Genetically Modified- Flower Pollination Algorithm (GM-FPA) to identify the most efficient technique for regression test case prioritization.
38
Kim, Jinho, Chang Seob Kim und Zong Woo Geem. „A Memetic Approach for Improving Minimum Cost of Economic Load Dispatch Problems“. Mathematical Problems in Engineering 2014 (2014): 1–11. http://dx.doi.org/10.1155/2014/906028.
Der volle Inhalt der QuelleAnnotation:
Economic load dispatch problem is a popular optimization problem in electrical power system field, which has been so far tackled by various mathematical and metaheuristic approaches including Lagrangian relaxation, branch and bound method, genetic algorithm, tabu search, particle swarm optimization, harmony search, and Taguchi method. On top of these techniques, this study proposes a novel memetic algorithm scheme combining metaheuristic algorithm and gradient-based technique to find better solutions for an economic load dispatch problem with valve-point loading. Because metaheuristic algorithms have the strength in global search and gradient-based techniques have the strength in local search, the combination approach obtains better results than those of any single approach. A bench-mark example of 40 generating-unit economic load dispatch problem demonstrates that the memetic approach can further improve the existing best solutions from the literature.
39
Kalyani, G., K. Krishna Jyothi und T. Pratyusha. „A Comprehensive Study on Metaheuristic Techniques Using Genetic Approach“. International Journal on Recent and Innovation Trends in Computing and Communication 7, Nr. 8 (29.08.2019): 23–31. http://dx.doi.org/10.17762/ijritcc.v7i8.5351.
Der volle Inhalt der QuelleAnnotation:
Most real-life optimization problems involve multiple objective functions. Finding a solution that satisfies the decision-maker is very difficult owing to conflict between the objectives. Furthermore, the solution depends on the decision-maker’s preference. Metaheuristic solution methods have become common tools to solve these problems. The task of obtaining solutions that take account of a decision-maker’s preference is at the forefront of current research. It is also possible to have multiple decision-makers with different preferences and with different decision-making powers. It may not be easy to express a preference using crisp numbers. In this study, the preferences of multiple decision-makers were simulated and a solution based on a genetic algorithm was developed to solve multi-objective optimization problems. The preferences were collected as fuzzy conditional trade-offs and they were updated while running the algorithm interactively with the decision-makers. The proposed method was tested using well-known benchmark problems. The solutions were found to converge around the Pareto front of the problems.
40
Gómez-Rubio, Álvaro, Ricardo Soto, Broderick Crawford, Adrián Jaramillo, David Mancilla, Carlos Castro und Rodrigo Olivares. „Applying Parallel and Distributed Models on Bio-Inspired Algorithms via a Clustering Method“. Mathematics 10, Nr. 2 (16.01.2022): 274. http://dx.doi.org/10.3390/math10020274.
Der volle Inhalt der QuelleAnnotation:
In the world of optimization, especially concerning metaheuristics, solving complex problems represented by applying big data and constraint instances can be difficult. This is mainly due to the difficulty of implementing efficient solutions that can solve complex optimization problems in adequate time, which do exist in different industries. Big data has demonstrated its efficiency in solving different concerns in information management. In this paper, an approach based on multiprocessing is proposed wherein clusterization and parallelism are used together to improve the search process of metaheuristics when solving large instances of complex optimization problems, incorporating collaborative elements that enhance the quality of the solution. The proposal deals with machine learning algorithms to improve the segmentation of the search space. Particularly, two different clustering methods belonging to automatic learning techniques, are implemented on bio-inspired algorithms to smartly initialize their solution population, and then organize the resolution from the beginning of the search. The results show that this approach is competitive with other techniques in solving a large set of cases of a well-known NP-hard problem without incorporating too much additional complexity into the metaheuristic algorithms.
41
López-López, Isaac, Guillermo Sosa-Gómez, Carlos Segura, Diego Oliva und Omar Rojas. „Metaheuristics in the Optimization of Cryptographic Boolean Functions“. Entropy 22, Nr. 9 (21.09.2020): 1052. http://dx.doi.org/10.3390/e22091052.
Der volle Inhalt der QuelleAnnotation:
Generating Boolean Functions (BFs) with high nonlinearity is a complex task that is usually addresses through algebraic constructions. Metaheuristics have also been applied extensively to this task. However, metaheuristics have not been able to attain so good results as the algebraic techniques. This paper proposes a novel diversity-aware metaheuristic that is able to excel. This proposal includes the design of a novel cost function that combines several information from the Walsh Hadamard Transform (WHT) and a replacement strategy that promotes a gradual change from exploration to exploitation as well as the formation of clusters of solutions with the aim of allowing intensification steps at each iteration. The combination of a high entropy in the population and a lower entropy inside clusters allows a proper balance between exploration and exploitation. This is the first memetic algorithm that is able to generate 10-variable BFs of similar quality than algebraic methods. Experimental results and comparisons provide evidence of the high performance of the proposed optimization mechanism for the generation of high quality BFs.
42
Vásquez-Varela, Luis Ricardo, und Francisco Javier García-Orozco. „Applied Metaheuristic Optimization in Asphalt Pavement Management“. Ciencia e Ingeniería Neogranadina 31, Nr. 2 (31.12.2021): 75–92. http://dx.doi.org/10.18359/rcin.4371.
Der volle Inhalt der QuelleAnnotation:
Pavement engineering is a crossroads between geotechnical and transportation engineering with a sound base on construction materials. There are multiple applications of optimization algorithms in pavement engineering, emphasizing pavement management for its socioeconomic implications and back-calculation of layer properties for its complexity. A detailed literature review shows that optimization has been a permanent concern in pavement engineering. However, only in the last two decades, the increase in computational power allowed the implementation of metaheuristic optimization techniques with promising results in research and practice. Pavement management requires powerful optimization tools for multi-objective problems such as minimizing costs and maximizing the pavement state from network to project level with constrained budgets. A substantial amount of research focuses on genetic algorithms (GA), but new developments include particle intelligence (PSO, ACO, and ABC). The study must go beyond small-sized networks to improve the management of existing road infrastructure (pavement, bridges) based on mechanistic and reliability criteria.
43
Chetty, Sivashan, und Aderemi Oluyinka Adewumi. „Three New Stochastic Local Search Metaheuristics for the Annual Crop Planning Problem Based on a New Irrigation Scheme“. Journal of Applied Mathematics 2013 (2013): 1–14. http://dx.doi.org/10.1155/2013/158538.
Der volle Inhalt der QuelleAnnotation:
Annual Crop Planning (ACP) is an NP-hard-type optimization problem in agricultural planning. It involves finding optimal solutions concerning the seasonal allocations of a limited amount of agricultural land amongst the various competing crops that are required to be grown on it. This study investigates the effectiveness of employing three new local search (LS) metaheuristic techniques in determining solutions to an ACP problem at a new Irrigation Scheme. These three new LS metaheuristic techniques are the Best Performance Algorithm (BPA), Iterative Best Performance Algorithm (IBPA), and the Largest Absolute Difference Algorithm (LADA). The solutions determined by these LS metaheuristic techniques are compared against the solutions of two other well-known LS metaheuristic techniques in the literature. These techniques are Tabu Search (TS) and Simulated Annealing (SA). The comparison with TS and SA was to determine the relative merits of the solutions found by BPA, IBPA, and LADA. The results show that TS performed as the overall best. However, LADA determined the best solution that was the most economically feasible.
44
Abi, Soufiane, Hamid Bouyghf, Benhala Bachir und Abdelhadi Raihani. „An optimal design of square spiral integrated inductor using metaheuristic techniques“. Indonesian Journal of Electrical Engineering and Computer Science 20, Nr. 2 (01.11.2020): 680. http://dx.doi.org/10.11591/ijeecs.v20.i2.pp680-689.
Der volle Inhalt der QuelleAnnotation:
<p>In this paper, the optimal sizing of CMOS RF square spiral integrated inductor utilizing three meta-heuristic techniques namely Ant Colony Optimization, Artificial Bee Colony and Differential Evolution is presented. The π-model is employed for the characterization of inductor behavior. In this optimization procedure, the geometrical parameters of the CMOS RF square spiral integrated inductor are considered as the design variables that satisfy the most important constraints such as the fixed value of required inductance 4nH at the operating frequency 2.4 GHz. The design of the integrated square spiral inductor is done with UMC 130 nm CMOS technology. A comparison between the used meta-heuristic techniques is emphasized. The optimization results are checked and validated by the mean of the Momentum Advanced Design System (ADS).</p>
45
Marouani, Ismail, Tawfik Guesmi, Badr M. Alshammari, Khalid Alqunun, Ahmed S. Alshammari, Saleh Albadran, Hsan Hadj Abdallah und Salem Rahmani. „Optimized FACTS Devices for Power System Enhancement: Applications and Solving Methods“. Sustainability 15, Nr. 12 (09.06.2023): 9348. http://dx.doi.org/10.3390/su15129348.
Der volle Inhalt der QuelleAnnotation:
The use of FACTS devices in power systems has become increasingly popular in recent years, as they offer a number of benefits, including improved voltage profile, reduced power losses, and increased system reliability and safety. However, determining the optimal type, location, and size of FACTS devices can be a challenging optimization problem, as it involves mixed integer, nonlinear, and nonconvex constraints. To address this issue, researchers have applied various optimization techniques to determine the optimal configuration of FACTS devices in power systems. The paper provides an in-depth and comprehensive review of the various optimization techniques that have been used in published works in this field. The review classifies the optimization techniques into four main groups: classical optimization techniques, metaheuristic methods, analytic methods, and mixed or hybrid methods. Classical optimization techniques are conventional optimization approaches that are widely used in optimization problems. Metaheuristic methods are stochastic search algorithms that can be effective for nonconvex constraints. Analytic methods involve sensitivity analysis and gradient-based optimization techniques. Mixed or hybrid methods combine different optimization techniques to improve the solution quality. The paper also provides a performance comparison of these different optimization techniques, which can be useful in selecting an appropriate method for a specific problem. Finally, the paper offers some advice for future research in this field, such as developing new optimization techniques that can handle the complexity of the optimization problem and incorporating uncertainties into the optimization model. Overall, the paper provides a valuable resource for researchers and practitioners in the field of power systems optimization, as it summarizes the various optimization techniques that have been used to solve the FACTS optimization problem and provides insights into their performance and applicability.
46
Yuan, Xinzhe, Mohammad Ali Karbasforoushha, Rahmad B. Y. Syah, Mohammad Khajehzadeh, Suraparb Keawsawasvong und Moncef L. Nehdi. „An Effective Metaheuristic Approach for Building Energy Optimization Problems“. Buildings 13, Nr. 1 (29.12.2022): 80. http://dx.doi.org/10.3390/buildings13010080.
Der volle Inhalt der QuelleAnnotation:
Mathematical optimization can be a useful strategy for minimizing energy usage while designing low-energy buildings. To handle building energy optimization challenges, this study provides an effective hybrid technique based on the pelican optimization algorithm (POA) and the single candidate optimizer (SCO). The suggested hybrid algorithm (POSCO) benefits from both the robust local search power of the single candidate method and the efficient global search capabilities of the pelican optimization. To conduct the building optimization task, the optimization method was developed and integrated with the EnergyPlus codes. The effectiveness of the proposed POSCO method was verified using mathematical test functions, and the outcomes were contrasted with those of conventional POA and other effective optimization techniques. Application of POSCO for global function optimization reveals that, among the thirteen considered functions, the proposed method was best at finding the global solution for seven functions, while providing superior results for the other functions when compared with competitive techniques. The suggested POSCO is applied for reducing an office buildings’ annual energy use. Comparing POSCO to POA procedures, the building energy usage is reduced. Furthermore, POSCO is compared to simple POA and other algorithms, with the results showing that, at specific temperatures and lighting conditions, the POSCO approach outperforms selected state-of-the-art methods and reduces building energy usage. As a result, all data suggests that POSCO is a very promising, dependable, and feasible optimization strategy for dealing with building energy optimization models. Finally, the building energy optimization findings for various climatic conditions demonstrate that the changes to the weather dataset had limited effect on the efficiency of the optimization procedure.
47
Araújo, Gonçalo Roque, Ricardo Gomes, Maria Glória Gomes, Manuel Correia Guedes und Paulo Ferrão. „Surrogate Models for Efficient Multi-Objective Optimization of Building Performance“. Energies 16, Nr. 10 (11.05.2023): 4030. http://dx.doi.org/10.3390/en16104030.
Der volle Inhalt der QuelleAnnotation:
Nowadays, the large set of available simulation tools brings numerous benefits to urban and architectural practices. However, simulations often take a considerable amount of time to yield significant results, particularly when performing many simulations and with large models, as is typical in complex urban and architectural endeavors. Additionally, multiple objective optimizations with metaheuristic algorithms have been widely used to solve building optimization problems. However, most of these optimization processes exponentially increase the computational time to correctly produce outputs and require extensive knowledge to interpret results. Thus, building optimization with time-consuming simulation tools is often rendered unfeasible and requires a specific methodology to overcome these barriers. This work integrates a baseline multi-objective optimization process with a widely used, validated building energy simulation tool. The goal is to minimize the energy use and cost of the construction of a residential building complex. Afterward, machine learning and optimization techniques are used to create a surrogate model capable of accurately predicting the simulation results. Finally, different metaheuristics with their tuned hyperparameters are compared. Results show significant improvements in optimization results with a decrease of up to 22% in the total cost while having similar performance results and execution times up to 100 times faster.
48
Radiša, Radomir, Nedeljko Dučić, Srećko Manasijević, Nemanja Marković und Žarko Ćojbašić. „CASTING IMPROVEMENT BASED ON METAHEURISTIC OPTIMIZATION AND NUMERICAL SIMULATION“. Facta Universitatis, Series: Mechanical Engineering 15, Nr. 3 (09.12.2017): 397. http://dx.doi.org/10.22190/fume170505022r.
Der volle Inhalt der QuelleAnnotation:
This paper presents the use of metaheuristic optimization techniques to support the improvement of casting process. Genetic algorithm (GA), Ant Colony Optimization (ACO), Simulated annealing (SA) and Particle Swarm Optimization (PSO) have been considered as optimization tools to define the geometry of the casting part’s feeder. The proposed methodology has been demonstrated in the design of the feeder for casting Pelton turbine bucket. The results of the optimization are dimensional characteristics of the feeder, and the best result from all the implemented optimization processes has been adopted. Numerical simulation has been used to verify the validity of the presented design methodology and the feeding system optimization in the casting system of the Pelton turbine bucket.
49
Shaaban, Amr Ahmed, und Omar Mahmoud Shehata. „Combining Response Surface Method and Metaheuristic Algorithms for Optimizing SPIF Process“. International Journal of Manufacturing, Materials, and Mechanical Engineering 11, Nr. 4 (Oktober 2021): 1–25. http://dx.doi.org/10.4018/ijmmme.2021100101.
Der volle Inhalt der QuelleAnnotation:
Recently, studies have focused on optimization as a method to reach the finest conditions for metal forming processes. This study tests various optimization techniques to determine the optimum conditions for single point incremental forming (SPIF). SPIF is a die-less forming process that depends on moving a tool along a path designed for a specific feature. As it involves various parameters, optimization based on experimental studies would be costly, hence a finite element model (FE-model) for the SPIF process is developed and validated through experimental results. In the second phase, statistical analyses based on the response surface method (RSM) are conducted. The optimum conditions are determined using the desirability optimization method, in addition to two metaheuristic optimization algorithms, namely genetic algorithm (GA) and particle swarm optimization (PSO). The results of all optimization techniques are compared to each other and a confirmation test using the FE-model is subsequently performed.
50
Kaya, Ebubekir. „A Comprehensive Comparison of the Performance of Metaheuristic Algorithms in Neural Network Training for Nonlinear System Identification“. Mathematics 10, Nr. 9 (09.05.2022): 1611. http://dx.doi.org/10.3390/math10091611.
Der volle Inhalt der QuelleAnnotation:
Many problems in daily life exhibit nonlinear behavior. Therefore, it is important to solve nonlinear problems. These problems are complex and difficult due to their nonlinear nature. It is seen in the literature that different artificial intelligence techniques are used to solve these problems. One of the most important of these techniques is artificial neural networks. Obtaining successful results with an artificial neural network depends on its training process. In other words, it should be trained with a good training algorithm. Especially, metaheuristic algorithms are frequently used in artificial neural network training due to their advantages. In this study, for the first time, the performance of sixteen metaheuristic algorithms in artificial neural network training for the identification of nonlinear systems is analyzed. It is aimed to determine the most effective metaheuristic neural network training algorithms. The metaheuristic algorithms are examined in terms of solution quality and convergence speed. In the applications, six nonlinear systems are used. The mean-squared error (MSE) is utilized as the error metric. The best mean training error values obtained for six nonlinear systems were 3.5×10−4, 4.7×10−4, 5.6×10−5, 4.8×10−4, 5.2×10−4, and 2.4×10−3, respectively. In addition, the best mean test error values found for all systems were successful. When the results were examined, it was observed that biogeography-based optimization, moth–flame optimization, the artificial bee colony algorithm, teaching–learning-based optimization, and the multi-verse optimizer were generally more effective than other metaheuristic algorithms in the identification of nonlinear systems.