Search Results - (( solution using ((graph algorithm) OR (_ algorithm)) ) OR ( java implication based algorithm ))
Search alternatives:
- implication based »
- java implication »
- graph algorithm »
- solution using »
-
1
-
2
VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.
Published 2012“…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
Get full text
Get full text
Thesis -
3
-
4
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As the requirement of the Ant System Algorithm, the 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 -
5
-
6
Hybrid bat algorithm for minimum dominating set problem
Published 2017“…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore we included simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
Get full text
Get full text
Article -
7
A hybrid local search algorithm for minimum dominating set problems
Published 2022“…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
Get full text
Get full text
Article -
8
A hybrid local search algorithm for minimum dominating set problems
Published 2022“…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
Get full text
Get full text
Article -
9
Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling
Published 2022“…The IEEE RTS 26, 32 and 36-unit dataset systems were used in the performance evaluation of the PACS algorithm. …”
Get full text
Get full text
Get full text
Thesis -
10
Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems
Published 2021“…Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in the graph. This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
Get full text
Get full text
Get full text
Article -
11
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text
Article -
12
Attack path selection optimization with adaptive genetic algorithms
Published 2016“…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text
Article -
13
Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem
Published 2020“…Five trajectory algorithms comprising of tabu search (TS), simulated annealing (SA), late acceptance hill climbing (LAHC), great deluge algorithm (GDA), and variable neighborhood search (VNS) are employed for improving the solution quality. …”
Get full text
Get full text
Get full text
Article -
14
Performance analysis of graph heuristics and selected trajectory metaheuristics on examination timetable problem
Published 2020“…Five trajectory algorithms comprising of tabu search (TS), simulated annealing (SA), late acceptance hill-climbing (LAHC), great deluge algorithm (GDA), and variable neighborhood search (VNS) are employed for improving the solution quality. …”
Get full text
Get full text
Get full text
Article -
15
A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time
Published 2009“…The computational results indicate the effectiveness of the proposed algorithm in generating better quality solutions compared to other algorithms. …”
Get full text
Get full text
Article -
16
Ant colony optimization algorithm for load balancing in grid computing
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 -
17
-
18
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
Published 2018“…The only way left is to use the approximation algorithm of Minimum Vertex Cover (MVC) for the solution of the Maximum Clique (MC) problem. …”
Get full text
Get full text
Get full text
Get full text
Article -
19
Optimised crossover genetic algorithm for capacitated vehicle routing problem
Published 2012“…The proposed algorithm uses an optimised crossover operator designed by a complete undirected bipartite graph to find an optimal set of delivery routes satisfying the requirements and giving minimal total cost. …”
Get full text
Get full text
Article -
20
Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail
Published 2023“…Different colours are allocated to each vertex using graph colouring techniques such as the vertices algorithm or the edges algorithm, ensuring that clashing courses and lecturers are assigned different time slots. …”
Get full text
Get full text
Student Project