Search Results - (( simulation permutation based algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

  • Showing 1 - 20 results of 20
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
    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:
  5. 5
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by N. A., Isa, S. A., Bareduan, A. S., Zainudin, M., Marsudi

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by Isa, N.A., Bareduan, S.A., Zainudin, A.S., Marsudi, M.

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem

    Multiple bottlenecks sorting criterion at initial sequence in solving permutation flow shop scheduling problem by Isa, N.A., Bareduan, S.A., Zainudin, A.S., Marsudi, M.

    Published 2021
    “…In this study, an experiment involving machines (m =4) and n-job (n = 6, 10, 15, 20) was simulated in Microsoft Excel Simple Programming to solve the permutation flowshop scheduling problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated kalman filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Purpose – The purpose of the research is to solve Travelling Salesman Problem (TSP) using Simulated Kalman Filter (SKF) algorithm and single-solution SKF (ssSKF) algorithm based on numerical ordering technique. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Development of improved bottleneck-based heuristic for re-entrant flow shop with dominant machine at M1 and M4

    Development of improved bottleneck-based heuristic for re-entrant flow shop with dominant machine at M1 and M4 by Mohd Fidzwan, Md Amin Hamzas, Ahmad Bareduan, Salleh, Liyana, Tajul, Mohd Sabri, Hussin, Zailani, Zainal Abidin, Hasnul, Hadi

    Published 2013
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network

    Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

    Published 2007
    “…To avoid crosstalk in OMINs many algorithms have been proposed by many researchers such as the Four Heuristic, Simulated Annealing, Genetic, Remove Last Passes and Zero Algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches

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

    Published 2015
    “…At high iterations of 204 and above, method 3+0+0 dominates the best performance. Based on this finding, the selection of the best method can be decided based on the iteration time available. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Simulated Annealing Based Strategy for Test Redundancy Reduction

    Simulated Annealing Based Strategy for Test Redundancy Reduction by Kamal Z., Zamli, Mohd Hafiz, Mohd Hassin, Al-Kazemi, Basem, Naseer, Atif

    Published 2014
    “…Unlike existing works which rely on the Greedy approaches, our work adopts the random sequence permutation and optimization algorithm based on Simulated Annealing with systematic merging technique. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem

    A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

    Published 2023
    “…Positive outcomes on the application of simulated annealing-based hyper-heuristic (SA-HH) in addressing similar scheduling problem has been reported in the literature. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network

    Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

    Published 2005
    “…This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Cutpoint determination methods in competing risks subdistribution model

    Cutpoint determination methods in competing risks subdistribution model by Noor Akma Ibrahim, Abdul Kudus, Isa Daud, Mohd. Rizam Abu Bakar

    Published 2009
    “…Simulation results show that the deviance method has the desired properties. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Development of an Image Encryption Algorithm using Latin Square Matrix and Logistics Map

    Development of an Image Encryption Algorithm using Latin Square Matrix and Logistics Map by Emmanuel Oluwatobi Asani, Godsfavour Biety-Nwanju, Abidemi Emmanuel Adeniyi, Salil Bharany, Ashraf Osman Ibrahim Elsayed, Anas W. Abulfaraj, Wamda Nagmeldin

    Published 2023
    “…The hybrid technique was simulated on image data and evaluated to gauge its performance. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Cutpoint determination methods in competing risks subdistribution model

    Cutpoint determination methods in competing risks subdistribution model by Ibrahim, Noor Akma, Kudus, Abdul, Daud, Isa, Abu Bakar, Mohd Rizam

    Published 2009
    “…Simulation results show that the deviance method has the desired properties. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop

    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop by Md Amin Hamzas, Mohd Fidzwan, Ahmad Bareduan, Salleh, Hussin, M.S., Hasnul, M.J.

    Published 2012
    “…Due to the re-entrant and permutation nature of the process routing, the actual bottlenecks were identified as M3 and it utilized makespan algorithms to identify bottleneck categories. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop

    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop by Mohd Fidzwan, Md Amin Hamzas, Ahmad Bareduan, Salleh, Mohd Sabri, Hussin, M. J., Hasnul, Asmawi, Sanuddin, Zailani, Zainal Abidin

    Published 2013
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    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: