Search Results - (( using association problem algorithm ) OR ( java application customization algorithm ))

Symbiotic organisms search optimization algorithm in cloud computing: a nature-inspired meta-heuristic by Sa'ad, Suleiman, Abdullah, Muhammed, Abdullah, Azizol, Ayob, Fahrul Hakim

“…In the past few years nature-inspired algorithms are experiencing rapid growth where most optimisation problems in different domains are addressed using it. …”
Get full text
Get full text

Genetic Algorithm for vehicle routing problem / W.Nurfahizul Ifwah W.Alias, Mohd Shaiful Sharipudin and Shamsunarnie Mohamed Zukri. by W.Alias, W.Nurfahizul Ifwah, Sharipudin, Mohd Shaiful, Mohamed Zukri, Shamsunarnie

“…The vehicle routing problem (VRP) is the m-Travelling Salesman Problem, where a demand is associated with each city or customer and each vehicle has a certain capacity. …”
Get full text
Get full text

Solving multi-task optimization problems using the sine cosine algorithm by Kamal Z., Zamli, Kader, Md. Abdul

Get full text
Get full text
Get full text
Get full text

Interacted Multiple Ant Colonies for Search Stagnation Problem by Aljanabi, Alaa Ismael

“…This thesis addresses the issues associated with search stagnation problem that ACO algorithms suffer from. …”
Get full text
Get full text
Get full text

Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA) by Alamri, Hammoudeh S., Zamli, Kamal Z., Ahmad Firdaus, Zainal Abidin, Mohd Faizal, Ab Razak

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

Accelerating learning performance of back propagation algorithm by using adaptive gain together with adaptive momentum and adaptive learning rate on classification problems by Abdul Hamid, Norhamreeza, Mohd Nawi, Nazri, Ghazali, Rozaida, Mohd Salleh, Mohd Najib

“…However, the most serious problem associated with the BP is local minima problem and slow convergence speeds. …”
Get full text
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
Get full text

A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time by Nazif, Habibeh, Lee, Lai Soon

“…For this problem, we propose a genetic algorithm using an optimised crossover operator designed by an undirected bipartite graph to find an optimal schedule which minimises the total weighted completion time of the jobs in the presence of the sequence independent family setup times. …”
Get full text
Get full text

Enhancing obfuscation technique for protecting source code against software reverse engineering by Mahfoudh, Asma

“…The proposed technique can be enhanced in the future to protect games applications and mobile applications that are developed by java; it can improve the software development industry. …”
Get full text
Get full text

Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem by ,, Wamiliana, Usman, Mustofa, ,, Warsono, Daoud, Jamal Ibrahim

“…Two algorithms (WWM1 and WWM2) are proposed for solving this problem. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Hybrid algorithm for NARX network parameters' determination using differential evolution and genetic algorithm by Salami, Momoh Jimoh Eyiomika, Tijani, Ismaila, Isqeel , Abdullateef Ayodele, Aibinu, Abiodun Musa

“…A hybrid optimization algorithm using Differential Evolution (DE) and Genetic Algorithm (GA) is proposed in this study to address the problem of network parameters determination associated with the Nonlinear Autoregressive with eXogenous inputs Network (NARX-network). …”
Get full text
Get full text
Get full text

Cuckoo Search Approach for Cutting Stock Problem by Shair, Ezreen Farina, Khor, Shen Young, Abdullah, Abdul Rahim, Jaafar, Hazriq Izzuan, Saharuddin, Nur Zawani, Zainal Abidin, Amar Faiz

Get full text
Get full text
Get full text

Performance analysis of AES (Advance Encryption Standard) in IPSec (Internet Protocol Security) / Nik Shahidah Afifi Md Taujuddin, Abdul Hanan Abdullah and Mohd Aizaini Maarof by Md Taujuddin, Nik Shahidah Afifi, Abdullah, Abdul Hanan, Maarof, Mohd Aizaini

“…Throughout this research, a new algorithm from NIST that is Advance Encryption Standard (AES) is found can be used in IPSec to overcome these problems. …”
Get full text
Get full text

Modified ACS centroid memory for data clustering by Jabbar, Ayad Mohammed, Ku-Mahamud, Ku Ruhana, Sagban, Rafid

“…Ant Colony Optimization (ACO) is a generic algorithm, which has been widely used in different application domains due to its simplicity and adaptiveness to different optimization problems. …”
Get full text
Get full text
Get full text

An improved genetic bat algorithm for unconstrained global optimization problems by Muhammad Zubair, Rehman, Kamal Z., Zamli, Abdullah, Nasser

Get full text
Get full text
Get full text

Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

“…This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
Get full text
Get full text

HEURISTIC OPTIMIZATION OF BAT ALGORITHM FOR HETEROGENEOUS SWARMS USING PERCEPTION by Kappagantula, S., Vojjala, S., Iyer, A.A., Velidi, G., Emani, S., Vandrangi, S.K.

“…Swarm Intelligence is inspired by naturally occurring swarm systems suchas Ant Colony, Bees Hive, or Bats. The Bat Algorithm is a population-based meta-heuristic algorithm for solving continuous optimization problems. …”
Get full text
Get full text

Systematic Review of Enhancement of Artificial Bee Colony Algorithm Using Ant Colony Pheromone by Alaidi A.H., Der C.S., Leong Y.W.

“…One method to enhance ABC is to borrow exploration technique from other algorithms. Researchers use pheromone, which is a technique used by Ant Colony optimization algorithm, to enhance ABC and addressed several aspects of using a pheromone to enhance ABC. …”

Parallel distributed genetic algorithm development based on microcontrollers framework by Krishnan P.S., Kiong T.S., Koh J.

“…Genetic algorithms are powerful optimizing techniques that are used successfully to solve problems in many different disciplines. …”