Search Results - (( simulation optimization _ algorithm ) OR ( problem implementation using algorithm ))

Refine Results
  1. 1

    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
  2. 2

    FPGA implementation of metaheuristic optimization algorithm by Nurul Hazlina, Noordin, Phuah, Soon Eu, Zuwairie, Ibrahim

    Published 2023
    “…Metaheuristic algorithms are gaining popularity amongst researchers due to their ability to solve nonlinear optimization problems as well as the ability to be adapted to solve a variety of problems. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Simulation of identifying shortest path walkway in library by using ant colony optimization by Chui Teng, Chan

    Published 2012
    “…The system is used to be error free and the algorithm can effectively solve the shortest path problem.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  4. 4

    Fpga Implementation Of Metaheuristic Optimization Algorithm by Phuah, Soon Eu

    Published 2022
    “…Metaheuristic algorithms are gaining popularity amongst researchers due to their ability to solve nonlinear optimization problems as well as the ability to be adapted to solve a variety of problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  5. 5

    Optimal placement and sizing of FACTS devices for optimal power flow using metaheuristic optimizers by Mohd Herwan, Sulaiman, Zuriani, Mustaffa

    Published 2022
    “…Thus, seven metaheuristic algorithms: Barnacles Mating Optimizer (BMO), Marine Predators Algorithm (MPA), Moth–Flame Optimization (MFO), Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Teaching–Learning-Based Optimization (TLBO) and Heap-Based Optimizer (HBO) are used to solve two objective functions: power loss and cost minimizations. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    Studying the Effect of Training Levenberg Marquardt Neural Network by Using Hybrid Meta-Heuristic Algorithms by Abubakar, A., Khan, A., Nawi, N.M., Rehman, M.Z., Teh, Y.W., Chiroma, H., Herawan, T.

    Published 2016
    “…The performances of the proposed Accelerated Particle Swarm Optimization Levenberg Marquardt (APSO-LM) algorithms compared by means of simulations on 7-Bit Parity and six UCI benchmark classification datasets. …”
    Get full text
    Get full text
    Article
  7. 7

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
    Get full text
    Get full text
    Thesis
  8. 8

    The design and applications of the african buffalo algorithm for general optimization problems by Odili, Julius Beneoluchi

    Published 2017
    “…Some of the successfully designed stochastic algorithms include Simulated Annealing, Genetic Algorithm, Ant Colony Optimization, Particle Swarm Optimization, Bee Colony Optimization, Artificial Bee Colony Optimization, Firefly Optimization etc. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Simulated annealing for solving economic dispatch problem / Wan Khairulizuan Wan Ismail by Wan Ismail, Wan Khairulizuan

    Published 2010
    “…To evaluate the proposed method, a six unit generating power system was tested in order to obtain the minimum cost of generator. SA algorithm used in this study was implemented by using MATLAB 7.8.0 (R2009a). …”
    Get full text
    Get full text
    Thesis
  10. 10

    An improved particle swarm optimization based on lévy flight and simulated annealing for high dimensional optimization problem by Basath, Samar Salem, Ismail, Amelia Ritahani, Alwan, Ali Amer, Amir Hussin, Amir 'Aatieff

    Published 2022
    “…The proposed algorithm uses two strategies to address high-dimensional problems: hybrid PSO to define the global search area and fast simulated annealing to refine the visited search region. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Studying the effect of training Levenberg Marquardt neural network by using hybrid meta-heuristic algorithms by Abubakar, Adamu, Khan, Abdullah, Nawi, Nazri Mohd, Rehman, M. Z., Teh , Ying Wah, Chiroma , Haruna, Herawan, Tutut

    Published 2016
    “…The performances of the proposed Accelerated Particle Swarm Optimization Levenberg Marquardt (APSO_LM) algorithms compared by means of simulations on 7-Bit Parity and six UCI benchmark classification datasets. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    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
  13. 13

    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
  14. 14

    Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

    Published 2018
    “…Based on literature, stereo algorithm is already being implemented to solve the distance measurement problem. …”
    Get full text
    Get full text
    Thesis
  15. 15

    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
  16. 16

    1D Multigrid Solver For Finite Element Method by Azhar, Mohamad Amiruddin

    Published 2022
    “…The new algorithm also has been tested using time simulation. …”
    Get full text
    Get full text
    Monograph
  17. 17

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

    Published 2020
    “…Input parameters, the number of fireflies, and the number of function evaluations were determined before the implementation of the firefly algorithm to solve formulated problems. …”
    Get full text
    Get full text
    Article
  20. 20

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph