Search Results - (( using starter based algorithm ) OR ( evolution optimization path algorithm ))
Search alternatives:
- evolution optimization »
- optimization path »
- path algorithm »
- using starter »
- starter based »
-
1
The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment
Published 2016“…Significant research has been conducted on Unmanned Aerial Vehicle (UAV) path planning using evolutionary algorithms, such as Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Differential Evolution (DE), and Biogeographic-Based Optimization (BBO). …”
Get full text
Get full text
Thesis -
2
Development of an improved GWO algorithm for solving optimal paths in complex vertical farms with multi-robot multi-tasking
Published 2024“…The EPDE-GWO algorithm is compared with Genetic Algorithm (GA), Simulated Annealing (SA), Dung Beetle Optimizer (DBO), and Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Get full text
Article -
3
-
4
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…Roadways and telephone systems are the examples of them. Genetic Algorithms (GA), pioneered by John Holland, applies the principle of evolution found in nature to the problem of finding an optimal solution. …”
Get full text
Get full text
Thesis -
5
Differential evolution optimization for constrained routing in Wireless Mesh Networks
Published 2014“…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
Get full text
Get full text
Get full text
Proceeding Paper -
6
Starter Set Generation Based on Factorial Numbers for Half Wing of Butterfly Representation
Published 2021“…Previously starter sets are generated by using their permutation under exchange-based and cycling based. …”
Get full text
Get full text
Get full text
Article -
7
Comparison between starter sets generation method for listing all permutations
Published 2013“…distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
Get full text
Get full text
Conference or Workshop Item -
8
New algorithm for listing all permutations
Published 2010“…In this paper, a new algorithm for listing down all permutations for n elements is developed based on distinct starter sets. …”
Get full text
Get full text
Get full text
Article -
9
Literature Review of Optimization Techniques for Chatter Suppression In Machining
Published 2011“…Various algorithms can be applied in the optimization of machining problems; however, Differential Evolution is the most appropriate for use in chatter suppression, being less time consuming, locally optimal, and more robust than both Genetic Algorithms, despite their wide applications, and Sequential Quadratic Programming, which is a famous conventional algorithm.…”
Get full text
Get full text
Get full text
Article -
10
Three phase induction motor coupled to DC motor in hybrid electric vehicle application
Published 2011“…An advanced electric drive controller for a high power starter-generator subsystem based on a series DC machine is presented. …”
Get full text
Get full text
Thesis -
11
Comparative analysis of spiral dynamic algorithm and artificial bee colony optimization for position control of flexible link manipulators
Published 2024“…By integrating the ABC algorithm into the manipulator's control system, the goal is to enhance its ability to plan paths and optimize trajectories. …”
Get full text
Get full text
Get full text
Article -
12
Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin
Published 2013“…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
Get full text
Get full text
Get full text
Thesis -
13
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 -
14
-
15
A secure trust aware ACO-Based WSN routing protocol for IoT
Published 2022“…The performance of the proposed routing algorithm is demonstrated through MATLAB. Based on the proposed system, to find the secure and optimal path while aiming at providing trust in IoT environment, the average energy consumption is minimized by nearly 50% even as the number of nodes has increased, as compared with the conventional ACO algorithm, a current ant-based routing algorithm for IoT-communication, and a present routing protocol RPL for IoT.…”
Get full text
Get full text
Get full text
Article -
16
Dealing with Routing Hole Problem in Multi-hop Hierarchical Routing Protocol in Wireless Sensor Network
Published 2019“…The challenging issue of routing protocols is to reduce the communication overhead for data transmission by determining an optimal path. The hierarchical routing technique is one of the energy efficient routing protocols in WSN. …”
Get full text
Get full text
Thesis -
17
The division free parallel algorithm for finding determinant
Published 2013“…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
Get full text
Get full text
Get full text
Article -
18
New Sequential and Parallel Division Free Methods for Determinant of Matrices
Published 2013“…The research also aims to generalise the Sarrus Rule for any order of square matrices based on permutations which are derived using starter sets. …”
Get full text
Get full text
Get full text
Thesis -
19
A novel high performance routing technique for cross-referencing DMFBs
Published 2012Get full text
Working Paper -
20
