Search Results - (( java implementation path algorithm ) OR ( problem based based algorithm ))

Search alternatives:

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
    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
    “…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
    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
    Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem

    Rule-Based Multi-State Gravitational Search Algorithm for Discrete Optimization Problem by Ismail, Ibrahim, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2015
    “…In this study, rule-based multi-state gravitational search algorithm (RBMSGSA) algorithm is proposed to solve discrete combinatorial optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line

    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

    Published 2010
    “…This study presented an intelligence based genetic algorithm approach to optimize the considered problem objectives through reducing the problem complexity. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…To evaluate the proposed algorithm, the solutions to the TSP problem obtained from the proposed algorithm and swap sequence based PSO are compared in terms of the best solution, mean solution, and time taken to converge to the optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems

    A Multi-State Gravitational Search Algorithm for Combinatorial Optimization Problems by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof

    Published 2015
    “…The binary-based algorithms including the binary gravitational search algorithm (BGSA) were designed to solve discrete optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Formulation of metaheuristic algorithms based on artificial bee colony for engineering problems

    Formulation of metaheuristic algorithms based on artificial bee colony for engineering problems by Lee, Wei Wen

    Published 2024
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Harmony great deluge for solving curriculum based course timetabling problem

    Harmony great deluge for solving curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable.An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems.The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research.This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems.The algorithm can be adapted to the problem.Results were not comparatively better than those previously known as best solution.Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems

    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
    “…To overcome these drawbacks and to achieve an appropriate percentage of exploitation and exploration, this study presents a new modified teaching learning-based optimization algorithm called the fuzzy adaptive teaching learning-based optimization algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem

    A Genetic Algorithm Based Approach for Solving the Minimum Dominating Set of Queens Problem by Alharbi, Saad, Venkat, Ibrahim

    Published 2017
    “…However, literature shows that limited research has been carried out to solve theMDSQP using bioinspired algorithms. To fill this gap, this paper proposes a simple and effective solution based on genetic algorithms to solve this classical problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem

    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem by M., Muziana, Kamal Z., Zamli

    Published 2015
    “…Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation

    Hybrid firefly and particle swarm optimization algorithm for multi-objective optimal power flow with distributed generation by Khan, Abdullah

    Published 2022
    “…Finally, a crowding distance and non-dominated-sorting-based multi-objective hybrid firefly & particle swarm optimization (MOHFPSO) algorithm is designed for MOOPF problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Harmony annealing algorithm for curriculum-based course timetabling problem

    Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2012
    “…This research article presents the adaption of the harmony annealing algorithm for solving timetabling problems, with particular focus on the curriculum-based course timetabling that formed part of the competition track 3 of the 2nd International Timetabling Competition in 2007 (ITC-2007). …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic

    Enhanced Adaptive Confidence-Based Q Routing Algorithms For Network Traffic by Yap, Soon Teck

    Published 2004
    “…These two adaptive routing algorithms enhance the existing Confidence-based Q (CQ) and Confidence-based Dual Reinforcement Q (CDRQ) Routing Algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…In addition, two novel Jaya-based methods namely, the modified Jaya (MJaya) algorithm and quasi-oppositional modified Jaya (QOMJaya) algorithm are proposed to solve different MOOPF problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…Harris’s hawk multi-objective optimizer (HHMO) algorithm is a MOSIbased algorithm that was developed based on the reference point approach. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: