Search Results - (( using vector problem algorithm ) OR ( evolution optimisation based 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

    Vector Evaluated Gravitational Search Algorithm (VEGSA) for multi-objective optimization problems by Zuwairie, Ibrahim, Badaruddin, Muhammad, Kamarul Hawari, Ghazali, Lim, Kian Sheng, Sophan Wahyudi, Nawawi, Zulkifli, Md. Yusof

    Published 2012
    “…The proposed algorithm, which is called Vector Evaluated Gravitational Search Algorithm (VEGSA), uses a number of populations of particles. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6

    A Method For Solving Mult-Objective Optimization Problem: Vector Evaluated Genetic Algorithm (Vega) by Tan, Tun Tai

    Published 2009
    “…However, it is impractical to solve MOOP by using classical methods due to its complexity. Genetic Algorithms (GAs) are a powerful stochastic search in solving optimization problems. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  7. 7

    A Test Vector Minimization Algorithm Based On Delta Debugging For Post-Silicon Validation Of Pcie Rootport by Toh , Yi Feng

    Published 2017
    “…To solve the problem, a test vector minimizer algorithm is proposed to eliminate redundant test vectors that do not contribute to reproduction of a test failure, hence, improving the debug throughput. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    Enhanced artificial bee colony-least squares support vector machines algorithm for time series prediction by Zuriani, Mustaffa

    Published 2014
    “…The lvABC algorithm is introduced to overcome the local optima problem by enriching the searching behaviour using Levy mutation. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    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
  11. 11

    Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
    Get full text
    Get full text
    Get full text
    Article
  12. 12
  13. 13
  14. 14

    Convergence and Diversity Evaluation for Vector Evaluated Particle Swarm Optimization by Mohd Zaidi, Mohd Tumari, Zuwairie, Ibrahim, Ismail, Ibrahim, Mohd Falfazli, Mat Jusof, Faradila, Naim, Kamarul Hawari, Ghazali, Lim, Kian Sheng, Salinda, Buyamin, Anita, Ahmad

    Published 2013
    “…An extended PSO algorithm called Vector Evaluated Particle Swarm Optimization (VEPSO) has been introduced to solve multi-objective optimization problems. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Ant Colony Optimization has been used to solve Support Vector Machine model selection problem.Ant Colony Optimization originally deals with discrete optimization problem.In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time.This study proposes an algorithm that can optimize Support Vector Machine parameters using Continuous Ant Colony Optimization without the need to discretize continuous value for Support Vector Machine parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.…”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    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
  17. 17

    Hand gesture recognition for autism diagnosis using Support Vector Machine (SVM) Algorithm / Muhammad Asyraf Mohamad Zain by Mohamad Zain, Muhammad Asyraf

    Published 2020
    “…To counter this problem, a system has been proposed to detect the hand gesture using one of the machine learning technique which is Support Vector Machine (SVM) Algorithm. …”
    Get full text
    Get full text
    Thesis
  18. 18

    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
  19. 19

    An Improved VEPSO Algorithm for Multi-objective Optimisation Problems by Kamarul Hawari, Ghazali, Zuwairie, Ibrahim, Faradila, Naim, Kian, Sheng Lim, Salinda, Buyamin, Anita, Ahmad, Sophan Wahyudi, Nawawi, Norrima, Mokhtar

    Published 2015
    “…The vector evaluated particle swarm optimisation algorithm is widely used for such purpose, where this algorithm optimised one objective using one swarm of particles by the guidance from the best solution found by another swarm. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  20. 20

    Extending the decomposition algorithm for support vector machines training by Zaki, N,M., Deris, S., Chin, K.K.

    Published 2003
    “…One can design a dedicated optimizer that will take full advantage of the specific nature of the QP problem in SVM training. The decomposition algorithm developed by Osuna et al. (1997a) reduces the training cost to an acceptable level. …”
    Get full text
    Get full text
    Get full text
    Article