Search Results - (( initial solution study algorithm ) OR ( using optimization strategy algorithm ))

Refine Results
  1. 1

    Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman by Che Osman, Siti Eshah

    Published 2019
    “…Due to the center biased nature of the videos, the HPSO algorithm uses an initial pattern (hexagon-shaped) to speed up the convergence of the algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Balancing exploration and exploitation in ACS algorithms for data clustering by Jabbar, Ayad Mohammed, Sagban, Rafid, Ku-Mahamud, Ku Ruhana

    Published 2019
    “…To resolve this issue, this study proposes a second modification by adding a restart strategy that balances between the exploration and exploitation strategy in P-ACOC.Each time the algorithm begins to converge with the same clustering solution, the restart strategy is performed to change the behavior of the algorithm from exploitation to exploration. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

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

    Published 2019
    “…Meanwhile, MAFIRO differs from AFIRO in terms of the iteration search strategy. These three algorithms are called in short as FIR optimizers (FIROs). …”
    Get full text
    Get full text
    Thesis
  11. 11

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

    Published 2019
    “…Meanwhile, MAFIRO differs from AFIRO in terms of the iteration search strategy. These three algorithms are called in short as FIR optimizers (FIROs). …”
    Get full text
    Get full text
    Thesis
  12. 12

    Power system intentional islanding for different contingency scenarios using discrete optimization technique by Nur Zawani Binti Saharuddin

    Published 2023
    “…The initial intentional islanding solution was determined using graph theory approach, to facilitate the proposed MDEP algorithm in determining the optimal intentional islanding strategy. …”
    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
    “…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
  16. 16

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

    A hybrid adaptive harmony search with modified great deluge algorithm for school timetabling by Arbaoui, Billel

    Published 2025
    “…In conclusion, the proposed algorithms significantly improve HSTP solutions, demonstrating their superiority and establishing them as effective strategies for solving complex optimization problems, particularly in high school timetabling.…”
    Get full text
    Get full text
    Thesis
  18. 18

    An improved partial comparison optimization for utilizing landfill facilities in a waste collection vehicle routing problem by Fazlini, Hashim

    Published 2025
    “…The improved PCO incorporates a Nearest Greedy (NG) algorithm for initial solution construction, dynamic parameter adjustment, and two additional neighborhood operators. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Optimization of RFID network planning for monitoring railway mechanical defects based on gradient-based Cuckoo search algorithm by Talib, Nihad Hasan

    Published 2020
    “…The solution strategy started in its initial input and process to find effective stations that can serve the railway monitoring system well. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak by Emily Sing Kiang, Siew

    Published 2025
    “…A constructive algorithm was developed to generate an initial feasible solution, which was subsequently refined using two primary approaches to evaluate their efficiency: Iterative Threshold Pipe Variable Neighborhood Descent (IT-PVND), and a modified Whale Optimization Algorithm (WOA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis