Search Results - (( simulation optimization methods algorithm ) OR ( peer evaluation path algorithm ))
Search alternatives:
- optimization methods »
- methods algorithm »
- peer evaluation »
- evaluation path »
- 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
An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town
Published 2005“…Both algorithms are compared. Simulation is used as a method in this study. …”
Get full text
Get full text
Get full text
Thesis -
3
Simulated Kalman Filter algorithms for solving optimization problems
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 -
4
Simulation of shortest path using a-star algorithm / 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 -
5
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 -
6
Three-dimensional coverage control for multi-unmanned aerial vehicle
Published 2024“…This project aims to model and simulate a group of quadrotors for area coverage in 3D space with the objectives of reviewing existing MUAV coverage methods, algorithm development, and assessing computational load, convergence, path length, coverage quality, and scalability in both Two-Dimensional (2D) and 3D spaces. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
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
Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Published 2016“…The modified RTS algorithm also performed better compared to the existing heuristic methods. …”
Get full text
Get full text
Get full text
Article -
9
-
10
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 -
11
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 -
12
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 -
13
Comprehensive review of drones collision avoidance schemes: challenges and open issues
Published 2024“…We explore collision avoidance methods for UAVs from various perspectives, categorizing them into four main groups: obstacle detection and avoidance, collision avoidance algorithms, drone swarm, and path optimization. …”
Get full text
Get full text
Get full text
Article -
14
SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing
Published 2019“…This work uses iterative smoothing algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Thesis -
15
Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network
Published 2018“…Coverage and energy efficiency metrics are two fundamental issues for almost all types of application in wireless sensor network (WSNs).Coverage reflects how well an area is monitored by sensor nodes and in energy efficient networks where less energy is consumed to provide the same level of services.These twin specifics are presented to evaluate the performance of a wireless sensor network.Due to its simplicity and ease of analysis,full coverage is widely implemented in many theoretical studies.However,sometimes full coverage is not the best way to represent some real-world application due to its strong restrictions and its deterministic characteristics.In this thesis,Modified Harmony Search algorithm (MHS) is proposed to achieve a sensor node deployment such that the covered area is optimal and data transfer has low energy consumption.Through computer simulations, experimental results verified that the proposed method improved the coverage of area in compare to some related methods.Based on the result obtain from every experiments,coverage area percentage performance is affected by the number of hotspots.This is shown by Harmony Search (HS) based method where the coverage area percentage increases as the number of hotspot increase. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
16
Enhancing Autonomous Guided Vehicles with Red-Black TOR Iterative Method
Published 2023“…By carefully choosing the optimal parameter values, the suggested B-MTOR improved the computational execution of the algorithm. …”
Get full text
Get full text
Get full text
Get full text
Article -
17
Node Participation Evaluation Scheme Based on Link Quality for Energy Efficient Routing in Ad-hoc Networks
Published 2016“…Between, intermediate nodes with energy level below predefined threshold were not chosen as forwarding node in order to prevent early route breakage and retransmission. Computer simulations using NS-2 simulator are performed with comparison to the conventional methods and the effectiveness of the proposed methods is quantitatively validated. …”
Get full text
Get full text
Thesis -
18
Energy efficient path reconstruction in wireless sensor network using iPath
Published 2019“…This work uses iterative boosting algorithm to find an alternative path with less distance and energy consumption. …”
Get full text
Get full text
Get full text
Article -
19
Development of a State-Space Observer for Active Noise Control Systems
Published 2009“…This observer is employed to observe and monitor the pressure modes along the propagation path through simulating it in an offline structure i.e. without controller, or to observe the modes at the cancellation path through simulating the SSLMS in an on-line structure i.e. while the controller is converging. …”
Get full text
Get full text
Thesis -
20
Design of A unmanned aerial vehicles assisted search and rescue collaboration architecture for emergency communication systems / Abdu Ahmed Saif Ahmed
Published 2022“…Simulation results indicate that the proposed algorithms can significantly reduce the outage probability and energy consumption. …”
Get full text
Get full text
Get full text
Thesis
