scholarly journals Routing problem in rectangular mesh network using shortest path based Greedy method

2019 ◽  
Vol 1358 ◽  
pp. 012079
Author(s):  
Noraziah Adzhar ◽  
Shaharuddin Salleh ◽  
Yuhani Yusof ◽  
Muhammad Azrin Ahmad
Keyword(s):  
Shortest Path ◽  
Mesh Network ◽  
Greedy Method ◽  
Routing Problem ◽  
Rectangular Mesh

scholarly journals Simulated Annealing Technique for Routing in a Rectangular Mesh Network

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Noraziah Adzhar ◽  
Shaharuddin Salleh
Keyword(s):  
Simulated Annealing ◽  
Shortest Path ◽  
Printed Circuit Boards ◽  
Optimal Path ◽  
Heuristic Method ◽  
Mesh Network ◽  
Routing Problem ◽  
Rectangular Mesh ◽  
Metaheuristic Methods ◽  
Cell Placement

In the process of automatic design for printed circuit boards (PCBs), the phase following cell placement is routing. On the other hand, routing process is a notoriously difficult problem, and even the simplest routing problem which consists of a set of two-pin nets is known to be NP-complete. In this research, our routing region is first tessellated into a uniformNx×Nyarray of square cells. The ultimate goal for a routing problem is to achieve complete automatic routing with minimal need for any manual intervention. Therefore, shortest path for all connections needs to be established. While classical Dijkstra’s algorithm guarantees to find shortest path for a single net, each routed net will form obstacles for later paths. This will add complexities to route later nets and make its routing longer than the optimal path or sometimes impossible to complete. Today’s sequential routing often applies heuristic method to further refine the solution. Through this process, all nets will be rerouted in different order to improve the quality of routing. Because of this, we are motivated to apply simulated annealing, one of the metaheuristic methods to our routing model to produce better candidates of sequence.

Obstacle-aware routing problem in a rectangular mesh network

2015 ◽  
Vol 9 ◽  
pp. 653-663 ◽  
Author(s):  
Noraziah Adzhar ◽  
Shaharuddin Salleh
Keyword(s):  
Mesh Network ◽  
Routing Problem ◽  
Rectangular Mesh

scholarly journals Parallel Genetic Algorithm for Shortest Path Routing Problem with Collaborative Neighbors

2015 ◽  
Vol 37 ◽  
pp. 327
Author(s):  
Reza Roshani ◽  
Mohammad Karim Sohrabi
Keyword(s):  
Genetic Algorithm ◽  
Mutation Rate ◽  
Shortest Path ◽  
Migration Rate ◽  
Mesh Network ◽  
Alternative Methods ◽  
Parallel Genetic Algorithm ◽  
Routing Problem ◽  
Shortest Path Routing ◽  
Fine Grained

Shortest path routing is generally known as a kind of routing widely availed in computer networks nowadays. Although advantageous algorithms exist for finding the shortest path, however alternative methods may have their own supremacy. In this paper, parallel genetic algorithm for finding the shortest path routing is resorted to. In order to improve the computation time in this routing algorithm and to distribute the load balance between the processors as well, Fine-Grained parallel GA model is opted for. The proposed algorithm was simulated on Wraparound Mesh network topologies in different sizes. To this end, several experiments were anchored to identify the most influential parameters such as Migration rate, Mutation rate, and Crossover rate. The simulation result shows that best result of mutation rate is: about 0.02 and 0.03, and migration rate for transmission to the neighbor’s node is 3 of the best chromosomes. This study has already shown that through using performance-based GA which uses fine-grained parallel algorithms, timing germane shortest path routing can be improved.

SHORTEST PATH TECHNIQUE FOR SWITCHING IN A MESH NETWORK

2012 ◽  
Vol 09 ◽  
pp. 488-494
Author(s):  
WAN NOR MUNIRAH ARIFFIN ◽  
SHAZALINA MAT ZIN ◽  
SHAHARUDDIN SALLEH
Keyword(s):  
Simulation Model ◽  
Shortest Path ◽  
Shortest Path Problem ◽  
Mesh Network ◽  
Broadcast Communication ◽  
Switching Mechanism

Switching is a technique to route data and instructions between pairs of source-destination nodes or among multiple nodes for broadcast communication. We realized that the shortest path problem has a wide application in the design of networks. Therefore, in this paper, we present a mesh network as our switching mechanism for computing the shortest path between the source and destination in our simulation model, developed using C++ on the Windows environment. The Floyd-Warshall algorithm is applied in finding the shortest path in all-pairs nodes.

scholarly journals A Relation of Dominance for the Bicriterion Bus Routing Problem

2017 ◽  
Vol 27 (1) ◽  
pp. 133-155 ◽  
Author(s):  
Jacek Widuch
Keyword(s):  
Graph Theory ◽  
Shortest Path ◽  
Experimental Tests ◽  
Partial Solution ◽  
Estimation Methods ◽  
Final Solution ◽  
Routing Problem ◽  
Variable Weights ◽  
Bus Routing ◽  
The Cost

Abstract A bicriterion bus routing (BBR) problem is described and analysed. The objective is to find a route from the start stop to the final stop minimizing the time and the cost of travel simultaneously. Additionally, the time of starting travel at the start stop is given. The BBR problem can be resolved using methods of graph theory. It comes down to resolving a bicriterion shortest path (BSP) problem in a multigraph with variable weights. In the paper, differences between the problem with constant weights and that with variable weights are described and analysed, with particular emphasis on properties satisfied only for the problem with variable weights and the description of the influence of dominated partial solutions on non-dominated final solutions. This paper proposes methods of estimation a dominated partial solution for the possibility of obtaining a non-dominated final solution from it. An algorithm for solving the BBR problem implementing these estimation methods is proposed and the results of experimental tests are presented.

