Search Results - (( problem solving method algorithm ) OR ( java implementation path 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
    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
    “…Genetic algorithm method was one of the methods that were widely used in solving optimization problem. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    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:
  5. 5
    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:
  6. 6
    Iterative methods for solving split common fixed point problems in Hilbert spaces

    Iterative methods for solving split common fixed point problems in Hilbert spaces by Mohammed, Lawan Bulama

    Published 2016
    “…We also suggest some iterative methods for solving the split common fixed point problems for the class of total quasi asymptotically nonexpansive mappings and prove the convergence results of the proposed algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee

    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

    Published 2015
    “…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…The proposed method provides a platform to efficiently solve the MC problem by using approximation algorithm of Minimum Vertex Cover (MVC).…”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review

    Application of ant colony optimisation algorithms in solving facility layout problems formulated as quadratic assignment problems: a review by See, Phen Chiak, Wong, Kuan Yew

    Published 2008
    “…The main reason is that, QAPs provide possibilities to solve FLPs computationally. To date, there are two common approaches used to solve FLPs formulated as QAPs, that is, exact methods and approximate methods (also known as heuristics). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…Due to the practical significance of this problem in real-world issues, numerous algorithms have been proposed to solve it. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems

    Performance evaluation of heuristic methods in solving symmetric travelling salesman problems by Lim, Yai-Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan, Baten, Md Azizul

    Published 2016
    “…The algorithms proposed in this study should be considered in solving symmetric travelling salesman problems.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    A Method For Solving Mult-Objective Optimization Problem: Vector Evaluated Genetic Algorithm (Vega)

    A Method For Solving Mult-Objective Optimization Problem: Vector Evaluated Genetic Algorithm (Vega) by Tan, Tun Tai

    Published 2009
    “…Genetic Algorithms (GAs) are a powerful stochastic search in solving optimization problems. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  13. 13
    Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim

    Shooting method with root finding to solve boundary value problems / Aryani Rima Matakim by Matakim, Aryani Rima

    Published 2025
    “…The shooting method is an effective numerical approach for solving boundary value problems (BVPs) by converting it into initial value problems (IVPs). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem

    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

    Published 2017
    “…The efficiency of the proposed method is identified while solving benchmark CVRPs. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  15. 15
    Bats echolocation-inspired algorithms for global optimisation problems

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…An adaptive bats sonar algorithm is proposed for solving single objective optimisation problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Solving economic load dispatch problem using genetic algorithm method / Norliza Kamarulzaman

    Solving economic load dispatch problem using genetic algorithm method / Norliza Kamarulzaman by Kamarulzaman, Norliza

    Published 2009
    “…In this study, Genetic Algorithm method is used to overcome this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Artificial bee colony algorithm for solving optimal power flow problem

    Artificial bee colony algorithm for solving optimal power flow problem by Le Dinh, L., Vo Ngoc, D., Vasant, P.

    Published 2013
    “…Therefore, the proposed ABC algorithm can be a favorable method for solving the OPF problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem

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

    Published 2008
    “…Existing method, known as FDTD needs a very long processing time to solve this problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems

    Improved stochastic gradient descent algorithm with mean-gradient adaptive stepsize for solving large-scale optimization problems by Zulkifli, Munierah, Abd Rahmin, Nor Aliza, Wah, June Leong

    Published 2023
    “…Stochastic gradient descent (SGD) is one of the most common algorithms used in solving large unconstrained optimization problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Comparison of Some Numerical Methods for Solving Real-Life Nonlinear Equations by Using Python Programming / Annie Gorgey ... [et al.]

    Comparison of Some Numerical Methods for Solving Real-Life Nonlinear Equations by Using Python Programming / Annie Gorgey ... [et al.] by Gorgey, Annie, Zulkifly, Zul Hafiezy, Hassim, Haslinah, Azim, Farah Adilla

    Published 2024
    “…The bisection method converges quickly compared with other methods for solving Planck’s radiation law, while Algorithm 1 converges quicker than other methods for solving the beam design problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: