Search Results - (( using evaluation path algorithm ) OR ( basic optimization _ algorithm ))

Search alternatives:

Refine Results
  1. 1
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller

    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
    Save to List
    Saved in:
  3. 3
    Evaluation of robot path planning algorithms in global static environments: genetic algorithm vs ant colony optimization algorithm / Nohaidda Sariff and Norlida Buniyamin

    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
    Save to List
    Saved in:
  4. 4
    Quantitative and qualitative analysis of unmanned aerial vehicle's path planning using master-slave parallel vector-evaluated genetic algorithm

    Quantitative and qualitative analysis of unmanned aerial vehicle's path planning using master-slave parallel vector-evaluated genetic algorithm

    Published 2012
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  5. 5
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

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

    Published 2013
    “…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis

    Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis by Awalin, Lilik J., Syahirah, Abd Halim, Jafferi, Jamaludin, Nor Azuana, Ramli

    Published 2021
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions

    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

    Published 2020
    “…Dijkstra’s algorithm was one of the shortest path algorithms that would be used to identify the path with the least cost. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    A Continuous Overlay Path Probing Algorithm For Overlay Networks

    A Continuous Overlay Path Probing Algorithm For Overlay Networks by Feily, Maryam

    Published 2013
    “…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…Experiments via WEKA tool and simulation prototype were conducted to evaluate the methods used. For the runtime path prediction method, the results showed that the path prediction method achieved promising prediction accuracy, and the number of paths involved in the prediction did not affect the accuracy. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    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
    Save to List
    Saved in:
  11. 11
    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm

    Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

    Published 2023
    “…This paper proposed a solution to the MCP problem using genetic algorithm (GA). The effectiveness of the proposed algorithm is evaluated through simulation. …”
    Article
    Save to List
    Saved in:
  12. 12
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm

    Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm by Krishnan P.S., Paw J.K.S., Kiong T.S.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  14. 14
    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Basic firefly algorithm for document clustering

    Basic firefly algorithm for document clustering by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2015
    “…To address the shortcoming, this paper proposes a Basic Firefly (Basic FA) algorithm to cluster text documents.The algorithm employs the Average Distance to Document Centroid (ADDC) as the objective function of the search. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    The impact of clustering on the average path length in wireless sensor networks

    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
    Save to List
    Saved in:
  17. 17
    Particle swarm optimization (PSO) for CNC route problem

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  18. 18
    Repetitive mutations in genetic algorithm for software test data generations

    Repetitive mutations in genetic algorithm for software test data generations by Kadhim, Mohammed Majid

    Published 2022
    “…One of the white box testing techniques is path coverage testing. Genetic Algorithm (GA) has proven to be an important method in generating test data for automatic path coverage testing. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    All-pass filtered x least mean square algorithm for narrowband active noise control

    All-pass filtered x least mean square algorithm for narrowband active noise control by Mondal (Das), Kuheli, Das, Saurav, Abu, Aminudin, Hamada, Nozomu, Toh, Hoong Thiam, Das, Saikat, Faris, Waleed Fekry

    Published 2018
    “…The performance evaluation in terms of convergence speed of the proposed algorithm is validated with standard ANC without secondary path modelling. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Mobile robot navigation using GPS to solve target location achieving problem / Saiful Zaimy Yahaya, Rozan Boudville and Mohamad Faizal Abdul Rahman

    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
    Save to List
    Saved in:

Search Tools: