Search Results - (( developing new solution algorithm ) OR ( java implementation path 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

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…New young queens are produced by the colony that migrates to establish new colonies after local optimum solution reached to start new local search. …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem by Hasan, Mohammad Khatim

    Published 2008
    “…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
  11. 11

    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

    Published 2015
    “…In this paper, a new algorithm is developed and the performances as well as the quality of the solution were evaluated against large scale test problems. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    An algorithm for positive solution of boundary value problems of nonlinear fractional differential equations by Adomian decomposition method by A. I., Md. Ismail, Hytham. A., Alkresheh

    Published 2016
    “…In this paper, an algorithm based on a new modification, developed by Duan and Rach, for the Adomian decomposition method (ADM) is generalized to find positive solutions for boundary value problems involving nonlinear fractional ordinary differential equations. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14
  15. 15

    Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks by Raja Mohd Auzar, Tengku Dian Shahida

    Published 2009
    “…Extended from the FastZ algorithms, another three new algorithms called the FastRLP, BRLP and FastBRLP algorithms are developed to achieve different performance goals. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    i-Saturate: The New Discovery of Stopping Criterion in Genetic Algorithm by Foo, Fong Yeng, Suhaimi, Azrina, Soo, Kum Yoke

    Published 2020
    “…A stopping criterion for evolutionary algorithms like Genetic Algorithm (GA) is crucial in determining the optimum solution. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Parallel block methods for solving higher order ordinary differential equations directly by Omar, Zurni

    Published 1999
    “…Hence, the development of parallel algorithms to suit these machines becomes essential. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20