Search Results - (( java implementation path algorithm ) OR ( program during optimization algorithm ))

Refine Results
  1. 1

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

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

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

    A new meta heuristic evolutionary programming (NMEP) in optimizing economic energy dispatch by Mohamad Ridzuan, Mohamad Radzi, Hassan, Elia Erwani, Abdullah, Abdul Rahim, Bahaman, Nazrulazhar, Abdul Kadir, Aida Fazliana

    Published 2016
    “…The proposed optimization algorithm, namely New Meta-Heuristic Evolutionary Programming (NMEP) algorithm is followed to Meta-Heuristic Evolutionary Programming (Meta-EP) approach with some modification where the cloning process embedded as a significant progress during the implementation. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    An improved grey wolf with whale algorithm for optimization functions by Asgher, Hafiz Maaz

    Published 2022
    “…The Grey Wolf Optimization (GWO) is a nature-inspired, meta-heuristic search optimization algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    A multi-depot vehicle routing problem with stochastic road capacity and reduced two-stage stochastic integer linear programming models for rollout algorithm by Anuar, Wadi Khalid, Lee, Lai Soon, Seow, Hsin Vonn, Pickl, Stefan

    Published 2021
    “…A matheuristic approach based on a reduced two-stage Stochastic Integer Linear Programming (SILP) model is presented. The proposed approach is suitable for obtaining a policy constructed dynamically on the go during the rollout algorithm. …”
    Get full text
    Get full text
    Article
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15

    Dynamic Economic Dispatch For Large Scale Power Systems: A Lagrangian Relaxation Approach by Ab Ghani, Mohd Ruddin, Hindi, K. S.

    Published 1991
    “…The dual Lagrangian function is optimized using subgradient optization. If an overall solution feasible in all constraints and sufficiently close to a computed best lower bound is discovered during subgradient optimization, it is deemed optimal. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18

    Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

    Published 2022
    “…We introduced a method that combines a compromise programming (CP) approach and metaheuristic algorithms, including the genetic algorithm (GA) and ant colony optimization (ACO), to solve the proposed optimization problem. …”
    Get full text
    Get full text
    Article
  19. 19

    Software regression test case prioritization for object-oriented programs using genetic algorithm with reduced-fitness severity by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

    Published 2015
    “…The re-execution of all test cases during the regression testing is costly. And even though several of the code based addresses procedural programs. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20