Search Results - (( different evaluation path algorithm ) OR ( based optimization method algorithm ))

Refine Results
  1. 1

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…The simulation results indicate that the algorithm is able to segregate and assign the tasks for each scanning head and also able to find the shortest scanning path for different types of objects coordination. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Transmission path optimization Based on Efficiency Communication System by Jin Fan, Kit, Guan Lim, Sin, Helen Ee Chuo, Min, Keng Tan, Ali Farzamnia, Tze, Kenneth Kin Teo

    Published 2022
    “…In this paper, routing attribute table that is maintained by the nodes, the density and relative distance of node distribution, is used to determine the clustering method. At the same time, the developed algorithm combines the relative position of the cluster and the base station to further improve the routing method of the sub-cluster head, Finally, the algorithm analyzes the influence of different parameters on the transmission path, and use the simulation experiments to evaluate the conclusions.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Three-dimensional coverage control for multi-unmanned aerial vehicle by Siow, Wen Hao

    Published 2024
    “…The performance of the transitioned 3D algorithm is evaluated against the original 2D MBC algorithm in terms of computational load, convergence analysis, path length, coverage quality, and scalability. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  4. 4
  5. 5

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…The main motivation for this study is to introduce and evaluate an advance new customized GA. Comparison results of different combinatorial operators and tests with different probability factors are shown. …”
    Article
  6. 6

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh J.S.P., Aris I.B., Ramachandaramurthy V.K., Bashi S.M., Marhaban M.H.

    Published 2023
    “…The main motivation for this study is to introduce and evaluate an advance new customized GA. Comparison results of different combinatorial operators and tests with different probability factors are shown. …”
    Article
  7. 7

    Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module by Koh, Johnny Siaw Paw, Aris, Ishak, Ramachandaramurthy, Vigna Kumaran, Bashi, Sinan Mahmod, Marhaban, Mohammad Hamiruce

    Published 2006
    “…The main motivation for this study is to introduce and evaluate an advance new customized GA. Comparison results of different combinatorial operators and tests with different probability factors are shown. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    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
    “…RTS is an improved method of TS and it dynamically adjusts tabu list size based on how the search is performed.The performance of SA, TS and RTS algorithms in solving TSP with different size of problems are evaluated by using empirical testing, benchmarking solution and simple probabilistic analysis. …”
    Get full text
    Get full text
    Get full text
    Monograph
  9. 9
  10. 10

    A Compromise Programming to Task Assignment Problem in Software Development Project by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N., Binh, H.D., Aftab, M.U.

    Published 2021
    “…To support the decision-maker to evaluate different decision strategies, we use compromise programming to transform multiobjective optimization (MOP) into a single-objective problem. …”
    Get full text
    Get full text
    Article
  11. 11

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

    Published 2013
    “…There are a variety of algorithms in this class with different objectives, advantages and drawbacks. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin by Sariff, Nohaidda, Buniyamin, Norlida

    Published 2010
    “…Performances between both algorithms were compared and evaluated in terms of speed and number of iterations that each algorithm takes to find an optimal path within several selected environments. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…The objective is to verify and compare the effectiveness of both algorithms in finding the optimal robot path in different types of global map environments. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

    Published 2012
    “…This project aims to determine locations of the node that reflect all the items in the list, build the route by connecting nodes and evaluate the proposed algorithm for the single source shortest path problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    A multi-objective parametric algorithm for sensor-based navigation in uncharted terrains by Khaksar W., Sahari K.S.M.

    Published 2023
    “…The performance of the proposed algorithm was tested through simulation studies in different types of environments to evaluate its ability to achieve different planning goals. …”
    Article
  16. 16

    The impact of clustering on the average path length in wireless sensor networks by Aziz, A.A., Şekercioğlu, Y. A.

    Published 2015
    “…This property is evaluated by comparing the performance of several clustering algorithms with respect to the average path length. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    An improved method using fuzzy system based on hybrid boahs for phishing attack detection by Noor Syahirah, Nordin

    Published 2022
    “…Moreover, Butterfly Optimization Algorithm and Harmony Search Algorithm were combined as optimization method led to a new method named BOAHS. …”
    Get full text
    Get full text
    Thesis
  18. 18

    A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots by Wan Daud, Wan Mohd Bukhari, Abu, Nur Syuhadah, Omar, Siti Nashayu, Sohaimeh, Shahirul Ashraf, Adli,, M. H.

    Published 2022
    “…The following review analyses and compares 200 articles from two databases, Scopus and IEEE Xplore, and selects 60 articles as references from those articles. This evaluation focuses mostly on the accuracy of the different path-planning algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation by Khan, Abdullah

    Published 2022
    “…Therefore, the SMA method is redesigned for optimal location and sizing based on the total active power loss of the systems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Mobile robot navigation using GPS to solve target location achieving problem / Saiful Zaimy Yahaya, Rozan Boudville and Mohamad Faizal Abdul Rahman by Yahaya, Saiful Zaimy, Boudville, Rozan, Abdul Rahman, Mohamad Faizal

    Published 2010
    “…The path finding algorithm will basically finds the best path and instructs the robot to moves to its location by keep on refreshing its positions. …”
    Get full text
    Get full text
    Research Reports