Search Results - (( problem representation selection algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    Metric's thresholds for encoding evolutionary computing representation in software engineering problem by Md Sultan, Abu Bakar, Din, Jamilah, Zulzalil, Hazura, Bakar, Abubakar Diwani

    Published 2015
    “…Algorithm was tested to metric selection problem using Genetic Algorithm and the results obtained are promising.…”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    A review of crossover methods and problem representation of genetic algorithm in recent engineering applications by Zainuddin, Farah Ayiesya, Abd Samad, Md Fahmi

    Published 2020
    “…The algorithm operates on three simple genetic operators called selection, crossover and mutation. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3
  4. 4

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

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

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…In addition, the performance of the new operators called GA_INSP (GA Inspection Module), DTC (Dynamic Tuning Crossover), and BCS (Bi-Cycle Selection Method) for a better evolutionary approach to the time-based problem has been discussed in the thesis. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Extremal region detection and selection with fuzzy encoding for food recognition by Razali @ Ghazali, Mohd Norhisham

    Published 2019
    “…Three algorithms were used to accomplish the task of feature representation. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Vehicle routing problem using genetic algorithm / Shamini Nagaratnam by Shamini , Nagaratnam

    Published 2006
    “…This dissertation studies and explores the potential of using Genetic Algorithms to find the shortest path in Vehicle Routing Problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    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
  10. 10
  11. 11

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

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

    Increasing the runs in compressed data using a dedicated move to front algorithm by Al-Khayyat, Kamal A., Alshaikhli, Imad Fakhri Taha

    Published 2019
    “…A common feature was found in the alphabetical representation. The ratios of the number of each simple symbol to its file size is similar in the case of the selected compression format.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Multi-State Particle Swarm Optimization for Discrete Combinatorial Optimization Problem by Ismail, Ibrahim, Hamzah, Ahmad, Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Zulkifli, Md. Yusof, Sophan Wahyudi, Nawawi, Kamal, Khalil, Muhammad Arif, Abdul Rahim

    Published 2014
    “…The performance of MSPSO algorithm is emperically compared to BPSO and other two binary-based algorithms on six sets of selected benchmarks instances of traveling salesman problem (TSP). …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Feature selection for high dimensional data: An evolutionary filter approach. by Yahya, Anwar Ali, Osman, Addin, Ramli, Abdul Rahman, Balola, Adlan

    Published 2011
    “…Problem statement: Feature selection is a task of crucial importance for the application of machine learning in various domains. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

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

    Optimizing tree planting areas through integer programming and improved genetic algorithm by Md Badarudin, Ismadi

    Published 2012
    “…The simulation of planting lining design relative to possible solutions of dividing an area to blocks (block division) and selecting planting lining direction towards optimizing tree planting areas is a complex problem. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…Besides, since PSO operates in the continuous domain, it cannot be applied directly to solve a discrete problem like the JSP efficiently. This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Crossover and mutation operators of real coded genetic algorithms for global optimization problems by Lim, Siew Mooi

    Published 2016
    “…This study is primarily aimed at investigating two issues in genetic algorithm (GA) and one issue in conformational search (CS) problems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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