Search Results - (( simulation optimization method algorithm ) OR ( implementation _ path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Route optimization using shortest path method / Muhamad Faisal Amin Shakri

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    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. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    New algorithm for autonomous dynamic path planning in real-time intelligent robot car

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    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
    “…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    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
    “…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Minimization of machining process sequence based on ant colony algorithm and conventional method

    Minimization of machining process sequence based on ant colony algorithm and conventional method by Abdullah, Haslina, Law, Boon Hui C., Zakaria, Mohamad Shukri

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Simulated Kalman Filter algorithms for solving optimization problems

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

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

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

    Published 2008
    “…This algorithm has been tested and implemented successfully via a dual beam optical scanning system.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    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
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree

    A safe overtaking control scheme for autonomous vehicles using rapid-exploration random tree by Yincong Ma, Kit Guan Lim, Min Keng Tan, Helen Sin Ee Chuo, Lorita Angeline, Kenneth Tze Kin Teo

    Published 2022
    “…The rough path is optimized by applying the cubic spline interpolation method to solve the problem that the path cannot be applied to the actual vehicle driving task. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
    Save to List
    Saved in:
  18. 18
    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)

    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
    Save to List
    Saved in:
  19. 19
    Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method

    Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method by Permal, Navinesshani, Osman, Miszaina, Mohd Ariffin, Azrul, Boopalan, Navaamsini, Ab Kadir, Mohd Zainal Abidin

    Published 2021
    “…This paper presents the results of optimization for substation grounding systems using the Simulated Annealing (SA) algorithm in different soil conditions which conforms to the safety requirements of the grounding system. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Robotic path planning using rapidly-exploring random trees

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…This study concerns the implementation of Rapidly-Exploring Random Trees (RRTs) algorithm for an autonomous robot path planning. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: