Search Results - (( java implementation path algorithm ) OR ( using solution approach algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    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. 2

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    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. 3

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    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. 4

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    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. 5
  6. 6

    A New Approach To The Solution Of Economic Dispatch Using Genetic Algorithm by Al-Shetwi, Ali Q., Alomoush, Muwaffaq I.

    Published 2016
    “…The main idea of this paper focuses on the application of genetic algorithm in order to identify the best solution to an economic dispatch problem by using a new approach depending on Bmn coefficients and arithmetic crossover of the genetic algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Multi-objective clustering algorithm using particle swarm optimization with crowding distance (MCPSO-CD) by Rashed, Alwatben Batoul, Hamdan, Hazlina, Mohd Sharef, Nurfadhlina, Sulaiman, Md Nasir, Yaakob, Razali, Abubakar, Mansir

    Published 2020
    “…However, MOPSO algorithm produces a group of non-dominated solutions which make the selection of an “appropriate” Pareto optimal or non-dominated solution more difficult. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8
  9. 9

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…This thesis presents an investigation of using the Intelligent Water Drops (IWD) algorithm to construct and produce good quality solutions for the UETP. …”
    thesis::doctoral thesis
  11. 11

    A New Hybrid Approach Based On Discrete Differential Evolution Algorithm To Enhancement Solutions Of Quadratic Assignment Problem by Asaad Shakir, Hameed, Mohd Aboobaider, Burhanuddin, Mutar, Modhi Lafta, Ngo, Hea Choon

    Published 2020
    “…The primary aim of this study is to propose a hybrid approach which combines Discrete Differential Evolution (DDE) algorithm and Tabu Search (TS) algorithm to enhance solutions of QAP model, to reduce the distances between the locations by finding the best distribution of N facilities to N locations, and to implement hybrid approach based on discrete differential evolution (HDDETS) on many instances of QAP from the benchmark. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

    Published 2012
    “…The aim of the proposed approach is to study the benefit of using visualization techniques to explorer Genetic Algorithm data based on gene values. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Solving the optimal power flow problems using the superiority of feasible solutions-moth flame optimizer by Alam, Mohammad Khurshed

    Published 2024
    “…Thus, the researchers trying to solve the OPF using metaheuristic approaches. Numerous algorithms have been put forth in the literature to address the aforementioned OPF challenges. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Parallel metaheuristic algorithm for route planning using CUDA by Looi, Daniel Jun Jie

    Published 2025
    “…This research aims to significantly speed up solution searching for the TSP by using GPUs compared to CPUs. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  15. 15

    Relative motion and autonomous rendezvous in Keplerian elliptic orbits by Okasha, Mohamed Elsayed Aly Abd Elaziz, Newman, Brett

    Published 2010
    “…Autonomous guidance algorithms to approach, to flyaround, and to depart from a target vehicle in elliptic orbits are exploited based on that solution. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  16. 16

    Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Chess tournament management system (scheduling module) by Lim, Jiin Kang

    Published 2005
    “…To solve the problem in utilizing the resources in a tournament, Genetic Algorithms approach has been used. Genetic Algorithms has been used as an approach in optimizing a solution.A scheduling system build using Genetic Algorithms is expected to produce a schedule that will utilize the usage of resources available.…”
    Get full text
    Get full text
    Undergraduates Project Papers
  18. 18

    Application of conjugate gradient approach for nonlinear optimal control problem with model-reality differences by Leong, Wah June, Sie, Long Kek, Teo, Kok Lay, Sim, Sy Yi

    Published 2018
    “…Here, the conjugate gradient approach is used to solve the modified model-based optimal control problem, where the optimal solution of the model used is calculated repeatedly, in turn, to update the adjusted parameters on each iteration step. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

    Application of conjugate gradient approach for nonlinear optimal control problem with model-reality difference by Sie, Long Kek, Wah, June Leong, Sy, Yi Sim, Kok, Lay Teo

    Published 2018
    “…Here, the conjugate gradient approach is used to solve the modified model-based optimal control problem, where the optimal solution of the model used is calculated repeatedly, in turn, to update the adjusted parameters on each iteration step. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    Loss reduction in distribution networks by network reconfiguration: a two stage solution approach by Nallagownden, Perumal

    Published 2004
    “…A general formulation of the network reconfiguration for loss minimization is given for optimization of distribution loss reduction and a solution approach is presented. The solution algorithm for loss minimization has been developed based on a two-stage solution methodology. …”
    Get full text
    Get full text
    Conference or Workshop Item