Search Results - (( using function path algorithm ) OR ( sequence optimization research algorithm ))

Search alternatives:

Refine Results
  1. 1
    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
    “…Research limitations – The experiment of this research only uses 15 types of TSP function which are TSP functions that are evaluated using Euclidean distance. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    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:
  4. 4
    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:
  5. 5
    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:
  6. 6
    Assembly sequence optimization using the bees algorithm

    Assembly sequence optimization using the bees algorithm by Kamaruddin, Shafie, Azmi, Nabilah, Sukindar, Nor Aiman

    Published 2022
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  7. 7
    A-star (A*) algorithm implementation for robotics path planning navigation

    A-star (A*) algorithm implementation for robotics path planning navigation by Emirul Ridzwan, Nor Azmi

    Published 2018
    “…This thesis is about the implementation of Astar (A*) algorithm as path planning algorithm used in robotics navigation. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  8. 8
    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems

    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…It is anticipated that this low-discrepancy sequence comparative simulation survey would be helpful for studying the metaheuristic algorithm in detail for the researcher.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm

    Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm by Krishnan P.S., Paw J.K.S., Kiong T.S.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  11. 11
    Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group

    Hybrid path planning for indoor robot with Laplacian Behaviour-based control via four point-explicit group by Azali Saudi, Jumat Sulaiman

    Published 2014
    “…Consequently, the gradient of the potential functions would be used by the searching algorithm to generate path from starting to goal location. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Optimization of Assembly Sequence Planning Using Soft Computing Approaches: A Review

    Optimization of Assembly Sequence Planning Using Soft Computing Approaches: A Review by Muhammad Arif, Abdullah, M. F. F., Ab Rashid, Z., Ghazalli

    Published 2019
    “…This review focused on ASP modeling approach, optimization algorithms and optimization objectives. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    False path identification algorithm framework for nonseparable controller-data path circuits

    False path identification algorithm framework for nonseparable controller-data path circuits by Shaheen, Ateeq U. R., Hussin, Fawnizu Azmadi, Hamid, Nor Hisham

    Published 2016
    “…This paper proposes an algorithm frame-work to deal with these false paths through identification for DFT test. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control

    Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control by Srazhidinov, Radik

    Published 2016
    “…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    False path identification algorithm framework for nonseparable controller-data path circuits

    False path identification algorithm framework for nonseparable controller-data path circuits by Shaheen, A.-U.-R., Hussin, F.A., Hamid, N.H.

    Published 2017
    “…This paper proposes an algorithm framework to deal with these false paths through identification for DFT test. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries

    Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries by Fadzli, S.A., Abdulkadir, S.I., Makhtar, M., Jamal, A.A.

    Published 2016
    “…The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Development of Genetic Algorithm Procedure for Sequencing Problem in Mixed-Model Assembly Lines

    Development of Genetic Algorithm Procedure for Sequencing Problem in Mixed-Model Assembly Lines by Noroziroshan, Alireza

    Published 2009
    “…The problem under study contains set of mixed-model assembly line where finding the optimal job sequence based on different production strategies is the objective of this research. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Indoor path planning using harmonic functions via half-sweep arithmetic mean method

    Indoor path planning using harmonic functions via half-sweep arithmetic mean method by Azali Saudi, Jumat Sulaiman

    Published 2019
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Potential of data minimization techniques approach in improving DNA sequences alignment and comparison / Syed Abdul Mutalib Al Junid … [et al.]

    Potential of data minimization techniques approach in improving DNA sequences alignment and comparison / Syed Abdul Mutalib Al Junid … [et al.] by Al Junid, Syed Abdul Mutalib, Haron, Muhammad Adib, Abd Majid, Zulkifli, Othman, Zulkifli

    Published 2012
    “…Specifically, the research objectives are i) to study various DNA sequences alignment algorithms characteristics, architectures and techniques such as scoring functions, optimal alignment and gap; and ii) to investigate the potential of data minimization approach in minimizing the size of data towards discovering the region of similarity in DNA sequences alignment and comparison and iii) to analyze the optimal sequences alignment properties for molecular biology and bioinformatics application. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:

Search Tools: