Search Results - (( problem solving new algorithm ) OR ( java implication based algorithm ))

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

“…The new hybrid algorithm has been applied on different cases of Knapsack problem with different dimensions. 20 case studies have been evaluated by the new hybrid algorithm. …”
Get full text
Get full text
Get full text
Get full text

Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

“…Existing method, known as FDTD needs a very long processing time to solve this problem. The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
Get full text
Get full text

Barnacles mating optimizer : a new bio-inspired algorithm for solving engineering optimization problems by M. H., Sulaiman, Zuriani, Mustaffa, Mohd Mawardi, Saari, Hamdan, Daniyal

Get full text
Get full text
Get full text

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

“…Due to the practical significance of this problem in real-world issues, numerous algorithms have been proposed to solve it. …”
Get full text
Get full text

Barnacles mating optimizer: A new bio-inspired algorithm for solving engineering optimization problems by Mohd Herwan, Sulaiman, Zuriani, Mustaffa, Mohd Mawardi, Saari, Hamdan, Daniyal

Get full text
Get full text
Get full text

Formulating new enhanced pattern classification algorithms based on ACO-SVM by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…This paper presents two algorithms that integrate new Ant Colony Optimization (ACO) variants which are Incremental Continuous Ant Colony Optimization (IACOR) and Incremental Mixed Variable Ant Colony Optimization (IACOMV) with Support Vector Machine (SVM) to enhance the performance of SVM.The first algorithm aims to solve SVM model selection problem. …”
Get full text
Get full text
Get full text

The Evolutionary Convergent Algorithm: A Guiding Path of Neural Network Advancement by Hosseini E., Al-Ghaili A.M., Kadir D.H., Daneshfar F., Gunasekaran S.S., Deveci M.

“…Among these algorithms, metaheuristics are an appropriate tool to solve these real problems. …”

African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

“…This paper proposes a new meta-heuristic approach to solving numerical and graph-based problems. …”
Get full text
Get full text
Get full text

Hybrid tabu search – strawberry algorithm for multidimensional knapsack problem by Wong, Jerng Foong

“…Since then, it has been vastly applied to solve engineering problems. However, SBA has never been deployed to solve MKP. …”
Get full text
Get full text
Get full text

A Kalman Filter Approach for Solving Unimodal Optimization Problems by Zuwairie, Ibrahim, Nor Hidayati, Abdul Aziz, Nor Azlina, Ab. Aziz, Saifudin, Razali, Mohd Ibrahim, Shapiai, Sophan Wahyudi, Nawawi, Mohd Saberi, Mohamad

“…To evaluate the performance of the SKF algorithm in solving unimodal optimization problems, it is applied unimodal benchmark functions of CEC 2014 for real-parameter single objective optimization problems. …”
Get full text
Get full text
Get full text

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

“…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
Get full text
Get full text

A New Proposed Pendulum-Like with Attraction-Repulsion mechanism Algorithm for Solving Optimization Problems by Abed I.A., Koh S.P., Sahari K.S.M., Tiong S.K., Ali M.M., Abdul Kadhim A.A.

“…PA algorithm has been constructed with the purpose of solving inverse kinematics (IK) problem. …”

New fundamental theory in solving the royalty payment problem / Wan Noor Afifah Wan Ahmad and Suliadi Firdaus Sufahani by Wan Ahmad, Wan Noor Afifah, Sufahani, Suliadi Firdaus

“…This study aim to maximize the functional performance index of the non-classical Optimal Control problem. However, solving the problem, this project has to clarify a few constraints. …”
Get full text
Get full text

Development of optimization Alghorithm for uncertain non-linear dynamical system by Abdul Aziz, Mohd. Ismail, Yaacob, Nazeeruddin, Mohd. Said, Norfarizan, Hamzah, Nor Hazadura

“…This study succeeded in overcoming the problem of slow convergence and with the modifications, the new algorithms become more efficient in solving the optimal control problems.…”
Get full text
Get full text

Iterative methods for solving split common fixed point problems in Hilbert spaces by Mohammed, Lawan Bulama

“…Our interest here is to apply these mappings to propose some algorithms for solving split common fixed point problems and its variant forms, in the end, we prove the convergence results of these algorithms. …”
Get full text
Get full text
Get full text

Harmony great deluge for solving curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable.An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems.The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research.This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems.The algorithm can be adapted to the problem.Results were not comparatively better than those previously known as best solution.Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text
Get full text
Get full text

Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review by See, Phen Chiak, Wong, Kuan Yew

“…In addition, the various ACO algorithms or variants developed to solve them are critically analysed and discussed. …”
Get full text
Get full text

Leader election algorithm in 2D torus networks with the presence of one link failure by Refai, M., Sharieh, A., Alshammari, F.

“…Leader election algorithms solve the instability problem in the network which is caused by leader failure. …”
Get full text

The algorithms of Broyden-CG for unconstrained optimization problems by Mustafa, Mamat, Mohd Asrul Hery, Ibrahim, Leong Wah, June

“…Therefore, in this paper, the new hybrid method between the conjugate gradient method and the quasi-newton method for solving optimization problem is suggested. …”
Get full text
Get full text

Exploring fruit fly evolutionary algorithm in a university examination timetabling environment by Abdul Rahman, Syariza, Benjamin, Aida Mauziah, Ramli, Razamin, Ku-Mahamud, Ku Ruhana, Omar, Mohd Faizal

“…It is a method that is still limited in optimization and artificial intelligence area for finding global optimization. We use FOA for solving the problem and introduce new neighborhood structures related with median difficult exams to suit with the problem solving. …”
Get full text
Get full text
Get full text