Search Results - (( using a problem algorithm ) OR ( evolution optimisation based algorithm ))

Performance evaluation and benchmarking of an extended computational model of ant colony system for DNA sequence design by Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Mohd Zaidi, Mohd Tumari

“…Ant colony system (ACS) algorithm is one of the biologically inspired algorithms that have been introduced to effectively solve a variety of combinatorial optimisation problems. …”
Get full text
Get full text
Get full text

A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, Fakhrud Din, Shah Khalid, Kamal Zuhairi Zamli, Aftab Alam

“…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
Get full text
Get full text
Get full text

A hyper-heuristic based strategy for image segmentation using multilevel thresholding by Luqman, ., Fakhrud, Din, Shah, Khalid, Kamal Z., Zamli, Alam, Aftab

“…EMCQ uses four low-level heuristic sets adopted from the teaching learning-based optimisation (TLBO) algorithm, flower pollination algorithm (FPA), genetic algorithm (GA), and Jaya algorithm. …”
Get full text
Get full text
Get full text

Cloud Worm Detection and Response Technique By Integrating The Enhanced Genetic Algorithm An Threat Level by Hasan Mahmoud Sha'ban Kanaker

Optimal placement, sizing and power factor of distributed generation: A comprehensive study spanning from the planning stage to the operation stage by Huy P.D., Ramachandaramurthy V.K., Yong J.Y., Tan K.M., Ekanayake J.B.

A competitive co-evolutionary approach for the nurse scheduling problem by Mohamad Nazri, Maizatul Farhana, Mohd Yusoh, Zeratul Izzah, Basiron, Halizah, Daud, Azlina

“…The competitive approach further exhibits smoother convergence behaviour across generations, indicating stronger optimisation dynamics and improved robustness. These findings demonstrate that competitive co-evolution provides an effective and practical alternative to static fitness-based evolutionary methods for nurse scheduling, with broader applicability to healthcare scheduling and constraint optimisation problems.…”
Get full text
Get full text
Get full text

Stock market turning points rule-based prediction / Lersak Photong … [et al.] by Photong, Lersak, Sukprasert, Anupong, Boonlua, Sutana, Ampant, Pravi

“…Finally, rule-based optimisation techniques such as Particle Swarm Optimization (PSO), Differential Evolution (DE) and Grey Wolf Optimizer (GWO) were used to minimise the amount of time employed in the stock market turning points prediction. …”
Get full text
Get full text

B-spline curve fitting with different parameterization methods by Kheng, Jia Shen

“…After generating control points, distance between the generated and original data points is used to identify the error of the algorithm. Later, genetic algorithm and differential evolution optimization are used to optimise the error of the curve. …”
Get full text
Get full text

Reliability assessment of power system generation adequacy with wind power using population-based intelligent search methods by Kadhem, Athraa Ali

“…This study sought to examine the performance of three newly proposed techniques, for reliability assessment of the power systems, namely Disparity Evolution Genetic Algorithm (DEGA), Binary Particle Swarm Optimisation (BPSO), and Differential Evolution Optimization Algorithm (DEOA). …”
Get full text
Get full text
Get full text

iBUST: An intelligent behavioural trust model for securing industrial cyber-physical systems by Azad, Saiful, Mahmud, Mufti, Kamal Zuhairi, Zamli, Kaiser, M. Shamim, Jahan, Sobhana, Razzaque, Md Abdur

“…In addition, a new optimisation model for finding optimum parameter values in the MEDF and an algorithm for transmuting a 1D quantitative feature into a respective categorical feature are developed to facilitate the model. …”
Get full text
Get full text
Get full text

Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

“…The proposed method provides a platform to efficiently solve the MC problem by using approximation algorithm of Minimum Vertex Cover (MVC).…”
Get full text
Get full text
Get full text
Get full text

A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

“…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

“…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
Get full text
Get full text
Get full text

Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms by Alomoush, Alaa A., Alsewari, Abdulrahman A., Alamri, Hammoudeh S., Kamal Z., Zamli

“…In this research, a new hybrid algorithm of Harmony search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. …”
Get full text
Get full text
Get full text
Get full text

Comparison between ant colony and genetic algorithm using traveling salesman problem by Abduljabbar, Zaid Ammen, Khalefa, Mustafa S., A. Jabar, Marzanah

“…The aim of this study is compare the effect of using two distributed algorithm which are ant colony as a Swarm intelligence algorithm and genetic algorithm. …”
Get full text
Get full text
Get full text

A self‐configured link adaptation for green LTE downlink transmission by Salman, Mustafa Ismael, Ng, Chee Kyun, Noordin, Nor Kamariah, Mohd Ali, Borhanuddin, Sali, Aduwati

“…Current and next‐generation cellular networks require such interactive techniques in order to be self‐optimised without complex modifications.…”
Get full text
Get full text

A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling by Abd. Halim, Bohadean @ Bohari

“…This problem can be minimized by using a Micro Genetic Algorithm approach. …”
Get full text
Get full text
Get full text

Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

“…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
Get full text
Get full text

A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

“…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text