Search Results - (( simulation optimization search algorithm ) OR ( using function path algorithm ))

Search alternatives:

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

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

    Published 2022
    “…The suggested algorithm outperforms the competition in terms of improving path cost, smoothness, and search time. …”
    Get full text
    Thesis
  3. 3

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

    Published 2004
    “…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
    Get full text
    Get full text
    Thesis
  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

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

    Published 2023
    “…The performance of the new hybrid optimization algorithm is verified using standard classical test function and further evaluated with other four renowned optimization algorithms and the results showed that it is better in most cases compared with the existing algorithms. …”
    Get full text
    Get full text
    Get full text
    Proceeding
  6. 6

    Enhancing performance of global path planning for mobile robot through Alpha–Beta Guided Particle Swarm Optimization (ABGPSO) algorithm by Ahmad, Javed, Ab Wahab, Mohd Nadhir, Ramli, Ahmad, Misro, Md Yushalify, Ezza, Wan Zafira, Wan Hasan, Wan Zuha

    Published 2025
    “…Through extensive simulations across various static environment maps, we demonstrate that the ABGPSO algorithm outperforms existing state-of-the-art optimization techniques, including Genetic Algorithms (GA), Grey Wolf Optimization (GWO), and modern optimizers like the Sine Cosine Algorithm (SCA), Harris Hawks Optimization (HHO) and Reptile search algorithm (RSA). …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

    Published 2016
    “…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

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

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

    Efficient multi-UAV coordination via rl: joint path planning and task scheduling for post-disaster UAV-assisted MEC systems by Adnan, Mohd Hirzi, Ahmad Zukarnain, Zuriati, Subramaniam, Shamala K.

    Published 2025
    “…Meanwhile, task scheduling is optimized using a greedy algorithm to reduce computational complexity, and UAVs cooperate through information sharing to achieve robust performance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

    Published 2008
    “…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Pressure vessel design simulation using hybrid harmony search algorithm by Alaa A., Alomoush, Mohammed I., Younis, Khalid S., Aloufi, Alsewari, Abdulrahman A., Kamal Z., Zamli

    Published 2019
    “…Recently the development of optimization algorithm is rapidly increased. Among several optimization algorithms, Harmony Search (HS) has been recently proposed for solving engineering optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…An example of a numerical algorithm is the simulated Kalman filter (SKF). Various method has been introduced as an extension of a numerical algorithm to adapt it to a discrete search space. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…This research proposes the enhanced metaheuristic algorithms that exploit the power of Tabu Search, Genetic Algorithm, and Simulated Annealing for solving VRPSD. …”
    Get full text
    Get full text
    Monograph
  16. 16

    Optimized PV-Battery Systems using Backtracking Search Algorithm for Sustainable Energy Solutions by Abdolrasol M.G.M., Jern Ker P., Hannan M.A., Tiong S.K., Ayob A., Almadani J.F.S.

    Published 2024
    “…Employing the Backtracking Search Algorithm (BSA), the research optimizes PI controller parameters to enhance system efficiency and reliability. …”
    Conference Paper
  17. 17

    Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems by Zuwairie, Ibrahim, Zulkifli, Md. Yusof, Asrul, Adam, Kamil Zakwan, Mohd Azmi, Tasiransurini, Ab Rahman, Badaruddin, Muhammad, Nor Azlina, Ab. Aziz, Norrima, Mokhtar, Mohd Ibrahim, Shapiai, Mohd Saberi, Mohamad

    Published 2018
    “…Simulated Kalman Filter (SKF) is a population-based optimization algorithm which exploits the estimation capability of Kalman filter to search for a solution in a continuous search space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    A Modified Simulated Kalman Filter Optimizer with State Measurement, Substitution Mutation, Hamming Distance Calculation, and 2-Opt Operator by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2021
    “…The simulated Kalman filter (SKF) is an algorithm for population-based optimization based on the Kalman filter framework. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

    Distance evaluated simulated kalman filter with state encoding for combinatorial optimization problems by Yusof, Zulkifli Md., Ibrahim, Zuwairie, Adam, Asrul, Azmi, Kamil Zakwan Mohd, Ab. Rahman, Tasiransurini, Muhammad, Badaruddin, Ab. Aziz, Nor Azlina, Abd Aziz, Nor Hidayati, Mokhtar, Norrima, Shapiai, Mohd Ibrahim, Muhammad, Mohd Saberi

    Published 2018
    “…Simulated Kalman Filter (SKF) is a population-based optimization algorithm which exploits the estimation capability of Kalman filter to search for a solution in a continuous search space. …”
    Get full text
    Get full text
    Article
  20. 20