Scopus İndeksli Yayınlar Koleksiyonu

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

Browse

Search Results

Now showing 1 - 3 of 3
  • 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: 15
    Numerical Solutions of a Novel Designed Prevention Class in the Hiv Nonlinear Model
    (Tech Science Press, 2021) Umar, Muhammad; Raja, Muhammad Asif Zahoor; Baleanu, Dumitru; Sabir, Zulqurnain
    The presented research aims to design a new prevention class (P) in the HIV nonlinear system, i.e., the HIPV model. Then numerical treatment of the newly formulated HIPV model is portrayed handled by using the strength of stochastic procedure based numerical computing schemes exploiting the artificial neural networks (ANNs) modeling legacy together with the optimization competence of the hybrid of global and local search schemes via genetic algorithms (GAs) and active-set approach (ASA), i.e., GA-ASA. The optimization performances through GA-ASA are accessed by presenting an error-based fitness function designed for all the classes of the HIPV model and its corresponding initial conditions represented with nonlinear systems of ODEs. To check the exactness of the proposed stochastic scheme, the comparison of the obtained results and Adams numerical results is performed. For the convergence measures, the learning curves are presented based on the different contact rate values. Moreover, the statistical performances through different operators indicate the stability and reliability of the proposed stochastic scheme to solve the novel designed HIPV model.
  • 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.