Search Results - ((discrete optimization) OR (based optimization)) ((method algorithm) OR (means algorithm))

Refine Results
  1. 1

    An efficient indexing and retrieval of iris biometrics data using hybrid transform and firefly based K-means algorithm title by Khalaf, Emad Taha

    Published 2019
    “…It uses a weighted K-means clustering algorithm based on the improved FA to optimize the initial clustering centers of K-means algorithm, known as Weighted K-means clustering-Improved Firefly Algorithm (WKIFA). …”
    Get full text
    Get full text
    Thesis
  2. 2

    Artificial Bee Colony-based satellite image contrast and brightness enhancement technique using DWT-SVD by Bhandari, A.K., Soni, V., Kumar, A., Singh, G.K.

    Published 2014
    “…The proposed technique is based on the Artificial Bee Colony (ABC) algorithm using Discrete Wavelet Transform and Singular Value Decomposition (DWT-SVD). …”
    Get full text
    Get full text
    Article
  3. 3

    Taguchi's T-method with nearest integer-based binary bat algorithm for prediction by Marlan Z.M., Jamaludin K.R., Ramlie F., Harudin N.

    Published 2023
    “…In this paper, a swarm-based binary bat optimization algorithm with a nearest integer discretization approach is integrated with the Taguchi�s T-method. …”
    Article
  4. 4
  5. 5

    Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

    Published 2024
    “…Hence, optimization algorithms, consisting of exact and heuristic methods, are crucial for a myriad of real-world applications. …”
    Get full text
    Get full text
    Thesis
  6. 6

    A Novel Discrete Filled Function Algorithm in Solving Discrete Optimization Problems (S/O: 12408) by Woon, Siew Fang, Karim, Sharmila, Mohamad, Mohd Saiful Adli

    Published 2016
    “…Several global methods have been proposed for solving discrete optimization problems. …”
    Get full text
    Get full text
    Monograph
  7. 7

    Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

    Published 2011
    “…This thesis describes the development of an efficient algorithm for solving nonlinear stochastic optimal control problems in discrete-time based on the principle of model-reality differences. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

    Published 2009
    “…One of the more recent global optimization tools in the area of discrete optimization is known as the discrete filled function method. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Optimizing Decentralized Exam Timetabling with a Discrete Whale Optimization Algorithm by Emily Siew, Sing Kiang, Sze, San Nah, Goh, Say Leng

    Published 2025
    “…In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Optimizing decentralized exam timetabling with a discrete whale optimization algorithm by Emily Sing Kiang Siew, San nah sze, Say leng goh

    Published 2025
    “…—In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14

    Binary Artificial Bee Colony Optimization For Weighted Random 2 Satisfiability In Discrete Hopfield Neural Network by Muhammad Sidik, Siti Syatirah

    Published 2023
    “…Hence, this thesis will utilize Non-Systematic Weighted Random 2 Satisfiability incorporating with Binary Artificial Bee Colony algorithm in Discrete Hopfield Neural Network. The Binary Artificial Bee Colony will be utilized to optimize the logical structure according to the ratio of negative literals by capitalizing the features of the exploration mechanism of the algorithm. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…It is also discovered that the hybrid-discrete MOPSO (HD-MOPSO) algorithm manages to obtain higher values in the performance metrics consisting of non-dominance ratio and hypervolume compared to the competing algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Optimization Of Bar Linkage By Using Genetic Algorithms by Ramasamy, Mugilan

    Published 2005
    “…This thesis presents the method of using simple Genetic Algorithms (GAs) in optimizing the size of bar linkage with discrete design variables and continues design variables. …”
    Get full text
    Get full text
    Monograph
  17. 17

    A variational discrete filled function approach in discrete global optimization by Woon, Siew Fang, Karim, Sharmila, Mohamad, Mohd Saiful Adli

    Published 2015
    “…Many real-life applications governed by discrete variables poss multiple local optimal solutions, which requires the utilization of global optimization tools find the best solution amongst them.The main difficulty in determining the best solution, or also known as the global solution, is to escape from the basins surrounding local minimums.To overcome this issue, an auxiliary function is introduced in discrete filled function method which turns the local minimizer of the original function become a maximizer.Then, an improved local minimum is found by minimizing the filled function, otherwise the edge of the feasible region is attained.Based on a discrete filled function method from the literature, we propose a modification particularly on the neighbourhood search to enhance its computational efficiency.Numerical results suggest that the proposed algorithm is efficient in solving large scale complex discrete optimization problems.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

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

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…To evaluate the proposed algorithm, the solutions to the TSP problem obtained from the proposed algorithm and swap sequence based PSO are compared in terms of the best solution, mean solution, and time taken to converge to the optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem by Asaad Shakir, Hameed, Mohd Aboobaider, Burhanuddin, Mutar, Modhi Lafta, Ngo, Hea Choon

    Published 2020
    “…The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. …”
    Get full text
    Get full text
    Get full text
    Article