Search Results - (( java simulation optimization algorithm ) OR ( parameter adoption based algorithm ))*

Refine Results
  1. 1
  2. 2

    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
  3. 3

    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
  4. 4

    On Adopting Parameter Free Optimization Algorithms for Combinatorial Interaction Testing by Kamal Z., Zamli, Alsariera, Yazan A., Nasser, Abdullah B., Alsewari, Abdulrahman A.

    Published 2015
    “…In doing so, this paper reviews two existing parameter free optimization algorithms involving Teaching Learning Based Optimization (TLBO) and Fruitfly Optimization Algorithm (FOA) in an effort to promote their adoption for CIT.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  6. 6

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

    Published 2018
    “…In line with the emerging field called Search based Software Engineering, many recently developed t-way strategies have adopted meta-heuristic algorithms as the basis of their implementations such as Simulated Annealing, Genetic Algorithm, Ant Colony Optimization Algorithm, Particle Swarm Optimization, Harmony Search and Cuckoo Search, owing their superior performance in term of test size reduction as compared to general computational based strategies, such as General t-way, Test Vector Generator, In Parameter Order General, Jenny, and Automatic Efficient Test Generator. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2011
    “…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion 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 other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  10. 10

    Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

    Published 2019
    “…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    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
    “…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
    Get full text
    Get full text
    Article
  12. 12

    An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite by Abdullah, Nasser, Kamal Z., Zamli, Alsewari, Abdulrahman A., Ahmed, Bestoun S.

    Published 2018
    “…In line with the upcoming of a new field called search-based software engineering (SBSE), many newly developed t-way strategies adopting meta-heuristic algorithms can be seen in the literature for constructing interaction test suite (such as simulated annealing (SA), genetic algorithm (GA), ant colony optimisation algorithm (ACO), particle swarm optimisation (PSO), harmony search (HS) and cuckoo search (CS). …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    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
    “…This paper proposed flower pollination algorithm metropolis-hastings (FPA-MH) based on the adoption of Metropolis-Hastings criteria adopted from the Simulated Annealing (SA) algorithm to enable dynamic selection of the pa probability. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    A fuzzy adaptive teaching learning-based optimization strategy for generating mixed strength t-way test suites by Din, Fakhrud

    Published 2019
    “…Owing to its proven performance in many other optimization problems, the adoption of the parameter-free Teaching Learning-based Optimization (TLBO) algorithm as a new t-way strategy is deemed useful. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Enhancing Harmony Search Parameters Based On Step And Linear Function For Bus Driver Scheduling And Rostering Problems by Mansor, Nur Farraliza

    Published 2018
    “…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

    Published 2019
    “…In this work, three new estimation-based metaheuristic algorithms are introduced. The first algorithm is a single-agent-based algorithm, named Single-agent FIR optimizer (SAFIRO). …”
    Get full text
    Get full text
    Thesis
  19. 19

    One Parameter at a time Combinatorial Testing Strategy Based on Harmony Search Algorithm OPAT-HS by Al-Sewari, Abdul Rahman Ahmed Mohammed, Mu’aza, Aminu Aminu, Rassem, Taha H., Tairan, Nasser M., Shah, Habib, Kamal Z., Zamli

    Published 2018
    “…Even though there are some existing optimization algorithm based combinatorial testing strategies, that minimize the number of test cases, but most of these strategies based on one-test-at-a-time (OTAT) approach and none of them has adopted the one-parameter-at-a-time (OPAT) approach. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

    Published 2019
    “…In this work, three new estimation-based metaheuristic algorithms are introduced. The first algorithm is a single-agent-based algorithm, named Single-agent FIR optimizer (SAFIRO). …”
    Get full text
    Get full text
    Thesis