Search Results - (( using discretization _ algorithm ) OR ( using optimization method algorithm ))

Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems by Bibi Amirah Shafaa, Emambocus

“…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
Get full text
Get full text

Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

“…We propose a novel modification to the PSO algorithm to perform rapid discrete optimization. The proposed Discrete-PSO method (DPSO) uses a rescaling equation to convert the continuous-valued positions into discrete-valued variables. …”
Get full text
Get full text

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

“…Due to the limitation of the SKF algorithm which only able to operate in continuous search space, the proposed algorithm makes use of a new interpretation that incorporates mutation and Hamming distance, allowing the proposed algorithm to function in discrete search space. …”
Get full text
Get full text

SA-EVPS ALGORITHM FOR DISCRETE SIZE OPTIMIZATION OF THE 582-BAR SPATIAL TRUSS STRUCTURE by Paknahad, M., Hosseini, P., Hakim, S.J.S

“…Nowadays, approximate optimization methods are widely used. This study utilized the Self Adaptive Enhanced Vibrating Particle System (SA-EVPS) algorithm as an approximate optimization method, since the EVPS algorithm requires experimental parameters. …”
Get full text
Get full text

A modified discrete filled function algorithm for solving nonlinear discrete optimization problems by Woon, Siew Fang, Rehbock, Volker, Loxton, Ryan

“…The discrete filled function method is a global optimization tool for searching for best solution amongst multiple local optima.This method has proven useful for solving large-scale discrete optimization problems.In this paper, we consider a standard discrete filled function algorithm in the literature and then propose a modification to increase its efficiency.…”
Get full text
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

“…In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
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

“…—In recent years, there has been increasing interest in intelligent optimization algorithms, such as the Whale Optimization Algorithm (WOA). …”
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

“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text

Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

“…This study seeks to solve this problem using Artificial Bee Colony (ABC) Algorithm along with the proposed Discrete Nearest Neighborhood Algorithm (DNNA). …”
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

“…These problems are known as discrete-valued optimal control problems. 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

Assisted History Matching by Using Genetic Algorithm and Discrete Cosine Transform by Abdul Rashid, Abdul Hadi

“…Next, fluid flow equations were derived to obtain the forward model and eventually, the objective function. Later, an algorithm combining both Genetic Algorithm and Discrete Cosine Transform was proposed, which shows the step-by-step sequence of both methods. …”
Get full text
Get full text

Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

“…The experimentations of the proposed algorithm are conducted using existing benchmark instances and a published case study on an energy-efficient job-shop model. …”
Get full text
Get full text
Get full text
Get full text

Optimization Of Bar Linkage By Using Genetic Algorithms by Ramasamy, Mugilan

“…This thesis presents the method of using simple Genetic Algorithms (GAs) in optimizing the size of bar linkage with discrete design variables and continues design variables. …”
Get full text
Get full text

Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

“…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
Get full text
Get full text

Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

“…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
Get full text
Get full text

Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

“…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
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

“…Optimization of several truss structures (2D and 3D) with discrete variables were carried out using the proposed methods and the results and computational performances were compared with several well-known metaheuristic algorithms. …”
Get full text
Get full text

A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem by Asaad Shakir, Hameed, Mohd Aboobaider, Burhanuddin, Mutar, Modhi Lafta, Ngo, Hea Choon

“…The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. …”
Get full text
Get full text
Get full text

Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, Hishamuddin, Abd. Samad, M. F., Ahmad, Robiah, Yaacob, M. S.

“…The genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
Get full text
Get full text

Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, H., Samad, M. F. A., Ahmad, R., Yaacob, M. S.

“…he genetic algorithm approach is widely recognized as an effective and flexible optimization method for system identification. …”
Get full text
Get full text