Search Results - (( based application study algorithm ) OR ( data optimization path algorithm ))

Refine Results
  1. 1

    Railway shortest path planner application using ant colony optimization algorithm / Muhammad Hassan Firdaus Ruslan by Ruslan, Muhammad Hassan Firdaus

    Published 2017
    “…For the process module, Ant Colony Optimization (ACO) algorithm was used to find the shortest path. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…The proposed scheme has been simulated by OMNET++ and compared with standard AntNet and two well-known standard QoS routings; Widest Shortest Path (WSP) algorithm and Shortest Widest Path (SWP) algorithm. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

    Published 2009
    “…Also the main aim of this research is to solve the freezing problem during optimum as well as sub-optimum path discovery process. In this research, Intelligent AntNet based Routing Algorithm (IANRA) is presented for routing in WMNs and MANET to find optimum and near-optimum paths for data packet routing. …”
    Get full text
    Get full text
    Thesis
  4. 4

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

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

    Published 2017
    “…The second contribution of this thesis is developing an accurate search-based test data generator for generating automatically optimal test data to satisfy the whole constraints in the path. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
    Get full text
    Get full text
    Student Project
  7. 7

    An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

    Published 2018
    “…The elaborated result of the study will help test engineers to choose the algorithm they need to generate test cases efficiently and optimally.…”
    Get full text
    Get full text
    Thesis
  8. 8

    Development Of Generative Computer-Aided Process Planning System For Lathe Machining by Zubair, Ahmad Faiz

    Published 2019
    “…Therefore, a single automatic system that able to transfer CAD data into machining readable data through CAM data had been developed.…”
    Get full text
    Get full text
    Thesis
  9. 9

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…As a route improvement strategy, two heuristics which are the swap among routes procedure and 3-opt algorithm are also employed within the ASH algorithm. …”
    Get full text
    Get full text
    Thesis
  10. 10

    Differential evolution optimization for constrained routing in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Ahmed, Gharib Subhi Mahmoud, Anwar, Farhat, Zakaria, Omar

    Published 2014
    “…This solution addresses efficient and optimal routing path construction for cost and quality metrics of the application. …”
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  11. 11

    Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

    Published 2012
    “…It is based on Ant Colony Optimization (ACO) meta heuristic, which is adopted to enhance the paths with the best-quality function. …”
    Get full text
    Get full text
    Thesis
  12. 12

    A mating technique for various crossover in genetic algorithm for optimum system identification by Abd Samad @ Mahmood, Md Fahmi, Zainuddin, Farah Ayiesya

    Published 2021
    “…Such derivation is made using a mathematical model based on certain specified assumptions. To researchers who are involved in the application of Genetic Algorithm (GA) in optimization, the process of choosing the best parents in the population for mating has become of great interest. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Optimization Method Using Modified Harmony Search For Coverage And Energy Efficiency In Wireless Sensor Network by Halim, Nurul Hamimi

    Published 2018
    “…Coverage and energy efficiency metrics are two fundamental issues for almost all types of application in wireless sensor network (WSNs).Coverage reflects how well an area is monitored by sensor nodes and in energy efficient networks where less energy is consumed to provide the same level of services.These twin specifics are presented to evaluate the performance of a wireless sensor network.Due to its simplicity and ease of analysis,full coverage is widely implemented in many theoretical studies.However,sometimes full coverage is not the best way to represent some real-world application due to its strong restrictions and its deterministic characteristics.In this thesis,Modified Harmony Search algorithm (MHS) is proposed to achieve a sensor node deployment such that the covered area is optimal and data transfer has low energy consumption.Through computer simulations, experimental results verified that the proposed method improved the coverage of area in compare to some related methods.Based on the result obtain from every experiments,coverage area percentage performance is affected by the number of hotspots.This is shown by Harmony Search (HS) based method where the coverage area percentage increases as the number of hotspot increase. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    Task offloading paradigm in mobile edge computing-current issues, adopted approaches, and future directions by Akhlaqi, Mohammad Yahya, Mohd Hanapi, Zurina

    Published 2023
    “…Due to the high diversity of research areas, targeted issues, and adopted algorithms and techniques, finding the right research path in task offloading is highly demanding. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
  19. 19

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

    Published 2005
    “…There are many algorithms that used to solve this problem. In this study, ant algorithms are used to find the shortest path using a real data. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

    Published 2015
    “…As a result, the evacuation route model is able to gain the shortest path and safest path consistently between Dijkstra’s algorithms and hybrid version which is Dijkstra-Ant Colony Optimization (DACO). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis