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

    Design Of Robot Motion Planning Algorithm For Wall Following Robot by Ali Hassan, Muhamad Khairul

    Published 2006
    “…Navigation algorithms are tested in a variety of differently shaped environments to encourage the development of robust solutions, and reduce the possibility of solutions based on memorization of a fixed set of movements. …”
    Get full text
    Get full text
    Monograph
  6. 6
  7. 7
  8. 8

    An Environmentally Energy Dispatch Using New Meta Heuristic Evolutionary Programming by Mohamad Ridzuan, Mohamad Radzi

    Published 2018
    “…Basically,one important issue in the power system network is to provide the optimal Economic Load Dispatch (ELD) solution in order to guarantee the sustainable consumer load demand.However,today ELD solution is essential to include together with the environmental aspect and known as Environmental Economic Load Dispatch (EELD).For that reason, many researchers continue in the development of new simulation tool specifically to overcome the EELD problems.Therefore,this study prepared an improved hybrid metaheuristic technique named as New Meta Heuristic Evolutionary Programming (NMEP) to provide the best possible solution in solving the identified single objective and multi objective functions for EELD solution.This new technique a merging cloning strategy that involved in an Artificial Immune System (AIS) algorithm into algorithm of Meta Heuristic Evolutionary Programming (Meta-EP).The development of NMEP technique is to minimize total cost,reduce the total emission during generator operation through the common formula in EELD and lowest total system loss.Besides that,all mentioned objective functions were also optimized together simultaneously that formulated using the weighted sum method before had been executed on the multi objective NMEP or called MONMEP.Both individual and multi objective NMEP techniques performance were verified among other two common heuristic methods known as AIS and Meta-EP techniques.In addition,the best possible solution defined using the aggregate function method.Through this method,the selection of the best MOEELD solution became effortless as compared with MO individually that required compare two or more objective function in one time manually.Among those three optimization techniques the lowest total aggregate values mostly resulted via the NMEP technique.Based upon that,the proposed technique is proving as the outstanding method compared with Meta-EP and AIS techniques in solving the EELD problem for both standard IEEE 26 bus and 57 bus systems.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Global and local convergence of a filter line search method for nonlinear programming. by Chin, Choong Ming, Abdul Rashid, Abdul Halim, Nor, Khaled Mohamed

    Published 2007
    “…The proposed methods solve a sequence of quadratic programming subproblems via line search techniques to induce global convergence. …”
    Get full text
    Get full text
    Article
  11. 11
  12. 12

    Restoration planning strategy of transmission system based on optimal energizing time of sectionalizing islands / Dian Najihah Abu Talib by Dian Najihah , Abu Talib

    Published 2019
    “…There are two discrete optimization techniques used in this work, which are the Artificial Bee Colony algorithm and Evolutionary Programming. Modification and simplification using parallel processing are done for both methods to grossly search the optimal solution and to minimize the program running time, respectively. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Indirect Feedback Kalman Filter Based Sensor Fusion for Reducing Navigation Errors of an Autonomous Wheelchair by Soh, Ying Wei

    Published 2018
    “…An autonomous wheelchair with facility for destination selection via a brain-computer interface or eye tracker would be a possible solution. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  14. 14
  15. 15
  16. 16
  17. 17

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…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
  18. 18
  19. 19

    Family of singly diagonally implicit block backward differentiation formulas for solving stiff ordinary differential equations by Saufianim, Jana Aksah

    Published 2021
    “…Performance of the methods are verified from the numerical results executed via the C++ programming by comparing them with existing methods of the same nature. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Counting roots of the Polynomial systems by using mixed volume of the Newton polytopes / Nur Suhailah Norazhar, Nur Ain Sofiya Zainuri and Nor Suhada Mohd Rosdi by Norazhar, Nur Suhailah, Zainuri, Nur Ain Sofiya, Mohd Rosdi, Nor Suhada

    Published 2024
    “…In addition, it is important to focus on addressing any potential factors that may affect the accuracy and reliability of root counting algorithms in computational programs like Maple. Collaboration among experts in the same field is essential for advancing computational tools in this domain. …”
    Get full text
    Get full text
    Student Project