Search Results - (( variable generation search algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    Variable step-size hill-climbing search (VS-HCS) MPPT algorithm for hydrokinetic energy harnessing by Wan Ismail, Ibrahim, Nasiruddin, Sadan, Noor Lina, Ramli, Mohd Riduwan, Ghazali, Ilham, Fuad

    Published 2025
    “…In this paper, the Variable-Step Hill Climbing Search (VS-HCS) MPPT algorithm is proposed to solve the limitation of the conventional HCS MPPT. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    A new variable strength t-way strategy based on the cuckoo search algorithm by Abdullah, Nasser, Kamal Z., Zamli

    Published 2019
    “…Owing to its performance, the metaheuristicbased t-way strategies have gained significant attention recently (e.g., Particle swarmoptimization, genetic algorithm, ant colony algorithm, harmony search, and cuckoo search). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Adopting A Particle Swarm-Based Test Generator Strategy For Variable-Strength And T-Way Testing by S. Ahmed, Bestoun

    Published 2011
    “…This thesis presents the design and implementation of a new interaction test generation strategy, known as the Particle Swarm-based Test Generator (PSTG), for generating t-way and variable-strength test suites. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Message based random variable length key encryption algorithm. by Mirvaziri, Hamid, Jumari, Kasmiran, Ismail, Mahamod, Mohd Hanapi, Zurina

    Published 2009
    “…Long and variable key length made key exhaustive search and differential attack impossible. …”
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The genotype of every ant is represented in binary form as the variables. These binary variables are used to locally search for optimum solution. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  10. 10

    Cuckoo search algorithm as an optimizer for optimal reactive power dispatch problems by M. H., Sulaiman, Zuriani, Mustaffa

    Published 2017
    “…This paper presents the application of Cuckoo Search Algorithm (CSA) in optimizing the control variables of power system operation in solving the optimal reactive power dispatch (ORPD) problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation by Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.

    Published 2018
    “…This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12
  13. 13

    Variable Neighbourhood Search Algorithm for Vehicle Routing Problem with Backhaul by Siaw Ying Doreen, Sek

    Published 2023
    “…Thus, a heuristic approach based on the Variable Neighbourhood Search (VNS) is proposed. In this research, 22 sets of benchmark instances introduced by Goetschalckx and Jacobs-Blecha are used to test the efficiency and effectiveness of the proposed algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Fuzzy Adaptive Tuning of a Particle Swarm Optimization Algorithm for Variable-Strength Combinatorial Test Suite Generation by Kamal Z., Zamli, Ahmed, Bestoun S., Mahmoud, Thair, Afzal, Wasif

    Published 2018
    “…The generation of variable strength test suites is a non-deterministic polynomial-time (NP) hard computational problem \cite{BestounKamalFuzzy2017}. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  16. 16

    An improved negative selection algorithm based on the hybridization of cuckoo search and differential evolution for anomaly detection by Ayodele Nojeem, Lasisi

    Published 2018
    “…The V-Detectors algorithm depends greatly on the random detectors generated in monitoring the status of a system. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Solving the vehicle routing problem with stochastic demands via hybrid genetic algorithm-tabu search by Ismail, Zuhaimy, Irhamah, Irhamah

    Published 2008
    “…This study considers a version of the stochastic vehicle routing problem where customer demands are random variables with known probability distribution. A new scheme based on a hybrid GA and Tabu Search heuristic is proposed for this problem under a priori approach with preventive restocking. …”
    Get full text
    Get full text
    Article
  18. 18
  19. 19
  20. 20

    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…Having only one parameter control (i.e. the switch probability, pa) to choose from the global search (i.e. exploration) and local search (i.e. exploitation) is the main strength of FPA as compared to other meta-heuristic algorithms. …”
    Get full text
    Get full text
    Article