Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation by Choong, Shin Siang

“…Approaches for solving combinatorial optimisation problems can be separated into two main sub-classes, i.e. exact and approximation algorithms. Exact algorithm is a sub-class of techniques that is able to guarantee global optimality. …”
Get full text

Bicubic B-Spline And Thin Plate Spline On Surface Appoximation by Liew, Khang Jie

“…The effectiveness of the modified B-spline approximation algorithm is investigated in approximating the bicubic B-spline surface from the samples of scattered data points taken from the point set model.…”
Get full text

Investigation of the Effects of Imputation Methods for Gene Regulatory Networks Modelling Using Dynamic Bayesian Networks by Sin, Yi Lim, Mohd Saberi, Mohamad, Lian, En Chai, Safaai, Deris, Weng, Howe Chan, Sigeru, Omatu, Muhammad Farhan, Sjaugi, Muhammad Mahfuz, Zainuddin, Gopinathaan, Rajamohan, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…Three missing value imputation methods are used, which are k-Nearest Neighbor (kNN), Iterated Local Least Squares (ILLsimpute), and Fixed Rank Approximation Algorithm (FRAA). Dataset used in this paper is E. coli. …”
Get full text

Algorithm solution for space-fractional diffusion equations by Agus Sunarto, Jumat Sulaiman

“…In this study, we propose approximate algorithm solution of the space-fractional diffusion equation (SFDE's) based on a quarter-sweep (QS) implicit finite difference approximation equation. …”
Get full text

New heuristic function in ant colony system for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana, Alobaedy, Mustafa Muwafak

“…Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
Get full text

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text