Search Results - (( a constructive path algorithm ) OR ( basic optimization method algorithm ))

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

“…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
Get full text
Get full text

A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

“…Path planning refers to a robot's search for a collision-free and optimal path from a start point to a predefined goal position in a given environment. …”
Get full text

A hybrid sampling-based path planning algorithm for mobile robot navigation in unknown environments by Khaksar, Weria

“…Sampling-based motion planning is a class of randomized path planning algorithms with proven completeness. …”
Get full text
Get full text

Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

“…Meanwhile, the proposed QOJaya algorithm produces better results than the basic Jaya method in terms of solution optimality and convergence speed. …”
Get full text
Get full text

Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text

Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

“…This study investigated the implementation and comparison between well known shortest path method which are Dijkstra’s algorithm, Bellman-Ford, and A* algorithm. …”
Get full text
Get full text

Performance comparison between genetic algorithm and ant colony optimization algorithm for mobile robot path planning in global static environment / Nohaidda Sariff by Sariff, Nohaidda

“…In the initial stage, the test environments were constructed. Subsequently, both algorithms were applied to the test environments. …”
Get full text
Get full text

Autonomous path planning robot using geographical information by Ismail Ishaq Ibrahim

Get full text

Wi-fi fingerprint database construction using Chebyshev wavelet functions by Narzullaev, Anvar, Nemadaliev, Azamjon, Selamat, Mohd Hasan, Othman, Mohamed, Sharif, Khaironi Yatim

“…Our algorithm requires only a few samples to be collected in a given region, and thus significantly reduces the calibration time. …”
Get full text
Get full text

An efficient algorithm to improve oil-gas pipelines path by Hasan Almaalei, Nabeel Naeem, Mohd Razali, Siti Noor Asyikin, Mohammed Alduais, Nayef Abdulwahab

“…Therefore, the aim of this study is to propose a new algorithm to obtain the shortest path connecting oil-gas wells and addressing obstacles that may appear on the path connecting any two wells. …”
Get full text

Data Analysis using Particle Swarm Optimization Algorithm by Tai, Zu Jie

Get full text
Get full text

Using Electromagnetism-like algorithm and genetic algorithm to optimize time of task scheduling for dual manipulators by Abed I.A., Sahari K.S.M., Koh S.P., Tiong S.K., Jagadeesh P.

“…A method based on Electromagnetism-Like algorithm (EM) and Genetic Algorithm (GA) is proposed to determine the time-optimal task scheduling for dual robot manipulators. …”

The impact of clustering on the average path length in wireless sensor networks by Aziz, A.A., Şekercioğlu, Y. A.

“…Clustering algorithms have been widely used in wireless sensor networks for virtual backbone construction. …”
Get full text
Get full text
Get full text

Shortest path from Bandar Tun Razak to Berjaya Times Square using Dijkstra Algorithm / Nur Syuhada Muhammat Pazil ... [et al.] by Muhammat Pazil, Nur Syuhada, Mahmud, Norwaziah, Jamaluddin, Siti Hafawati, Mustafa, Nur Farasyaqirra

“…Nevertheless, both time and cost of shortest path are constructed in different paths. The time and cost of the journey are described by driving a car from Bandar Tun Razak to Lebuhraya SMART to Kampung Pandan, then Berjaya Times Square. …”
Get full text
Get full text
Get full text

An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

“…This algorithm run in a software called Toolkit for Oracle (TORA) software. …”
Get full text
Get full text

Optimizing optimal path trace back for Smith-Waterman algorithm using structural modelling technique by Saliman, Nur Farah Ain

“…The optimizing of optimal path trace back system for Smith-Waterman algorithm using structural modelling techniques are presented in this paper. …”
Get full text
Get full text

Optimal QoS aware multiple paths web service composition using heuristic algorithms and data mining techniques by Qtaish, Osama Kayed Taher

“…However, when compositions contain more than one execution path (i.e., multiple path's compositions), it is difficult to generate a composite service that simultaneously optimizes all the execution paths involved in the composite service at the same time while meeting the QoS requirements. …”
Get full text
Get full text
Get full text
Get full text

Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction by Abasi, Ammar Kamal Mousa

“…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
Get full text
Get full text

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

“…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. …”
Get full text
Get full text

Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi by Mohd Rafi, Hafifi

“…There is several algorithms use in sequencing of DNA fragment. This paper presents a study on design and analysis of construction and recombination module using IduryWaterman algorithm and fragment assembly application using Verilog. …”
Get full text
Get full text