Search Results - (( solution construction _ 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

    Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2017
    “…To produce a population of initial solution require algorithm that can produce multiple feasible solutions and these solutions must be diverse. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…(iii) It is a constructive-based meta-heuristic algorithm which means, the solution is incrementally constructed (step by step) until the complete solution is obtained (Noferesti and Shah-Hosseini, 2012). …”
    thesis::doctoral thesis
  7. 7
  8. 8

    A hybrid adaptive harmony search with modified great deluge algorithm for school timetabling by Arbaoui, Billel

    Published 2025
    “…In Phase 1, heuristic rules refine the time assignment stage to improve an existing construction algorithm. Phase 2 adaptively tunes parameters based on iteration position, solution number, behavioral status, and parameter linkages. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Sequential constructive algorithm incorporate with fuzzy logic for solving real world course timetabling problem by Tan, Li June, Joe H. Obit, Leau, Yu Beng, Jetol Bolongkikit, Rayner Alfred

    Published 2020
    “…Sequential constructive algorithm is one of the popular methods for solving timetabling problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    Utilizing the roulette wheel based social network search algorithm for substitution box construction and optimization by Kamal Z., Zamli, Alhadawi, Hussam S., Fakhrud Din, .

    Published 2023
    “…This paper introduces a new variant of a recent metaheuristic algorithm based on the Social Network Search algorithm (SNS), which is called the Roulette Wheel Social Network Search algorithm (SNS). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  11. 11
  12. 12
  13. 13

    Optimised Crossover Genetic Algorithms for Combinatorial Optimisation Problems by Nazif, Habibeh

    Published 2010
    “…A Genetic Algorithm is successful in generating near -optimal solutions if it is able to produce o®spring during crossover that is better than the parent solutions. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    An Efficient Computational Algorithm for Solving Arbitrary Sylvester Matrix Equations in Fuzzy Control Theory (S/O 14179) by Ahmad, Nazihah, Ibrahim, Haslinda

    Published 2021
    “…As a result, the constructed algorithm has successfully demonstrated the solutions for the arbitrary FFSME, with minimum complexity of the fuzzy operations. …”
    Get full text
    Get full text
    Monograph
  16. 16

    Development of a scheduling tool for constructing a Malaysian school timetable using genetic algorithms / Salihin Farag Shoeeb by Salihin Farag , Shoeeb

    Published 2003
    “…A recent approach to derive a near-optimal solution is to use evolutionary or genetic algorithms. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    Published 2009
    “…For this kind of problem, researchers believe that it will be better to find an approximate solution that can be delivered by a stochastic algorithm than waiting for an exact solution from the deterministic algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  18. 18

    Simulated annealing algorithm for solving chambering student-case assignment problem by Ghazali, Saadiah, Abdul Rahman, Syariza

    Published 2015
    “…The objective of the study is to minimize the total completion time for all students in solving the given cases.This study employed a minimum cost greedy heuristic in order to construct a feasible initial solution.The search then is preceded with a simulated annealing algorithm for further improvement of solution quality.The analysis of the obtained result has shown that the proposed simulated annealing algorithm has greatly improved the solution constructed by the minimum cost greedy heuristic. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19
  20. 20