Search Results - (( basic optimization path algorithm ) OR ( data classification 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

Ant colony algorithm for text classification in multicore-multithread environment / Ahmad Nazmi Fadzal by Fadzal, Ahmad Nazmi

“…ACO classification accuracy is compared to Genetic Algorithm classifier which also a wrapper method. …”
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

Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

“…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. The proposed technique is able to find a least spent travel time path between two nodes in a bus network with time-dependence.Graph algorithm is used to generate all possible paths to reveal the distances.Classification technique is then used to analysis traffic situation in different period of the time.By analysis traffic situation, date, time, week, month, location are used as a main factor for training process in classification technique.From the experimental studies, the proposed technique is able to show the best route from any given node to the final destination depending on the different period of the time.The proposed technique provides significant benefit for traveler to select the best bus route, which is short distance and fast, among generated routes…”
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

Whale Optimisation Freeman Chain Code (WO-FCC) extraction algorithm for handwritten character recognition by Muhammad Arif, Mohamad, Jamaludin, Sallim, Kohbalan, Moorthy

“…Finally, the results were compared with the existing proposed Flower Pollination Algorithm (FPA) at the time of FCC extraction. The results show that WOA is a bit better at getting shorter path lengths than FPA in terms of path lengths. …”
Get full text
Get full text
Get full text

Developing and validating a simulation model for counting and classification of vehicles by Ali Emad Jehad, Riza Atiq O.K. Rahmat

“…An algorithm system approach has been presented for extracting traffic data using video image processing. …”
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

Applying SAX-based time series analysis to classify EEG signal using a COTS EEG device by Shanmuga, Pillai A/L Murutha Muthu

“…The main motivation of this study is to find out techniques that may improve EEG signal classification. SAX algorithm may bring improvement to classic time series classification, so we investigate it`s impact on EEG signal classification. …”
Get full text