Search Results - (( developing solving _ algorithm ) OR ( java implementation path algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- developing solving »
- path algorithm »
-
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. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
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
Bats echolocation-inspired algorithms for global optimisation problems
Published 2016“…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
Thesis -
6
Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman
Published 2012“…The hybrid algorithm is applied in prototype development where in process on solving Sudoku. …”
Get full text
Get full text
Thesis -
7
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“…Background and Objective: The process of solving the Maximum Clique (MC) problem through approximation algorithms is harder, however, the Maximum Vertex Cover (MVC) problem can easily be solved using approximation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Article -
8
Solving transcendental equation using genetic algorithm / Masitah Hambari
Published 2004“…This project studies the potential of using Genetic Algorithm and develops a program in order to solve Transcendental Equation in optimizing problem domain. …”
Get full text
Get full text
Thesis -
9
CSC126 - Fundamentals of Algorithms and Computer Problem Solving / Faculty of Computer And Mathematical Sciences
Published 2023“…In the end they are expected to develop the ability to analyze simple problems, organize effective algorithmic solutions for the problems and write computer programs to solve them.…”
Get full text
Get full text
Get full text
Teaching Resource -
10
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
Get full text
Get full text
Thesis -
11
New Generalized Algorithm for Developing k-Step Higher Derivative Block Methods for Solving Higher Order Ordinary Differential Equations
Published 2018“…This article presents a new generalized algorithm for developing k-step (m+1) derivative block methods for solving mth order ordinary differential equations. …”
Get full text
Get full text
Get full text
Article -
12
Mathematical models and optimization algorithms for low-carbon Location-Inventory-Routing Problem with uncertainty
Published 2024“…Given the NP-Hard nature of the three models proposed in this thesis, two metaheuristic algorithms have been developed. A hybrid Particle Swarm Optimization-Bacterial Foraging Algorithm is developed for solving the single objective LIRP model. …”
Get full text
Get full text
Get full text
Thesis -
13
Comparison Between Genetic Algorithm and Electromagnetism-Like Algorithm for Solving Inverse Kinematics
Published 2012“…A comparison study between Electromagnetism-Like Algorithm (EM) and Genetic Algorithm (GA)has been presented in this work to solve the Inverse Kinematics (IK) of a four-link planar robot manipulator. …”
Get full text
Get full text
Article -
14
Development of cell formation algorithm and model for cellular manufacturing system
Published 2011“…In addition, one of the main challenges has been development of efficient algorithm for solving aforementioned model to find exact feasible optimal solution. …”
Get full text
Get full text
Thesis -
15
Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
Published 2008“…Existing method, known as FDTD needs a very long processing time to solve this problem. The objective of the thesis is to develop new sequential and parallel algorithms that are faster than the standard Finite Difference Time Domain method. …”
Get full text
Get full text
Thesis -
16
Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee
Published 2015“…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
Get full text
Get full text
Thesis -
17
CSC118: Fundamentals of Algorithm Development / College of Computing, Informatics and Media
Published 2023“…This course will focus on algorithm development in problem solving. It will also introduce the students to the techniques of problem solving using modular approach. …”
Get full text
Get full text
Get full text
Teaching Resource -
18
Solving single machine scheduling problem with maximum lateness using a genetic algorithm
Published 2010“…We develop an optimised crossover operator designed by an undirected bipartite graph within a genetic algorithm for solving a single machine family scheduling problem, where jobs are partitioned into families and setup time is required between these families. …”
Get full text
Get full text
Get full text
Article -
19
Development of an improved Jellyfish Search (JS) algorithm for solving the optimal path problem of multi-robot collaborative multi-tasking in complex vertical farms
Published 2025“…The VFSMRCTP model is solved using the TLDW-JS algorithm and a number of comparison algorithms in order to analyze the algorithm’s performance. …”
Get full text
Get full text
Get full text
Article -
20
Improved Bat Algorithm for faster convergence in solving optimisation problem
Published 2021“…Therefore, this confirms the validity of the IBA as an alternative algorithm for solving optimisation problems.…”
Get full text
Get full text
Get full text
Thesis
