Search Results - (( initial solution methods algorithm ) OR ( variable generation based algorithm ))

Variable Neighbourhood Search Algorithm for Vehicle Routing Problem with Backhaul by Siaw Ying Doreen, Sek

“…A simple priority heuristic rule is developed in the first phase to generate the initial dataset solution for each benchmark instance. …”
Get full text
Get full text
Get full text
Get full text

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

“…In general, genetic based clustering algorithms showed the ability to reach near global optimal solution. …”
Get full text
Get full text

Optimizing Decentralized Exam Timetabling with a Discrete Whale Optimization Algorithm by Emily Siew, Sing Kiang, Sze, San Nah, Goh, Say Leng

“…Then, several search methods were employed for comparison during the improvement phase, including three Variable Neighborhood Descent (VND) variations and two modified WOA algorithms employing five distinct neighborhoods. …”
Get full text
Get full text
Get full text

Optimizing decentralized exam timetabling with a discrete whale optimization algorithm by Emily Sing Kiang Siew, San nah sze, Say leng goh

“…Then, several search methods were employed for comparison during the improvement phase, including three Variable Neighborhood Descent (VND) variations and two modified WOA algorithms employing five distinct neighborhoods. …”
Get full text
Get full text
Get full text

Axis manipulation to solve Inverse Kinematics of Hyper-Redundant Robot in 3D Space by Annisa, Jamali, Sheldon Ijau, Winston

“…In this study, an axis manipulation using a geometrical approach is used. Initially, a general algorithm for a 2-m-link hyper-redundant robot in 3D is generated. …”
Get full text
Get full text
Get full text
Get full text

Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

“…Most practical discrete-valued optimal control problems have multiple local minima and thus require global optimization methods to generate practically useful solutions. …”
Get full text
Get full text
Get full text

A proactive fuzzy-guided link labeling algorithm based on MIH framework in heterogeneous wireless networks by Salih Y.K., See O.H., Yussof S., Iqbal A., Mohammad Salih S.Q.

“…This paper proposes a proactive fuzzy-guided algorithm with dynamic links triggering for vertical handover initiation based on the neighbor network information from the information server of MIH. …”

Variable Neighborhood Descent and Whale Optimization Algorithm for Examination Timetabling Problems at Universiti Malaysia Sarawak by Emily Sing Kiang, Siew

“…A constructive algorithm was developed to generate an initial feasible solution, which was subsequently refined using two primary approaches to evaluate their efficiency: Iterative Threshold Pipe Variable Neighborhood Descent (IT-PVND), and a modified Whale Optimization Algorithm (WOA). …”
Get full text
Get full text
Get full text
Get full text

New classes of block backward differentiation formula for solving stiff initial value problems by Musa, Hamisu

“…The BDF still remain a foundation for most widely used algorithms. In this thesis, new classes of block methods are developed for the solution of sti® initial value problems. …”
Get full text
Get full text

Operational matrix based on orthogonal polynomials and artificial neural networks methods for solving fractal-fractional differential equations by Shloof, Aml Melad Asan

“…Initially, the algorithm utilized a truncated series. …”
Get full text
Get full text
Get full text

Partitioning techniques and their parallelization for stiff system of ordinary differential equations by Othman, Khairil Iskandar

“…A new code based on variable order and variable stepsize component wise partitioning is introduced to solve a system of equations dynamically. …”
Get full text
Get full text

Clustering ensemble learning method based on incremental genetic algorithms by Ghaemi, Reza

“…In addition, experiments prove that incremental genetic-based clustering ensemble algorithm speed up to converge into an optimal clustering solution, where pattern ensemble learning method and the cluster partitions produced by the threshold fuzzy c-means clustering algorithm are employed as recombination operator and initial population, respectively.…”
Get full text
Get full text

Multistage optimal homotopy asymptotic method for solving initial-value problems by Anakira, N. R., Alomari, A. K., Jameela, Ali, Hashim, Ishak

“…In this paper, a new approximate analytical algorithm namely multistage optimal homotopy asymptotic method (MOHAM) is presented for the first time to obtain approximate analytical solutions for linear, nonlinear and system of initial value problems (IVPs).This algorithm depends on the standard optimal homotopy asymptotic method (OHAM), in which it is treated as an algorithm in a sequence of subinterval. …”
Get full text
Get full text
Get full text

Combining approximation algorithm with genetic algorithm at the initial population for NP-complete problem by Razip, H., Zakaria, M.N.

“…In Genetic Algorithm (GA), the prevalent approach to population initialization are heuristics and randomization. …”
Get full text
Get full text

Initialization Methods For Conventional Fuzzy C-Means And Its Application Towards Colour Image Segmentation by Tan , Khang Siang

“…Due to its capability in providing a particularly promising solution to clustering problems, the conventional Fuzzy C-Mean (FCM) algorithm is widely used as a segmentation method. …”
Get full text
Get full text

Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation by Bahomaid, Ameen A., Alsewari, Abdulrahman A., Zamli, Kamal Z., Alsariera, Yazan A.

“…This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. …”
Get full text
Get full text
Get full text

Comparison between Newton’s Method and a new Scaling Newton Method / Ramizah Baharuddin by Baharuddin, Ramizah

“…Newton's Method also called the Newton-Raphson method is a recursive algorithm for approximating the root of a differentiable function. …”
Get full text
Get full text

Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

“…This method involves guessing initial conditions and iteratively adjusting them until the solution satisfies the boundary conditions at the other end of the domain. …”
Get full text
Get full text

Message based random variable length key encryption algorithm. by Mirvaziri, Hamid, Jumari, Kasmiran, Ismail, Mahamod, Mohd Hanapi, Zurina

“…In order to overcome analysis mentioned above a new algorithm is designed that is based on random numbers and also can defeat time and memory constraints. …”
Get full text
Get full text

Enhancing the RC4 algorithm by eliminating the Initiative Vector (IV) transmission by Waleed Abdelrahman Yousif Mohammed, Salmah Fattah, Khalid Mohammed Osman Saeed, Ashraf Osman Ibrahim Elsayed, Safaa Eltahier

“…This paper introduces an innovative approach to address the vulnerabilities of the RC4 encryption algorithm by employing an Initiative Vector (IV). The proposed method incorporates a lengthy random text without transmitting an initialization vector. …”
Get full text
Get full text
Get full text