Search Results - (( using factor path algorithm ) OR ( basic optimization modified algorithm ))
Search alternatives:
- optimization modified »
- basic optimization »
- path algorithm »
- using factor »
-
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
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 -
3
A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution
Published 2018“…Significant modifications to the basic Jaya algorithm are done to create a modified Jaya (MJaya) algorithm that can handle the MOOPF problem. …”
Get full text
Get full text
Get full text
Article -
4
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 -
5
Data Analysis using Particle Swarm Optimization Algorithm
Published 2015Get full text
Get full text
Final Year Project / Dissertation / Thesis -
6
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 -
7
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 -
8
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 -
9
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 -
10
A-star (A*) algorithm implementation for robotics path planning navigation
Published 2018“…This thesis is about the implementation of Astar (A*) algorithm as path planning algorithm used in robotics navigation. …”
Get full text
Get full text
Undergraduates Project Papers -
11
Robotic indoor path planning using dijkstra's algorithm with multi-layer dictionaries
Published 2016“…The path computed using the classic Dijkstra's algorithm is the shortest; however, it may not be the most feasible. …”
Get full text
Get full text
Conference or Workshop Item -
12
Particle Swarm Optimization algorithm for facial emotion detection
Published 2010Get full text
Working Paper -
13
New algorithm for autonomous dynamic path planning in real-time intelligent robot car
Published 2017“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text
Article -
14
Cognitive map approach for mobility path optimization using multiple objectives genetic algorithm
Published 2023Conference Paper -
15
A Continuous Overlay Path Probing Algorithm For Overlay Networks
Published 2013“…Several experiments were carried out using the OMNeT++ simulation framework. The designed algorithm was evaluated using experimental data. …”
Get full text
Get full text
Thesis -
16
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 -
17
Nlfxlms and thf-nlfxlms algorithms for wiener-hammerstein nonlinear active noise control
Published 2016“…However, this assumption may lead to inaccurate secondary path model. In this work, the modelling of acoustic path using FIR filters is incorporated for both algorithms for Wiener-Hammerstein structure. …”
Get full text
Get full text
Thesis -
18
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 -
19
Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment
Published 2018“…We demonstrate our framework; the integration of enhanced Jump Point Search algorithm with modified Bresenham for heuristic computation in virtual grid-based environment. …”
Get full text
Get full text
Get full text
Thesis -
20
Mathematical formulation of tabu search in combinatorial optimization
Published 2008Get full text
Get full text
Monograph
