Search Results - (( based optimization based algorithm ) OR ( basic general function algorithm ))
Search alternatives:
-
1
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 -
2
Stochastic process and tutorial of the African bufalo optimization
Published 2022“…This paper presents the data description of the African buffalo optimization algorithm (ABO). ABO is a recently-designed optimization algorithm that is inspired by the migrant behaviour of African buffalos in the vast African landscape. …”
Get full text
Get full text
Get full text
Article -
3
Stochastic process and tutorial of the African buffalo optimization
Published 2022“…This paper presents the data description of the African buffalo optimization algorithm (ABO). ABO is a recently-designed optimization algorithm that is inspired by the migrant behaviour of African buffalos in the vast African landscape. …”
Get full text
Get full text
Get full text
Article -
4
Gradient-based mutation manta ray foraging optimization (gbm-mrfo) for solving constrained real-world problems
Published 2022“…GbM-MRFO turn out to be a competitive optimization algorithm on solving constrained optimization problem of Three-bar Truss problem. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
5
T-way testing : a test case generator based on melody search algorithm
Published 2015“…Next, TTT-MS will be executed through main algorithms to generate Parameters Interaction List, Parameter Values Interaction List, and finally generate final Test Cases based on Melody Search Algorithm. …”
Get full text
Get full text
Undergraduates Project Papers -
6
-
7
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
Thesis -
8
Improving Attentive Sequence-to-Sequence Generative-Based Chatbot Model Using Deep Neural Network Approach
Published 2022“…Hence, this research’s objective aimed to propose an optimization strategy based on Structural Modification and Optimizing Training Network for improving the lacking of accuracy of response in the chatbot application, to propose the algorithm enhancement to improve the current attention mechanism in the Attentive Sequence-to-Sequence model and the network’s training optimization of its inability to memorize the dialogue history, and lastly, to evaluate the accuracy of response of the proposed solution through data training on loss function and real data testing. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
9
Neural Network – A Black Box Model
Published 2024“…A variety of metaheuristic algorithms have been used to train ANN, including Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Simulated Annealing (SA), Ant Colony Optimization (ACO), Tabu Search (TS), and Harmony Search (HS). …”
Get full text
Get full text
Get full text
Book Chapter -
10
EMG motion pattern classification through design and optimization of neural network
Published 2012“…This paper illustrates the classification of EMG signals through design and optimization of Artificial Neural Network (ANN). Different types of ANN models are basically structured with many interconnected network elements which can develop pattern classification strategies based on a set of input/training data. …”
Get full text
Get full text
Get full text
Proceeding Paper -
11
Implementation of Symmetric Rank-One Methods for Unconstrained Optimization
Published 2010“…We then examine a new scaled memoryless SR1 method based on modied secant equation for solving large-scale unconstrained optimization problems. …”
Get full text
Get full text
Thesis -
12
Tasks Distribution In Driver Scheduling Using Dynamic Set Of Bandwidth In Harmony Search Algorithm With 2-Opt
Published 2021“…This research was focused on driver scheduling problem for university shuttle bus (DSPUSB). Based on previous research using one of metaheuristic algorithms known as harmony search (HS), the generated schedule was still not optimum and cannot be solved maximally as there were too much repetitions of task (shift and route) occurred among drivers. …”
Get full text
Get full text
Get full text
Thesis -
13
An Environmentally Energy Dispatch Using New Meta Heuristic Evolutionary Programming
Published 2018“…Basically,one important issue in the power system network is to provide the optimal Economic Load Dispatch (ELD) solution in order to guarantee the sustainable consumer load demand.However,today ELD solution is essential to include together with the environmental aspect and known as Environmental Economic Load Dispatch (EELD).For that reason, many researchers continue in the development of new simulation tool specifically to overcome the EELD problems.Therefore,this study prepared an improved hybrid metaheuristic technique named as New Meta Heuristic Evolutionary Programming (NMEP) to provide the best possible solution in solving the identified single objective and multi objective functions for EELD solution.This new technique a merging cloning strategy that involved in an Artificial Immune System (AIS) algorithm into algorithm of Meta Heuristic Evolutionary Programming (Meta-EP).The development of NMEP technique is to minimize total cost,reduce the total emission during generator operation through the common formula in EELD and lowest total system loss.Besides that,all mentioned objective functions were also optimized together simultaneously that formulated using the weighted sum method before had been executed on the multi objective NMEP or called MONMEP.Both individual and multi objective NMEP techniques performance were verified among other two common heuristic methods known as AIS and Meta-EP techniques.In addition,the best possible solution defined using the aggregate function method.Through this method,the selection of the best MOEELD solution became effortless as compared with MO individually that required compare two or more objective function in one time manually.Among those three optimization techniques the lowest total aggregate values mostly resulted via the NMEP technique.Based upon that,the proposed technique is proving as the outstanding method compared with Meta-EP and AIS techniques in solving the EELD problem for both standard IEEE 26 bus and 57 bus systems.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
14
Optimal planning and design of hybrid renewable energy system for rural healthcare facilities / Olatomiwa Lanre Joseph
Published 2016“…Then, utilization of cost-effective optimization algorithm for optimal sizing of the energy resources and other system components with accurate mathematical models for energy management of the entire hybrid system. …”
Get full text
Get full text
Thesis -
15
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
Get full text
Get full text
Get full text
Article -
16
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
Get full text
Get full text
Get full text
Article -
17
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
Get full text
Get full text
Get full text
Article -
18
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
Get full text
Get full text
Get full text
Article -
19
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2022“…The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
Get full text
Get full text
Get full text
Article -
20
Improved Segregated Advancement (I-SA): a new method for solving full triangular fuzzy transportation problems
Published 2023“…The flaw of SA is that it uses the classical algorithms which are NWC, LCM, and VAM. Therefore, we proposed the improvement based on the combination of total ratio cost matrix and total difference method by column without using classical ranking functions. …”
Get full text
Get full text
Get full text
Article
