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

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

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

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

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

“…Two main improvements were included into the original SSA algorithm to alleviate its drawbacks and adapt it for feature selection problems. …”
Get full text
Get full text

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

“…The works related to swarm intelligence algorithms include the development of the algorithm itself, its modification and improvisation as well as its application in solving global optimisation problems. …”
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

Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

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.

“…The team selection problem has become more complicated in order to achieve multiple goals in its decision-making process. …”
Get full text
Get full text

Improved flower pollination optimization algorithm based on swap operator and dynamic switch probability selection by Iqbal, Muhammad

Get full text
Get full text
Get full text
Get full text

Adaptive differential evolution algorithm with fitness based selection of parameters and mutation strategies / Rawaa Dawoud Hassan Al-Dabbagh by Rawaa Dawoud Hassan, Al-Dabbagh

“…The performance of DE algorithm depends heavily on the selected mutation strategy and its associated control parameters. …”
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

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

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

A Negative Selection Algorithm For University Examination Timetabling. by Malim, Muhammad Rozi, Khader, Ahmad Tajudin, Mustafa, Adli

Get full text
Get full text

A hybrid particle swarm optimization approach and its application to solving portfolio selection problems by Shamshul Bahar, Yaakob, Prof. Madya, Watada, Junzo

Get full text

Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

“…The CDRQ Routing Algorithm provides a solution to the problem addressed above by integrating the advantages of CQ Routing Algorithm and Dual Reinforcement Learning. …”
Get full text
Get full text

Improved Manta Ray Foraging Optimizer-based SVM for Feature Selection Problems: A Medical Case Study by Got, Adel, Zouache, Djaafar, Moussaoui, Abdelouahab, Laith, Abualigah *, Alsayat, Ahmed

“…The experimental results show the high ability of the proposed algorithm to find the appropriate SVM’s parameters, and its acceptable performance to deal with feature selection problem.…”
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