Search Results - global distributions ((((factor algorithm) OR (function algorithm))) OR (search algorithm))
Search alternatives:
- global distributions »
- function algorithm »
- factor algorithm »
-
1
A new HMCR parameter of harmony search for better exploration
Published 2016“…However, when performing a local search, the harmony search algorithm can be easily trapped in the local optima. …”
Get full text
Get full text
Conference or Workshop Item -
2
A new HMCR parameter of harmony search for better exploration
Published 2015“…However, when performing a local search, the harmony search algorithm can be easily trapped in the local optima. …”
Get full text
Get full text
Conference or Workshop Item -
3
Chaos search in fourire amplitude sensitivity test
Published 2012“…Work in Artificial Intelligence (AI) often involves search algorithms. In many complicated problems, however, local search algorithms may fail to converge into global optimization and global search procedures are needed. …”
Get full text
Get full text
Get full text
Article -
4
Chaos Search in Fourier Amplitude Sensitivity Test
Published 2012“…Work in Artificial Intelligence (AI) often involves search algorithms. In many complicated problems, however, local search algorithms may fail to converge into global optimization and global search procedures are needed. …”
Get full text
Get full text
Get full text
Article -
5
An empirical study of density and distribution functions for ant swarm optimized rough reducts
Published 2011“…Ant colony approach in Ant Swarm algorithm generates local solutions which satisfy the Gaussian distribution for global optimization using PSO algorithm. …”
Get full text
Get full text
Get full text
Book Chapter -
6
Modified Parameters of Harmony Search Algorithm for Better Searching
Published 2017“…The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems. …”
Get full text
Get full text
Conference or Workshop Item -
7
Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems
Published 2018“…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
Get full text
Get full text
Get full text
Thesis -
8
Multi-objective service restoration in distribution networks using genetic algorithm
Published 2013“…This thesis presents a new approach of supply restoration service using the Genetic Algorithm. The GA is robust in searching a global optimal solution for the large-scale combinatorial optimization problems. …”
Get full text
Get full text
Thesis -
9
Distributed joint power control, beamforming and spectrum leasing for cognitive two-way relay networks
Published 2017“…In the first part of the thesis, distributed power control and beamforming algorithm is proposed in which users operating in the underlay mode can strategically adapt their power levels and maximize their own utilities. …”
Get full text
Get full text
Thesis -
10
-
11
An improved bat algorithm with artificial neural networks for classification problems
Published 2016“…Metaheuristic search algorithms have been used for quite a while to optimally solve complex searching problems with ease. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Efficient task scheduling strategies using symbiotic organisms search algorithm for cloud computing environment
Published 2022“…Then CDSOS approach further improves the SOS algorithm by hybridising it with Cuckoo search’s levy flight to minimise the degree of imbalance between the local search space and the global search thereby improving the tasks to VM mapping. …”
Get full text
Get full text
Thesis -
13
A new hybrid GA−ACO−PSO algorithm for solving various engineering design problems
Published 2019“…The intention of this hybridization is to further enhance the exploratory and exploitative search capabilities involving simple concepts. The proposed algorithm adopts the combined discrete and continuous probability distribution scheme of ant colony optimization (ACO) to specifically assist genetic algorithm in the aspect of exploratory search. …”
Get full text
Get full text
Article -
14
Network reconfiguration and control for loss reduction using genetic algorithm
Published 2010“…Tests results show that Genetic Algorithm is a suitable algorithm as it is an optimization technique with, high accuracy, and it avoids local minimum by searching in several regions to arrive to the global optimum solution. …”
Get full text
Get full text
Thesis -
15
Optimal location and size estimation of distributed generators by employing grouping particle swarm optimization and grouping genetic algorithm
Published 2017“…These algorithms are used to obtain the optimal size of distributed generators units to be installed at optimal locations, which are obtained using loss sensitivity factor. …”
Get full text
Get full text
Thesis -
16
-
17
Nomadic people optimizer (NPO) for large-scale optimization problems
Published 2019“…The basic component of the algorithm consists of several clans and each clan searches for the best place (or best solution) based on the position of their leader. …”
Get full text
Get full text
Thesis -
18
Parameter estimation in computational systems biology models: a comparative study of initialization methods in global optimization
Published 2022“…Estimating parameters values is difficult and time-consuming process due to their highly nonlinear and huge number of kinetic parameters involved. Global optimization method based on an enhanced scatter search (ESS) algorithm is a suitable choice to address this issue. …”
Get full text
Get full text
Get full text
Article -
19
A new variant of black hole algorithm based on multi population and levy flight for clustering problem
Published 2020“…Trying through all the possible candidate clusters for the perfect result is too time consuming. Metaheuristic algorithm aims to search for global optimum in high dimensional problems. …”
Get full text
Get full text
Thesis -
20
Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures
Published 2020“…To evaluate the capability of ROA at addressing complicated problems, it has subjected to experiment several benchmark functions. The ROA has then compared with nine well-known optimization algorithms. …”
Get full text
Get full text
Thesis