By our analysis, the QoS routing is the optimization problem under the satisfaction of multiple QoS constraints. The Particles Swarm Optimization (PSO) is an optimization algorithm which has been applied to finding shortest path in the network. However, it might fall into local optimal solution, and is not able to solve the routing based on multiple constraints. To tackle this problem, we propo...

The task of VLSI physical design is to produce the layout of an integrated circuit. The layout problem in VLSI-design can be broken up into the subtasks partitioning, floor p lanning, placement and routing. Routing can be classified into two types. One is Global routing and another one is detailed routing. In detailed routing, the Connections between blocks or cells, respectively, have to be ge...

There are various bio inspired and evolutionary approaches including genetic programming (GP), Neural Network, Evolutionary programming (EP) exp loited for routing optimizat ion in MANETs and WSNs. The Swarm Intelligence based algorithmic approaches; Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO) are more p romising in provid ing loop free, energy-aware, and mult i-path rou...

In this paper we present a new layout-driven timing model based on Asymptotic Waveform Evaluation (AWE) for improved timing analysis during routing. Our model enables the bottom-up computation of interconnect tree moments, and can be easily integrated with such a global router. Such an integration achieves incremental layout optimization, i.e., timing analysis and routing are tightly coupled, w...

We present a heuristic algorithm for the optimization of transport on complex networks. Previously proposed network transport optimization algorithms aim at avoiding or reducing link overload. Our algorithm balances traffic on a network by minimizing the maximum node betweenness with as little path lengthening as possible, thus being useful in cases when networks are jamming due to node congest...

A cross-layer network optimization problem is considered. It involves network and transport layers, treating both routing and flows as decision variables. Due to the nonconvexity of the capacity constraints, when using Lagrangian relaxation method a duality gap causes numerical instability. It is shown that the rescue preserving separability of the problem may be the application of the augmente...

In this paper, we propose an end-to-end route optimization scheme for nested mobile networks, which we refer to as Recursive Binding Update plus (RBU+). A nested mobile network is a hierarchical form of mobile networks. Nested mobile networks suffer from a pinball routing problem with hierarchical mobile routers. This problem becomes more serious in the case of macro mobility, as the routing di...

in a logistic system, decisions on location of depot, vehicle routing and assignment of routes to vehicles should be considered simultaneously. the location-routing problems are defined to find the optimal number and locations of depots, and at the same time with the distribution routes for the vehicles. because of the complexity and the time consuming computation, this problem belongs to a cla...