Search Results - (( basic location allocation algorithm ) OR ( java implementation path algorithm ))

  • Showing 1 - 10 results of 10
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

    Heuristic resource allocation algorithm for controller placement in multi-control 5G based on SDN/NFV architecture by Ibrahim, Abeer Abdalla Zakaria, Hashim, Fazirulhisyam, Noordin, Nor Kamariah, Sali, Aduwati, Navaie, Keivan, Fadul, Saber Mohammed Elnour

    Published 2021
    “…It is based on the K-center problem, to solve the capacitated controller placement problem (CCPP), which acts as a resource location problem, in which the location and number of controllers can be allocated to maximize resources. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    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
  4. 4

    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
  5. 5

    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
  6. 6

    Public healthcare facility planning in Malaysia : Using location allocation models / S. Sarifah Radiah Shariff by S. Sarifah Radiah, Shariff

    Published 2012
    “…Two basic location allocation models with two different objectives are studied: The p-median problem and the Maximal Covering Location Problem (MCLP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Determining optimal transportation allocation using linear programming methods / Tengku Mohd Hazimi Tuan Hassan and Maslin Masrom by Tuan Hassan, Tengku Mohd Hazimi, Masrom, Maslin

    Published 2022
    “…The study aimed to minimise the delivery of items from the plant to the dealer's location by determining the optimal allocation of inventory from suppliers to dealers in the Malaysian cities of Seremban, Johor Bahru, Kuala Lumpur/Selangor and Penang. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    Assessment of dynamic spectrum allocation technique in heterogeneous network by Ismail, Ahmad Fadzil, Hasan, Mohammad Kamrul, Othman, N.I, Hashim, Wahidah

    Published 2017
    “…The second research explained more about the implementation of Dynamic Resource Allocation in the uplink and downlink configuration, and are tested using three algorithms; Max-sum, max-min and maxproduct. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    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
  10. 10

    Incremental learning for large-scale stream data and its application to cybersecurity by Ali, Siti Hajar Aminah

    Published 2015
    “…In Chapter 1, the concept of in�cremental learning is briefly described and basic theories on Resource Allocating Network (RAN) and conventional data selection method are discussed in this chapter. …”
    Get full text
    Get full text
    Thesis