Search Results - (( simulation optimization using algorithm ) OR ( using factor path algorithm ))

Refine Results
  1. 1

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2
  3. 3

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…Through extensive simulations across various static environment maps, we demonstrate that the ABGPSO algorithm outperforms existing state-of-the-art optimization techniques, including Genetic Algorithms (GA), Grey Wolf Optimization (GWO), and modern optimizers like the Sine Cosine Algorithm (SCA), Harris Hawks Optimization (HHO) and Reptile search algorithm (RSA). …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Thesis
  5. 5

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

    Published 2016
    “…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
    Get full text
    Get full text
    Article
  8. 8

    Path Planning Optimization For Solar-Powered Perpetual Flight Across The World by Lim, Guang Ming

    Published 2018
    “…A validated algorithm with overall error percentage less than 10 % is developed to simulate the solar-powered flight.Next, the detailed path planning is planned which allow an UAV to perform mapping mission at constant altitude, 600 m above the Earth’s surface with minimized geometric error without fail. …”
    Get full text
    Get full text
    Monograph
  9. 9
  10. 10

    Efficient relay placement algorithm using landscape aware routing (erpalar) by Onabajo, Olawale Olusegun

    Published 2011
    “…GA is an optimization algorithm that simulates natural selection process as found in nature. …”
    Get full text
    Get full text
    Thesis
  11. 11
  12. 12

    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

    Published 2020
    “…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Ant-based vehicle congestion avoidance framework using vehicular networks / Mohammad Reza Jabbarpour Sattari by Sattari, Mohammad Reza Jabbarpour

    Published 2015
    “…Previous researches concentrated on using static algorithms to find the shortest path in VTRSs. …”
    Get full text
    Get full text
    Thesis
  15. 15

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

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

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
  17. 17

    A-star (A*) algorithm implementation for robotics path planning navigation by Emirul Ridzwan, Nor Azmi

    Published 2018
    “…This thesis is about the implementation of Astar (A*) algorithm as path planning algorithm used in robotics navigation. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  18. 18

    Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries by Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., Jamal, A.A.

    Published 2016
    “…The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. …”
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Optimization-based simulation algorithm for predictive-reactive job-shop scheduling of reconfigurable manufacturing systems by Tan, Joe Yee

    Published 2022
    “…In this case, the effectiveness and reliability of RMS is increase by combining the simulation with the optimization algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…However, these extensions may result in increased execution times for the algorithm. In this research, a new combinatorial algorithm named discrete simulated Kalman filter optimizer (DSKFO) is proposed to solve combinatorial optimization problem. …”
    Get full text
    Get full text
    Thesis