Search Results - (( using selection problem algorithm ) OR ( evolution optimization bat algorithm ))

Refine Results
  1. 1

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

    Published 2023
    “…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. …”
    Article
  2. 2

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

    Published 2017
    “…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
    Thesis
  3. 3

    Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

    Published 2020
    “…An improved version of Salp Swarm Algorithm (ISSA) is proposed in this study to solve feature selection problems and select the optimal subset of features in wrapper-mode. …”
    Get full text
    Get full text
    Article
  5. 5

    Dengue classification system using clonal selection algorithm / Karimah Mohd by Mohd, Karimah

    Published 2012
    “…Some popular intelligent techniques like Genetic Algorithm, Fuzzy Logic and Artificial Neural Network are often used by reasearcher to perform classifcation problems. …”
    Get full text
    Get full text
    Thesis
  6. 6

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

    A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization by Jia Hui Ong, Jason Teo

    Published 2018
    “…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri by Masri, Nor Khirda

    Published 2017
    “…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Static and self-scalable filter range selection algorithms for peer-to-peer networks by Kweh, Yeah Lun

    Published 2011
    “…The research works were implemented by simulation in which it was used to identify the selection problem, implementation of the proposed algorithms and the measurement of the results. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

    Published 2013
    “…In this research, we showed how evolutionary multi-objective algorithms can be used to solve the view selection problem and its advantage over classical optimization problems were described. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

    Published 2020
    “…The proposed algorithm has been evaluated using 24 benchmark functions. …”
    Get full text
    Get full text
    Article
  12. 12

    Metaheuristic algorithms for feature selection (2014–2024) by Faizan, Muhammad, Muhammad Arif, Mohamad

    Published 2025
    “…Metaheuristic algorithms are suited to provide solutions to feature selection problems because these problems are combinatorial and require an effective and efficient search through large solution spaces. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Improved whale optimization algorithm for feature selection in Arabic sentiment analysis by Tubishat, Mohammad, Abushariah, Mohammad A.M., Idris, Norisma, Aljarah, Ibrahim

    Published 2019
    “…To overcome these problems, two improvements for WOA algorithm are proposed in this paper. …”
    Get full text
    Get full text
    Article
  14. 14

    Enhanced selection method for genetic algorithm to solve traveling salesman problem by Jubeir, Mohammed, Almazrooie, Mishal, Abdullah, Rosni

    Published 2017
    “…Genetic algorithms (GAs) have been applied by many researchers to get an optimized solution for hard problems such as Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  16. 16

    A prototype for driving school instructor timetabling using case-based heuristics selection algorithm / CT Munnirah Niesha Mohd Shafee by Mohd Shafee, CT Munnirah Niesha

    Published 2010
    “…The specification with both hard constraints which must be satisfied and soft constraint which should satisfied. This problem can be solved using Case-Based Heuristics Selection approaches. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Genetic Algorithm Performance with Different Selection Strategies in Solving TSP by Noraini, Mohd Razali, Geraghty, John

    Published 2011
    “…There are several ways for selection. This paper presents the comparison of GA performance in solving travelling salesman problem (TSP) using different parent selection strategy. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Binary whale optimization algorithm with logarithmic decreasing time-varying modified sigmoid transfer function for descriptor selection problem by Yusof, Norfadzlia Mohd, Muda, Azah Kamilah, Pratama, Satrya Fajri, Carbo-Dorca, Ramon, Abraham, Ajith

    Published 2023
    “…The new Binary Whale Optimization Algorithm is integrated with wrapper feature selection and validated on descriptor selection problem to improve Amphetamine-type stimulants drug classification result. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Clonal selection algorithm for the cryptanalysis of a simple substitution cipher by Ahmad, Badrisham, Maarof, Mohd. Aizaini, Ibrahim, Subariah, Kutty Mammi, Hazinah, Mohamed Amin, Muhalim, Z'aba, Muhammad Reza

    Published 2006
    “…The main aim of the algorithm is to create a group of memories for antibodies which is used to solve engineering problems. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems by Varnamkhasti, Mohammad Jalali, Lee, Lai Soon

    Published 2012
    “…Computational experiments are conducted on the proposed techniques and the results are compared with other genetic operators, heuristics, and local search algorithms commonly used for solving multidimensional 0/1 knapsack problems published in the literature.…”
    Get full text
    Get full text
    Article