Search Results - (( developing initial solution algorithm ) OR ( java _ selection algorithm ))
Search alternatives:
- selection algorithm »
- developing initial »
- solution algorithm »
- initial solution »
-
1
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…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. …”
Get full text
Get full text
Get full text
Monograph -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…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
Resource management in grid computing using ant colony optimization
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 -
4
Java based expert system for selection of natural fibre composite materials
Published 2013“…Computer oriented materials selection and knowledge-based expert systems are the prevailing approach in materials selection. …”
Get full text
Get full text
Get full text
Article -
5
Clustering ensemble learning method based on incremental genetic algorithms
Published 2012“…Firstly, an architecture for the clustering ensemble based on incremental genetic-based algorithms is proposed consisting of two phases: (i) to produce cluster partitions as initial populations, (ii) to combine cluster partitions and to generate final clustering solution by incremental genetic based clustering ensemble learning algorithm. …”
Get full text
Get full text
Thesis -
6
-
7
Route Optimization System
Published 2005“…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
Final Year Project -
8
Hybrid of firefly algorithm and pattern search for solving optimization problems
Published 2018“…In the first stage, the parameters of standard FA are initialized. In the firefly changing position stage, the randomization factor is used to update the solution in each iteration of operational stages. …”
Get full text
Get full text
Article -
9
A Hybrid ant colony optimization algorithm for solving a highly constrained nurse rostering problem
Published 2019“…Specifically, three main phases were involved in developing the hybrid model, which are generating an initial roster, updating the roster through the ACO algorithm, and implementing the hill climbing to further search for a refined solution. …”
Get full text
Get full text
Get full text
Article -
10
Application of genetic algorithm and JFugue in an evolutionary music generator
Published 2025“…This project explores the application of Genetic Algorithms (GA) with JFugue, which is a Java-based music programming library to develop an Evolutionary Music Generator. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
11
Flexible job shop scheduling using priority heuristics and genetic algorithm
Published 2010“…In the next method, a genetic algorithm has been developed. It has been shown that proposed genetic algorithm with a reinforced initial population (GA2) has better efficiency compared to a proposed genetic algorithm with fully random initial population (GA0). …”
Get full text
Get full text
Thesis -
12
Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems
Published 2020“…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
13
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text
Article -
14
Enhanced segment particle swarm optimization for large-scale kinetic parameter estimation of escherichia coli network model
Published 2021“…This development then introduces the Se-PSO algorithm in which the particles are segmented to find a local optimal solution at the beginning and later sought by the PSO algorithm. …”
Get full text
Get full text
Thesis -
15
Approximating Non Linear Higher Order ODEs By A Three Point Block Algorithm
Published 2024journal::journal article -
16
A Toolkit for Simulation of Desktop Grid Environment
Published 2014“…The prototypes will be developed using JAVA language united with a MySQL database. Core functionality of the simulator are job generation, volunteer generation, simulating algorithms, generating graphical charts and generating reports. …”
Get full text
Get full text
Final Year Project -
17
Web-based expert system for material selection of natural fiber- reinforced polymer composites
Published 2015“…Several algorithms, methods and spreadsheets are being proposed by various researchers in this field to improve materials selection. …”
Get full text
Get full text
Thesis -
18
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
Get full text
Get full text
Thesis -
19
-
20
Solving ump examination timetabling problem using dynamic exploration step counting hill climbing algorithm
Published 2022“…Then, the initial solution is improved using our enhanced algorithm called dynamic exploration step counting hill climbing (DESCHC). …”
Get full text
Get full text
Thesis
