Search Results - (( a construction path algorithm ) OR ( basic optimization method algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  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
    “…Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments

    A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

    Published 2013
    “…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…Meanwhile, the proposed QOJaya algorithm produces better results than the basic Jaya method in terms of solution optimality and convergence speed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Voting algorithms for large scale fault-tolerant systems

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff

    Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

    Published 2011
    “…In the initial stage, the test environments were constructed. Subsequently, both algorithms were applied to the test environments. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Autonomous path planning robot using geographical information

    Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

    Published 2008
    Get full text
    Learning Object
    Save to List
    Saved in:
  9. 9
    Wi-fi fingerprint database construction using Chebyshev wavelet functions

    Wi-fi fingerprint database construction using Chebyshev wavelet functions by Narzullaev, Anvar, Nemadaliev, Azamjon, Selamat, Mohd Hasan, Othman, Mohamed, Sharif, Khaironi Yatim

    Published 2015
    “…Our algorithm requires only a few samples to be collected in a given region, and thus significantly reduces the calibration time. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    An efficient algorithm to improve oil-gas pipelines path

    An efficient algorithm to improve oil-gas pipelines path by Hasan Almaalei, Nabeel Naeem, Mohd Razali, Siti Noor Asyikin, Mohammed Alduais, Nayef Abdulwahab

    Published 2018
    “…Therefore, the aim of this study is to propose a new algorithm to obtain the shortest path connecting oil-gas wells and addressing obstacles that may appear on the path connecting any two wells. …”
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Data Analysis using Particle Swarm Optimization Algorithm

    Data Analysis using Particle Swarm Optimization Algorithm by Tai, Zu Jie

    Published 2015
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  12. 12
    Using Electromagnetism-like algorithm and genetic algorithm to optimize time of task scheduling for dual manipulators

    Using Electromagnetism-like algorithm and genetic algorithm to optimize time of task scheduling for dual manipulators by Abed I.A., Sahari K.S.M., Koh S.P., Tiong S.K., Jagadeesh P.

    Published 2023
    “…A method based on Electromagnetism-Like algorithm (EM) and Genetic Algorithm (GA) is proposed to determine the time-optimal task scheduling for dual robot manipulators. …”
    Conference paper
    Save to List
    Saved in:
  13. 13
    The impact of clustering on the average path length in wireless sensor networks

    The impact of clustering on the average path length in wireless sensor networks by Aziz, A.A., Şekercioğlu, Y. A.

    Published 2015
    “…Clustering algorithms have been widely used in wireless sensor networks for virtual backbone construction. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.]

    Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

    Published 2020
    “…Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    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
    “…This algorithm run in a software called Toolkit for Oracle (TORA) software. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  16. 16
    Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique

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

    Published 2012
    “…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  17. 17
    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques

    Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

    Published 2014
    “…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction

    Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction by Abasi, Ammar Kamal Mousa

    Published 2021
    “…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    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
    “…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi

    Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi by Mohd Rafi, Hafifi

    Published 2012
    “…There is several algorithms use in sequencing of DNA fragment. This paper presents a study on design and analysis of construction and recombination module using IduryWaterman algorithm and fragment assembly application using Verilog. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: