Search Results - (( using application path algorithm ) OR ( simulation optimization method algorithm ))

Refine Results
  1. 1

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

    Published 2005
    “…Both algorithms are compared. Simulation is used as a method in this study. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

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

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

    Published 2012
    “…Therefore, the second design is the best approach in optimizing the optimal path trace back for Smith Waterman algorithm. …”
    Get full text
    Get full text
    Student Project
  6. 6

    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article by Saliman, Nur Farah Ain

    Published 2012
    “…This will cause disadvantages in the performance and speed level of the Smith-Waterman Algorithm. Thus, based on other researchers there was various kind of method being use in order to overcome this problem. …”
    Get full text
    Get full text
    Article
  7. 7

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  8. 8

    Modelling of multi-robot system for search and rescue by Poy, Yi Ler

    Published 2023
    “…One of the key aspects in multi-robot systems is the path planning problem, which involves finding collision-free paths for each robot to reach their respective destinations while optimizing various performance metrics. This report focusses on developing a novel multi-robot path planning algorithm based on the Modified Particles Swarm Optimization (MPSO) algorithm for dynamic environments. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  9. 9

    Novel algorithm for mobile robot path planning in constrained environment by Muhammad, Aisha, Ali, Mohammed A. H., Turaev, Sherzod, Shanono, Ibrahim Haruna, Hujainah, Fadhl, Mohd Zubir, Mohd Nashrul, Faiz, Muhammad Khairi, Mohd Faizal, Erma Rahayu, Abdulghafor, Rawad Abdulkhaleq Abdulmolla

    Published 2021
    “…Moreover, the performance of the proposed method was compared with the A-star and laser simulator (LS) algorithms in terms of path length, computational time and path smoothness. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  10. 10

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

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Path planning for visually impaired people in an unfamiliar environment using particle swarm optimization by Yusof, T. S. T., Toha, Siti Fauziah, Md. Yusof, Hazlina

    Published 2015
    “…The simulation analyses of the proposed method have shown promising results of optimal route for different destinations. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…A MPSO algorithm, without path smoothening, is used for comparison. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14
  15. 15

    Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators by Nor Maniha, Abdul Ghani, Nizaruddin, M. Nasir, Azrul Azim, Abdullah Hashim

    Published 2024
    “…Interestingly, the manipulator's behaviours using the spiral dynamics algorithm for PID controller tuning were superior to those using alternative methods. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

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

    Published 2017
    “…The whole constraint analyzer and the fitness function were combined with four SBTs (genetic algorithm, evolutionary algorithm, simulating annealing, and quantum genetic algorithm). …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17

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

    A novel bio-inspired routing algorithm based on ACO for WSNs by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2019
    “…A novel approach of ant colony optimization (ACO) algorithm for discovering the optimum route for information transmission in the WSNs is proposed here for optimization and enhancement. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20