Search Results - (( based solving path algorithm ) OR ( simulation optimization using 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

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…A research is proposed based on Ant Colony Optimization for solving the shortest path problem in library.This is a research that the algorithm is aim to implement on a robot. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  3. 3

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

    Published 2013
    “…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…In this thesis, a smart QoS-aware service composition approach is proposed. The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…This research focuses on developing a novel path planning algorithm, called Generalized Laser Simulator (GLS), to solve the path planning problem of mobile robots in a constrained environment. …”
    Get full text
    Thesis
  7. 7

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

    Path optimization using genetic algorithm in laser scanning system by Chen, Chai Phing, Koh, Johnny Siaw Paw, Aris, Ishak, Fong, Albert Yu Chooi, Tiong, Sieh Kiong

    Published 2008
    “…The GA would base on the real-number representation, namely Real-Coded Genetic Algorithm (RCGA). …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Path optimization using genetic algorithm in laser scanning system by Chen C.P., Koh S.P., Aris I.B., Albert F.Y.C., Tiong S.K.

    Published 2023
    “…The GA would base on the real-number representation, namely Real-Coded Genetic Algorithm (RCGA). …”
    Conference paper
  10. 10

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

    Published 2017
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  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

    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
    “…Their performances were compared and the appropriate algorithm for solving TSPs was then identified. The solution quality was evaluated using empirical testing, benchmark solutions and probabilistic analyses. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

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

    Published 2009
    “…By this procedure, IANRA is able to prevent some of the existing difficulties in AntNet, MACO and Ad hoc On Demand Distance Vector (AODV) routing algorithms. OMNeT++ was used to simulate the IARNA algorithm for WMNs and MANET. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree by Yincong Ma, Kit Guan Lim, Min Keng Tan, Helen Sin Ee Chuo, Lorita Angeline, Kenneth Tze Kin Teo

    Published 2022
    “…The rough path is optimized by applying the cubic spline interpolation method to solve the problem that the path cannot be applied to the actual vehicle driving task. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
  16. 16

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

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

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

    Published 2019
    “…In this paper, a novel sampling-based algorithm is proposed which is able to plan in an unknown environment and provides solutions with lower cost in terms of path length, runtime and stability of the results. …”
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

    Published 2010
    “…The contribution of this work is to optimize the base of Fuzzy membership function of the APFLC by using GA technique. …”
    Get full text
    Thesis