Search Results - (( simulation optimization method algorithm ) OR ( software optimization path algorithm ))

Refine Results
  1. 1

    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
  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, 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
  6. 6

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

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

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

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

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

    Published 2017
    “…In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    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. This project is designed based on speed optimization. …”
    Get full text
    Get full text
    Article
  12. 12

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

    Soft computing approach for solving elevator scheduling problem by Norzatul Hajar, Abd Majid

    Published 2010
    “…In order to manipulate the scheduling problem solution, designed and developed simulation software for the optimization of elevator scheduling problem is introduced and presented by using soft computing methodology.…”
    Get full text
    Get full text
    Get full text
    Final Year Project Report / IMRAD
  14. 14
  15. 15

    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

    Published 2017
    “…The method proposed is to design DNA assembly algorithms in Verilog HDL and implemented it in ASIC design flow. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Modeling and optimization of multi-holes drilling path using Particle Swarm Optimization by Ab Rashid, Mohd Fadzil Faisae, Nik Mohamed, Nik Mohd Zuki, Romlay, Fadhlur Rahman Mohd, Razali, Akhtar Razul, Asmizam, Mokhtar

    Published 2018
    “…Then a machining experiment has been conducted to validate the optimization results. The optimization results clearly indicated that the PSO algorithm outperformed all comparison algorithms for the drilling tool path problem. …”
    Get full text
    Get full text
    Research Report
  17. 17

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…This approach is that the path optimization can be easily solved using the CPLEX optimization software with AMPL interface / MATLAB. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

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