Search Results - (( using optimization path algorithm ) OR ( software simulation based algorithm ))
Search alternatives:
- software simulation »
- optimization path »
- simulation based »
- path algorithm »
-
1
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
2
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
3
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
4
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
5
Minimization of machining process sequence based on ant colony algorithm and conventional method
Published 2023“…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Get full text
Article -
6
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
7
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
8
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
Get full text
Get full text
Article -
9
Simulation of identifying shortest path walkway in library by using ant colony optimization
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 -
10
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…When compared to the Ant Colony Optimization algorithm, Simulated Annealing and Genetic Algorithm, the results obtained from African Buffalo Optimization show that the algorithm works well and can be extended to solving problems like: path planning, scheduling, vehicle routing in addition to other constraint-driven problems.…”
Get full text
Get full text
Get full text
Article -
11
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
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 -
12
Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri
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 -
13
Test case generation from state machine with OCL constraints using search-based techniques / 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 -
14
Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri
Published 2013“…The main objectives of this project is to design the DNA sequence generator module using the Eulerian Path algorithm. This project is designed based on speed optimization. …”
Get full text
Get full text
Student Project -
15
Optimization And Execution Of Multiple Holes-Drilling Operations Based On STEP-NC
Published 2021“…The newly developed system combines between open CNC control system and ant colony optimization (ACO) algorithm by using LabVIEW software. …”
Get full text
Get full text
Get full text
Get full text
Article -
16
A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS)
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 -
17
Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan
Published 2017“…Depending on the technology used, it can only read small pieces of base between 20 to 1000 bases. …”
Get full text
Get full text
Thesis -
18
Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib
Published 2019“…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
Get full text
Get full text
Get full text
Thesis -
19
Optimization of multi-holes drilling path using particle swarm optimization
Published 2018“…PSO is also compared with another algorithm like Whale Optimization Algorithm, Ant Lion Optimizer, Dragonfly Algorithm, Grasshopper Optimization Algorithm, Moth-flame Optimization and Sine Cosine Algorithm. …”
Get full text
Get full text
Get full text
Get full text
Book Chapter -
20
