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

Refine Results
  1. 1

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

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

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

    Published 2023
    “…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
  5. 5

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

    Published 2012
    “…Then, the structural modelling is being use in this project in order to trace back by scanning the Smith-Waterman matrix calculation and find the optimal path. The paper was to study on theoretical and a simulation technique to complete the result.…”
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…The elaborated result of the study will help test engineers to choose the algorithm they need to generate test cases efficiently and optimally.…”
    Get full text
    Get full text
    Thesis
  9. 9

    Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

    Published 2009
    “…Among various works inspired by ant colonies, the Ant Colony Optimization (ACO) metaheuristic algorithms are the most successful and popular, e.g., AntNet, Multiple Ant Colony Optimization (MACO) and AntHocNet. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Reliable Fuzzy-Based Multi-Path Routing Protocol Based on Whale Optimization Algorithm to Improve QOS in 5G Networks for IOMT Applications by Al-Mukhtar F.S., Jaaz Z.A., Hamad A.H.

    Published 2024
    “…The "Quality of Services (QoS)" in 5G-based IoMT is improved by the Reliable Fuzzy-based Multi-path routing system shown in this study. …”
    Article
  11. 11
  12. 12

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

    Published 2024
    “…The Multi-step Broadcast Control (MBC) scheme emerges as a key reference due to its effectiveness in scalability and computational efficiency. This study proposes a 3D coverage control algorithm to address complex real-world scenarios, wherein the 3D control algorithm will be developed based on the 2D MBC scheme. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  13. 13

    Hybrid optimal path traceback system development for optimization DNA sequences alignment by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…This paper present the new hybrid optimal path trace back system development for solving optimal path trace back complexity issue. …”
    Get full text
    Get full text
    Student Project
  14. 14

    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…This paper present the new hybrid optimal path trace back system development for solving optimal path trace back complexity issue. …”
    Get full text
    Get full text
    Article
  15. 15

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

    Optimization And Execution Of Multiple Holes-Drilling Operations Based On STEP-NC by Yusof, Yusri, Latif, Kamran, Hatem, Noor, A. Kadir, Aini Zuhra, Abedlhafd, Mohammed M.

    Published 2021
    “…The percentage of tool path improvement was 16.96%. This experimental study will fulfill the design of an open architecture CNC control system, optimize the CNC movement, and simulate and generate a document of the result.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

    Published 2014
    “…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  19. 19

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

    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