Search Results - (( problem based course algorithm ) OR ( java simulation optimization algorithm ))

Harmony great deluge for solving curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

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

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

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

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

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

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

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

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

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

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

Get full text
Get full text
Get full text

Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

Get full text
Get full text
Get full text

Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid by Wahid, Juliana

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

A heuristic room matching algorithm in generating enhanced initial seed for the university course timetabling problem by Teoh, Chong Keat, Haron, Habibollah, Wibowo, Antoni, Ngadiman, Mohd Salihin

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

Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems by Joe Henry Obit, Yik Junn Kuan, Rayner Alfred

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

Heuristic factors in ant system algorithm for course timetabling problem by Djamarus, Djasli, Ku-Mahamud, Ku Ruhana

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

Automated study plan generator using rule-based and knapsack problem by Salahuddin, Lizawati, Hashim, Ummi Rabaah, Salahuddin, Lizawati

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

Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid by Wahid, Juliana

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

Multiple-hybrid case-based reasoning approach for university course timetabling problem by Hong, Siaw Theng, Md Sultan, Abu Bakar, Mohd Ali, Norhayati

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

A Genetic Algorithm for the Real-world University Course Timetabling Problem by Chee, Hung Wong, Goh, Say Leng, Jonathan Likoh Juis @ Juise

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

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

Investigating a round robin strategy over multi algorithms in optimising the quality of university course timetables by Abdullah S., Shaker K., Shaker H.

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

Multiple case-based retrieval for university course timetabling problem by Hong, Siaw Theng

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

A Survey of metaheuristic approaches for curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…Purpose - The aim of this paper is to explore approaches applied for solving CBCTT by presenting features of implementation related to it.The idea is to prepare references structure for future implementation.There are numerous surveys related to approaches in University course timetabling problem (UCTP) (Babaei, Karimpour, & Hadidi, 2014; Nandhini & Kanmani, 2009).Usually surveys that carried out involved post enrollment course timetabling problem (PECTT) and curriculum-based course timetabling problem (CBCTT) together in one literature. …”
Get full text
Get full text