Search Results - (( problem solving selection algorithm ) OR ( java application optimized algorithm ))

Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

“…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
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

Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text

Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

“…An adaptive bats sonar algorithm is proposed for solving single objective optimisation problems. …”
Get full text
Get full text

Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text

A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems by Varnamkhasti, Mohammad Jalali, Lee, Lai Soon

“…Computational experiments are conducted on the proposed techniques and the results are compared with other genetic operators, heuristics, and local search algorithms commonly used for solving multidimensional 0/1 knapsack problems published in the literature.…”
Get full text
Get full text

Genetic Algorithm Performance with Different Selection Strategies in Solving TSP by Noraini, Mohd Razali, Geraghty, John

“…There are several ways for selection. This paper presents the comparison of GA performance in solving travelling salesman problem (TSP) using different parent selection strategy. …”
Get full text
Get full text

Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

“…We introduced a method that combines a compromise programming (CP) approach and metaheuristic algorithms, including the genetic algorithm (GA) and ant colony optimization (ACO), to solve the proposed optimization problem. …”
Get full text
Get full text

Optimization of blood vessel detection in retina images using multithreading and native code for portable devices by Tran, Duc Ngoc, Hussin, Fawnizu Azmadi, Yusoff, Mohd Zuki

Get full text
Get full text

Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

“…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
Get full text
Get full text

Evolutionary algorithm with roulette-tournament selection for solving aquaculture diet formulation by Abd Rahman, Rosshairy, Ramli, Razamin, Jamari, Zainoddin, Ku-Mahamud, Ku Ruhana

“…In this paper, a new selection operator is introduced for a real valued encoding problem, which specifically exists in a shrimp diet formulation problem.This newly developed selection operator is a hybrid between two well-known established selection operators: roulette wheel and binary tournament selection.A comparison of the performance of the proposed operator and the other existing operator was made for evaluation purposes.The result shows that the proposed roulette-tournament selection is better in terms of its ability to provide many good feasible solutions when a population size of 30 is used.Thus, the proposed roulette-tournament is suitable and comparable to established selection for solving a real valued shrimp diet formulation problem.The selection operator can also be generalized to any problems related to EA.…”
Get full text
Get full text
Get full text

Enhanced selection method for genetic algorithm to solve traveling salesman problem by Jubeir, Mohammed, Almazrooie, Mishal, Abdullah, Rosni

“…Genetic algorithms (GAs) have been applied by many researchers to get an optimized solution for hard problems such as Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Get full text

Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

“…In this research, we showed how evolutionary multi-objective algorithms can be used to solve the view selection problem and its advantage over classical optimization problems were described. …”
Get full text
Get full text

Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, Son Tung, Jaafar, Jafreezal, Izzatdin, Aziz Abdul, Tong, Giang Truong, Bui, Anh Ngoc

Get full text

Dengue classification system using clonal selection algorithm / Karimah Mohd by Mohd, Karimah

“…At this point, Artificial Immune System (AIS) is one of the inspired biology technique which provide effective solutions for optimization and classificaton problems. One of AIS Algorithm is Clonal Selection Algorithm (CSA) is to classify dengue disease is a suitable to solve classification problem in this project . …”
Get full text
Get full text

Optimization of mycelium growth using genetic algorithm for multi-objective functions by Muhamad Faiz, Abu Bakar

“…The nitrogen concentration and the mycelium extension rate of are two objectives problem that need to be solved. Through the implementation of selected multi-objective genetic algorithm, NSGA-ii was able to produce pareto front for optimizing both nitrogen concentration and the extension rate of the mycelium. …”
Get full text
Get full text
Get full text

Route Optimization System by Zulkifli, Abdul Hayy

“…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
Get full text
Get full text

Levy slime mould algorithm for solving numerical and engineering optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…Therefore, for solving the SMA algorithm local optima problem, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure. …”
Get full text
Get full text
Get full text

Levy tunicate swarm algorithm for solving numerical and real-world optimization problems by J. J., Jui, M. A., Ahmad, M. I. M., Rashid

“…Therefore, we used the Levy distribution rather than the conventional uniform distribution in the candidate selection procedure to solve the TSA algorithm local optima problem. …”
Get full text
Get full text
Get full text

Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem by Ismail, Ibrahim, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

“…Later, binary gravitational search algorithm (BGSA) is designed to solve discrete optimization problems. …”
Get full text
Get full text
Get full text
Get full text