Search Results - (( initial solving based algorithm ) OR ( parallel optimization path algorithm ))

Tool path generation of contour parallel based on ant colony optimisation by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

“…An Ant Colony Optimisation (ACO) method is used to optimize the tool path length because of its capability to find the shortest tool path length. …”
Get full text
Get full text

Minimizing machining airtime motion with an ant colony algorithm by Abdullah, Haslina, Ramli, Rizauddin, Abd Wahab, Dzuraidah, Abu Qudeiri, Jaber

Get full text
Get full text

OPTIMAL DATAPATH DESIGN FOR A CRYPTOGRAPHIC PROCESSOR: THE BLOWFISH ALGORITHM by Zain Ali, Noohul Basheer, Noras, James

Get full text
Get full text

Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

“…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

“…This indicates the capability of the algorithm in exploring the search space. The 2S-ENDSHHMO algorithm can be used to improve the search process of other MOSI-based algorithms and can be applied to solve MOPs in applications such as structural design and signal processing.…”
Get full text
Get full text
Get full text
Get full text

Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

“…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. …”
Get full text
Get full text
Get full text

A firefly algorithm based hybrid method for structural topology optimization by Gebremedhen, H.S., Woldemichael, D.E., Hashim, F.M.

“…The lower and upper limit of design variables (0 and 1) were used to find initial material distribution to initialize the firefly algorithm based section of the hybrid algorithm. …”
Get full text
Get full text

Solving Assembly Line Balancing Problem Using Genetic Algorithm With Heuristics-Treated Initial Population by Chong, Kuan Eng, Omar, Mohamed K, Abu Bakar, Nooh

Get full text
Get full text
Get full text

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

“…However, the HKA algorithm has its own flaws. Although it was introduced as a population-based stochastic optimization algorithm, HKA is not exactly a population-based algorithm because it initializes and updates only a single solution. …”
Get full text
Get full text

Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences by Adnan Ashraf, Sobia Pervaiz, Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Ag. Ibrahim, Joel J. P. C. Rodrigues, Danda B. Rawat

“…To solve different kinds of optimization challenges, meta-heuristic algorithms have been extensively used. …”
Get full text
Get full text
Get full text
Get full text
Get full text

An enhanced opposition-based firefly algorithm for solving complex optimization problems by Ling, Ai Wong, Hussain Shareef, Azah Mohamed, Ahmad Asrul Ibrahim

Get full text
Get full text
Get full text

Performance comparison of linear and non-linear great deluge algorithms in solving university course timetabling problems by Joe Henry Obit, Yik Junn Kuan, Rayner Alfred

“…This research does not focus on hard constraints involved as the initial solution is solved based on Constraint Programming algorithm. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Finite impulse response optimizers for solving optimization problems by Tasiransurini, Ab Rahman

“…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

“…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
Get full text
Get full text
Get full text

Efficiency of heuristic algorithms in solving waste collection vehicle routing problem: a case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza

“…This paper investigated the efficiency of six heuristic algorithms from prior studies in the attempt to solve issues related to waste collection, namely: (i) Nearest Greedy (NG), (ii) Further from Depot (FFD), (iii) Different Initial Customer (DIC), (iv) Savings Approach, (v) Sweep Algorithm, and (vi) Different Initial Customer based on Sweep Algorithm. …”
Get full text
Get full text
Get full text

Finite impulse response optimizers for solving optimization problems by Ab Rahman, Tasiransurini

“…The classification of estimation-based metaheuristic algorithms has been introduced for solving optimization problems. …”
Get full text
Get full text

A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

“…This study investigates a variant of Fisher and Jaikumar algorithm owning to solve CVRP efficiently. In the proposed method clusters form such a way that each cluster cone contains equal number of nodes. …”
Get full text
Get full text
Get full text
Get full text

Harmony Search-Based Fuzzy Clustering Algorithms For Image Segmentation by Alia, Osama Moh’d Radi

“…This thesis aims to solve these problems using an efficient metaheuristic algorithm, known as the Harmony Search (HS) algorithm. …”
Get full text
Get full text

Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

“…In this paper we used DIRK methods which are specifically designed for parallel execution to solve a set of initial value problems. Numerical results based on the sequential and parallel modes are tabulated and compared, which shows the advantage of the algorithms based on the parallel mode.…”
Get full text
Get full text

A genetic algorithm for solving single level lotsizing problems by Zenon, Nasaruddin, Ahmad, Ab. Rahman, Ali, Rosmah

“…In this paper a genetic algorithm for solving single level lot-sizing problems is proposed and the results of applying the algorithm toexample problems are discussed. …”
Get full text
Get full text