the multiple traveling salesman problem (mtsp) is a generalization of the famous traveling salesman problem (tsp), where more than one salesman is used in the solution. although the mtsp is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. this paper presents an efficient and evolutionary optimization algorith...

the heterogeneous fixed fleet open vehicle routing problem (hffovrp) is one of the most significant extension problems of the open vehicle routing problem (ovrp). the hffovrp is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. in this problem, the vehicle doesn’t return to the depot after se...

This paper presents a simple, efficient and cost effective routing strategy that considers deadlock recovery as opposed to prevention. Performance is optimized in the absence of deadlocks by allowing maximum flexibility in routing. Disha supports true fully adaptive routing where all virtual channels at each node are available to packets without regard for deadlocks. Deadlock cycles, upon formi...

The heterogeneous fixed fleet open vehicle routing problem (HFFOVRP) is one of the most significant extension problems of the open vehicle routing problem (OVRP). The HFFOVRP is the problem of designing collection routes to a number of predefined nodes by a fixed fleet number of vehicles with various capacities and related costs. In this problem, the vehicle doesn’t return to the depot after se...

We introduce three novel algorithms for routing in WDM networks. These schemes are based on the “Best-First Branch-and-Bound” algorithm and take constraints into account. An exact algorithm for the unprotected routing problem in WDM networks, one exact algorithm, and a heuristic for the routing with 1+1 protection are described. By simulations with realistic optical networks and grid topologies...

An algorithm is presented for obtaining a planar routing of two power nets in building-block layout. In contrast to other works, more than one pad for each of the power nets is allowed. First, conditions are established to guarantee a planar routing. The algorithm consists of three parts, a top-down terminal clustering, a bottom-up topological path routing and a wire width calculation procedure...

Many of the calculating systems are made based on a parallel nodes architecture. In these systems, interconnection networks play a main role. Because the number of nodes is thousands, the probability of failure is high. So, developing fault-tolerant mechanisms is essential. In this paper a new fault-tolerant routing algorithm, which is based on deterministic methods, is introduced for a two dim...

In this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular, we examine the possibility of creating scalable algorithms that use only a constant number of buuers per node. Minimal, scalable, deadlock-free routing algorithms are known for many important networks includin...