Search Results - (( initial solution graph algorithm ) OR ( evolution optimization bat algorithm ))

Multi-Swarm bat algorithm by Taha A.M., Chen S.-D., Mustapha A.

“…In this study a new Bat Algorithm (BA) based on multi-swarm technique called the Multi-Swarm Bat Algorithm (MSBA) is proposed to address the problem of premature convergence phenomenon. …”

Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

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

Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

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

Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…This paper presents an investigation of a combination of graph coloring heuristics in construction approach in University course timetabling problem (UCTP) to produce a population of initial solutions. …”
Get full text
Get full text

Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem by Mandal, Ashis Kumar, M. N. M., Kahar

“…Experimental results indicate that, in terms of construction of solution of datasets, hybridizing of SD produces the best initial solutions. …”
Get full text
Get full text
Get full text

Performance analysis of graph heuristics and selected trajectory metaheuristics on examination timetable problem by Mandal, Ashis Kumar, Mohd Nizam Mohmad, Kahar

“…Experimental results indicate that hybrid graph heuristics produce the best initial solutions across both these benchmark problems. …”
Get full text
Get full text
Get full text

Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin by Baharuddin, Ramizah

“…In Newton’s method, approximation is done by using tangential lines. The solution process begins with choosing a value as the first estimate of the solution (normally obtained from graphing). …”
Get full text
Get full text

Quality of service and energy efficient aware (QEEA) scheduling algorithm for long term evolution (LTE) network / Nurulanis Mohd Yusoff by Mohd Yusoff, Nurulanis

“…Basically, the QEEA is based on the Time Domain (TD) and Frequency Domain (FD) scheduling where it is dependent on the QoS requirements to allocate resources. The proposed algorithm is compared against other scheduling algorithms, namely, the Channel and QoS Aware (CQA), Priority Set Scheduler (PSS), Proportional Fair (PF), Maximum Throughput (MT) and Blind Average Throughput (BAT). …”
Get full text
Get full text

A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Che, Yahaya, Roslina, Abdul Hamid

“…The search process of ACO-PFMDM has converged effectively compared to some state-of-art algorithms. Moreover, the proposed dynamic update of the heuristic parameters based on entropy has generated high quality tours and it can guide ants toward the effective solutions space in the initial search stages.…”
Get full text
Get full text
Get full text

Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar by Vijyakumar, Kanendra Naidu

“…The edge reduction algorithm is initially applied to reduce the search space to obtain the initial solution. …”
Get full text
Get full text

Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

“…We have implemented partial graph heuristic with hill climbing (PGH-HC) and partial graph heuristic with modified great deluge algorithm (PGH-mGD) into solving the examination timetabling. …”
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 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

A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

“…In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. …”
Get full text
Get full text

Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

“…The heuristic initialization is applied to determine a set of initial solution of the islands. …”
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

“…Experimental results show that EACO produced better grid resource management solution compared to other algorithms. …”
Get full text
Get full text
Get full text

Power system intentional islanding for different contingency scenarios using discrete optimization technique by Nur Zawani Binti Saharuddin

“…The initial intentional islanding solution was determined using graph theory approach, to facilitate the proposed MDEP algorithm in determining the optimal intentional islanding strategy. …”

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.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.The resource allocation problem is modeled 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.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text

A study of examination timetable problem in UMP by Mohd Nizam, Mohmad Kahar, Ku Saimah, Ibrahim, Suryanti, Awang, Zalili, Musa, Rohani, Abu Bakar, Tuty Asmawaty, Abdul Kadir

“…UMP examination timetabling dataset is a capacitated dataset which contains additional constraints, in addition to those commonly used in the literature. The proposed algorithms start with constructing the initial timetable using the graph heuristic methods. …”
Get full text
Get full text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…Dijkstra and ACO are integrated to produce the smart guidance algorithm for the indoor parking system. Dijkstra algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text
Get full text

Block backward differentiation formulas for solving first and second order fuzzy differential equations by Tiaw, Kah Fook

“…The algorithm of existing BBDF was modified into fuzzy version. …”
Get full text
Get full text
Get full text