Search Results - (( java implementation path algorithm ) OR ( _ selection problem algorithm ))

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…This technique has the problem of selecting a significant number of test cases even for small changes made to a software. …”
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
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

Fuzzy genetic algorithms for combinatorial optimisation problems by Varnamkhasti, Mohammad Jalali

“…The proposed sexual selection and the FGAs are applied to combinatorial optimization problems specifically to those involving selection problems. …”
Get full text
Get full text

Broadening selection competitive constraint handling algorithm for faster convergence by Shaikh, T.A., Hussain, S.S., Tanweer, M.R., Hashmani, M.A.

“…In this paper, a new algorithm incorporating broadening selection strategy in competitive constraint handling paradigm for finding the optimum solution in constrained problems has been proposed, referred as Broadening Selection Competitive Constraint Handling (BSCCH). …”
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 can find solutions to the team selection problem in many different areas. The problem solver needs to scan across a large array of available solutions during their search. …”
Get full text
Get full text

Improved Salp Swarm Algorithm based on opposition based learning and novel local search algorithm for feature selection by Tubishat, Mohammad, Idris, Norisma, Shuib, Liyana, Abushariah, Mohammad A.M., Mirjalili, Seyedali

“…An improved version of Salp Swarm Algorithm (ISSA) is proposed in this study to solve feature selection problems and select the optimal subset of features in wrapper-mode. …”
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

A Comparative Study on three Component Selection Mechanisms for Hyper-Heuristics in Expensive Optimization by Jia Hui Ong, Jason Teo

“…Numerous studies in optimization problems often lead to tailoring a specific algorithm to adapt to the problem instances, especially in expensive optimization problems. …”
Get full text
Get full text
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

Tourist Trip Design Problem with user preference and popularity: a case study of Langkawi Island / Nabilah Anuar Ahmad and Huda Zuhrah Ab. Halim by Anuar Ahmad, Nabilah, Ab. Halim, Huda Zuhrah

“…This study proposed enhancement in the greedy algorithm approach (Benjamin et al., 2019). A greedy algorithm solves a problem that selects the most appropriate option based on the current situation. …”
Get full text
Get full text

Static and self-scalable filter range selection algorithms for peer-to-peer networks by Kweh, Yeah Lun

“…Two multiple selection algorithm, which are known as “static filter range selection algorithm” and “self-scalable selection algorithm” are proposed. …”
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

Binary whale optimization algorithm with logarithmic decreasing time-varying modified sigmoid transfer function for descriptor selection problem by Yusof, Norfadzlia Mohd, Muda, Azah Kamilah, Pratama, Satrya Fajri, Carbo-Dorca, Ramon, Abraham, Ajith

“…The new Binary Whale Optimization Algorithm is integrated with wrapper feature selection and validated on descriptor selection problem to improve Amphetamine-type stimulants drug classification result. …”
Get full text
Get full text
Get full text

Metaheuristic algorithms for feature selection (2014–2024) by Faizan, Muhammad, Muhammad Arif, Mohamad

“…Metaheuristic algorithms are suited to provide solutions to feature selection problems because these problems are combinatorial and require an effective and efficient search through large solution spaces. …”
Get full text
Get full text
Get full text

Mutable composite firefly algorithm for gene selection in microarray based cancer classification by Fajila, Mohamed Nisper Fathima

“…This leads to the classification accuracy and genes subset size problem. Hence, this study proposed to modify the Firefly Algorithm (FA) along with the Correlation-based Feature Selection (CFS) filter for the gene selection task. …”
Get full text
Get full text

Multi-population kidney-inspired algorithm with migration policy selections for feature selection problems by Najmeh Sadat Jaddi, Salwani Abdullah, Say leng goh, Mohd Zakree Ahmad Nazri, Zalinda Othman, Mohammad Kamrul Hasan, Fatemeh Alvankarian

“…Experimental evaluations, conducted across 25 test functions and applied to 18 benchmark feature selection problems, demonstrate the efficacy of the proposed techniques. …”
Get full text
Get full text
Get full text