Search Results - (( using function methods algorithm ) OR ( peer optimization path algorithm ))

Refine Results
  1. 1

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. …”
    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
    “…A statistical test was used to demonstrate the efficiency of the proposed algorithm over the compared methods. …”
    Get full text
    Thesis
  3. 3

    The Implementation of Genetic Algorithm in Path Optimization by Jumali, Suriana

    Published 2005
    “…In this project, TSP will be used to model and easy visualize the path optimization problem and Genetic Algorithm (GA) was chosen to be implemented in resolving the problem. …”
    Get full text
    Get full text
    Final Year Project
  4. 4

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

    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
    “…The results reveal that our proposed method reduces the mobile robot's travel time by up to 69%, 67%, 72%, and 79% compared to these algorithms, while consistently achieving optimal path lengths. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries by Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., Jamal, A.A.

    Published 2016
    “…The adjacency matrix is the naive storage structure of the algorithm. This storage structure has limited the use of the algorithm as it expands large storage space. …”
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

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

    Published 2023
    “…Moreover, to cope with dynamic environments, a combination of global and local path planning methods is introduced. The PSO algorithm functions as a global path planner, determining the complete path for each robot, whereas a sensor-based obstacle avoidance algorithm serves as a local planner to avoid collision with dynamic obstacles during navigation. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  8. 8

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

    Published 2004
    “…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
    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
    “…Finally, real-world tests are performed to verify the proposed Algorithm's efficacy compared to existing optimization methods. …”
    Get full text
    Get full text
    Article
  10. 10

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…A MPSO algorithm, without path smoothening, is used for comparison. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  11. 11
  12. 12

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

    Published 2020
    “…In the sizing of the SAPV system, the mutation adaptive DE (MADE) algorithm based multi-objective functions minimizes three constraint objective functions. …”
    Get full text
    Get full text
    Thesis
  13. 13

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

    Vehicle routing problem using genetic algorithm / Shamini Nagaratnam by Shamini , Nagaratnam

    Published 2006
    “…Fixed length chromosomes and their genes have been used for encoding this problem. The proposed method uses proportional selection with two fixed point crossover and random mutation. and discards the infeasible chromosomes by giving high penalty values to the fitness function. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16

    Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

    Published 2021
    “…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    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
    “…The implementations of the three methods to solve TSP show that the RTS algorithm provides a better solution in terms of minimizing the objective function while SA algorithm is less time consuming in solving problem with large number of cities.In conclusion, RTS is more effective in producing good quality solution and on the other hand, SA may be used to obtain instant results.…”
    Get full text
    Get full text
    Get full text
    Monograph
  18. 18

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

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19
  20. 20

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

    Published 2025
    “…This paper serves as a comprehensive background on localization algorithms and methods used in wireless sensor networks, offering insights for researchers to develop efficient localization algorithms tailored to specific application requirements in diverse work environments.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article