Search Results - (( java implementation path algorithm ) OR ( solving problems faced algorithm ))

Search alternatives:

Refine Results
  1. 1
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    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
    Save to List
    Saved in:
  2. 2
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  3. 3
    Application of genetic algorithm methods to optimize flowshop sequencing problem

    Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

    Published 2008
    “…At the end of this project, we can see the performance of genetic algorithm method in solving flow shop sequencing problem and types of flow shop sequencing problems that can be solve through genetic algorithm method. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  4. 4
    Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem

    Chaotic Immune Symbiotic Organisms Search algorithm for solving optimisation problem by Zamani M.K.M., Musirin I., Suliman S.I., Mustaffa S.A.S.

    Published 2023
    “…Heuristics-based algorithms were introduced to counter the problem faced by classical optimisation techniques. …”
    Article
    Save to List
    Saved in:
  5. 5
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    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
    Save to List
    Saved in:
  6. 6
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    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
    Save to List
    Saved in:
  7. 7
    Solving a bus driver scheduling problem: A genetic algorithm approach

    Solving a bus driver scheduling problem: A genetic algorithm approach by Ramli, Razamin, Ibrahim, Haslinda, Lim, Tze Shung

    Published 2013
    Get full text
    Get full text
    Book
    Save to List
    Saved in:
  8. 8
    Student-supervisor matching using stable marriage algorithm / Siti Farahana Nodzari

    Student-supervisor matching using stable marriage algorithm / Siti Farahana Nodzari by Nodzari, Siti Farahana

    Published 2007
    “…So, the problem face by students to find supervisor can be solve by using this system. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…In order to achieve the objective, Weighted Sum-Dijkstra’s Algorithm (WSDA), a combination method between WSM and Dijkstra’s Algorithm is applied to solve multiple criteria network problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Managing economic and Islamic research in big data environment: from computer science perspective / Nordin Abu Bakar

    Managing economic and Islamic research in big data environment: from computer science perspective / Nordin Abu Bakar by Abu Bakar, Nordin

    Published 2018
    “…This article explains the current demanding situation facing many researchers and how those algorithms have successfully solved some of the problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Application of Genetic Algorithm in solving Tourist Routing Problem

    Application of Genetic Algorithm in solving Tourist Routing Problem by Yusof, Siti Sarah

    Published 2013
    “…After completing a thorough comparative study, the author decided to apply Genetic Algorithm (GA), which is one of the best heuristic solutions to date in solving TRP. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  12. 12
    The influence of students’ concept of mole, problem representation ability and mathematical ability on stoichiometry problem solving

    The influence of students’ concept of mole, problem representation ability and mathematical ability on stoichiometry problem solving by Taha, Hafsah, Hashim, Rosnani, Ismail, Zurida, Jusoff, Kamaruzaman, Khoo, Yin Yin

    Published 2014
    “…The challenge of enhancing students’ performance in solving stoichiometry problems remain a daunting task as many resort to just teaching how solve stoichiometry problems algorithmically. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Application Of Higher Order Compact Finite Difference Methods To Problems In Fluid Dynamics

    Application Of Higher Order Compact Finite Difference Methods To Problems In Fluid Dynamics by Yap, Wen Jiun

    Published 2003
    “…The Hermitian scheme shows excellent agreement with the analytical result but the Lax-Wendroff approach failed to do so due to instability problem. Third, only the numerical algorithm based on Hermitian scheme is used to solve the flow past a backward-facing step. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    School teacher-subject allocation management system

    School teacher-subject allocation management system by Yap, Dennis Jian Yuan

    Published 2024
    “…Not just that, Genetic Algorithm, a meta-heuristic is also used to solve the clashing problem faced by existing system using deterministic algorithm. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  15. 15
    Face recognition using eigenfaces and smooth support vector machine

    Face recognition using eigenfaces and smooth support vector machine by Mhd, Furqan

    Published 2011
    “…Smoothing methods, extensively used for solving important mathematical programming problems and applications. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Face recognition using eigenfaces and smooth support vector machine

    Face recognition using eigenfaces and smooth support vector machine by Mhd, Furqan

    Published 2011
    “…Smoothing methods, extensively used for solving important mathematical programming problems and applications. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  17. 17
    Improved Variable Neighbourhood Descent (VND) to Solve Universiti Malaysia Sarawak (UNIMAS) Course Timetabling Problem

    Improved Variable Neighbourhood Descent (VND) to Solve Universiti Malaysia Sarawak (UNIMAS) Course Timetabling Problem by Mei Ching, Chen

    Published 2023
    “…Sensitivity analysis was performed on the proposed algorithm. The experimental results demonstrate the flexibility of the proposed algorithm in solving the university course timetabling problem (UCTTP) at the FCSIT.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Implementation of modified chaos embedded symbiotic organisms search algorithm to solve economic dispatch problem / Mohamad Khairuzzaman Mohamad Zamani ...[et al.]

    Implementation of modified chaos embedded symbiotic organisms search algorithm to solve economic dispatch problem / Mohamad Khairuzzaman Mohamad Zamani ...[et al.] by Mohamad Zamani, Mohamad Khairuzzaman, Musirin, Ismail, Suliman, Saiful Izwan, Bouktir, Tarek, Kalam, Akhtar

    Published 2018
    “…To counter the issue, the optimal power output of generation units were obtained by solving economic dispatch problem. In past years, various researchers have attempted to solve the problem using different optimization technique. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system

    Application of Krylov Subspace methods for solving Continuous Power Flow problem in voltage stability analysis of power system by Jasni, Jasronita

    Published 2010
    “…Furthermore, the real data with 293 buses and 595 lines is used as a practical system for verification of the new algorithms The results show that these new algorithms are able to eliminate the convergence problem faced by the existing CPF algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Tackling the berth allocation problem via harmony search algorithm

    Tackling the berth allocation problem via harmony search algorithm by Ahmed, Bilal, Hamdan, Hazlina, Muhammed, Abdullah, Husin, Nor Azura

    Published 2024
    “…Many metaheuristic algorithms have been suggested to tackle this problem, and yet, most of these algorithms have some drawbacks such as they have a weak ability to explore the solution space (they struggle escaping from local minima) and they face the difficulties to operate on different datasets. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: