Search Results - (( problem based course algorithm ) OR ( java application optimization algorithm ))
Search alternatives:
- application optimization »
- course algorithm »
- java application »
- based course »
-
1
Harmony great deluge for solving curriculum based course timetabling problem
Published 2013“…University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable.An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems.The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research.This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems.The algorithm can be adapted to the problem.Results were not comparatively better than those previously known as best solution.Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
2
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013Get full text
Get full text
Conference or Workshop Item -
3
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…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
Conference or Workshop Item -
4
Harmony annealing algorithm for curriculum-based course timetabling problem
Published 2012“…This research article presents the adaption of the harmony annealing algorithm for solving timetabling problems, with particular focus on the curriculum-based course timetabling that formed part of the competition track 3 of the 2nd International Timetabling Competition in 2007 (ITC-2007). …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
Get full text
Get full text
Get full text
Thesis -
6
-
7
Harmony search algorithm for curriculum-based course timetabling problem
Published 2013Get full text
Get full text
Get full text
Conference or Workshop Item -
8
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid
Published 2017“…Thus, this thesis proposed hybrid algorithms between HSA and local search based methods (simulated annealing (SA) and/or great deluge (GD)) to enhance the HSA performance for solving curriculum-based course timetabling (CBCTT) problem which is the variant of UCTP. …”
Get full text
Get full text
Thesis -
9
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 -
10
A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem
Published 2015“…The University Course Timetabling Problem (UCTP) such as the curriculum-based course timetabling problem is both an NP-hard and NP-complete scheduling problem.The nature of the problem concerns with the assignment of lecturers-courses to available teaching space in an academic institution.The Curriculum-Based University Course Timetabling Problem (CB-UCTP) has a high conflict-density and searching for an improved solution is not trivial.In this study, the authors propose a heuristic room matching algorithm which improves the seed of the CB-UCTP.The objective is to provide a reasonable search point to carry out any improvement phase and the results obtained indicate that the matching algorithm is able to provide very promising results as the fitness score of the solution is significantly enhanced in a very short period of time.…”
Get full text
Get full text
Get full text
Article -
11
Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems
Published 2017“…This research compares both linear and nonlinear Great Deluge (GD) algorithms in solving university course timetabling problem (UCTP) and the sample dataset is obtained from the Universiti Malaysia Sabah, Labuan International Campus (UMSLIC), Malaysia. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
12
Heuristic factors in ant system algorithm for course timetabling problem
Published 2009“…This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm. …”
Get full text
Get full text
Conference or Workshop Item -
13
-
14
Automated study plan generator using rule-based and knapsack problem
Published 2022“…A combination of rule-based and knapsack problem were proposed to generate an automated study plan. …”
Get full text
Get full text
Get full text
Article -
15
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid
Published 2017“…Thus, this thesis proposed hybrid algorithms between HSA and local search based methods (simulated annealing (SA) and/or great deluge (GD)) to enhance the HSA performance for solving curriculum-based course timetabling (CBCTT) problem which is the variant of UCTP. …”
Get full text
Get full text
Book Section -
16
Multiple-hybrid case-based reasoning approach for university course timetabling problem
Published 2015“…With the aim to improve timetabling solution, we investigate into a new algorithm which is based on Case-based Reasoning (CBR) retrieval function. …”
Get full text
Get full text
Article -
17
A Genetic Algorithm for the Real-world University Course Timetabling Problem
Published 2022“…In this work, we propose a Genetic Algorithm (GA) in addressing a post enrolment course timetabling (PECTT) problem for University Malaysia Sabah-Labuan International Campus (UMS-LIC). …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
18
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…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
Article -
19
Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables
Published 2023“…The performance of the approach is tested with over two sets of benchmark datasets, that is, enrolment-based course timetabling and curriculum-based course timetabling (UD1) in comparison with a set of state-of-the-art methods from the literature. …”
Article -
20
Multiple case-based retrieval for university course timetabling problem
Published 2016“…This thesis presents research for Case-based reasoning (CBR), a knowledge-based reasoning technique to solve university timetabling problem such as resource allocation for student’s course timetabling. …”
Get full text
Get full text
Thesis