Search Results - (( _ distribution among algorithm ) OR ( parameter adoption ((a algorithm) OR (new algorithm)) ))

Modified Parameters of Harmony Search Algorithm for Better Searching by Nur Farraliza, Mansor, Abas, Z.A, Shibghatullah, A.S., Rahman, A.F.N.A

“…The latest approaches still unable to address the fairness problem that has emerged, thus this research proposes a strategy to adopt an amendment of a harmony search algorithm in order to address the fairness issue and thus the level of fairness will be escalate. …”
Get full text
Get full text

Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

“…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

Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

“…Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). …”
Get full text
Get full text

A fuzzy adaptive teaching learning-based optimization strategy for generating mixed strength t-way test suites by Din, Fakhrud

“…Owing to its proven performance in many other optimization problems, the adoption of the parameter-free Teaching Learning-based Optimization (TLBO) algorithm as a new t-way strategy is deemed useful. …”
Get full text
Get full text

An elitist-flower pollination-based strategy for constructing sequence and sequence-less t-way test suite by Abdullah, Nasser, Kamal Z., Zamli, Alsewari, Abdulrahman A., Ahmed, Bestoun S.

“…In line with such a need, this paper presents a unified strategy based on the new meta-heuristic algorithm, called the elitist flower pollination algorithm (eFPA), for sequence and sequence-less coverage. …”
Get full text
Get full text
Get full text

Adopting Jaya Algorithm for Team Formation Problem by Kader, Md. Abdul, Kamal Z., Zamli

Get full text
Get full text
Get full text

Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

“…Flower Pollination Algorithm (FPA) is a relatively new meta-heuristic algorithm that adopts its metaphor from the proliferation role of flowers in plants. …”
Get full text
Get full text

Novel direct and self-regulating approaches to determine optimum growing multi-experts network structure by Loo, C.K., Rajeswari, M., Rao, M.V.C.

“…However, GMN is not ergonomic due to too many network control parameters. Therefore, a self-regulating GMN (SGMN) algorithm is proposed. …”
Get full text
Get full text

Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

“…Thus, this study attempts to adopt a new search strategy from another popular estimator, named the Ultimate iterative unbiased finite impulse response (UFIR) filter which works with only one parameter. …”
Get full text
Get full text

Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

“…Thus, this study attempts to adopt a new search strategy from another popular estimator, named the Ultimate iterative unbiased finite impulse response (UFIR) filter which works with only one parameter. …”
Get full text
Get full text

Dynamic social behavior algorithm for real-parameter optimization problems and optimization of hyper beamforming of linear antenna arrays by Prajindra�Sankar K., Kiong T.S., Siaw�Paw J.K.

Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

“…Flower Pollination Algorithm (FPA) is a relatively new meta-heuristic algorithm that adopts its metaphor from the proliferation role of flowers in plants. …”
Get full text
Get full text
Get full text

Combinatorial test suites generation strategy utilizing the whale optimization algorithm by Ali Abdullah, Hassan, Salwani, Abdullah, Kamal Zuhairi, Zamli, Rozilawati, Razali

“…Supporting the No Free Lunch theorem, as well as potentially offering new insights into the whole process of t-way generation, this article proposes a new strategy with constraint support based on the Whale Optimization Algorithm (WOA). …”
Get full text
Get full text
Get full text

Estimating Face Emotion using Genetic Algorithm by Karthigayan, M., Mohd Rizon, Muhamed Juhari, Sazali, Yaacob, Nagarayan, R.

Get full text

HABCSm: A Hamming Based t -way Strategy based on Hybrid Artificial Bee Colony for Variable Strength Test Sets Generation by Alazzawi, A.K., Rais, H.M., Basri, S., Alsariera, Y.A., Capretz, L.F., Imam, A.A., Balogun, A.O.

“…HABCSm is the first t -way strategy to adopt Hybrid Artificial Bee Colony (HABC) algorithm with Hamming distance as its core method for generating a final test set and the first to adopt the Hamming distance as the final selection criterion for enhancing the exploration of new solutions. …”
Get full text
Get full text

HABCSm: A Hamming Based t -way Strategy based on Hybrid Artificial Bee Colony for Variable Strength Test Sets Generation by Alazzawi, A.K., Rais, H.M., Basri, S., Alsariera, Y.A., Capretz, L.F., Imam, A.A., Balogun, A.O.

“…HABCSm is the first t -way strategy to adopt Hybrid Artificial Bee Colony (HABC) algorithm with Hamming distance as its core method for generating a final test set and the first to adopt the Hamming distance as the final selection criterion for enhancing the exploration of new solutions. …”
Get full text
Get full text

A new approach for recognition of human emotions by Karthigayan, M., Mohd Rizon, Muhamed Juhari, Sazali, Yaacob, Nagarajan, R.

Get full text

Mathematical modelling of mass transfer in a multi-stage rotating disc contactor column by Maan, Normah

“…Based on this formulation, a Mass Transfer of A Single Drop (MTASD) Algorithm was designed, followed by a more realistic Mass Transfer of Multiple Drops (MTMD) Algorithm which was later refined to become another algorithm named the Mass Transfer Steady State (MTSS) Algorithm. …”
Get full text
Get full text

One Parameter at a time Combinatorial Testing Strategy Based on Harmony Search Algorithm OPAT-HS by Al-Sewari, Abdul Rahman Ahmed Mohammed, Mu’aza, Aminu Aminu, Rassem, Taha H., Tairan, Nasser M., Shah, Habib, Kamal Z., Zamli

“…Therefore, this paper will propose a new OPAT strategy based on Harmony Search Algorithm (HS) called OPAT-HS. …”
Get full text
Get full text
Get full text

Application of memetic algorithm in modelling discrete-time multivariable dynamics systems by Ahmad, Robiah, Jamaluddin, Hishamuddin, Hussain, Mohd. Azlan

“…There are more possible structures to choose from and more parameters are required to obtain a good fit. In this work, a new model structure selection in system identification problems based on a modified GA with an element of local search known as memetic algorithm (MA) is adopted. …”
Get full text
Get full text
Get full text