Search Results - (( java implementation path algorithm ) OR ( programming problem search 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
    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:
  4. 4
    Using genetic algorithm for solving N-Queens problem

    Using genetic algorithm for solving N-Queens problem by Turky A.M., Ahmad M.S.

    Published 2023
    “…The N-Queens problem is a well-known NP-Hard problem. Optimal solutions to small N values can be found in reasonable time by classical search algorithms or linear programming. …”
    Conference paper
    Save to List
    Saved in:
  5. 5
    String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razif Mohd Ghazi

    String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razi... by Mohd Ghazi, Mohd Razif

    Published 1999
    “…Dynamic programming is used to solve both the String Distance Problem and Longest Common Subsequence (LCS) problem. …”
    Get full text
    Get full text
    Thesis
    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
    Cuckoo Search Approach for Cutting Stock Problem

    Cuckoo Search Approach for Cutting Stock Problem by Shair, Ezreen Farina, Khor, Shen Young, Abdullah, Abdul Rahim, Jaafar, Hazriq Izzuan, Saharuddin, Nur Zawani, Zainal Abidin, Amar Faiz

    Published 2015
    “…The purpose of this paper is to develop a new approach which is Cuckoo Search Algorithm in Cutting Stock Problem. Cutting Stock Problem with Linear Programming based method has been improved down the years to the point that it reaches limitation that it cannot achieve a reasonable time in searching for solution. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    A combined filter line search and trust region method for nonlinear programming

    A combined filter line search and trust region method for nonlinear programming by Chin, Choong Ming, Halim, Abdul, Rashid, A. H. A., Nor, K. M.

    Published 2006
    “…A framework for solving a class of nonlinear programming problems via the filter method is presented. …”
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Evaluation of fast evolutionary programming, firefly algorithm and mutate-cuckoo search algorithm in single-objective optimization / Muhammad Zakyizzuddin Rosselan, Shahril Irwan Sulaiman and Norhalida Othman

    Evaluation of fast evolutionary programming, firefly algorithm and mutate-cuckoo search algorithm in single-objective optimization / Muhammad Zakyizzuddin Rosselan, Shahril Irwan S... by Rosselan, Muhammad Zakyizzuddin, Sulaiman, Shahril Irwan, Othman, Norhalida

    Published 2016
    “…FEP and MCSA are based on the conventional Evolutionary Programming (EP) and Cuckoo Search Algorithm (CSA) with modifications and adjustment to boost up their search ability. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Based on the proposed heuristic method, we developed a program to optimize the routing problem using the Visual Studio C++ 6.0 programming language.…”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  11. 11
    Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem

    Metaheuristic Algorithms Based on Compromise Programming for the Multi-Objective Urban Shipment Problem by Ngo, T.S., Jaafar, J., Aziz, I.A., Aftab, M.U., Nguyen, H.G., Bui, N.A.

    Published 2022
    “…We designed a hybrid version of the genetic algorithm with the local search algorithm to solve the proposed problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja

    Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

    Published 2004
    “…For most of the cases of the shortest route finding, the Dijkstra's algorithm is known to be an optimal search algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Overview of metaheuristic: classification of population and trajectory

    Overview of metaheuristic: classification of population and trajectory by Zainul Rashid, Zarina

    Published 2010
    “…Algorithms are used to find the solutions through the computer program. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  14. 14
    Evaluation of the effectiveness and efficiency of Wagner and Fischer algorithm in retrieving Hadith translated documents / Kamarul Arifin Muhamad

    Evaluation of the effectiveness and efficiency of Wagner and Fischer algorithm in retrieving Hadith translated documents / Kamarul Arifin Muhamad by Muhamad, Kamarul Arifin

    Published 2002
    “…Dynamic programming is used to solve Edit Distance problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    A sports tournament scheduling problem: Exploiting constraint-based algorithm and neighborhood search for the solution

    A sports tournament scheduling problem: Exploiting constraint-based algorithm and neighborhood search for the solution by Razamin, Ramli, Soong, Cai Juan, Haslinda, Ibrahim

    Published 2012
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Local search heuristics for elective surgery scheduling considering patient urgency

    Local search heuristics for elective surgery scheduling considering patient urgency by Rashid, N. S. A., Rahmin, N. A. A., Leong, W. J., Mohamed Ali, Nazihah

    Published 2019
    “…As the model consume a high computational time to solve for a large-scale instance, we developed a local search algorithm based on a simple heuristic to deal with the problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Some metaheuristic algorithms for solving multiple cross-functional team selection problems

    Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

    Published 2022
    “…This problem belongs to a class of combinatorial and NP-Hard problems that requires an efficient search algorithm to maintain the quality of solutions and a reasonable execution time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    A performance comparison of metaheuristics search for university course timetabling problems

    A performance comparison of metaheuristics search for university course timetabling problems by Joe Henry Obit, Kuan Yik Junn, Rayner Alfred

    Published 2017
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    An improved grey wolf with whale algorithm for optimization functions

    An improved grey wolf with whale algorithm for optimization functions by Asgher, Hafiz Maaz

    Published 2022
    “…Since its inception in 2014, GWO is able to successfully solve several optimization problems and has shown better convergence than the Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Differential Evolution (DE), and Evolutionary Programming (EP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: