Search Results - (( using object based algorithm ) OR ( simulation optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    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
    “…back system for Smith-Waterman Algorithm using Structural Modelling Technique. The objectives for this paper are to optimize the best trace back scanning performance and also to design the simple architecture in order to reduce the runtime. …”
    Get full text
    Get full text
    Article
    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
    “…These algorithms generate paths using random numbers and perform efficiently in guiding the robot in known environments. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    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
    “…This thesis presents a new approach to optimize the performance of a dual beam optical scanning system in terms of its scanning combinations and speed, using Genetic Algorithm (GA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Providing wireless coverage in massively crowded events using UAVs

    Providing wireless coverage in massively crowded events using UAVs by Sawalmeh A., Othman N.S., Shakhatreh H., Khreishah A.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  7. 7
    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…The objective of this project is to design the DNA sequence generator modules using the Eulerian Path Algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    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
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Enhancement of collision avoidance technique in dynamic crowd simulations using visual cues and vision based algorithm

    Enhancement of collision avoidance technique in dynamic crowd simulations using visual cues and vision based algorithm by Iznora Aini Zolkifly

    Published 2022
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…The main objectives of this project is to design the DNA sequence generator module using the Eulerian Path algorithm. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  12. 12
    Hybrid optimal path traceback system development for optimization DNA sequences alignment

    Hybrid optimal path traceback system development for optimization DNA sequences alignment by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…The objective of this paper is to study several optimization techniques and determine the best optimization technique for optimizing the optimal path trace back system. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  13. 13
    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article

    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…The objective of this paper is to study several optimization techniques and determine the best optimization technique for optimizing the optimal path trace back system. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…The whole constraint analyzer and the fitness function were combined with four SBTs (genetic algorithm, evolutionary algorithm, simulating annealing, and quantum genetic algorithm). …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    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
    “…As a multi-agent algorithm, every agent in the population acts as a Kalman filter by using a standard Kalman filter framework, which includes a simulated measurement process and a best-so-far solution as a reference. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network

    Adaptive manet OLSR routing protocol for optimal route selection in high dynamic network by Al-Kharasani, Nori Mohammed Abdulkarem

    Published 2020
    “…The proposed Quality of Path QoP metric is incorporated into the modified relay selection algorithm, which improves the efficiency of relay selection mechanism to find optimal path with high link quality. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Efficient and scalable ant colony optimization based WSN routing protocol for IoT

    Efficient and scalable ant colony optimization based WSN routing protocol for IoT by Sharmin, Afsah, Anwar, Farhat, Motakabber, S. M. A.

    Published 2020
    “…The proposed routing algorithm is simulated using MATLAB for performance evaluations. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    Design and modelling of an autonomous robotic airship with soft computing control

    Design and modelling of an autonomous robotic airship with soft computing control by Wong, Wei Kitt

    Published 2012
    “…Along with the prototype airship, a path planner was also proposed for the UAV for the purpose of obstacle avoidance and path optimization using genetic algorithm to minimize on the distance travelled and to generate the shortest path to cover the specified waypoints. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    “…Results: The analysis of computational results showed that the modified RTS algorithm provided a better solution quality in terms of minimizing the objective function of TSPs, while the SA algorithm was useful for obtaining instant solutions for TSPs with a large number of cities. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: