Search Results - (( basic computing path algorithm ) OR ( simulation optimization _ algorithm ))

Refine Results
  1. 1

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
    Get full text
    Get full text
    Get full text
    Thesis
  2. 2

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

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

    Published 2010
    “…It is observed that the APFLC showed convincing performance over the entire simulation of the Pico-satellite. Genetic Algorithm (GA) is a computational model inspired by evaluation. …”
    Get full text
    Thesis
  4. 4

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…It can be concluded that Basic Theta* can produce a shorter path compared to A* but with the price of having a higher computation time. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Enhanced Mobility Solution In Mobile Ipv6 Network by David, Adeniji Oluwashola

    Published 2008
    “…The interface selection algorithm was based on NEMO implementation structure using a technique of mutihoming which was extended to MIPv6 concepts The outcome of this research work are: a designed policy protocol for policy messages communication between the Mobile Router and the Home Agent, the framework is simulated using Network Simulator (NS2) with an extension of mobiwan, the result shows the end to end delay, average end to end delay, overhead, optimal routing path, average inter-packet latency and throughput of the developed system. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

    Travelling Salesman Problem using Prim Algorithm in High Performance Computing by Wan Harun, Wan Nurhafizah

    Published 2007
    “…This preliminary report emphasizes on the basic terms of the efficient job scheduling algorithm for traveling salesman problem in high performance computing. …”
    Get full text
    Get full text
    Final Year Project
  12. 12

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

    Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm by Zuwairie, Ibrahim, Nor Hidayati, Abd Aziz, Nor Azlina, Ab. Aziz, Saifudin, Razali, Mohd Saberi, Mohamad

    Published 2016
    “…In this paper, a new population-based metaheuristic optimization algorithm, named Simulated Kalman Filter (SKF) is introduced. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

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

    The Hybrid of WOABAT-IFDO Optimization Algorithm and Its Application in Crowd Evacuation Simulation by Hamizan, Sharbini, Roselina, Sallehuddin, Habibollah, Haron

    Published 2023
    “…This paper proposes a new hybrid of nature inspired optimization algorithm (IFDO-WOABAT) based on the latest optimization algorithm namely Improved Fitness Dependent Optimization (IFDO) with Whale-Bat Optimization algorithm (WOABAT). …”
    Get full text
    Get full text
    Get full text
    Proceeding
  16. 16

    Asynchronous simulated kalman filter optimization algorithm by Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Nor Hidayati, Abd Aziz, Tasiransurini, Ab Rahman

    Published 2018
    “…Simulated Kalman filter (SKF) is an optimization algorithm which is inspired by Kalman filtering method. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  17. 17

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

    Angle Modulated Simulated Kalman Filter Algorithm for Combinatorial Optimization Problems by Zulkifli, Md. Yusof, Zuwairie, Ibrahim, Ismail, Ibrahim, Kamil Zakwan, Mohd Azmi, Nor Azlina, Ab. Aziz, Nor Hidayati, Abd. Aziz, Mohd Saberi, Mohamad

    Published 2016
    “…Inspired by the estimation capability of Kalman filter, we have recently introduced a novel estimation-based optimization algorithm called simulated Kalman filter (SKF). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Ant colony optimization for rule induction with simulated annealing for terms selection by Saian, Rizauddin, Ku-Mahamud, Ku Ruhana

    Published 2012
    “…This paper proposes a sequential covering based algorithm that uses an ant colony optimization algorithm to directly extract classification rules from the data set.The proposed algorithm uses a Simulated Annealing algorithm to optimize terms selection, while growing a rule.The proposed algorithm minimizes the problem of a low quality discovered rule by an ant in a colony, where the rule discovered by an ant is not the best quality rule, by optimizing the terms selection in rule construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20