Nowadays Network-on-Chips is used instead of System-on-Chips for better performance. This paper presents a new algorithm to find a shorter path, and shows that genetic algorithm is a potential technique for solving routing problem for mesh topology in on-chip-network.

a significant portion of gross domestic production (gdp) in any country belongs to the transportation system. transportation equipment, in the other hand, is supposed to be great consumer of oil products. many attempts have been assigned to the vehicles to cut down greenhouse gas (ghg). in this paper a novel heuristic algorithm based on clark and wright algorithm called green clark and wright (...

this paper discusses the multi-depot vehicle routing problem of heterogeneous fleet of vehicles with time windows for perishable commodities. the objective of the problem is to minimize the total time required for servicing all customers that is equivalent to the total cost. commodities are delivered to the customers with defined time windows by a fleet of heterogeneous vehicles, which have lim...

Distributed double loop networks are very advantageous for the design and implementation of local area networks and parallel processing architectures, mainly due to their fault-tolerance, low communication latency, and regularity. In this paper, an algorithm for the formulation of routing tables that facilitate routing of messages in a distributed double loop network is presented. The algorithm...

In this paper we suggest a novel routing algorithm for Delay Tolerant Networks (DTN). The suggested backpressurealgorithm uses information about queue backlogs in order to make routing decisions on a per-packet basis without the notion of end-to-end routes. The backpressure approach is highly agile and can be used as both a stand alone routing algorithm and a congestion control algorithm for we...

one of the most important problems in schematization and watershed management is determining the watershed measures impacts on flow distribution. flow distribution algorithms grouped into two main types include single flow direction (sfd) algorithm and multiple flow direction (mfd) algorithms. in many package of gis use the single flow direction to runoff routing. in this research studied water...

Absftact-This paper presents a new parallel algorithm for routing unicast (one-to-one) assignments in Ben& networks. Parallel routing algorithms for such networks were reported earlier, but these algorithms were designed primarily to route permutation assignments. The routing algorithm presented in this paper removes this restriction without an increase in the order of routing cost or routing t...

Wireless sensor network a powerful network contains many wireless sensors with limited power resource, data processing, and transmission abilities. Wireless sensor capabilities including computational capacity, radio power, and memory capabilities are much limited. Moreover, to design a hierarchy topology, in addition to energy optimization, find an optimum clusters number and best location of ...

We devise a new approximation algorithm for capacitated vehicle routing. Our yields better ratio general routing as well the unit-demand case and splittable variant. results hold in arbitrary metric spaces. This is first improvement on classical tour partitioning by Haimovich Rinnooy Kan [16] Altinkemer Gavish [2].

We give a unified view to greedy geometric routing algorithms in ad hoc networks. For this, we first present a general form of greedy routing algorithm using a class of objective functions which are invariant under congruent transformations of a point set. We show that several known greedy routing algorithms such as Greedy Routing, Compass Routing, and Midpoint Routing can be regarded as specia...