Search Results - empirical search algorithm

Search alternatives:

Refine Results
  1. 1
  2. 2

    A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof

    Published 2015
    “…The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Wind farm layout design using cuckoo search algorithm by Rehman, S., Ali, S.S., Adil, S.H.

    Published 2016
    “…Empirical results indicate that the proposed cuckoo search algorithm outperformed the genetic algorithm for the given test scenarios in terms of yearly power output and efficiency. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri by Mohd Sabri, Norlina

    Published 2020
    “…In this research, the empirical experiments have been conducted for the five selected algorithms in the engineering optimization discipline, namely Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Ant Colony Optimization (ACO) and Artificial Immune System (AIS). …”
    Get full text
    Get full text
    Thesis
  5. 5

    A novel multi-state gravitational search algorithm for discrete optimization problems by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof

    Published 2015
    “…The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Heterogenous adaptive ant colony optimization with 3-opt local search for the travelling salesman problem by Tuani Ibrahim, Ahamed Fayeez, Keedwell, Edward, Collett, Matthew

    Published 2020
    “…An empirical analysis of the proposed algorithm tested on a range of Travelling Salesman Problem (TSP) instances shows that the approach has better algorithmic performance when compared against state-of-the-art algorithms from the literature.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Modified reactive tabu search for the symmetric traveling salesman problems by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2013
    “…Reactive tabu search (RTS) is an improved method of tabu search (TS) and it dynamically adjusts tabu list size based on how the search is performed.RTS can avoid disadvantage of TS which is in the parameter tuning in tabu list size. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9
  10. 10

    Wind Farm Layout Design Using Cuckoo Search Algorithms by Rehman, S., Ali, S.S., Khan, S.A.

    Published 2016
    “…Empirical results indicate that the proposed CS algorithms outperformed the genetic and PSO algorithms for the given test scenarios in terms of yearly power output and efficiency. …”
    Get full text
    Get full text
    Article
  11. 11

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…RTS is an improved method of TS and it dynamically adjusts tabu list size based on how the search is performed.The performance of SA, TS and RTS algorithms in solving TSP with different size of problems are evaluated by using empirical testing, benchmarking solution and simple probabilistic analysis. …”
    Get full text
    Get full text
    Get full text
    Monograph
  12. 12

    Analytical and empirical study of particle swarm optimization with a sigmoid decreasing inertia weight by Adriansyah, Andi, H. M. Amin, Shamsudin

    Published 2006
    “…The particle swarm optimization (PSO) is an algorithm for finding optimal regions of complex search space through interaction of individuals in a population of particles. …”
    Get full text
    Get full text
    Article
  13. 13

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    “…The purpose of this study is to carry out a comparative evaluation study on Simulated Annealing (SA) and several variation of Tabu Search (TS).Materials and Method: This study considers four heuristic methods, i.e., Simulated Annealing (SA), conventional Tabu Search (TS), Improved Tabu Search (ITS) and modified Reactive Tabu Search (RTS) to solve symmetric TSPs.The algorithms were tested on five chosen benchmark problems. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    On the exploration and exploitation in popular swarm-based metaheuristic algorithms by Hussain, Kashif, Mohd Salleh, Mohd Najib, Cheng, Shi, Shi, Yuhui

    Published 2018
    “…This study, therefore, performed in-depth empirical analysis by quantitatively analyzing exploration and exploitation of five swarm-based metaheuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    An adaptively switching iteration strategy for population based metaheuristics / Nor Azlina Ab. Aziz by Nor Azlina, Ab. Aziz

    Published 2017
    “…Experiments conducted using three parent algorithms namely particle swarm optimization (PSO), which is a popular population-based optimizer with population and individual memories, gravitational search algorithm (GSA), a memoryless young optimizer, and simulated Kalman filter (SKF), a newly introduced optimization algorithm that use population’s memory to guide an agent’s search, show that iteration strategy is an algorithm dependent parameter as well as function dependent. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    An improved multi-state particle swarm optimization for discrete combinatorial optimization problems by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof

    Published 2015
    “…The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    An efficient model for indoor radio signal prediction and coverage estimation / Md. Sumon Sarker by Md. Sumon, Sarker

    Published 2011
    “…Genetic algorithm is combined with the Breath First Search (BFS) algorithm incorporated with Branch-And-Bound terminology while exploring the search space tree to achieve the optimum coverage solution. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Tree-based contrast subspace mining method by Florence Sia Fui Sze

    Published 2020
    “…Genetic algorithm has been widely used to find global solution to optimization and search problem. …”
    Get full text
    Get full text
    Get full text
    Thesis