Search Results - (( using selection problem algorithm ) OR ( basic optimization path algorithm ))

Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

“…The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
Get full text
Get full text

Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

“…The algorithm used in this project is the Global Best (gbest) algorithm where it is a basic algorithm of Particle Swarm Optimization which applicable the shortest time and path of CNC machine to complete the process of drilling. …”
Get full text
Get full text

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah

“…To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. …”
Get full text
Get full text
Get full text

Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm by Machmudah A., Parman S., Abbasi A., Solihin M.I., Manan T.S.A., Beddu S., Ahmad A., Rasdi N.W.

Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim by Hashim, Siti Zuraifah

“…It makes use of three basic operations in order to optimize this problem. …”
Get full text
Get full text

Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

“…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
Get full text
Get full text
Get full text
Get full text

Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

“…This study shows that Basic Theta* is able to produce the true shortest path compared to A* which produced slightly longer path. …”
Get full text
Get full text

Genetic algorithm optimization for coefficient of FFT processor by Pang, Jia Hong, Sulaiman, Nasri

Get full text
Get full text
Get full text

Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

“…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
Get full text
Get full text
Get full text

Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

“…However, the planned path by using basic RRT structure might not always be optimal in terms of path length. …”
Get full text
Get full text
Get full text

Embedding Malaysian House Red Ant Behavior into an Ant Colony System by Ali Othman, Zulaiha, Md Rais, Helmi, Hamdan, Abdul Razak

“…Problem statement: Ant Colony System (ACS) is the most popular algorithm used to find a shortest path solution in Traveling Salesman Problem (TSP). …”
Get full text
Get full text

Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

“…As a route improvement strategy, two heuristics which are the swap among routes procedure and 3-opt algorithm are also employed within the ASH algorithm. …”
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

“…The proposed algorithm has been better than basic ABC in all tested problems with average of 0.570%.…”
Get full text
Get full text
Get full text

An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

“…Since there is no known polynomial-time algorithm for solving large scale TSP, metaheuristic algorithms such as Ant Colony Optimization (ACO), Bee Colony Optimization (BCO), and Particle Swarm Optimization (PSO) have been widely used to solve TSP problems through their high quality solutions. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Modeling and control of a Pico-satellite attitude using Fuzzy Logic Controller by Zaridah, Mat Zain

“…The performances obtained show that the optimized APFLC is better than the non-optimize APFLC in terms of RMSE and the settling time.…”
Get full text

Development of high speed booth multiplier with optimized stuck-at fault implementation by Mohammed Khalid, Muhammad Nazir, Wan Hasan, Wan Zuha, Sulaiman, Nasri, Wagiran, Rahman

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

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

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

“…Some popular intelligent techniques like Genetic Algorithm, Fuzzy Logic and Artificial Neural Network are often used by reasearcher to perform classifcation 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