scholarly journals A Fissile Ripple Spreading Algorithm to Solve Time-Dependent Vehicle Routing Problem via Coevolutionary Path Optimization

2020 ◽  
Vol 2020 ◽  
pp. 1-13
Author(s):  
Wen Xu ◽  
JiaJun Li
Keyword(s):  
Vehicle Routing ◽  
Shortest Path ◽  
Traffic Congestion ◽  
Path Optimization ◽  
Time Dependent ◽  
Optimization Approach ◽  
Routing Problem ◽  
Shortest Path Problems ◽  
Travelling Time ◽  
Logistics Delivery

The time-dependent vehicle routing problems have lately received great attention for logistics companies due to their crucial roles in reducing the time and economic costs, as well as fuel consumption and carbon emissions. However, the dynamic routing environment and traffic congestions have made it challenging to make the actual travelling trajectory optimal during the delivery process. To overcome this challenge, this study proposed an unconventional path optimization approach, fissile ripple spreading algorithm (FRSA), which is based on the advanced structure of coevolutionary path optimization (CEPO). The objective of the proposed model is to minimize the travelling time and path length of the vehicle, which are the popular indicators in path optimization. Some significant factors usually ignored in other research are considered in this study, such as congestion evolution, routing environment dynamics, signal control, and the complicated correlation between delivery sequence and the shortest path. The effectiveness of the proposed approach was demonstrated well in two sets of simulated experiments. The results prove that the proposed FRSA can scientifically find out the optimal delivery trajectory in a single run via global research, effectively avoid traffic congestion, and decrease the total delivery costs. This finding paves a new way to explore a promising methodology for addressing the delivery sequence and the shortest path problems at the same time. This study can provide theoretical support for the practical application in logistics delivery.

Dynamic Genetic Algorithms with Hyper-Mutation Schemes for Dynamic Shortest Path Routing Problem in Mobile Ad Hoc Networks

2012 ◽  
Vol 3 (1) ◽  
pp. 87-98 ◽  
Author(s):  
Hui Cheng
Keyword(s):  
Genetic Algorithms ◽  
Wireless Networks ◽  
Shortest Path ◽  
Network Topology ◽  
Ad Hoc ◽  
Optimization Techniques ◽  
Mobile Wireless Networks ◽  
Mobile Wireless ◽  
Routing Problem ◽  
Mobile Ad Hoc

In recent years, the static shortest path (SP) routing problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks (ANNs), genetic algorithms (GAs), particle swarm optimization (PSO), etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile ad hoc network (MANET), wireless mesh network (WMN), etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, that is, the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. This paper proposes to use two types of hyper-mutation GAs to solve the dynamic SP routing problem in MANETs. The authors consider MANETs as target systems because they represent new generation wireless networks. The experimental results show that the two hyper-mutation GAs can quickly adapt to the environmental changes (i.e., the network topology change) and produce good solutions after each change.

scholarly journals Approach of Improved Topology Development Protocol In Ad Hoc Network Minimizing The Number of Hops And Maintaining Connectivity of Mobile Terminals Which Move From One To The Others

2017 ◽  
Vol 1 (1) ◽  
Author(s):  
Lipur Sugiyanta
Keyword(s):  
Wireless Network ◽  
Data Transmission ◽  
Ad Hoc ◽  
Mesh Network ◽  
Maximum Throughput ◽  
Mobile Terminals ◽  
Average Delay ◽  
Routing Problem ◽  
Delay Performance ◽  
Network Metrics

Wireless ad-hoc mesh network is a special kind of network, where all of the nodes move in time. Node is intended to help relaying packets of neighboring nodes using multi-hop routing mechanism in order to solve problem of dead communication. Wireless mesh network which engages broadcasting and contains multiple hops become increasingly vulnerable to problems such as routing problem and rapid increasing of overhead packets. During this progress, the delay on account of multi hop characteristics and redundant packets caused by communication nature potentially existed during communication. Typically, delay will increase in linearity with number of hops. There is a certain minimum level of delay that will be experienced due to the time it takes to transmit a packet through a link. Topology development holds a significant point prior to the data transmission. Without improved topology development protocol, this problem can decrease network’s performance in overall data transmission. We analyze the delay performance of a multi-hop wireless network with a dynamic route between each source and final destination pair. There are fluctuate interference constraints on the set of links that impose a fundamental delay performance of any instant network topology. At first, we present a similar Link State Routing network simulation to derive such referential lower bounds. We conduct extensive simulation studies to suggest that the average delay of multi-hop transmission policy can be made lower compared to the referential bound by using appropriate functions of network metrics. This paper provides a broadcast framework that engages various network metrics and at the same time maintaining connectivity of nodes (mobile terminals). The framework captures the essential features of the wireless network metrics, i.e. bandwidth, throughput, network buffer, direction, and round trip time. This research is useful since, in many cases, it find that the throughput is the most important parameter in reduction of delay transmission. This result is confirmed with another composite simulation result. Most of network hop delay is impacted with this composite metric, particularly in delay minimization on the longer hops. The reduction achievement on average delay by this algorithm is 0.577% and the total average delay reduction for this simulated network is 0.683%. This research will be further designed primarily for achieving maximum throughput in the multiple wireless network area.

Sign in / Sign up

Export Citation Format

Share Document