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

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

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  3. 3

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

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). Because of the dynamic nature of an enterprise network, all security analysis tools devised for the network need to function in dynamic mode as well. …”
    Get full text
    Get full text
    Article
  5. 5

    Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

    Published 2016
    “…We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). Because of the dynamic nature of an enterprise network, all security analysis tools devised for the network need to function in dynamic mode as well. …”
    Get full text
    Get full text
    Article
  6. 6

    Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms by Ridha, Hussein Mohammed

    Published 2020
    “…A new mutation vector inspired by the two-opposite path (2-Opt) algorithm with adaptive mutation scalar (F ) and crossover rate (CR) control parameters were employed to enhance the exploration and exploitation phases of the proposed algorithm. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Particle swarm optimization approach in route navigation for PoSVI-Cane by Toha, Siti Fauziah, Nordin, Nor Hidayati Diyana, Md. Zain, Mohd Zarhamdy

    Published 2023
    “…In addition, only low-cost components are used to ensure that the total cost of the proposed cane is low, without jeopardizing its function.…”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

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

    Improvement and application of particle swarm optimization algorithm by Deevi, Durga Praveen, Kodadi, Sharadha, Allur, Naga Sushma, Dondapati, Koteswararao, Chetlapalli, Himabindu, Perumal, Thinagaran

    Published 2025
    “…This method combines CPTD with the Genetic Algorithm and PSO (GAPSO), resulting in an effective strategy for dynamic formation reconfiguration and path optimization. …”
    Get full text
    Get full text
    Article
  10. 10

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

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…The comparison of the result of the developed integrated algorithm using two benchmark FMS scheduling algorithms datasets is conducted. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Continuous path planning of Kinematically redundant manipulator using Particle Swarm Optimization by Machmudah, A., Parman, S., Baharom, M.B.

    Published 2018
    “…To achieve n-connectivity of sampling points, the angle domain trajectories are modelled using a sinusoidal function generated inside the angle domain boundary. …”
    Get full text
    Get full text
    Article
  14. 14

    Continuous path planning of Kinematically redundant manipulator using Particle Swarm Optimization by Machmudah, A., Parman, S., Baharom, M.B.

    Published 2018
    “…To achieve n-connectivity of sampling points, the angle domain trajectories are modelled using a sinusoidal function generated inside the angle domain boundary. …”
    Get full text
    Get full text
    Article
  15. 15

    Metaheuristic optimization techniques for localization in outdoor wireless sensor networks: a comprehensive review by Gumaida, Bassam, Ibrahim, Adamu Abubakar

    Published 2025
    “…The primary objective of this paper isto review localization algorithms based on metaheuristic optimization techniques to improve localization accuracy. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Optimization of fast fourier transform based on twiddle factor using genetic algorithm on raspberry pi by Ghazi, Firas Faisal

    Published 2019
    “…Over the years the Genetic Algorithms (GA) proved to be one of the best methods for optimization. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    A novel swarm-based optimisation algorithm inspired by artificial neural glial network for autonomous robots by Ismail, Amelia Ritahani, Tumian, Afidalina

    Published 2019
    “…Therefore this research proposed a novel model for artificial neuro-glial networks and swarm-inspired algorithm for autonomous robots’ communication. Artificial neuro-glial networks is proposed to be combined in the swarm-based communication algorithm to provide a human-like model for the robot's communication and optimization.…”
    Get full text
    Get full text
    Monograph
  19. 19

    Controller placement problem in the optimization of 5G based SDN and NFV architecture by Ibrahim, Abeer Abdalla Zakaria

    Published 2021
    “…In addition, energy savings of up to 70% are achieved compared to the proposed Dijkstra-based energy-aware algorithms.…”
    Get full text
    Get full text
    Thesis
  20. 20

    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