Search Results - (( simulation optimization graph algorithm ) OR ( java implementation path algorithm ))

Search alternatives:

Refine Results
  1. 1
    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm

    African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

    Published 2015
    “…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
    Get full text
    Get full text
    Get full text
    Article
    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
    Route optimization using shortest path method / Muhamad Faisal Amin Shakri

    Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

    Published 2025
    “…Each algorithm was tested to compute the shortest path, with results indicating that while all algorithms arrive at the same optimal route, their efficiency differs. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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:
  6. 6
    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town

    An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town by Nor Rafidah, Mohamad

    Published 2005
    “…Both algorithms are compared. Simulation is used as a method in this study. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Ant colony optimization algorithm for load balancing in grid computing

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  9. 9
    Modeling of static and dynamic components of bio-nanorobotic systems

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Optimization of Maximum Power Point Tracking (MPPT) of Photovoltaic System using Artificial Intelligence (AI) Algorithms

    Optimization of Maximum Power Point Tracking (MPPT) of Photovoltaic System using Artificial Intelligence (AI) Algorithms by Raal Mandour, Raal

    Published 2013
    “…In this paper, starting from the set of equations modeling a PV module, an innovative procedure to optimize the performance and efficiency of the MPPT algorithms is presented, simulated and verified. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  11. 11
    A branch and bound and simulated annealing approach for job shop scheduling

    A branch and bound and simulated annealing approach for job shop scheduling by Tan, Hui Woon, Salim, Sutinah

    Published 2004
    “…In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Underwater Acoustic Communications: Optimizing Data Packet Size With Respect to Throughput Efficiency, BER, and Energy Efficiency

    Underwater Acoustic Communications: Optimizing Data Packet Size With Respect to Throughput Efficiency, BER, and Energy Efficiency by Jung, L.T., Azween, Abdullah

    Published 2011
    “…Based on the results of the simulation the authors have proposed an algorithm/framework to determine the optimal packet size for UWA data transmission. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    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:
  14. 14
    Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling

    Multi-objective pareto ant colony system based algorithm for generator maintenance scheduling by Shimailawi, Shatha Abdulhadi Muthana

    Published 2022
    “…Friedman test using GRG metric shows significant better performance (p-values<0.05) for PACS algorithm compared to benchmark algorithms. The proposed models and algorithm can be used to solve the multi-objective GMS problem while the new parameters’ values can be used to obtain optimal or near optimal maintenance scheduling of generators. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    An efficient multi join query optimization for relational database management system using swarm intelligence approaches

    An efficient multi join query optimization for relational database management system using swarm intelligence approaches by Alsaedi, Ahmed Khalaf Zager

    Published 2016
    “…A directed acyclic graph, based on materialized query graph, aids in the optimization of algorithms and solving MJQO by removing non-promising QEP, which decreases the QEP combination space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    An efficient multi join query optimization for relational database management system using swarm intelligence approaches

    An efficient multi join query optimization for relational database management system using swarm intelligence approaches by Alsaedi, Ahmed Khalaf Zager

    Published 2016
    “…A directed acyclic graph, based on materialized query graph, aids in the optimization of algorithms and solving MJQO by removing non-promising QEP, which decreases the QEP combination space. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Neural network algorithm-based fall detection modelling

    Neural network algorithm-based fall detection modelling by Mohd Yusoff, Ainul Husna, Koh, Cheng Zhi, Ngadimon, Khairulnizam, Md Salleh, Salihatun

    Published 2020
    “…The selection of the model was based on the comparison of optimization epochs, magnitude of validate error or mean square error (MSE), magnitude of correlation performance, the convergence graph in term of MSE performance, accuracy of regression and non-zero value of autocorrelation graph. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Benchmark simulator with dynamic environment for job scheduling in grid computing

    Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

    Published 2014
    “…Characteristics of jobs and resources to be used in evaluating the performance of the scheduling algorithm must reflect the dynamic nature of real grid environment.Static models of jobs and resources cannot be used to generate jobs and resources in simulating the grid environment because of the dynamic nature of the grid.This paper presents a new graph representation of jobs and resources which is practical for hybrid metaheuristic model implementation such as ant colony optimization and genetic algorithm.A dynamic model that can generate jobs and resources similar to the jobs and resources in the real grid environment is also proposed.Jobs and resources may join in or drop out from the grid.Stochastic analysis is performed on the characteristics of jobs and resources.A simulator based on the dynamic expected time to compute, has been developed and can be used as a benchmark.The simulator can generate jobs and resources with the characteristics of jobs and resources in the real grid environment.This will facilitates the evaluation of dynamic job scheduling algorithm.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm

    Optimization of mobile robot path planning in semi-dynamic environment using genetic algorithm by Kasim Hawari, Mohd Zarifitri

    Published 2023
    “…Finally, the simulation was conducted by implementing a random algorithm to verify the proposed GA in terms of the mobile robot's minimum and maximum path lengths. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Quality of service in mobile IP networks with parametric multi-channel routing algorithms based on linear programming approach

    Quality of service in mobile IP networks with parametric multi-channel routing algorithms based on linear programming approach by Gholizadeh, Somayyeh

    Published 2018
    “…Furthermore, Optimized Parametric Topology Control Routing algorithm performs significantly better than Triangular Routing Method and Change Foreign Agent Algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: