Search Results - (( initial optimization method algorithm ) OR ( using selection problem algorithm ))

Refine Results
  1. 1

    Fuzzy clustering method and evaluation based on multi criteria decision making technique by Sameer, Fadhaa Othman

    Published 2018
    “…For the third problem a modified of Kohonen Network (MKN) algorithm was proposed to select the initial centres of clusters. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Opposition Based Competitive Grey Wolf Optimizer For EMG Feature Selection by Too, Jing Wei, Abdullah, Abdul Rahim

    Published 2020
    “…Four state-of-the-art algorithms include particle swarm optimization, flower pollination algorithm, butterfly optimization algorithm, and CBGWO are used to examine the effectiveness of proposed methods in feature selection. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

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

    Published 2019
    “…Additionally, they used either random or non-mathematically proved population initializations methods. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…Two case studies are used to evaluate those algorithms, and the camera placement problem is formulated as a coverage maximization problem. …”
    Get full text
    Get full text
    Book
  8. 8

    Scaled Conjugate Gradient using strong Wolfe line search for portfolio selection / Nurfatihah Anizan by Anizan, Nurfatihah

    Published 2024
    “…This study demonstrates the SLAMR method's effectiveness in solving portfolio selection problems.…”
    Get full text
    Get full text
    Thesis
  9. 9

    Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

    Published 2019
    “…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

    Published 2019
    “…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Harmony search-based robust optimal controller with prior defined structure by Rafieishahemabadi, Ali

    Published 2013
    “…For further assessment, the proposed design strategy is then employed to design a control law for an electrical DC drive velocity controller used as a benchmark problem for the recent PSO-based and genetic algorithm optimization (GAO)-based robust controllers. …”
    Get full text
    Get full text
    Thesis
  12. 12

    CAT CHAOTIC GENETIC ALGORITHM BASED TECHNIQUE AND HARDWARE PROTOTYPE FOR SHORT TERM ELECTRICAL LOAD FORECASTING by ISLAM, BADAR UL ISLAM

    Published 2017
    “…In the hybrid scheme, the initial parameters of the modified BP neural network are optimized by using the global search ability of genetic algorithm, improved by cat chaotic mapping to enrich its optimization capability. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

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

    Published 2022
    “…Besides, since PSO operates in the continuous domain, it cannot be applied directly to solve a discrete problem like the JSP efficiently. This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Optimized differential evolution algorithm for linear frequency modulation radar signal denoising by Al-Dabbagh, Mohanad Dawood Hasan

    Published 2013
    “…The standard DE algorithm is known as a fixed length optimizer, while our problem demands the need for methods that aren’t tolerated to a fixed individual size, and that was made by altering the mutation and crossover strategies as well as the selection operation. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Optimized Cover Selection for Audio Steganography Using Multi-Objective Evolutionary Algorithm by Noor Azam, Muhammad Harith, Ridzuan, Farida, Mohd Sayuti, M Norazizi Sham

    Published 2023
    “…One of the search methods commonly used to find solutions for the trade-off problem in various fields is the Multi-Objective Evolutionary Algorithm (MOEA). …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    PROPOSED METHODOLOGY FOR OPTIMIZING THE TRAINING PARAMETERS OF A MULTILAYER FEED-FORWARD ARTIFICIAL NEURAL NETWORKS USING A GENETIC ALGORITHM by ABDALLA, OSMAN AHMED

    Published 2011
    “…To overcome these limitations, there have been attempts to use genetic algorithm (GA) to optimize some of these parameters. …”
    Get full text
    Get full text
    Thesis
  18. 18

    A Modified Particle Swarm Optimization for Efficient Maximum Power Point Tracking Under Partial Shading Condition by Koh J.S., Tan R.H.G., Lim W.H., Tan N.M.L.

    Published 2024
    “…Finally, a modified local search method using Perturb and Observe with adaptive step size method (P&O-ASM) is proposed to refine the near-optimal duty cycle and track GMPP with negligible oscillations. …”
    Article
  19. 19
  20. 20

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…This intractability is one of the reasons why the problem has been so widely studied. The problem was initially tackled by “exact methods” such as the branch and bound method, which is based on the exhaustive enumeration of a restricted region of solutions containing exact optimal solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis