Search Results - (( based application path algorithm ) OR ( using solution using algorithm ))

Search alternatives:

Refine Results
  1. 1
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    A robust GA-based QoS routing algorithm for solving multi-constrained path problem

    A robust GA-based QoS routing algorithm for solving multi-constrained path problem by Yussof S., See O.H.

    Published 2023
    “…It has been proven that this problem is NP-complete and finding an exact solution can be difficult. As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. …”
    Article
    Save to List
    Saved in:
  3. 3
    Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation

    Solving Nonlinear Algebraic Problem Using Newton Homotopy Differential Equation by Hasan, Talib Hashim, Chowdhury, Md. Sazzad Hossien, Prayoto, .

    Published 2011
    “…An ordinary differential equation based on Newton homotopy is used for following the solution path. Our homotop algorithm is much more efficient than the conventional iterations type algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Thus, this thesis aims to develop a mobile robot for industrial applications by leveraging a genetic algorithm (GA). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Optimization of multi-holes drilling path using particle swarm optimization

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin

    Published 2022
    “…One way to improve the multi-hole drilling is by optimising the tool path in the process. This research aims to model and optimise multi-hole drilling problems using Particle Swarm Optimisation (PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    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). …”
    Article
    Save to List
    Saved in:
  7. 7
    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    Subjects: Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  8. 8
    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem

    Development of Hybrid Algorithm for Integrated Aircraft Routing Problem and Crew Pairing Problem by NurulFarihan Mohamed, ZaitulMarlizawati Zainuddin, Said Salhi, Nurul Huda Mohamed, NurulAkmal Mohamed

    Published 2024
    Article
    Save to List
    Saved in:
  9. 9
    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution

    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

    Published 2017
    “…Objectives: Our paper attempt to find an optimal route result for VRP by using K-Nearest Neighbor Algorithm (KNNA). To achieve an optimal solution for VRP with the accompanying targets: (1) To reduce the distance and the time for all paths this leads to speedy the transportation of customers to their locations, (2) To implement the capacitated vehicle routing problem (CVRP) model for optimizing the solutions. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    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
    “…The proposed algorithm is found to provide better solutions with shorter paths when applied to TSP as compared to swap sequence based PSO. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Optimised multi-robot path planning via smooth trajectory generation

    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
    Save to List
    Saved in:
  12. 12
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…Although useful, the existing algorithms does not provide any comparative data to select an algorithm based on the problem size and difficulty and the use of other neighborhood algorithms (including Great Deluge and Late Acceptance Hill Climbing) has not been sufficiently explored as well. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Token based path allocation approach for mobile robots in sorting centre for achieving high throughput

    Token based path allocation approach for mobile robots in sorting centre for achieving high throughput by Khoo, Zong Zheng

    Published 2024
    “…This project proposes an improved path-finding algorithm that implements token-based path finding while a robot wants to access a grid cell. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  15. 15
    Strategies DACS3 Increasing its Performances

    Strategies DACS3 Increasing its Performances by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

    Published 2009
    “…Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman problem (TSP). …”
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  16. 16
    Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments

    Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

    Published 2013
    “…Navigation experiments using the real Pioneer 3-AT Mobile Robot provide a proof of the concept.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Time series data intelligent clustering algorithm for landslide displacement prediction

    Time series data intelligent clustering algorithm for landslide displacement prediction by Han, Liu, Shang, Tao, Shu, Jisen, Khan Chowdhury, Ahmed Jalal

    Published 2018
    “…Clustering calculation of time series data set is carried out by using hierarchical clustering algorithm according to bending path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman

    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

    Published 2017
    “…ACO algorithm is the best solution because it included the optimization technique to optimized the result based on the data criteria needs. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system

    Sampling-based online motion planning for mobile robots: utilization of Tabu search and adaptive neuro-fuzzy inference system by Khaksar, Weria, Tang, Sai Hong, Mohamed Sahari, Khairul Salleh, Khaksar, Mansoor, Toressen, Jim

    Published 2019
    “…Despite the proven advantages of sampling-based motion planning algorithms, their inability to handle online navigation tasks and providing low-cost solutions make them less efficient in practice. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems

    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
    “…Their performances were compared and the appropriate algorithm for solving TSPs was then identified. The solution quality was evaluated using empirical testing, benchmark solutions and probabilistic analyses. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: