Search Results - (( java application optimization algorithm ) OR ( _ allocation problem algorithm ))

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

“…The proposed algorithm can overcome stagnation problem, minimize processing time, match jobs with suitable resources, and balance entire resources in grid environment. …”
Get full text
Get full text
Get full text

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

“…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

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

“…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

Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

Get full text
Get full text

Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text

An investigation towards hostel space allocation problem with stochastic algorithms by Joe Henry Obit, Kuan, Yik Junn, Rayner Alfred, Jetol Bolongkikit, Ong, Yan Sheng

“…This research presents the study of stochastic algorithms in one of the limited study in Space Allocation Problem. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Performances Of Metaheuristic Algorithms In Optimizing Tool Capacity Allocations by Goheannee

“…The former three are common in literature for tool capacity allocation problems. The latter three are the next generation of metaheuristic algorithms and albeit popular elsewhere, have no known attempt in tool capacity allocation problems. …”
Get full text
Get full text

Route Optimization System by Zulkifli, Abdul Hayy

“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text

Developing a college room allocation system using heuristic algorithm / Raziha Bidin by Bidin, Raziha

“…Allocations have been major problems nowadays in all fields especially when these involve limited spaces. …”
Get full text
Get full text

Modification of the ant colony optimization algorithm for solving multi-agent task allocation problem in agricultural application by Hardhienata, Medria Kusuma Dewi, Priandana, Karlisa, Putra, Daffa Rangga, Sriatun, Mamiek, Wulandari, Buono, Agus, Mohamed, Raihani

“…Simulation results showed that the proposed ACO algorithm with the modified efficiency factor improved the performance of basic ACO algorithm for solving task allocation problem in terms of the average total travel cost for each agent. …”
Get full text
Get full text
Get full text

Comparison Between the Bees Algorithm and Genetic Algorithm Model in Manpower Allocation on Cell Loading Problem by AlMahasneh, Hossam Sayel

“…A number of resolutions to the cell loading problem have been stated in the literature. However, Manpower Allocation and Cell Loading (MACL) problem is comparatively new. …”
Get full text
Get full text
Get full text
Get full text

The Optimum Combination Of Local Searches For Genetic Operators In Memetic Algorithm For The Space Allocation Problem [QA9.58. S624 2008 f rb]. by Chandrakaisan, Sivarenuka Devi

Get full text
Get full text

Tackling the berth allocation problem via harmony search algorithm by Ahmed, Bilal, Hamdan, Hazlina, Muhammed, Abdullah, Husin, Nor Azura

“…Berth Allocation Problem (BAP) is a renowned difficult combinatorial optimization problem that plays a crucial role in maritime transportation systems. …”
Get full text
Get full text
Get full text

Automatic Number Plate Recognition on android platform: With some Java code excerpts by ., Abdul Mutholib, Gunawan, Teddy Surya, Kartiwi, Mira

Get full text
Get full text
Get full text

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

“…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

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text

Harmony search algorithm for location-routing problem in supply chain network design by Misni, F., Lee, L. S.

“…To effectively solved the problem, it is decomposed into three sub problems which are: location-allocation problem, multi-depot vehicle routing problem and multi-depot routing-allocation problem. …”
Get full text
Get full text

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

“…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

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

“…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

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

“…The four prime aspects of this work are: firstly, a model of the grid scheduling problem for dynamic grid computing environment; secondly, development of a new web based simulator (SyedWSim), enabling the grid users to conduct a statistical analysis of grid workload traces and provides a realistic basis for experimentation in resource allocation and job scheduling algorithms on a grid; thirdly, proposal of a new grid resource allocation method of optimal computational cost using synthetic and real workload traces with respect to other allocation methods; and finally, proposal of some new job scheduling algorithms of optimal performance considering parameters like waiting time, turnaround time, response time, bounded slowdown, completion time and stretch time. …”
Get full text
Get full text