Search Results - (( java implementation path algorithm ) OR ( problem during based algorithm ))
Search alternatives:
- java implementation »
- implementation path »
- path algorithm »
- problem during »
- during based »
-
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
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
Get full text
Get full text
Thesis -
3
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 -
4
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 -
5
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 -
6
-
7
-
8
A federated usage control framework with ontology-based policy and elimination of irrelevant rules set algorithm for grid computing authorization
Published 2019“…This thesis aims at providing solutions to the problem by introducing an authorization framework, namely the Federated Grid Usage Control (FGUC) with a new ontology-based policy model, namely, the UCON based Access Control Ontology (UBACO), and a new grid authorization algorithm, namely, the Elimination of the Irrelevant Authorization Rules Set (EIARS). …”
Get full text
Get full text
Thesis -
9
Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian
Published 2013“…As a comparative study, the performance of the algorithms was evaluated based on various standard metrics. …”
Get full text
Get full text
Thesis -
10
Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems
Published 2022“…To overcome these drawbacks and to achieve an appropriate percentage of exploitation and exploration, this study presents a new modified teaching learning-based optimization algorithm called the fuzzy adaptive teaching learning-based optimization algorithm. …”
Get full text
Get full text
Get full text
Article -
11
Angle Modulated Simulated Kalman Filter Algorithm for Combinatorial Optimization Problems
Published 2016“…In order to solve discrete optimization problems, the SKF algorithm is combined with an angle modulated approach. …”
Get full text
Get full text
Get full text
Get full text
Article -
12
Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems
Published 2011“…This thesis describes the development of an efficient algorithm for solving nonlinear stochastic optimal control problems in discrete-time based on the principle of model-reality differences. …”
Get full text
Get full text
Thesis -
13
Improved flower pollination optimization algorithm based on swap operator and dynamic switch probability selection
Published 2023“…Meta-heuristic algorithms have become popular in finding optimal solutions for nonlinear complex problems. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
14
Balancing exploration and exploitation in ACS algorithms for data clustering
Published 2019“…The ACOC performs clustering based on random initial centroids, which are generated iteratively during the algorithm run. …”
Get full text
Get full text
Get full text
Article -
15
Fuzzy genetic algorithms for combinatorial optimisation problems
Published 2012“…The Genetic Algorithms (GAs) have been very successful in handling optimization problems which are difficult. …”
Get full text
Get full text
Thesis -
16
Application of manta ray foraging optimization with gradient-based mutation (cMRFO) for solving power system problems
Published 2023“…In this paper, the Manta Ray Foraging Optimization (MRFO) algorithm is applied to solve real parameter constrained optimization problems, using the Gradient-based Mutation MRFO (cMRFO) variant. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
17
Gravitational search – bat algorithm for solving single and bi-objective of non-linear functions
Published 2018“…Later, this algorithm was used to solve bi-objective Production Planning (PP) and Scheduling Problem (Sch.P). …”
Get full text
Get full text
Thesis -
18
A multi-depot vehicle routing problem with stochastic road capacity and reduced two-stage stochastic integer linear programming models for rollout algorithm
Published 2021“…The proposed approach is suitable for obtaining a policy constructed dynamically on the go during the rollout algorithm. The rollout algorithm is part of the Approximate Dynamic Programming (ADP) lookahead solution approach for a Markov Decision Processes (MDP) framed Multi-Depot Dynamic Vehicle Routing Problem with Stochastic Road Capacity (MDDVRPSRC). …”
Get full text
Get full text
Article -
19
Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid
Published 2017“…However, HSA encountered a setback in which the convergence rate and accuracy of the obtained results are reduced because of the solutions in the population are eventually about the same during the final iterations. Thus, this thesis proposed hybrid algorithms between HSA and local search based methods (simulated annealing (SA) and/or great deluge (GD)) to enhance the HSA performance for solving curriculum-based course timetabling (CBCTT) problem which is the variant of UCTP. …”
Get full text
Get full text
Thesis -
20
Optimization and discretization of dragonfly algorithm for solving continuous and discrete optimization problems
Published 2024“…The trained network is then applied to benchmark classification problems. Based on the experimental results, the optimized DA algorithm is a much better training algorithm for ANNs as compared to the usual gradient-descent backpropagation algorithm since the resultant ANNs trained by the optimized DA achieve higher accuracy. …”
Get full text
Get full text
Thesis
