Search Results - (( java implementation path algorithm ) OR ( basic selection problem 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

    Enhanced Distributed Learning Classifier System For Simulated Mobile Robot Behaviours by Baneamoon, Saeed Mohammed Saeed

    Published 2010
    “…The main problem in robotic system is in selecting the correct behaviour. …”
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    CSC099: Foundation Computing II / Centre of Foundation Studies by UiTM, Centre of Foundation Studies

    Published 2022
    “…This course introduces basic computer programming algorithm, problem solving, structured programming language, selection structure, repetition structure, function and array. …”
    Get full text
    Get full text
    Get full text
    Teaching Resource
  8. 8

    Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems by Din, Fakhrud, Khalid, Shah, Fayaz, Muhammad, Gwak, Jeonghwan, Kamal Z., Zamli, Mashwani, Wali Khan

    Published 2022
    “…As the 50-50 probabilities for exploitation and exploration in the basic teaching learning-based optimization algorithm may be counterproductive, the Mamdani-type fuzzy inference system of the new algorithm takes these measures as a crisp inputs and generates selection as crisp output to choose either exploitation or exploration based on the current search requirement. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10
  11. 11

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Basically, it will look into matters such as putting students into certain time slot. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Backtracking search algorithm for optimal power dispatch in power system / Mostafa Modiri Delshad by Mostafa, Modiri Delshad

    Published 2016
    “…BSA with two constraint handling mechanisms is applied to solve the power dispatch problems to select the better mechanism in power dispatch problems. …”
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches by Mohd Pauzi, Nur Fazlinda

    Published 2015
    “…Therefore, ABC algorithm is proposed to solve the flowshop scheduling problem in this research. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    The advantages of genetic algorithm and neural networks to forecast air pollution trend in Malaysia: an overview / Mohamad Idham Md Razak … [et al.] by Md Razak, Mohamad Idham, Ahmad, Ismail, Bujang, Imbarine, Talib, Adi Hakim, Kedin, Nor Adila

    Published 2012
    “…Genetic Algorithms (GAs) are adaptive heuristic search algorithm premised on the evolutionary ideas of natural selection and genetic. …”
    Get full text
    Get full text
    Book Section
  17. 17

    A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

    Published 2018
    “…Significant modifications to the basic Jaya algorithm are done to create a modified Jaya (MJaya) algorithm that can handle the MOOPF problem. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction by Abasi, Ammar Kamal Mousa

    Published 2021
    “…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Voltage stability margin identification using evolution programming learning algorithm / Zamzuhairi Darus by Darus, Zamzuhairi

    Published 2003
    “…A systematic method for selecting the ANN's input variables was developed using Matlab Programming language.…”
    Get full text
    Get full text
    Thesis
  20. 20

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…Besides, since PSO operates in the continuous domain, it cannot be applied directly to solve a discrete problem like the JSP efficiently. This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
    Get full text
    Get full text
    Get full text
    Thesis