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

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    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:
  3. 3
    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:
  4. 4
    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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    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:
  8. 8
    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:
  9. 9
    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:
  10. 10
    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
    “…The research anticipates significant contributions to algorithmic solutions, utilizing Python-based experiments aligned with Software Engineering practice, providing practical insights for routing optimization in automated warehouses. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  11. 11
    Routing problem in rectangular mesh network using shortest path based Greedy method

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Controller placement problem in the optimization of 5G based SDN and NFV architecture

    Controller placement problem in the optimization of 5G based SDN and NFV architecture by Ibrahim, Abeer Abdalla Zakaria

    Published 2021
    “…If the control plane fails to improve system resilience quality, A reliable RAMCP is formulated as an optimal solution for fault tolerance. Furthermore, the approach is extended with a Particle Swarm Algorithm (PSO) and presented as a hybrid RASCP to validate the optimal location and number of controllers. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm

    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

    Published 2016
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Soft computing approach for solving elevator scheduling problem

    Soft computing approach for solving elevator scheduling problem by Norzatul Hajar, Abd Majid

    Published 2010
    “…In order to manipulate the scheduling problem solution, designed and developed simulation software for the optimization of elevator scheduling problem is introduced and presented by using soft computing methodology.…”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  15. 15
    Workload performance evaluation of large spatial database for DSS based disaster management

    Workload performance evaluation of large spatial database for DSS based disaster management by Rohman, Muhammad Syaifur

    Published 2017
    “…Data recorded in the shortest path analysis process reveals that the evaluation and the prediction on workload performance of shortest path analysis using Dijkstra algorithm has been well implemented. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Electricity distribution network for low and medium voltages based on evolutionary approach optimization

    Electricity distribution network for low and medium voltages based on evolutionary approach optimization by Hasan, Ihsan Jabbar

    Published 2015
    “…This thesis proposes an algorithm to find the optimum distribution substation placement and sizing by utilizing the PSO algorithm and optimum feeder routing using modified Minimum Spanning Tree (MST). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    A Compromise Programming to Task Assignment Problem in Software Development Project

    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
    Save to List
    Saved in:
  19. 19
    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…In this work, the main focus is to seek optimal solutions for DNA fragment assembly problems in terms of assembly accuracy. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    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, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2018
    “…PSO is also compared with another algorithm like Whale Optimization Algorithm, Ant Lion Optimizer, Dragonfly Algorithm, Grasshopper Optimization Algorithm, Moth-flame Optimization and Sine Cosine Algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:

Search Tools: