Search Results - (( java implementation path algorithm ) OR ( using problems a algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- path algorithm »
- using problems »
- a algorithm »
- problems a »
-
1
Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer
Published 2017“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. …”
Get full text
Get full text
Thesis -
2
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…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
Thesis -
3
Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment
Published 2021“…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
Article -
4
Smart appointment organizer for mobile application / Mohd Syafiq Adam
Published 2009“…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
Thesis -
5
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…The recent trend of software development uses OO paradigm. Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
Get full text
Get full text
Thesis -
6
Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
Published 2018“…The proposed method provides a platform to efficiently solve the MC problem by using approximation algorithm of Minimum Vertex Cover (MVC).…”
Get full text
Get full text
Get full text
Get full text
Article -
7
A discrete simulated kalman filter optimizer for combinatorial optimization problems
Published 2022“…Two types of analysis are used to evaluate the proposed algorithm. First, the DSKFO algorithm is used to solve the travelling salesman problem (TSP), and then the algorithm's execution time is measured. …”
Get full text
Get full text
Thesis -
8
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As a member of the NP Problem, an exact algorithm to solve the course scheduling problem is not available to date. …”
Get full text
Get full text
Get full text
Thesis -
9
Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
Published 2018“…In this research, a new hybrid algorithm of Harmony search and Jaya search algorithms applied on 0/1 Knapsack problem to find a near optimal results. …”
Get full text
Get full text
Get full text
Get full text
Article -
10
Comparison between ant colony and genetic algorithm using traveling salesman problem
Published 2013“…The aim of this study is compare the effect of using two distributed algorithm which are ant colony as a Swarm intelligence algorithm and genetic algorithm. …”
Get full text
Get full text
Get full text
Article -
11
A Micro-Genetic Algorithm Approach for Soft Constraint Satisfaction Problem in University Course Scheduling
Published 2013“…This problem can be minimized by using a Micro Genetic Algorithm approach. …”
Get full text
Get full text
Get full text
Thesis -
12
Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems
Published 2024“…Furthermore, the original DA is only suitable for solving continuous optimization problems. Although there is a binary version of the algorithm, it cannot be directly used for solving discrete optimization problems like the Traveling Salesman Problem (TSP). …”
Get full text
Get full text
Thesis -
13
A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali
Published 2012“…This approach presents better platform in finite field E as compared to the original works using the braid groups. The second algorithm deals with the use of Decomposition Problem in encryption scheme for ECC. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
14
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Applications and improvements to the HKA algorithm suggest that optimization algorithm based on estimation principle has a huge potential in solving a wide variety of optimization problems. …”
Get full text
Get full text
Thesis -
15
Bats echolocation-inspired algorithms for global optimisation problems
Published 2016“…The algorithm is a hybrid algorithm that operates using dual level search strategy that takes merits of a particle swarm optimisation algorithm and a modified adaptive bats sonar algorithm. …”
Get full text
Get full text
Thesis -
16
-
17
Bees algorithm for Forest transportation planning optimization in Malaysia
Published 2021“…Algorithm is widely used in various areas due to its ability to solve classes of problems. …”
Get full text
Get full text
Article -
18
Levy slime mould algorithm for solving numerical and engineering optimization problems
Published 2022“…The proposed Levy Slime Mould Algorithm (LSMA) is a novel metaheuristic algorithm that integrates the Levy distribution into a new metaheuristic called Slime Mould Algorithm (SMA) for solving numerical and engineering problems. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
19
A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm
Published 2010“…TSP is a representative of a large class of problems known as the combinatorial optimization problems. …”
Get full text
Get full text
Thesis -
20
Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation
Published 2013“…The MODPSO algorithm is tested with a wide range of problem difficulties for integrated single-model and mixed-model ASP and ALB problems. …”
Get full text
Get full text
Thesis