Search Results - (( using optimization path algorithm ) OR ( software evaluation path algorithm ))

Refine Results
  1. 1

    Comparative Study of Weighted Product–Dijkstra’s Algorithm and All Possible Path Approach Based on Multiple Criteria and Multi-Dimensions by Ting Kien Hua, Noraini Abdullah

    Published 2020
    “…Dijkstra’s algorithm was one of the shortest path algorithms that would be used to identify the path with the least cost. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Test case generation from state machine with OCL constraints using search-based techniques / Aneesa Ali Ali Saeed by Aneesa Ali, Ali Saeed

    Published 2017
    “…A model-driven approach was used for generating abstract test cases from the feasible paths. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Modelling Autonomous Evacuation Navigation System (AENS) for optimal route using Dijkstra's algorithm by Abu Samah, Khyrina Airin Fariza

    Published 2016
    “…Through ST adaptation, all subsystems were integrated and using the “Dijkstra’s algorithm” (DA) by modifying its function from shortest path algorithm to safest and shortest algorithm, to the nearest exit. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Successor selection for Ant Colony Optimization technique algorithm / Muhammad Iskandar Isman by Isman, Muhammad Iskandar

    Published 2017
    “…Therefore, in this research, will be use Ant Colony Optimization (ACO) algorithm as an optimize technique that provide a shortest path of defining a successor that is their highest value of criteria. …”
    Get full text
    Get full text
    Thesis
  5. 5

    A new routing mechanism for energy-efficient in bluetooth mesh-low power nodes based on wireless sensor network by Almuslehi, Hussein Saad Mohammed

    Published 2023
    “…Compared to the Ant Colony Optimization-Genetic Algorithm (ACO-GA) and Ant Colony Optimization- Hierarchical Clustering Mechanism (ACOHCM), the ACO algorithm shows superior power savings and efficiency. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    A comparative study on ant-colony algorithm and genetic algorithm for mobile robot planning. by Rajendran, Piraviendran, Othman, Muhaini

    Published 2024
    “…Focusing on routing optimization, the study evaluates Ant-Colony Optimization (ACO) and Genetic Algorithm (GA) in Mobile Robot Planning. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7

    Dam haji game using A* search algorithm / Siti Farah Najwa Mukhlis by Mukhlis, Siti Farah Najwa

    Published 2017
    “…Therefore many research have been done to develop this type of computer game by using the Al techniques. In Dam Haji game, the goal is to find the optimal movement to make, so A* algorithm, which is a pathfinding algorithm is used. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Workload performance evaluation of large spatial database for DSS based disaster management by Rohman, Muhammad Syaifur

    Published 2017
    “…Data recorded in the shortest path analysis process reveals that the evaluation and the prediction on workload performance of shortest path analysis using Dijkstra algorithm has been well implemented. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    The solution of 2048 puzzle game using A* algorithm / Zafhira Ismail by Ismail, Zafhira

    Published 2017
    “…The input data of this project is retrieved from the game’s rule itself and implemented with the proposed algorithm which is A* algorithm. The output of this project is the best solution to achieve the goal using A* algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10

    A comparative study of heuristic methods to solve Traveling Salesman Problem (TPS) by Lim, Yai Fung, Hong, Pei Yee, Ramli, Razamin, Khalid, Ruzelan

    Published 2011
    “…Traveling Salesman Problem (TSP) is a famous problem in combinatorial optimization. The objective of the TSP is to find the shortest path that reaches all the cities which are interconnected with each other by straight lines.The symmetric TSP is used and the distance between two cities is calculated by using Euclidean equation.In this study, three heuristic methods, namely simulated annealing (SA), tabu search (TS) and reactive tabu search (RTS) are used to solve TSP.SA is a generic probabilistic meta-algorithm for the global optimization problem and TS is a meta-heuristic search technique that guides a local search procedure to explore the solution space beyond local optimality. …”
    Get full text
    Get full text
    Get full text
    Monograph
  11. 11

    Security enhancement of route optimization in mobile IPv6 networks by Mehdizadeh, Abbas, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir, Kurup, Gopakumar

    Published 2008
    “…Mobile IPv6 (MIPv6) allows Mobile Node (MN) to be always addressable by its home address. Route Optimization (RO) is standard in MIPv6 to route packets between MN and Correspondent Node (CN) using shortest possible path. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12
  13. 13

    Controller placement problem in the optimization of 5G based SDN and NFV architecture by Ibrahim, Abeer Abdalla Zakaria

    Published 2021
    “…Extensive computations utilizing MATLAB 2018a on the Intel Core i7/Gen 10 processor and 16 GB of RAM are used to evaluate the algorithm efficacy. According to the blueprint of our heuristic method, the allocation and the optimum number of controllers under an effective decentralized policy could achieve higher efficiency. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Electricity distribution network for low and medium voltages based on evolutionary approach optimization by Hasan, Ihsan Jabbar

    Published 2015
    “…The test network is generated by fractal based distribution network generation model software tool. The results indicate that proposed algorithm has succeeded in finding a reasonable placement and sizing of distributed generation with adequate feeder path. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    A Compromise Programming to Task Assignment Problem in Software Development Project by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N., Binh, H.D., Aftab, M.U.

    Published 2021
    “…To support the decision-maker to evaluate different decision strategies, we use compromise programming to transform multiobjective optimization (MOP) into a single-objective problem. …”
    Get full text
    Get full text
    Article
  16. 16

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…The recent trend of software development uses OO paradigm. 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
  17. 17

    Development of a systematic method in lean tool selection for automotive industry by Anvari, Alireza

    Published 2012
    “…Based on the systematic features of this algorithm, the efficiency and effectiveness of the model in presenting optimizing techniques for lean tool selection with the automotive industry seems reasonable and useful. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Optimization of multi-holes drilling path using particle swarm optimization by Najwa Wahida, Zainal Abidin, M. F. F., Ab Rashid, N. M. Zuki, N. M.

    Published 2018
    “…PSO is also compared with another algorithm like Whale Optimization Algorithm, Ant Lion Optimizer, Dragonfly Algorithm, Grasshopper Optimization Algorithm, Moth-flame Optimization and Sine Cosine Algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
  19. 19
  20. 20

    Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

    Published 2021
    “…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
    Get full text
    Get full text
    Get full text
    Article