Scopus İndeksli Yayınlar Koleksiyonu

Permanent URI for this collectionhttps://hdl.handle.net/20.500.12416/8651

Browse

Filters

2007 - 200912010 - 201912020 - 20223

Settings

Scopus Q: search.filters.scopusQuartile.Q1Subject: search.filters.subject.Genetic Algorithms

Search Results

Now showing 1 - 5 of 5
  • Article
    Citation - WoS: 5
    Citation - Scopus: 9
    Strategy Creation, Decomposition and Distribution in Particle Navigation
    (Elsevier Science inc, 2007) Leblebicioglu, Kemal; Beldek, Ulas
    Strategy planning is crucial to control a group to achieve a number of tasks in a closed area full of obstacles. In this study, genetic programming has been used to evolve rule-based hierarchical structures to move the particles in a grid region to accomplish navigation tasks. Communications operations such as receiving and sending commands between particles are also provided to develop improved strategies. In order to produce more capable strategies, a task decomposition procedure is proposed. In addition, a conflict module is constructed to handle the challenging situations and conflicts such as blockage of a particle's pathway to destination by other particles. (C) 2006 Elsevier Inc. All rights reserved.
  • Article
    Citation - WoS: 12
    Citation - Scopus: 17
    Dynamics of Multi-Point Singular Fifth-Order Lane-Emden System With Neuro-Evolution Heuristics
    (Springer Heidelberg, 2022) Ali, Mohamed R.; Fathurrochman, Irwan; Raja, Muhammad Asif Zahoor; Sadat, R.; Baleanu, Dumitru; Sabir, Zulqurnain
    The objective of the presented communication is to examine and analyze the solutions of nonlinear multi-singular fifth-order Lane-Emden (LE) system for different scenarios by variation of shape factors settled on the equivalent design of the LE equations. The neuro-evolution based stochastic computing is explored for the numerical measures using the artificial neural networks (ANNs) models for the appropriate continuous mapping, while the learning of decision variables is conducted using the integrated meta-heuristic global search of genetic algorithms (GA) hybrid with the local search efficiency of active-set (AS) i.e., ANN-GA-AS scheme. The numerical approach ANN-GA-AS is applied efficiently for the fifth kind of nonlinear LE model and statistical calculations further validate the accuracy, robustness as well as convergence.
  • Article
    Citation - WoS: 5
    Citation - Scopus: 6
    Multi-Objective Trajectory Planning for Slung-Load Quadrotor System
    (Ieee-inst Electrical Electronics Engineers inc, 2021) Ergezer, Halit
    In this article, multi-objective trajectory planning has been carried out for a quadrotor carrying a slung load. The goal is to obtain non-dominated solutions for path length, mission duration, and dissipated energy cost functions. These costs are optimized by imposing constraints on the slung-load quadrotor system's endpoints, borders, obstacles, and dynamical equations. The dynamic model of a slung-load quadrotor system is used in the Euler-Lagrange formulation. Although the differential flatness feature is mostly used in this system's trajectory planning, a fully dynamic model has been used in our study. A new multi-objective Genetic Algorithm has been developed to solve path planning, aiming to optimize trajectory length, mission time, and energy consumed during the mission. The solution process has a three-phase algorithm: Phase-1 is about randomly generating waypoints, Phase-2 is about constructing the initial non-dominated pool, and the final phase, Phase-3, is obtaining the solution. In addition to conventional genetic operators, simple genetic operators are proposed to improve the trajectories locally. Pareto Fronts have been obtained corresponding to exciting scenarios. The method has been tested, and results have been presented at the end. A comparison of the solutions obtained with MOGA operators and MOPSO over hypervolume values is also presented.
  • Article
    Citation - WoS: 62
    Citation - Scopus: 53
    Design of Stochastic Numerical Solver for the Solution of Singular Three-Point Second-Order Boundary Value Problems
    (Springer London Ltd, 2021) Baleanu, Dumitru; Shoaib, Muhammad; Raja, Muhammad Asif Zahoor; Sabir, Zulqurnain
    In this paper, a novel meta-heuristic computing solver is presented for solving the singular three-point second-order boundary value problems using artificial neural networks (ANNs) optimized by the combined strength of global and local search ability of genetic algorithms (GAs) and interior point algorithm (IPA), i.e., ANN-GA-IPA. The inspiration for presenting this numerical work comes from the intention of introducing a consistent framework that combines the effective features of neural networks optimized with the contexts of soft computing to handle with such challenging systems. Three numerical variants of singular second-order system have been taken to examine the proficiency, robustness, and stability of the designed approach. The comparison of the proposed results of ANN-GA-IPA from available exact solutions shows the good agreement with 5 to 7 decimal places of the accuracy which established worth of the methodology through performance analyses on a single and multiple executions.
  • Article
    Citation - WoS: 63
    Citation - Scopus: 72
    A New Hybrid Algorithm for Continuous Optimization Problem
    (Elsevier Science inc, 2018) Jafarian, Ahmad; Baleanu, Dumitru; Farnad, Behnam
    This paper applies a new hybrid method by a combination of three population base algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Symbiotic Organisms Search (SOS). The proposed method has been inspired from natural selection process and it completes this process in GA by using the PSO and SOS. It tends to minimize the execution time and in addition to reduce the complexity. Symbiotic organisms search is a robust and powerful metaheuristic algorithm which has attracted increasing attention in recent decades. There are three alternative phases in the proposed algorithm: GA, which develops and selects best population for the next phases, PSO, which gets experiences for each appropriate solution and updates them as well and SOS, which benefits from previous phases and performs symbiotic interaction update phases in the real-world population. The proposed algorithm was tested on the set of best known unimodal and multimodal benchmark functions in various dimensions. It has further been evaluated in, the experiment on the clustering of benchmark datasets. The obtained results from basic and non-parametric statistical tests confirmed that this hybrid method dominates in terms of convergence, execution time, success rate. It optimizes the high dimensional and complex functions Rosenbrock and Griewank up to 10(-330) accuracy in less than 3 s, outperforming other known algorithms. It had also applied clustering datasets with minimum intra-cluster distance and error rate. (C) 2017 Elsevier Inc. All rights reserved.