Search Results - (( using optimization strategy algorithm ) OR ( using vector (problems OR problem) algorithm ))
Search alternatives:
- strategy algorithm »
-
1
Broadening selection competitive constraint handling algorithm for faster convergence
Published 2020“…The proposed algorithm has been evaluated using 24 benchmark functions. …”
Get full text
Get full text
Article -
2
Crossover and mutation operators of real coded genetic algorithms for global optimization problems
Published 2016“…The rationale behind developing algorithms using real encoding of chromosome representations is the limitations of binary encoding. …”
Get full text
Get full text
Thesis -
3
Towards large scale unconstrained optimization
Published 2007“…The main difficulty in dealing with large scale problems is the fact that effective algorithms for small scale problems do not necessarily translate into efficient algorithms when applied to solve large scale problems. …”
Get full text
Get full text
Get full text
Inaugural Lecture -
4
Reduced torque ripple and switching frequency using optimal DTC switching strategy for open-end winding induction machines
Published 2017“…The main benefit of the proposed strategy is its simplicity, where the DTC improvements can be obtained without the common approach, i.e. the use of Space Vector Modulation (SVM) which involves complex control algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
Minimization of torque ripple and flux droop using optimal DTC switching and sector rotation strategy
Published 2022“…A five-level cascaded H-bridge (CHB) inverter was used in the optimal DTC switching strategy because it had many voltage vectors and could be used for a variety of speed operations. …”
Get full text
Get full text
Get full text
Thesis -
6
Development of a motion planning and obstacle avoidance algorithm using adaptive neuro fuzzy inference system for mobile robot navigation
Published 2017“…Finally, the last objective is to improve the optimality of the new approach using a robust Machine Learning strategy. …”
Get full text
Get full text
Get full text
Thesis -
7
Harmonic Elimination Pulse Width Modulation Using Differential Evolution Technique For Three Phase Voltage Source Inverter
Published 2018“…Explanation of DE algorithm execution is given, and the best approach of mutation strategy selection used in DE has been investigated. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
8
Quasi-Newton type method via weak secant equations for unconstrained optimization
Published 2021“…Using the concept of least change updating strategy, two updating formulas are derived by the mean of variational problem, via weak secant equation and some other non-secant equations. …”
Get full text
Get full text
Thesis -
9
Design Of Feature Selection Methods For Hand Movement Classification Based On Electromyography Signals
Published 2020“…The first method is the Binary Tree Growth Algorithm (BTGA), which implements a hyperbolic tangent function to convert the Tree Growth Algorithm into the binary version. …”
Get full text
Get full text
Get full text
Thesis -
10
Vector Evaluated Gravitational Search Algorithm (VEGSA) for multi-objective optimization problems
Published 2012“…The proposed algorithm, which is called Vector Evaluated Gravitational Search Algorithm (VEGSA), uses a number of populations of particles. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
11
Multi-user beamforming, fairness and device-to-device channel state information sharing in downlink non-orthogonal multiple access systems
Published 2021“…This algorithm is designed to maximize the throughput with moderate fairness enhancement. …”
Get full text
Get full text
Thesis -
12
A Method For Solving Mult-Objective Optimization Problem: Vector Evaluated Genetic Algorithm (Vega)
Published 2009“…However, it is impractical to solve MOOP by using classical methods due to its complexity. Genetic Algorithms (GAs) are a powerful stochastic search in solving optimization problems. …”
Get full text
Get full text
Final Year Project Report / IMRAD -
13
Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier
Published 2013“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text
Article -
14
-
15
Convergence and Diversity Evaluation for Vector Evaluated Particle Swarm Optimization
Published 2013“…An extended PSO algorithm called Vector Evaluated Particle Swarm Optimization (VEPSO) has been introduced to solve multi-objective optimization problems. …”
Get full text
Get full text
Conference or Workshop Item -
16
Improving Vector Evaluated Particle Swarm Optimisation by Incorporating Nondominated Solutions
Published 2013“…The Vector Evaluated Particle Swarm Optimisation algorithm is widely used to solve multiobjective optimisation problems. …”
Get full text
Get full text
Get full text
Article -
17
Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization
Published 2013“…Ant Colony Optimization has been used to solve Support Vector Machine model selection problem.Ant Colony Optimization originally deals with discrete optimization problem.In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time.This study proposes an algorithm that can optimize Support Vector Machine parameters using Continuous Ant Colony Optimization without the need to discretize continuous value for Support Vector Machine parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.…”
Get full text
Get full text
Get full text
Article -
18
Improving performance of mobile ad hoc networks using efficient Tactical On Demand Distance Vector (TAODV) routing algorithm
Published 2012“…The proposed TAODV algorithm performs better for solving routing problems in Mobile Ad Hoc networks. …”
Get full text
Get full text
Article -
19
-
20
Enhanced artificial bee colony-least squares support vector machines algorithm for time series prediction
Published 2014“…The lvABC algorithm is introduced to overcome the local optima problem by enriching the searching behaviour using Levy mutation. …”
Get full text
Get full text
Get full text
Thesis