Search Results - (( solution construction phase algorithm ) OR ( java simulation optimization algorithm ))*
Search alternatives:
- solution construction »
- construction phase »
- phase algorithm »
- java simulation »
-
1
A hybrid adaptive harmony search with modified great deluge algorithm for school timetabling
Published 2025“…In Phase 1, heuristic rules refine the time assignment stage to improve an existing construction algorithm. …”
Get full text
Get full text
Thesis -
2
Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem
Published 2017“…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
Get full text
Get full text
Conference or Workshop Item -
3
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
4
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
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
Ant colony optimization algorithm for load balancing in grid computing
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
Enhancing the Sorting Layers in the Initial Stage of High School Timetabling
Published 2020“…Generally, NP-Complete problem was solved firstly by constructing the initial solution, in the construction phase. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Constructing population of initial solutions for curriculum – based course timetabling problem
Published 2012“…Future work will use the best settings of heuristics to the improvement phase in population-based improvement algorithm.…”
Get full text
Get full text
Conference or Workshop Item -
8
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
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 -
9
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
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 -
10
Features selection for intrusion detection system using hybridize PSO-SVM
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 -
11
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 -
12
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
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 -
13
Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics
Published 2016“…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
Get full text
Get full text
Get full text
Article -
14
Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem
Published 2021“…The methodology consists of three phases. First, the profitable cells were constructed by applying ECBA. …”
Get full text
Get full text
Thesis -
15
Embedding Malaysian House Red Ant Behavior into an Ant Colony System
Published 2008“…The three level phases of pheromone updates are: local construction, local reinforcement and global reinforcement. …”
Get full text
Get full text
Citation Index Journal -
16
Development of two matheuristics for production-inventory-distribution routing problem / Dicky Lim Teik Kyee
Published 2018“…Phase 2 uses VNS and we utilize both phases in an interactive manner. …”
Get full text
Get full text
Get full text
Thesis -
17
A MODIFIED PARTICLE SWARM OPTIMIZATION ALGORITHM FOR WELLBORE TRAJECTORY DESIGN
Published 2021“…The improvements of the original PSO algorithm are proposed by updating its exploitation phase by incorporating the GWO algorithm because of its strong exploitation capability and the exploration phase using a cellular automaton due to its ability to explore more area by constructing new neighbours. …”
Get full text
Get full text
Thesis -
18
A Tabu Search Approach with Embedded Nurse Preferences for Solving Nurse Rostering Problem
Published 2020“…The methodology consists of two phases: initialization and neighborhood. The semi-random initialization is employed for finding a good initial solution during the initialization phase which avoids the violation of hard constraints, while the neighborhood phase is established for further improving the solution quality with a special representation and innovative neighborhood generations within TS algorithm. …”
Get full text
Get full text
Get full text
Get full text
Article -
19
A tabu search approach with embedded nurse preferences for solving nurse rostering problem
Published 2020“…The methodology consists of two phases: initialization and neighborhood. The semi-random initialization is employed for finding a good initial solution during the initialization phase which avoids the violation of hard constraints, while the neighborhood phase is established for further improving the solution quality with a special representation and innovative neighborhood generations within TS algorithm. …”
Get full text
Get full text
Get full text
Get full text
Article -
20
Generic DNA encoding design scheme to solve combinatorial problems
Published 2015“…However, DNA computing can solve the problem in linear time since the parallel processing power of DNA computing is able to generate a solution in a single process. DNA encoding is the first important step in DNA computing phases. …”
Get full text
Get full text
Thesis
