Search Results - (( sequence optimization path algorithm ) OR ( using optimization research 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
    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article

    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article by Saliman, Nur Farah Ain

    Published 2012
    “…Then, the structural modelling is being use in this project in order to trace back by scanning the Smith-Waterman matrix calculation and find the optimal path. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Path optimization using genetic algorithm evolution

    Path optimization using genetic algorithm evolution by Low C.Y., Chong K.H., Salleh K., Johnny K.S.P.

    Published 2023
    “…In this paper, genetic algorithm (GA) has been proposed to optimize the traveling sequence making the movement more efficient and economic as the total travel length is shortened. �2010 IEEE.…”
    Conference paper
    Save to List
    Saved in:
  4. 4
    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
    “…Also, this research involves in developing a machine-learning system and program via genetic algorithm that is capable of performing independent learning capability and optimization for scanning sequence using novel GA operators. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Most metaheuristic algorithms are designed for continuous optimization problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  6. 6
    Network reconfiguration and DG sizing incorporating optimal switching sequence for system improvement / Ola Subhi Waheed Badran

    Network reconfiguration and DG sizing incorporating optimal switching sequence for system improvement / Ola Subhi Waheed Badran by Ola Subhi , Waheed Badran

    Published 2018
    “…However, power losses during the switching operations from the initial state to the final state of configuration was never studied. This research presents the optimal switching sequence path to minimize power losses during the network switching operation. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks

    Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks by Ghathwan, Khalil Ibrahim

    Published 2016
    “…The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…The objectives of this research are to develop an algorithm for integrated scheduling and conflict-free routing of jobs and AGVs in FMS environment using a hybrid genetic algorithm, ensure the algorithm validity and improvement on the performance of the developed algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…There were also attempts to hybridize SKF with other famous algorithms such as Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), and Sine Cosine Algorithm (SCA) to improve its performance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    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:
  11. 11
    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    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:
  13. 13
    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
    “…The key innovation is to implement DNA sequence assembly algorithms on ASIC to make it a synthesisable IP block. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    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
    “…These results show that the Bees Algorithm can be an alternative approach to find the optimal drilling sequence.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  15. 15
    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method

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

    Published 2018
    “…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:
  16. 16
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  18. 18
    Path optimization using genetic algorithm in laser scanning system

    Path optimization using genetic algorithm in laser scanning system by Chen, Chai Phing, Koh, Johnny Siaw Paw, Aris, Ishak, Fong, Albert Yu Chooi, Tiong, Sieh Kiong

    Published 2008
    “…In this paper, the genetic algorithm (GA) has been proposed to optimize the scanning sequence, thus shortening the required laser scanning path. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Path optimization using genetic algorithm in laser scanning system

    Path optimization using genetic algorithm in laser scanning system by Chen C.P., Koh S.P., Aris I.B., Albert F.Y.C., Tiong S.K.

    Published 2023
    Subjects:
    Conference paper
    Save to List
    Saved in:
  20. 20
    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
    “…Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: