Search Results - (( evolution optimisation based algorithm ) OR ( program validation using algorithm ))

Refine Results
  1. 1
  2. 2

    Performance evaluation and benchmarking of an extended computational model of ant colony system for DNA sequence design by Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Mohd Zaidi, Mohd Tumari

    Published 2014
    “…Ant colony system (ACS) algorithm is one of the biologically inspired algorithms that have been introduced to effectively solve a variety of combinatorial optimisation problems. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    A competitive co-evolutionary approach for the nurse scheduling problem by Mohamad Nazri, Maizatul Farhana, Mohd Yusoh, Zeratul Izzah, Basiron, Halizah, Daud, Azlina

    Published 2026
    “…The competitive approach further exhibits smoother convergence behaviour across generations, indicating stronger optimisation dynamics and improved robustness. These findings demonstrate that competitive co-evolution provides an effective and practical alternative to static fitness-based evolutionary methods for nurse scheduling, with broader applicability to healthcare scheduling and constraint optimisation problems.…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, Fakhrud Din, Shah Khalid, Kamal Zuhairi Zamli, Aftab Alam

    Published 2025
    “…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, ., Fakhrud, Din, Shah, Khalid, Kamal Z., Zamli, Alam, Aftab

    Published 2025
    “…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Stock market turning points rule-based prediction / Lersak Photong … [et al.] by Photong, Lersak, Sukprasert, Anupong, Boonlua, Sutana, Ampant, Pravi

    Published 2021
    “…Finally, rule-based optimisation techniques such as Particle Swarm Optimization (PSO), Differential Evolution (DE) and Grey Wolf Optimizer (GWO) were used to minimise the amount of time employed in the stock market turning points prediction. …”
    Get full text
    Get full text
    Book Section
  7. 7

    B-spline curve fitting with different parameterization methods by Kheng, Jia Shen

    Published 2020
    “…After generating control points, distance between the generated and original data points is used to identify the error of the algorithm. Later, genetic algorithm and differential evolution optimization are used to optimise the error of the curve. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  8. 8

    Reliability assessment of power system generation adequacy with wind power using population-based intelligent search methods by Kadhem, Athraa Ali

    Published 2017
    “…This study sought to examine the performance of three newly proposed techniques, for reliability assessment of the power systems, namely Disparity Evolution Genetic Algorithm (DEGA), Binary Particle Swarm Optimisation (BPSO), and Differential Evolution Optimization Algorithm (DEOA). …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11
  12. 12

    A multi-depot vehicle routing problem with stochastic road capacity and reduced two-stage stochastic integer linear programming models for rollout algorithm by Anuar, Wadi Khalid, Lee, Lai Soon, Seow, Hsin Vonn, Pickl, Stefan

    Published 2021
    “…Then an extension, MDVRPSRC-2S, is presented as an offline two-stage SILP model of the MDDVRPSRC. These models are validated using small simulated instances with CPLEX. …”
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Solving Sudoku puzzles in Binary Integer Linear Programming using Branch and Bound algorithm / Ahida Waliyyah Ahmad Fuad by Ahmad Fuad, Ahida Waliyyah

    Published 2024
    “…This study explores the application of a Binary Integer Linear Programming (BILP) model combined with the Branch and Bound (B&B) algorithm to solve Sudoku puzzles. …”
    Get full text
    Get full text
    Thesis
  15. 15

    iBUST: An intelligent behavioural trust model for securing industrial cyber-physical systems by Azad, Saiful, Mahmud, Mufti, Kamal Zuhairi, Zamli, Kaiser, M. Shamim, Jahan, Sobhana, Razzaque, Md Abdur

    Published 2024
    “…In addition, a new optimisation model for finding optimum parameter values in the MEDF and an algorithm for transmuting a 1D quantitative feature into a respective categorical feature are developed to facilitate the model. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…Whereas, the validation from the real-world of the two datasets showed that the new augmentation algorithm steadily producing lesser iteration number compared to the conventional Simplex, QSM and BLSA algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

    Optimizing Visual Surveillance Sensor Coverage Using Dynamic Programming by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P., Saad, N.B., Ibrahim, R.B., Dass, S.C.

    Published 2017
    “…To validate the proposed algorithm, we compared the outcomes of the dynamic programming algorithm with the existing benchmarking placement optimization techniques. …”
    Get full text
    Get full text
    Article
  18. 18

    Priority and dynamic quantum time algorithms for central processing unit scheduling by Mohammed, Maysoon A.

    Published 2018
    “…Central Processing Unit is scheduled using different types of scheduling algorithms. One of the most widely algorithm used in scheduling with sharing and batch operating systems is Round Robin. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail by Basri, Siti Nor Ba, Khozaid, Nur Su’aidah, Ismail, Farhana Hazwani

    Published 2023
    “…This study seeks to optimize the scheduling process by employing a graph theory approach with graph colouring method, as well as results validation by Integer Linear Programming (ILP) based on the graph colouring outcome by using the Phyton programming software, to effectively assign time slots for courses and lecturers while managing the risk of clashes and omissions. …”
    Get full text
    Get full text
    Student Project
  20. 20

    Novice programmers’ emotion and competency assessments using machine learning on physiological data / Fatima Jannat by Fatima, Jannat

    Published 2022
    “…Hyper-parameter tuning has been used in all the algorithms using k-fold cross validation to have the best accuracy and to avoid the over-fitting issue. …”
    Get full text
    Get full text
    Get full text
    Thesis