Search Results - (( optimal solution using algorithm ) OR ( simulation optimization path algorithm ))

Search alternatives:

Refine Results
  1. 1
    Simulated Kalman Filter algorithms for solving optimization problems

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    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
    “…The aim is to solve the above-mentioned problems via an optimization mechanism based upon the combination between runtime path prediction method and heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    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:
  6. 6
    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:
  7. 7
    Single-solution simulated Kalman Filter algorithm for routing in printed circuit board drilling process

    Single-solution simulated Kalman Filter algorithm for routing in printed circuit board drilling process by Nor Hidayati, Abdul Aziz, Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Zulkifli, Md. Yusof, Mohd Saberi, Mohamad

    Published 2018
    “…It uses only a single agent to solve optimization process by finding the estimate of the optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  8. 8
    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:
  9. 9
    Optimised multi-robot path planning via smooth trajectory generation

    Optimised multi-robot path planning via smooth trajectory generation by Loke, Zhi Yu

    Published 2024
    “…A MPSO algorithm, without path smoothening, is used for comparison. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  10. 10
    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:
  11. 11
    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
    “…This increases the complexity to route later nets and makes routing longer than optimal, or sometimes impossible to complete. The solution is further refined by re-routing all nets in different orders using simulated annealing method. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A Kalman Filter Approach to PCB Drill Path Optimization Problem

    A Kalman Filter Approach to PCB Drill Path Optimization Problem by Abdul Aziz, Nor Hidayati, Zuwairie, Ibrahim, Ab. Aziz, Nor Azlina, Saifudin, Razali, Abas, Khairul Hamimah, Mohamad, Mohd Saberi

    Published 2017
    “…Due to the exponential increase in the number of possible solutions when the number of holes to be drilled increase, the metaheuristic optimization algorithm seems to be a good choice in solving this type of optimization problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    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
    “…Simulated Kalman Filter (SKF) solves optimization problems by finding the estimate of the optimum solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    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:
  15. 15
    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:
  16. 16
    An adaptive relay selection scheme for enhancing network stability in VANETs

    An adaptive relay selection scheme for enhancing network stability in VANETs by Al-Kharasani, Ameen Mohammed Abdulkarem, Ahmad Zukarnain, Zuriati, Subramaniam, Shamala, Mohd Hanapi, Zurina

    Published 2020
    “…In this paper, we propose a new improvement to the mechanism of the Optimized Link State Routing Protocol(OLSR) protocol, named Cluster-based Adept Cooperative Algorithm (CACA), where each vehicle estimate a reliable low-overhead path using the cluster-based QoS algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method

    Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method by Permal, Navinesshani, Osman, Miszaina, Mohd Ariffin, Azrul, Boopalan, Navaamsini, Ab Kadir, Mohd Zainal Abidin

    Published 2021
    “…This paper presents the results of optimization for substation grounding systems using the Simulated Annealing (SA) algorithm in different soil conditions which conforms to the safety requirements of the grounding system. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method

    Optimization of substation grounding grid design for horizontal and vertical multilayer and uniform soil condition using Simulated Annealing method by Permal N., Osman M., Ariffin A.M., Boopalan N., Abidin Ab Kadir M.Z.

    Published 2023
    Article
    Save to List
    Saved in:
  20. 20
    Designated Path Routing Algorithm For Dense Wireless Sensor Network

    Designated Path Routing Algorithm For Dense Wireless Sensor Network by Subramaniam, Siva Kumar, Ikhwan Lee, Mohamad Yusry Lee, Feroz, Farah Shahnaz, Azman, Amierul Syazrul Azril

    Published 2021
    “…The results have shown better network performance and energy consumption can be achieved using the proposed algorithm when compared to the others…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: