Search Results - (( based routing method algorithm ) OR ( java simulation optimization algorithm ))

Refine Results
  1. 1

    Evaluation of the routing algorithms for NoC-based MPSoC: a fuzzy multi-criteria decision-making approach by Muhsen, Yousif Raad, Husin, Nor Azura, Zolkepli, Maslina, Manshor, Noridayu, Jasim Al-Hchaimi, Ahmed Abbas

    Published 2023
    “…The analysis reveals that Adaptive Dimensional Bubble Routing (ADBR), Message-based Congestion-Aware Routing (MCAR), and Dynamic and Adaptive Routing Algorithm (DyAd) are ranked as the top three routing algorithms, respectively. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Neighbour-based on-demand routing algorithms for mobile ad hoc networks by Ejmaa, Ali Mohamed E.

    Published 2017
    “…Thus, a Scalable Neighbor-Based Routing algorithm (SNBR) is proposed, which reduces the routing overhead in the NCPR, by eliminating the redundant RREQ. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3

    Benchmarking routing algorithms in NoC-based MPSoCs using guaranteed convergence arithmetic optimization with artificial neural networks and fuzzy MCDM by R Muhsin, Al-Molla Yousif

    Published 2024
    “…At the same time, a multi-criteria decision-making (MCDM) approach (phase 2) analysis reveals that Adaptive Dimensional Bubble Routing, Message-based Congestion-Aware Routing, and Dynamic and Adaptive Routing Algorithms are ranked as the top three routing algorithms, respectively.…”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Performance analysis of ant colony's algorithm: load-balancing in QoS-based wireless mesh networks routing by Moghanjoughi, Ayyoub Akbari, Khatun, Sabira, Mohd Ali, Borhanuddin, Raja Abdullah, Raja Syamsul Azmir

    Published 2008
    “…This can provide the required route with special goals. This method is able to prevent some of the difficulties which have not been seen in the colony algorithms of ants. …”
    Get full text
    Get full text
    Get full text
    Article
  6. 6

    A variant fisher and Jaikuamr algorithm to solve capacitated vehicle routing problem by Sultana, Tanzima, Akhand, Md Aminul Haque, Rahman, M.M. Hafizur

    Published 2017
    “…On the other hand, a clustering based method first assigns nodes into vehicle wise cluster and then generates route for each vehicle. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  7. 7
  8. 8

    Enhancing Solutions Of Capacity Vehicle Routing Problem Based On An Improvement Ant Colony System Algorithm by Mutar, Modhi Lafta, Mohd Aboobaider, Burhanuddin, Hameed, Asaad Shakir, Yusof, Norzihani

    Published 2019
    “…Optimal routes are founded based on to decrease the distance and the time for each and every one route which directs to quickest the moving of customers to their locations, also based on developing the CVRP model for optimizing the routing issues. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    An efficient innovative method to decrease routing table size in packet switched networks by Baygi, Maassoumeh Javadi, Ramli, Abdul Rahman, Zaeri, Bahram, Mohd Ali, Borhanuddin

    Published 2013
    “…Taking into consideration the highly distributed character of networks, numerous multi-agent based algorithms, and particularly ant colony based algorithms, have been proposed in recent years. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  12. 12

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…Genetic Algorithm as population-based methods are better identifying promising areas in the search space, while Tabu Search and Simulated Annealing as trajectory methods are better in exploring promising areas in search space. …”
    Get full text
    Get full text
    Monograph
  13. 13
  14. 14
  15. 15

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra’s based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    An Efficient Genetic Algorithm for Large Scale Vehicle Routing Problem Subject to Precedence Constraints by Noraini, Mohd Razali

    Published 2015
    “…Therefore, metaheuristic method based genetic algorithm has been developed to obtain feasible and optimal solution with less computation time. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…This paper presents a complete routing algorithm which can further refine the solution by using Dijkstra's based greedy method. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Even-odd scheduling based energy efficient routing for wireless sensor network (WSN) / Muhammad Zafar Iqbal Khan by Khan, Muhammad Zafar Iqbal

    Published 2022
    “…To achieve the task of a longer network lifetime and higher average node energy, we have proposed an energy-efficient routing protocol motivated from the concept of well-known Low Energy Adaptive Cluster Hierarchy routing algorithm also known as LEACH, and optimized it with the concept of alternate hitting, which means the even-odd scheduling-based routing. …”
    Get full text
    Get full text
    Thesis
  19. 19

    An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

    Published 2017
    “…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
    Get full text
    Get full text
    Get full text
    Article
  20. 20

    A new machine learning-based hybrid intrusion detection system and intelligent routing algorithm for MPLS network by Mohammad Azmi Ridwan, Dr.

    Published 2023
    “…This thesis proposes a hybrid ML-based intrusion detection system (ML-IDS) and ML-based intelligent routing algorithm (ML-RA) for MPLS network. …”
    text::Thesis