Search Results - (( using optimization system algorithm ) OR ( basic optimization modified algorithm ))
Search alternatives:
- optimization modified »
- optimization system »
- basic optimization »
- system algorithm »
-
1
Optimal power flow based on fuzzy linear programming and modified Jaya algorithms
Published 2017“…A set of modified and novel optimization algorithms are proposed in this thesis to deal with different single and multi-objective OPF problems. …”
Get full text
Get full text
Thesis -
2
A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution
Published 2018“…The proposed algorithm is scrutinized and validated using the modified IEEE 30-bus test system. …”
Get full text
Get full text
Get full text
Article -
3
Modification of the ant colony optimization algorithm for solving multi-agent task allocation problem in agricultural application
Published 2024“…The performance of the basic ACO algorithm for solving task allocation is improved by modifying the efficiency factor. …”
Get full text
Get full text
Get full text
Article -
4
Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems
Published 2022“…To overcome these drawbacks and to achieve an appropriate percentage of exploitation and exploration, this study presents a new modified teaching learning-based optimization algorithm called the fuzzy adaptive teaching learning-based optimization algorithm. …”
Get full text
Get full text
Get full text
Article -
5
INTELLIGENT OPTIMIZATION OF INTERLINE POWER FLOW CONTROLLER IN TRANSMISSION SYSTEM
Published 2010“…The optimal parameters are derived to minimize the transmission line losses using three intelligent optimization techniques, namely Particle Swarm Optimization (PSO), Genetic Algorithm (GA) and Simulated Annealing (SA). …”
Get full text
Get full text
Thesis -
6
Facial emotion detection using Guided Particle Swarm Optimization (GPSO)
Published 2009Get full text
Working Paper -
7
Hybrid artificial bee colony algorithm with branch and bound for two–sided assembly line balancing
Published 2018“…The branch and bound concept was applied by using mated workstations to overcome the slow convergence of the ABC algorithm and solve the problem optimality. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
8
Parametric modelling of a TRMS using dynamic spread factor particle swarm optimisation
Published 2009“…The proposed method formulates a modified inertia weight algorithm by using a dynamic spread factor (SF). …”
Get full text
Get full text
Get full text
Proceeding Paper -
9
Power System State Estimation In Large-Scale Networks
Published 2010“…Its optimal performance is required in order to operate the power system in a safe, secure and economic manner. …”
Get full text
Get full text
Thesis -
10
Automatic generic process migration system in linux
Published 2012“…A fexible interface to the underlying checkpoint/ restart subsystem is designed which permits users to specify the migration mechanism according to process constraints. A migration algorithm is designed which attempts to exploit the unique features of the basic migration algorithms to form a generic algorithm. …”
Get full text
Get full text
Thesis -
11
Classification of herbs plant diseases via hierarchical dynamic artificial neural network
Published 2010“…Once the image of a target is captured digitally, a myriad of image processing algorithms can be used to extract features from it. …”
Get full text
Get full text
Article -
12
Classification of herbs plant diseases via hierachical dynamic artificial neural network after image removal using kernel regression framework
Published 2011“…Once the image of a target is captured digitally, a myriad of image processing algorithms can be used to extract features from it. …”
Get full text
Get full text
Article -
13
Data Analysis using Particle Swarm Optimization Algorithm
Published 2015Get full text
Get full text
Final Year Project / Dissertation / Thesis -
14
Memoryless modified symmetric rank-one method for large-scale unconstrained optimization
Published 2009“…In this study, we present a scaled memoryless modified Symmetric Rank-One (SR1) algorithm and investigate the numerical performance of the proposed algorithm for solving large-scale unconstrained optimization problems. …”
Get full text
Get full text
Get full text
Article -
15
Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction
Published 2021“…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
Get full text
Get full text
Thesis -
16
Multiple Objective Optimization of Green Logistics Using Cuckoo Searching Algorithm
Published 2016“…In this paper, a modified Cuckoo searching algorithm is proposed to solve the multiple objective Green Logistics optimization problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Particle Swarm Optimization algorithm for facial emotion detection
Published 2010Get full text
Working Paper -
18
Optimization of the Time of Task Scheduling for Dual Manipulators using a Modified Electromagnetism-Like Algorithm and Genetic Algorithm
Published 2023“…A method based on a modified electromagnetism-like with two-direction local search algorithm (MEMTDLS) and genetic algorithm (GA) is proposed to determine the optimal time of task scheduling for dual-robot manipulators. …”
Article -
19
Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling
Published 2022“…Many real-world production scheduling problems involve the simultaneous optimization of multiple conflicting objectives that are challenging to solve without the aid of powerful optimization techniques. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
SNR-Based OLSR Routing Protocol for Wireless Mesh Networks
Published 2009“…Unfortunately the routing protocols used such as AODV and Dynamic source routing (DSR) are hop count-based; where the routing algorithm uses the number of nodes to determine the optimum path to the destination. …”
Get full text
Get full text
Thesis
