Search Results - (( based optimization path algorithm ) OR ( total solution using algorithm ))

Refine Results
  1. 1

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

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

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

    Published 2013
    “…Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Particle swarm optimization approach in route navigation for PoSVI-Cane by Toha, Siti Fauziah, Nordin, Nor Hidayati Diyana, Md. Zain, Mohd Zarhamdy

    Published 2023
    “…Here, Particle Swarm Optimization (PSO) path planning algorithm computes the shortest possible path based on the collection of coordinates along the pedestrian walkway. …”
    Get full text
    Get full text
    Get full text
    Article
  5. 5

    Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

    Published 2020
    “…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  8. 8
  9. 9

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Electricity distribution network for low and medium voltages based on evolutionary approach optimization by Hasan, Ihsan Jabbar

    Published 2015
    “…This thesis proposes an algorithm to find the optimum distribution substation placement and sizing by utilizing the PSO algorithm and optimum feeder routing using modified Minimum Spanning Tree (MST). …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Evolutionary algorithm based network coding for optimization of intelligent vehicular ad hoc network by Lee, Chun Hoe

    Published 2017
    “…This project aims to improve the throughput, energy consumption and overhead of vehicular ad hoe network (VANET) by optimising the network coding (NC) using Genetic Algorithm and Particle Swarm Optimisation (GA-PSO). …”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Accurate range free localization in multi-hop wireless sensor networks by Abdulwahhab, Abdullah Raed

    Published 2019
    “…Simulation and experimental results show a substantial performance gain achieved by our proposed localization algorithm in wireless sensor networks. The performance is evaluated in terms of RMSE in terms of three algorithms WLS, CRLR, and GMSDP based on using the Monte Carlo simulation with account the number of anchors that varying from anchor=4 to anchor =20. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra’s based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…Depending on the technology used, it can only read small pieces of base between 20 to 1000 bases. …”
    Get full text
    Get full text
    Thesis
  17. 17

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…The motion planning problem poses the question of how a robot can move from an initial to a final position. Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
    Get full text
    Get full text
    Thesis
  19. 19

    MULTIPLE DRONES PATH OPTIMIZATION ALGORITHM FOR 3D SPACE PERFORMANCE USING CENTRALIZED VISUALIZATION PLATFORM by Teng, Chu Yao

    Published 2019
    “…The existing methods aim for planning optimal path of drone flight. In this report, a variant of A*, Theta* algorithm is proposed to find the optimal path within a grid-based environment. …”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  20. 20