Search Results - (( based evaluation study algorithm ) OR ( simulation optimization path algorithm ))

Refine Results
  1. 1

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

    Published 2019
    “…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3

    A multi-objective parametric algorithm for sensor-based navigation in uncharted terrains by Khaksar W., Sahari K.S.M.

    Published 2023
    “…Simulation studies have shown the algorithm to perform robust and effective in all environments.…”
    Article
  4. 4

    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
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6

    Three-dimensional coverage control for multi-unmanned aerial vehicle by Siow, Wen Hao

    Published 2024
    “…The performance of the transitioned 3D algorithm is evaluated against the original 2D MBC algorithm in terms of computational load, convergence analysis, path length, coverage quality, and scalability. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  7. 7
  8. 8

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…Case study evaluation was conducted based on three industrial open source case studies in order to evaluate empirically the significant of the performance of the proposed method. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    “…The purpose of this study is to carry out a comparative evaluation study on Simulated Annealing (SA) and several variation of Tabu Search (TS).Materials and Method: This study considers four heuristic methods, i.e., Simulated Annealing (SA), conventional Tabu Search (TS), Improved Tabu Search (ITS) and modified Reactive Tabu Search (RTS) to solve symmetric TSPs.The algorithms were tested on five chosen benchmark problems. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    The Effect of Rainfall on the UAV Placement for 5G Spectrum in Malaysia by Shalaby A.M., Othman N.S.

    Published 2023
    “…The problem of finding the UAV 3D placement is formulated with the objective to minimize the total path loss between the UAV and all users. The problem is solved by invoking two algorithms, namely Particle Swarm Optimization (PSO) and Gradient Descent (GD) algorithms. …”
    Article
  11. 11

    Collision avoidance mechanisms using artificial potential field for UAVs by Abdul Azis, Fadilah, Tan, Jie Sim, Md Ghazaly, Mariam, Mohamad Hanif, Noor Hazrin Hany

    Published 2025
    “…To evaluate algorithmic performance, three simulated scenarios were developed: (i) varying obstacle densities, (ii) extreme goal positioning, and (iii) external wind disturbances. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
  13. 13

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…The aim of this research is to develop an Ant Colony Optimization (ACO) for solving the CVRP where it simulates the behavior of real ants that always find the shortest path between their nest and a food source through an indirect form of communication, namely pheromone trail. …”
    Get full text
    Get full text
    Thesis
  14. 14

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

    New optimization feature for the developed open cnc controller based on ISO 6983 and ISO 14649 by Obayes, Noor Hatem

    Published 2021
    “…However, this system has some limitations, such as tool path optimization. This research aims to minimize tool path airtime during machining of input ISO codes via an ant colony optimization algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Mobile Crowd Steering Evacuation Model via Agent Based Simulation by Applying the Social Force Model by Norhaida, Binti Hussain, Wai Shiang, Cheah, Wai Loke, Seng

    Published 2025
    “…The evaluation states that the existing agent-based steering model computes the complete set of collision-free paths with the least travel time among agents to make path decisions based on updated information. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

    Published 2015
    “…A simulated robot in a simulated environment is used to test the algorithm that is to be developed. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

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

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Therefore, the IE algorithm exhibits significant potential for UAV path planning optimization…”
    Get full text
    Get full text
    Thesis