Search Results - (( based implementation path algorithm ) OR ( simulation optimization modified 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
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…The fundamental and standard algorithm were first introduced. Then, the work on the algorithm improvements was surveyed. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

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

    SNR-Based OLSR Routing Protocol for Wireless Mesh Networks by Elobaid, Mohamed Elshaikh

    Published 2009
    “…Unfortunately the routing protocols used such as AODV and Dynamic source routing (DSR) are hop count-based; where the routing algorithm uses the number of nodes to determine the optimum path to the destination. …”
    Get full text
    Get full text
    Thesis
  5. 5

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

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

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
    Get full text
    Get full text
    Final Year Project
  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

    Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

    Published 2008
    “…The purpose of this project is initially to present an implementation of a guidance algorithm based on the geometrical analysis for the adoption of path planning problem. …”
    Get full text
    Learning Object
  13. 13

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

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

    The PID controller parameter tuning based on a modified differential evolutionary optimization algorithm for the intelligent active vibration control of a combined single link robo... by Moloody, Abbas, As’arry, Azizan, Hong, Tang Sai, Raja Kamil, ., Zolfagharian, Ali

    Published 2025
    “…The Crossover Probability Factor (CPF) as the Certain Ratio (CR) and the Mutation Factor (MF) of the algorithm are gradually altered during algorithm iteration to enhance the method's performance during optimization. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

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

    Published 2015
    “…The information then is used to generate a directed graph in order to obtain the shortest path results through the implementation of shortest path algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Optimal power flow using the Jaya algorithm by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

    Published 2016
    “…Simulations are carried out on the modified IEEE 30-bus and IEEE 118-bus networks to determine the effectiveness of the Jaya algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Indoor global path planning based on critical cells using dijkstra algorithm by Azrul Amri, Jamal, Engku Fadzli Hasan, Syed Abdullah, Fatma Susilawati, Mohamad

    Published 2015
    “…This paper proposes global path planning based on grids representation in an indoor environment using Dijkstra algorithm. …”
    Get full text
    Get full text
    Article