Search Results - (( using optimization method 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

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

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

    Published 2017
    “…In order to generate optimal data to satisfy whole constraints in the feasible path, new method with SBTs is necessary to satisfy the whole constraints at the same time of the whole path executing. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4
  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 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
  7. 7

    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
    “…This algorithm is able to detect and prevent the attacker from modifying the data with using an encryption algorithm by cost of little bit increase but tolerable delay. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

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

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

    Published 2015
    “…This thesis proposes an algorithm to find the optimum distribution substation placement and sizing by utilizing the PSO algorithm and optimum feeder routing using modified Minimum Spanning Tree (MST). …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

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

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

    Repetitive mutations in genetic algorithm for software test data generations by Kadhim, Mohammed Majid

    Published 2022
    “…Genetic Algorithm (GA) has proven to be an important method in generating test data for automatic path coverage testing. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Wide area measurement system in the IEEE-14 bus system using multiobjective shortest path algorithm for fault analysis by Awalin, Lilik J., Syahirah, Abd Halim, Jafferi, Jamaludin, Nor Azuana, Ramli

    Published 2021
    “…The IEEE-14 bus system was modeled in PSCAD software for simulating nineteen types of fault based on multi-objective shortest path algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

    Published 2018
    “…Dijkstra’s Algorithm is a shortest path algorithm that considers a single criterion only. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15
  16. 16

    A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

    Published 2018
    “…They are relation table, relation graph, consistency checking, test path minimization, test path prioritization, path pruning, test path generation, and test case generation. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18
  19. 19
  20. 20

    Application of genetic algorithm methods to optimize flowshop sequencing problem by Mohd Fadil, Md Sairi

    Published 2008
    “…Genetic algorithm method was one of the methods that were widely used in solving optimization problem. …”
    Get full text
    Get full text
    Undergraduates Project Papers