Search Results - (( simulation optimization method algorithm ) OR ( _ implementation method algorithm ))

Refine Results
  1. 1

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

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  3. 3

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  4. 4

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  5. 5

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  6. 6

    Process Planning Optimization In Reconfigurable Manufacturing Systems by Musharavati, Farayi

    Published 2008
    “…The five (5) AADTs include; a variant of the simulated annealing algorithm that implements heuristic knowledge at critical decision points, two (2) cooperative search schemes based on a “loose hybridization” of the Boltzmann Machine algorithm with (i) simulated annealing, and (ii) genetic algorithm search techniques, and two (2) modified genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Minimization of machining process sequence based on ant colony algorithm and conventional method by Abdullah, Haslina, Law, Boon Hui C., Zakaria, Mohamad Shukri

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  9. 9

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  10. 10

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…Based on the simulation, the Ant Colony algorithm method is, on average, 10.8% better than conventional methods in reducing machining time. …”
    Get full text
    Get full text
    Article
  11. 11

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

    Published 2022
    “…Usually, the mathematical problem can be solved using only one of those two methods. A sample of such code written in MATLAB programming language was found in the GitHub repository, where the implemented algorithms are far from optimal. …”
    Get full text
    Get full text
    Monograph
  12. 12

    Design optimization of valve timing at various engine speeds using Multi-Objective Genetic Algorithm (MOGA) by Mohiuddin, A. K. M., Ashour, Ahmed Aly Ibrahim Shaaban, Yap, Haw Shin

    Published 2008
    “…Majority of the research works in this project were in CAE software environment and method to implement optimization to 1D engine simulation. …”
    Get full text
    Get full text
    Proceeding Paper
  13. 13

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

    Published 2020
    “…In this paper, a firefly algorithm based hybrid algorithm through retaining global convergence of firefly algorithm and ability to generate connected topologies of optimality criteria (OC) method is proposed as an alternative method to solve stress-based topology optimization problems. …”
    Get full text
    Get full text
    Article
  14. 14

    A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network by Gumaida, Bassam, Abubakar, Adamu

    Published 2024
    “…This novel optimization method is a direct search approach and is usually directed to solve nonlinear optimization problems that may not have well-known derivatives, and it is called the Nelder-mead Method (NMM). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Asynchronous simulated kalman filter optimization algorithm by Zuwairie, Ibrahim, Nor Azlina, Ab. Aziz, Nor Hidayati, Abd Aziz, Tasiransurini, Ab Rahman

    Published 2018
    “…Simulated Kalman filter (SKF) is an optimization algorithm which is inspired by Kalman filtering method. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    A New Hybrid Image Encryption Technique Using Lorenz Chaotic System and Simulated Kalman Filter (SKF) Algorithm by Nurnajmin Qasrina Ann, ., Pebrianti, Dwi, Mohammad Fadhil, Abas, Bayuaji, Luhur

    Published 2022
    “…Nowadays, encryption is one of the most popular and effective security methods used by company and organizations. A new hybrid technique, Lorenz chaotic system and an optimization algorithm, Simulated Kalman Filter (SKF) had been proposed to solve image encryption problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Determining optimal location of static VAR compensator by means of genetic algorithm by Karami, Mahdi, Mariun, Norman, Ab Kadir, Mohd Zainal Abidin

    Published 2011
    “…The purpose of this paper is to study a practical and accurate heuristic method known as genetic algorithm (GA) which is used to find the optimal location of Static Var Compensator (SVC) and its appropriate size and setting. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Optimization of PID parameters for hydraulic positioning system utilizing variable weight Grey-Taguchi and particle swarm optimization by Nur Iffah, Mohamed Azmi

    Published 2014
    “…Particle swarm optimization algorithm (PSO) is one of the artificial intelligence methods. …”
    Get full text
    Get full text
    Thesis
  19. 19

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