Search Results - (( time evaluation method algorithm ) OR ( using optimization path algorithm ))*
Search alternatives:
- evaluation method »
- optimization path »
- method algorithm »
- time evaluation »
- path algorithm »
-
1
Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques
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 -
2
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…The algorithms are evaluated using 30 benchmark functions of the CEC2014 benchmark suite, and then applied to solve PCB drill path optimization case study. …”
Get full text
Get full text
Thesis -
3
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
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 -
4
Real-Time Optimal Trajectory Correction (ROTC) for autonomous quadrotor / Noorfadzli Abdul Razak
Published 2018“…However, existing algorithm seems too complicated to be applied. Since there is no technique can enable the quadrotor to implement precision navigation application, the research proposed a Real-Time Optimal Trajectory Correction (ROTC) algorithm. …”
Get full text
Get full text
Thesis -
5
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The steps to calculate a shortest path using A • algorithm is shown by using appropriate examples and related figures. …”
Get full text
Get full text
Thesis -
6
Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators
Published 2024“…This study aims to evaluate the effectiveness of two optimization algorithms, artificial bee colony (ABC) and spiral dynamic algorithm (SDA), in controlling the position of a flexible-link manipulator. …”
Get full text
Get full text
Get full text
Article -
7
Transmission path optimization Based on Efficiency Communication System
Published 2022“…In this paper, routing attribute table that is maintained by the nodes, the density and relative distance of node distribution, is used to determine the clustering method. At the same time, the developed algorithm combines the relative position of the cluster and the base station to further improve the routing method of the sub-cluster head, Finally, the algorithm analyzes the influence of different parameters on the transmission path, and use the simulation experiments to evaluate the conclusions.…”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
8
Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed
Published 2017“…For test data generation, the existing search-based techniques (SBTs) have been applied to satisfy only one OCL constraint by time. 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 -
9
Modelling and Optimization of Asymmetric Vehicle Routing Problem Using Particle Swarm Optimization Algorithm
Published 2021“…This paper used a well-known metaheuristic optimization method, Particle Swarm Optimization (PSO) for solving AVRP models. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
10
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2023“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Article -
11
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2023“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Article -
12
-
13
Design, development and performance optimization of a new artificial intelligent controlled multiple-beam optical scanning module
Published 2006“…This research presents a new approach to optimise the performance of a multiple-beam optical scanning system in terms of its marking combinations and speed, using Genetic Algorithm (GA). The problem has been decomposed into two sub problems; task segregation, where the marking tasks need to be segregated and assigned for each scanner head and path planning where the best combinatorial paths for each scanner are determined in order to minimise the total motion of marking time. …”
Get full text
Get full text
Get full text
Article -
14
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 -
15
Modeling and multi-objective optimal sizing of standalone photovoltaic system based on evolutionary algorithms
Published 2020“…The IEM algorithm uses the attraction-repulsion mechanism to change the positions of solutions towards the optimality. …”
Get full text
Get full text
Thesis -
16
-
17
Solving vehicle routing problem by using improved genetic algorithm for optimal solution
Published 2023Article -
18
The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail
Published 2017“…The input data of this project is retrieved from the game’s rule itself and implemented with the proposed algorithm which is A* algorithm. The output of this project is the best solution to achieve the goal using A* algorithm. …”
Get full text
Get full text
Thesis -
19
Route optimization security in mobile IPv6 wireless networks: a test-bed experience
Published 2008“…Route Optimization (RO) is standard in Mobile IPv6 (MIPv6) to route packets between Mobile Node (MN) and Correspondent Node (CN) using shortest possible path. …”
Get full text
Get full text
Conference or Workshop Item -
20
Security enhancement of route optimization in mobile IPv6 networks
Published 2008“…This algorithm is able to detect and prevent the attacker from modifying the data with using an encryption algorithm by cost of little bit increase but tolerable delay. …”
Get full text
Get full text
Get full text
Article
