Search Results - (( using optimization path algorithm ) OR ( software optimization problems algorithm ))

Search alternatives:

Refine Results
  1. 1
    Modeling and optimization of multi-holes drilling path using Particle Swarm Optimization

    Modeling and optimization of multi-holes drilling path using Particle Swarm Optimization by Ab Rashid, Mohd Fadzil Faisae, Nik Mohamed, Nik Mohd Zuki, Romlay, Fadhlur Rahman Mohd, Razali, Akhtar Razul, Asmizam, Mokhtar

    Published 2018
    “…Later the problem is optimized using Particle Swarm Optimization (PSO) and compared with other algorithms including the new metaheuristics algorithms. …”
    Get full text
    Get full text
    Research Report
    Save to List
    Saved in:
  2. 2
    Particle swarm optimization (PSO) for CNC route problem

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

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  3. 3
    Optimization of drilling path using the bees algorithm

    Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

    Published 2021
    “…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Path Optimization For Cooperative Multi-Head 3d Printing

    Path Optimization For Cooperative Multi-Head 3d Printing by Cheong, Kah Jun

    Published 2020
    “…Hence, finding the best path for the nozzle is termed as the Layer Path Optimization Problem (LPOP). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  5. 5
    Simulation of identifying shortest path walkway in library by using ant colony optimization

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…The system is used to be error free and the algorithm can effectively solve the shortest path problem.…”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  6. 6
    Application of the Bees Algorithm to find optimal drill path sequence

    Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

    Published 2024
    “…The Bees Algorithm was run using R Software. The results found are compared with the results of other algorithms in terms of the drill path length and machining time. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  7. 7
    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Path planning algorithm for a car like robot based on MILP method

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This approach is that the path optimization can be easily solved using the CPLEX optimization software with AMPL interface / MATLAB. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    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
    “…Therefore, in this research, will be use Ant Colony Optimization (ACO) algorithm as an optimize technique that provide a shortest path of defining a successor that is their highest value of criteria. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Ant colony optimization (ACO) algorithm for CNC route problem

    Ant colony optimization (ACO) algorithm for CNC route problem by Wan Nur Farhanah , Wan Zakaria

    Published 2012
    “…This project is about to develop a software which applying ACO algorithm in order to calculate the shortest path available that can reduce the time taken to drill the entire hole of PCB. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path

    The performance effect due to varying network topologies on a software-defined network employing the k-shortest path by Linsheng, R., Derahman, M. N., Kadir, M. F. A., Mohamed, M. A., Kamarudin, S.

    Published 2022
    “…K-shortest paths algorithm discovers a set of paths ordered in the most optimal, optimal, and suboptimal, has a very wide application is integrated into SDN controller to handle routing functionality. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem

    A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

    Published 2021
    “…The comparative algorithms in this study employ different techniques in their search for solutions to ATSP: the African Buffalo Optimization employs the modified Karp–Steele mechanism, Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO) employs the path construction with patching technique, Cooperative Genetic Ant System uses natural selection and ordering; Randomized Insertion Algorithm uses the random insertion approach, and the Improved Extremal Optimization uses the grid search strategy. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    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
    “…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm

    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

    Published 2016
    “…The ST itself is a conceptual framework that examines, reframes the problem and finds the solution. Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Simulation of identifying shortest path walkway using particle swarm optimization (PSO)

    Simulation of identifying shortest path walkway using particle swarm optimization (PSO) by Kae Shin, Yong

    Published 2012
    “…The purpose of this research is to present the development of the system of Simulation of Identifying Shortest Path Walkway using Particle Swarm Optimization(PSO). …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  17. 17
    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning.

    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning. by Rajendran, Piraviendran, Othman, Muhaini

    Published 2024
    “…Focusing on routing optimization, the study evaluates Ant-Colony Optimization (ACO) and Genetic Algorithm (GA) in Mobile Robot Planning. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    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
    “…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail

    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail by Ismail, Zafhira

    Published 2017
    “…The input data of this project is retrieved from the game’s rule itself and implemented with the proposed algorithm which is A* algorithm. The output of this project is the best solution to achieve the goal using A* algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: