Search Results - (( using allocation problem algorithm ) OR ( java application ant algorithm ))

Refine Results
  1. 1

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

    Published 2012
    “…The resource allocation problem is modelled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element. …”
    Get full text
    Get full text
    Get full text
    Monograph
  2. 2

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

    Published 2011
    “…The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

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

    Published 2011
    “…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  4. 4
  5. 5
  6. 6

    Performances Of Metaheuristic Algorithms In Optimizing Tool Capacity Allocations by Goheannee

    Published 2014
    “…To achieve the best allocation, optimization methods, such as metaheuristic algorithms are commonly used. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Automated scheduling of hostel room allocation using genetic algorithm by Rayner Alfred, Hin, Fuk Yu

    Published 2020
    “…This paper proposes a hierarchical heuristics approach to cope with hostel room allocation problem. The proposed approach involves selecting eligible students using rank based selection method and allocating selected students to the most suitable hostel room possible via the implementation of a genetic algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8

    Exam hall allocation using genetic algorithm / Norisyani Binti Fauzai by Fauzai, Norisyani

    Published 2021
    “…In this project an automated exam hall allocation prototype was developed using the genetic algorithm since this algorithm is commonly used to produce high-quality optimization solutions. …”
    Get full text
    Get full text
    Thesis
  9. 9

    School teacher-subject allocation management system by Yap, Dennis Jian Yuan

    Published 2024
    “…Not just that, Genetic Algorithm, a meta-heuristic is also used to solve the clashing problem faced by existing system using deterministic algorithm. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  10. 10

    An improved leader particle swarm optimisation algorithm for solving flexible ac transmission systems optimisation problem in power system by Jordehi, Ahmad Rezaee

    Published 2014
    “…It should efficiently mitigate premature convergence problem and result in lower amounts of overloads, voltage deviations and power losses (than existing algorithms) in D-TCSC allocation problem during line outage contingencies. …”
    Get full text
    Get full text
    Thesis
  11. 11

    DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS by MEHMOOD SHAH, SYED NASIR

    Published 2012
    “…The issue is not only to develop new algorithms, but also to evaluate them on an experimental computational grid, using synthetic and real workload traces, along with the other existing job scheduling algorithms. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Distributed generation allocation to reduce losses and improve voltage profile genetic algorithm: article by Abdol Azis, Hazriq Syahmie

    Published 2010
    “…I used Newton Raphson for load flow algorithm and composed it with Genetic Algorithm. …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Meta-scheduler in Grid environment with multiple objectives by using genetic algorithm by Lorpunmanee, Siriluck, Sap, M.N.M, Abdullah, Abdul Hanan, Srinoy, Surat

    Published 2006
    “…The minimization is proposed by using a multiple objective genetic algorithm (GA), because the job scheduling problem is NP-hard problem. …”
    Get full text
    Article
  15. 15
  16. 16
  17. 17

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Graph coloring is an assignment a color to each vertex, which each vertex that adjacent is given a different color. Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Heuristic algorithm for university final examination timetabling by Thian, Tze Yung

    Published 2015
    “…There are two parts fbr the algorithm which are course grouping and timeslot allocation. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  19. 19

    Solving New Student Allocation Problem (NSAP) With Analytical Hierarchy Process (AHP) by Shahbodin, Faaizah, Wan Hassim, Wan Haniza, Shibghatullah, Abdul Samad

    Published 2014
    “…There are many approaches used to solve New Student Allocation Problem (NSAP).Many researchers use application of Genetic Algorithm (GA).However,the study presented in this paper applies an Analytical Hierarchy Process (AHP)technique in solving New Student Allocation Problem (NSAP) handled by Registration Unit at Ungku Omar Polytechnic.The problem is the students are allocated to their class randomly,just by using their registration number and by all means without referring to their intelligence level,knowledge,skills and also their performance.So,in this paper the researcher’s focus is on solving NSAP by using AHP to allocate students into their respective classes with minimum intelligence gap in each class and the number of students in each class does not exceed its maximum capacity.The proposed solution will be tested using real data from the Politeknik Ungku Omar to see the result. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Heuristic resource allocation algorithm for controller placement in multi-control 5G based on SDN/NFV architecture by Ibrahim, Abeer Abdalla Zakaria, Hashim, Fazirulhisyam, Noordin, Nor Kamariah, Sali, Aduwati, Navaie, Keivan, Fadul, Saber Mohammed Elnour

    Published 2021
    “…It is based on the K-center problem, to solve the capacitated controller placement problem (CCPP), which acts as a resource location problem, in which the location and number of controllers can be allocated to maximize resources. …”
    Get full text
    Get full text
    Get full text
    Article