Search Results - (( using permutation parallel algorithm ) OR ( basic optimization search algorithm ))

The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

“…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
Get full text
Get full text
Get full text

A new parallel model for starter sets generation via exchanging two elements by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

“…In this study, a technique of parallelization across the method was employed to develop new parallel algorithm for finding all permutations under exchanged restrictions. …”
Get full text
Get full text

Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network by Othman, Mohamed, Abdullah, Monir, Johari, Rozita

“…In this paper, a new parallel algorithm of the window method is developed called the Balanced Parallel Window Method (BPWM) algorithm. …”
Get full text
Get full text

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

“…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
Get full text
Get full text

Basic firefly algorithm for document clustering by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

“…To address the shortcoming, this paper proposes a Basic Firefly (Basic FA) algorithm to cluster text documents.The algorithm employs the Average Distance to Document Centroid (ADDC) as the objective function of the search. …”
Get full text
Get full text

New Sequential and Parallel Division Free Methods for Determinant of Matrices by Sharmila, Karim

“…The computation times in the newly developed sequential methods were dominated by generating starter sets. Therefore, two parallel strategies were developed to parallelise this algorithm so as to reduce the computation times. …”
Get full text
Get full text
Get full text

Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems by Din, Fakhrud, Khalid, Shah, Fayaz, Muhammad, Gwak, Jeonghwan, Kamal Z., Zamli, Mashwani, Wali Khan

“…The performance of the fuzzy adaptive teaching learning-based optimization is evaluated against other metaheuristic algorithms including basic teaching learning-based optimization on 23 unconstrained global test functions. …”
Get full text
Get full text
Get full text

Multiple Objective Optimization of Green Logistics Using Cuckoo Searching Algorithm by Wang, Wei, Liu, Yao

“…Basically, Cuckoo searching algorithm imitates the natural evolution of a population with initial solutions. …”
Get full text
Get full text
Get full text

Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman by Che Osman, Siti Eshah

“…In future, this work could be enhanced for better performances in both aspects using another variant of the PSO or other potential metaheuristic searching techniques such as Firefly Optimization, Bat Algorithm and etc.…”
Get full text
Get full text

A hybrid particle swarm optimization approach and its application to solving portfolio selection problems by Shamshul Bahar, Yaakob, Prof. Madya, Watada, Junzo

Get full text

Mathematical formulation of tabu search in combinatorial optimization by Ismail, Zuhaimy

Get full text
Get full text

Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text

Particle Swarm Optimization algorithm for facial emotion detection by Ghandi, B.M., Nagarajan, R., Hazry, Desa, Prof. Madya Dr.

Get full text

Tackling the berth allocation problem via harmony search algorithm by Ahmed, Bilal, Hamdan, Hazlina, Muhammed, Abdullah, Husin, Nor Azura

“…Harmony Search Algorithm (HSA) is one of the recent population-based optimization methods which inspired by modern-nature. …”
Get full text
Get full text
Get full text

The design and applications of the african buffalo algorithm for general optimization problems by Odili, Julius Beneoluchi

“…Optimization, basically, is the economics of science. …”
Get full text
Get full text

Local search manoeuvres recruitment in the bees algorithm by Muhamad, Zaidi, Mahmuddin, Massudi, Nasrudin, Mohammad Faidzul, Sahran, Shahnorbanun

“…Swarm intelligence of honey bees had motivated many bioinspired based optimisation techniques. The Bees Algorithm (BA) was created specifically by mimicking the foraging behavior of foraging bees in searching for food sources.During the searching, the original BA ignores the possibilities of the recruits being lost during the flying.The BA algorithm can become closer to the nature foraging behavior of bees by taking account of this phenomenon.This paper proposes an enhanced BA which adds a neighbourhood search parameter which we called as the Local Search Manoeuvres (LSM) recruitment factor.The parameter controls the possibilities of a bee extends its neighbourhood searching area in certain direction.The aim of LSM recruitment is to decrease the number of searching iteration in solving optimization problems that have high dimensions.The experiment results on several benchmark functions show that the BA with LSM performs better compared to the one with basic recruitment.…”
Get full text
Get full text
Get full text

African Buffalo Optimization: A Swarm-Intelligence Technique by Odili, Julius Beneoluchi, M. N. M., Kahar, Shahid, Anwar

“…Our interest is in their organizational ability through two basic sounds in search of solutions. Experiments carried out using the novel algorithm in solving some benchmark Travelling Salesman’s Problem when compared with the results from some popular optimization algorithms show that the ABO was not only able to obtain better solutions but at a faster speed.…”
Get full text
Get full text
Get full text

Nomadic people optimizer (NPO) for large-scale optimization problems by Mohamd Salih, Sinan Qahtan

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

African Buffalo Optimization Algorithm for Tuning Parameters of a PID Controller in Automatic Voltage Regulators by Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad

“…Though a recently-designed algorithm, the ABO has been effective and efficient in solving a number of search optimization problems. …”
Get full text
Get full text
Get full text

Convergence Analysis of the African Buffalo Optimization Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar, Noraziah, Ahmad

“…This paper presents the convergence analysis of the newly-developed African Buffalo Optimization algorithm. African Buffalo Optimization is a simulation of the organizational skills of the African buffalos using two basic sounds: /waaa/ and /maaa/ as they transverse the African landscape in search of grazing pastures. …”
Get full text
Get full text
Get full text