Search Results - (( java implementation path algorithm ) OR ( basic permutation generation algorithm ))

Search alternatives:

  • Showing 1 - 9 results of 9
Refine Results
  1. 1
    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop

    Numerical assessment on makespan minimization by adopting NEH heuristics in permutation flow shop by Ziao, C.Z., Kamaruddin, S.

    Published 2015
    “…Throughout the last 30 years, the NEH heuristic developed by Nawaz, Enscore and Ham has been commonly regarded as the best heuristic for minimizing the makespan in permutation flow shops. This heuristic is basically divided into two main stages: generate an initial sequence with decreasing total processing time and insert into the schedule accordingly. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    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:
  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
    A new 128-bit block cipher

    A new 128-bit block cipher by Mohd Ali, Fakariah Hani

    Published 2009
    “…It is an involution substitution and permutation encryption network (SPN). This block cipher uses only basic operations, key dependent S-box and XOR IS together so that it can be efficiently implemented on various platforms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling

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

    Published 2022
    “…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
    Save to List
    Saved in:
  8. 8
    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem

    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem by Sh Ahmad, Sh Salleh

    Published 2009
    “…Third, bottleneck approach was utilised in the study and the analysis using Visual Basic macro programming indicated that this method produced good results. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: