Search Results - (( simulation optimization modified algorithm ) OR ( data optimization path algorithm ))

Refine Results
  1. 1

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…The elaborated result of the study will help test engineers to choose the algorithm they need to generate test cases efficiently and optimally.…”
    Get full text
    Get full text
    Thesis
  2. 2

    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

    Published 2018
    “…However,the sink node position and size of data transmitted will not affect the performance of coverage area.This is because the coverage area value is fluctuated as the parameters value increases.Throughout the experiment conducted,sensor nodes deployed using Modified Harmony Search algorithm (MHS) gives better coverage area compared to other existing methods.The average coverage area percentage obtained by Modified Harmony Search is 63 %.The average coverage area percentage obtained by Modified Random is 48 % and the average coverage area percentage obtained by Harmony Search is 46 %.The highest coverage area recorded for Modified Harmony Search is 70 %.To enhance the energy efficiency,shortest path distance finder is added to each method.Throughout the research,Modified Harmony Search with shortest path distance finder gives optimum results.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    A Modified Simulated Kalman Filter Optimizer with State Measurement, Substitution Mutation, Hamming Distance Calculation, and 2-Opt Operator by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2021
    “…The simulated Kalman filter (SKF) is an algorithm for population-based optimization based on the Kalman filter framework. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Testing on real data sets showed consistency results as the simulated ones. Generally, the proposed modified k-means algorithm is able to determine the optimum number of clusters for huge data.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10

    A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

    Published 2018
    “…This study introduces a novel meta-heuristic optimization algorithm known as quasi-oppositional modified Jaya (QOMJaya) to solve different multi-objective optimal power flow (MOOPF) problems. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  12. 12

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  13. 13

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…As a result, the evacuation route model is able to gain the shortest path and safest path consistently between Dijkstra’s algorithms and hybrid version which is Dijkstra-Ant Colony Optimization (DACO). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

    Published 2008
    “…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  17. 17

    New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

    Published 2024
    “…In the fourth phase, the newly developed algorithm undergoes testing on the formulated ROOPs and compared to several contemporary optimizer algorithms. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. …”
    Get full text
    Get full text
    Thesis
  20. 20