Search Results - (( using function method algorithm ) OR ( problem implementation search algorithm ))

Hybrid conjugate gradient methods using strong Wolfe line search for Whale Optimization Algorithm / Wan Nur Athirah Wan Mohd Zakirudin by Wan Mohd Zakirudin, Wan Nur Athirah

“…The nonlinear conjugate gradient (CG) method recently is the most used iterative methods for solving optimizing problems because it requires less storage and easy for implementation. …”
Get full text
Get full text

Comparative analysis of line search methods in the Steepest Descent algorithm for unconstrained optimization problems / Ahmad Zikri Shukeri, Puteri Qurratu Ain Megat Sulzamzamendi... by Shukeri, Ahmad Zikri, Megat Sulzamzamendi, Puteri Qurratu Ain, Ibrahim, Suhaida

“…This study focuses on "Comparative Analysis of Line Search Methods in SD Algorithm for Unconstrained Optimization Problems". …”
Get full text
Get full text

Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

“…This paper aims to compare the performance of two metaheuristic algorithms which are Jaya Algorithm (JA) and Cuckoo Search (CS) using some common benchmark functions. …”
Get full text
Get full text
Get full text
Get full text

Bees algorithm enhanced with Nelder and Mead method for numerical function optimisation by Kamaruddin, Shafie, Bahari, Muhammad Syahril, Pham, Duc Truong, Mohd Amin Hamzas, Mohd Fidzwan, Zakaria, S

“…In order to enhance its accuracy and convergence rate, it is proposed to employ the Nelder and Mead (NM) method to implement the local search phase of the algorithm. …”
Get full text
Get full text
Get full text
Get full text

Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

“…This means A • algorithm only calculates and consider the next node m path that has the lowest value of G and F, plus searching the shortest route by using heuristic estimation in Manhattan method. …”
Get full text
Get full text

A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

“…The implementations of the three methods to solve TSP show that the RTS algorithm provides a better solution in terms of minimizing the objective function while SA algorithm is less time consuming in solving problem with large number of cities.In conclusion, RTS is more effective in producing good quality solution and on the other hand, SA may be used to obtain instant results.…”
Get full text
Get full text
Get full text

An experience oriented-convergence improved gravitational search algorithm for minimum variance distortionless response beamforming optimum by Darzi S., Tiong S.K., Tariqul Islam M., Rezai Soleymanpour H., Kibria S.

Application of a primal-dual interior point algorithm using exact second order information with a novel non-monotone line search method to generally constrained minimax optimizatio... by Ahamad, Intan Salwani, Vassiliadis, Vassilios S.

“…This work presents the application of a primal-dual interior point method to minimax optimisation problems. The algorithm differs significantly from previous approaches as it involves a novel non-monotone line search procedure, which is based on the use of standard penalty methods as the merit function used for line search. …”
Get full text
Get full text
Get full text

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

“…The proposed population-based SKF algorithm and the single solution-based SKF algorithm use the scalar model of discrete Kalman filter algorithm as the search strategy to overcome these flaws. …”
Get full text
Get full text

Multi-objective service restoration in distribution networks using genetic algorithm by Moazami, Ehsan

“…This thesis presents a new approach of supply restoration service using the Genetic Algorithm. The GA is robust in searching a global optimal solution for the large-scale combinatorial optimization problems. …”
Get full text
Get full text

Identification of continuous-time model of hammerstein system using modified multi-verse optimizer by Most. Julakha, Jahan Jui

“…In particular, the search capacity of the MVO algorithm has been improved using the sine and cosine functions of the Sine Cosine Algorithm (SCA) that will be able to balance the processes of exploration and exploitation. …”
Get full text
Get full text

Enhanced gravitational search algorithm for nano-process parameter optimization problem / Norlina Mohd Sabri by Mohd Sabri, Norlina

“…Based on the capabilities of the metaheuristic algorithms, this research is proposing the enhanced Gravitational Search Algorithm (eGSA) to solve the nano-process parameter optimization problem. …”
Get full text
Get full text

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

“…The final problem is the ability of the algorithm to solve large-scale problems, which mostly are the real world problems. …”
Get full text
Get full text

Application of adaptive bats sonar algorithm to minimise car side impact design by Tan, Hon Seong

“…The best objective function was compared with the existing results of other swarm intelligence algorithms. …”
Get full text
Get full text
Get full text

Harmony search-based robust optimal controller with prior defined structure by Rafieishahemabadi, Ali

“…In this approach, a combination of interacting two levels HS optimization algorithm is presented. In the first level, a new method for analytical formulation of integral square error cost function based on controller variables is elaborated for performance evaluation purposes by the proposed optimization algorithm. …”
Get full text
Get full text

Network reconfiguration and control for loss reduction using genetic algorithm by Jawad, Mohamed Hassan Izzaldeen

“…Note that the 18-bus system is originally without any capacitor. Two selection methods that are used in Genetic Algorithm are the roulette wheel and tournament selections. …”
Get full text
Get full text

An improved particle swarm optimization based on lévy flight and simulated annealing for high dimensional optimization problem by Basath, Samar Salem, Ismail, Amelia Ritahani, Alwan, Ali Amer, Amir Hussin, Amir 'Aatieff

“…The proposed algorithm uses two strategies to address high-dimensional problems: hybrid PSO to define the global search area and fast simulated annealing to refine the visited search region. …”
Get full text
Get full text
Get full text

Combined heat and power (CHP) economic dispatch solved using Lagrangian relaxation with surrogate subgradient multiplier updates by Sashirekha A., Pasupuleti J., Moin N.H., Tan C.S.

“…Results prove that the algorithm is reliable and could be easily implemented even on a much complex and nonconvex problems. � 2012 Elsevier Ltd. …”

Global gbest guided-artificial bee colony algorithm for numerical function optimization by Shah, Habib, Tairan, Nasser, Garg, Harish, Ghazali, Rozaida

“…Recently, an attractive bio-inspired method—namely the Artificial Bee Colony (ABC)—has shown outstanding performance with some typical computational algorithms in different complex problems. …”
Get full text
Get full text

A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network by Gumaida, Bassam, Abubakar, Adamu

“…This novel optimization method is a direct search approach and is usually directed to solve nonlinear optimization problems that may not have well-known derivatives, and it is called the Nelder-mead Method (NMM). …”
Get full text
Get full text
Get full text
Get full text