Search Results - (( based evaluation methods algorithm ) OR ( travel information scheduling algorithm ))*

Refine Results
  1. 1
  2. 2

    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

    Published 2012
    “…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
    Get full text
    Monograph
  3. 3

    Rapid Penang travel planner mobile application using GPS positioning and decision-making algorithm / Naslyiana Abdul Latif by Abdul Latif, Naslyiana

    Published 2015
    “…Thus, the public transportation system itself should be friendly user. Information about bus schedules and point of interest should be easy receive by users. …”
    Get full text
    Get full text
    Thesis
  4. 4

    New heuristic function in ant colony system algorithm by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza, Yusof, Yuhanif, Mahmuddin, Massudi, Alobaedy, Mustafa Muwafak

    Published 2012
    “…NP-hard problem can be solved by Ant Colony System (ACS) algorithm.However, ACS suffers from pheromone stagnation problem, a situation when all ants converge quickly to one sub-optimal solution.ACS algorithm utilizes the value between nodes as heuristic value to calculate the probability of choosing the next node.However, the heuristic value is not updated throughout the process to reflect new information discovered by the ants.This paper proposes a new heuristic function for the Ant Colony System algorithm that can reflect new information discovered by ants.The credibility of the new function was tested on travelling salesman and grid computing problems.Promising results were obtained when compared to classical ACS algorithm in terms of best tour length for the travelling sales-man problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Tasks Distribution In Driver Scheduling Using Dynamic Set Of Bandwidth In Harmony Search Algorithm With 2-Opt by Shaffiei, Zatul Alwani

    Published 2021
    “…Therefore, a tasks distribution in driver scheduling using dynamic set of bandwidth in harmony search algorithm with 2-opt (SBHS2-opt) was proposed in this research. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    A firefly-inspired scheme for energy-efficient transmission scheduling using a self-organizing method in a wireless sensor network by Al-Mekhlafi, Zeyad Ghaleb, Mohd Hanapi, Zurina, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

    Published 2016
    “…Various types of natural phenomena are regarded as primary sources of information for artificial occurrences that involve spontaneous synchronization. …”
    Get full text
    Get full text
    Article
  8. 8

    Standardizing and weighting the evaluation criteria of many-objective optimization competition algorithms based on fuzzy delphi and fuzzy-weighted zero-inconsistency methods by Salih, Rawia Tahrir

    Published 2021
    “…Thus, this research aims to standardize and weigh the evaluation criteria of MaOO competitive algorithms base on fuzzy Delphi and new fuzzy-weighted zero-inconsistency (FWZIC) methods. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

    Published 2015
    “…To prove the concept, we employ four different combinatorial problems: Traveling Salesman Problem, Distribution Centre Location Problem, Scheduling Robotic Cell Problem, and Vertex Colouring Problem. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…This technique with k = 10 has been used in this thesis to evaluate the proposed approach. CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Hybrid subjective evaluation method using weighted subsethood - based (WSBA) rule generation algorithm by Othman, Mahmod, Khalid, Shaiful Annuar, Abdullah, Fader, Amir Hamzah, Shezrin Hawani, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…The use of fuzzy rules, which were extracted directly from input data through Weighted Subsethood-based (WSBA) Rule Generation Algorithm.WSBA rule generation use the subsethood values to generate the weights which finally produced the fuzzy general rules.The rules generated through the data provided knowledge in developed fuzzy rule The fuzzy rules embedded in the framework of subjective evaluation method showed advantages in generalizing the evaluation of the performance achievement, where the evaluation process can be conducted consistently in producing good evaluation results with the use of the membership set score.The results from the numerical examples are comparable to other fuzzy evaluation methods, even with the use of small rule size.…”
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Evaluation of Lightning Current Using Inverse Procedure Algorithm. by Ab Kadir, Mohd Zainal Abidin, Izadi, Mahdi, Askari, Mohamad Tolou, Hajikhani, Maryam

    Published 2013
    “…In this study an inverse procedure algorithm is proposed in the time domain to evaluate lightning return stroke current based on measured electromagnetic fields at an observation point. …”
    Get full text
    Get full text
    Article
  17. 17

    Modified Contrast Limited Adaptive Histogram Equalization for high dynamic range images by Tung, Li Qian

    Published 2012
    “…The algorithm was written by using MATLAB software. The local tone mapping method is based on the modified contrast limited adaptive histogram equalization (CLAHE) method. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Tree-based contrast subspace mining method by Florence Sia Fui Sze

    Published 2020
    “…The research works involve first preparing the real world numerical and categorical data sets. Then, the tree-based method, the genetic algorithm based parameter values identification of tree-based method, and followed by the genetic algorithm based tree-based method, for numerical data sets are developed and evaluated. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Evaluation of dynamic programming among the existing stereo matching algorithms by Teo, Chee Huat, Nurulfajar, Abd Manap

    Published 2015
    “…The dynamic programming algorithm used on this research is the current method as its disparity estimates at a particular pixel and all the other pixels unlike the old methods which with scanline based of dynamic programming. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

    Published 2012
    “…In the first and second phases, a threshold fuzzy c-means clustering algorithm as a clusterer and a pattern ensemble learning method based on the incremental genetic-based algorithms are proposed respectively. …”
    Get full text
    Get full text
    Thesis