Search Results - (( using optimization problem algorithm ) OR ( using function ((a algorithm) OR (new algorithm)) ))

Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions by Abbas, Iraq Tareq

“…The second technique is to solve bi-objective functions by using the BOBAT algorithm. The third technique is an integration of BOGSA with BOBAT to produce a BOGSBAT algorithm. …”
Get full text
Get full text

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

“…However, these extensions may result in increased execution times for the algorithm. In this research, a new combinatorial algorithm named discrete simulated Kalman filter optimizer (DSKFO) is proposed to solve combinatorial optimization problem. …”
Get full text
Get full text

Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text

New random approaches of modified adaptive bats sonar algorithm for reservoir operation optimization problems by Nor Shuhada, Ibrahim

“…The increasing interest among researchers in the application of metaheuristic algorithms for search optimization has resulted in notable progress, especially in tackling single objective optimization problems. …”
Get full text
Get full text

Transform of Artificial Immune System algorithm optimization based on mathematical test function by Yaw M.W., Chong K.H., Kamil K.

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

Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
Get full text
Get full text
Get full text

Comparative Performance Analysis of Bat Algorithm and Bacterial Foraging Optimization Algorithm using Standard Benchmark Functions by Mazlina, Abdul Majid, Alsariera, Yazan A., Alamri, Hammoudeh S., Nasser, Abdullah M., Kamal Z., Zamli

“…Owing to the fact that they are new and much of their relative performance are still unknown (as compared to other established meta-heuristic algorithms), Bacterial Foraging Optimization Algorithm (BFO) and Bat Algorithm (BA) have been adopted for comparison using the 12 selected benchmark functions. …”
Get full text
Get full text

Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…The proposed Levy Tunicate Swarm Algorithm (LTSA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic algorithm called Tunicate Swarm Algorithm (TSA) to solve numerical and real-world optimization problems. …”
Get full text
Get full text
Get full text

Cuckoo search algorithm and wind driven optimization based study of satellite image segmentation for multilevel thresholding using Kapur’s entropy by Bhandari, A.K., Singh, V.K, Kumar, A., Singh, G.K.

“…A new approach of CS and WDO algorithm is used for selection of optimal threshold value. …”
Get full text
Get full text

Enhancing three variants of harmony search algorithm for continuous optimization problems by Alomoush, Alaa A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alrosan, Ayat, Alomoush, Waleed, Alissa, Khalid

“…A convergence rate graph is also used to show the overall performance of the new algorithms.…”
Get full text
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.

Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems by Zulkifli, Munierah, Abd Rahmin, Nor Aliza, Wah, June Leong

“…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
Get full text
Get full text
Get full text

Development and applications of metaheuristic algorithms in engineering design and structural optimization / Ali Sadollah by Ali, Sadollah

“…In this thesis, the applications of a number of well-known metaheuristic algorithms for solving engineering problems have been considered. …”
Get full text
Get full text

Binary whale optimization algorithm with logarithmic decreasing time-varying modified sigmoid transfer function for descriptor selection problem by Yusof, Norfadzlia Mohd, Muda, Azah Kamilah, Pratama, Satrya Fajri, Carbo-Dorca, Ramon, Abraham, Ajith

“…This work introduced a new Binary Whale Optimization Algorithm, which utilized a novel time-varying modified Sigmoid transfer function with a modified logarithmic decreasing time-varying update strategy to improve the balancing of exploration and exploitation in WOA. …”
Get full text
Get full text
Get full text

A novel nonlinear time‑varying sigmoid transfer function in binary whale optimization algorithm for descriptors selection in drug classifcation by Mohd Yusof, Norfadzlia, Muda, Azah Kamilah, Pratama, Satrya Fajri, Abraham, Ajith

“…A new BWOA algorithm, namely BWOA-3, is introduced to solve the descriptors selection problem, which becomes the second contribution. …”
Get full text
Get full text
Get full text

Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

“…This thesis focuses on the development of a new stream of crossover within genetic algorithms, called Optimised Crossover Genetic Algorithm (OCGA) for solving combinatorial optimisation problems, which takes into account the objective function in finding the best ofspring solution among an exponentially large number of potential ofspring. …”
Get full text
Get full text

New heuristic function in ant colony system for the travelling salesman problem by Alobaedy, Mustafa Muwafak, Ku-Mahamud, Ku Ruhana

“…However, one part of the algorithm, called heuristic function, is not updated at any time throughout the process to reflect the new information discovered by the ants.This paper proposes an Enhanced Ant Colony System algorithm for solving the Travelling Salesman Problem.The enhanced algorithm is able to generate shorter tours within reasonable times by using accumulated values from pheromones and heuristics.The proposed enhanced ACS algorithm integrates a new heuristic function that can reflect the new information discovered by the ants. …”
Get full text
Get full text
Get full text

Simulated Kalman Filter: A Novel Estimation-based Metaheuristic Optimization Algorithm by Zuwairie, Ibrahim, Nor Hidayati, Abd Aziz, Nor Azlina, Ab. Aziz, Saifudin, Razali, Mohd Saberi, Mohamad

“…In this paper, a new population-based metaheuristic optimization algorithm, named Simulated Kalman Filter (SKF) is introduced. …”
Get full text
Get full text
Get full text

Optimal power flow using the Jaya algorithm by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

“…This paper presents application of a new effective metaheuristic optimization method namely, the Jaya algorithm to deal with different optimum power flow (OPF) problems. …”
Get full text
Get full text
Get full text