We know that channel routing is very important problem in VLSI physical design. The main objective of a channel routing algorithm is the reduction of the area of a IC chip. In this paper, we just do a survey on some impotent multi-layer routing algorithms. Here we analyze The Efficient Routing algorithm and resolve horizontal constraints and minimize the net wirelength in a particular model of ...

We present a multilevel routing algorithm for circuits modeled on the 3-Dimensional grid. The algorithm repeatedly contracts the grid by coalescing nodes until a small manageable size has been obtained. Routing is performed on the smaller size grid based on a modified shortest path technique. In the reverse process, the grid and subsequently all pre-routed paths are expanded. Additional routing...

an integrated model considers all parameters and elements of different deficiencies in one problem. this paper presents a new integrated model of a supply chain that simultaneously considers facility location, vehicle routing and inventory control problems as well as their interactions in one problem, called location-routing-inventory (lri) problem. this model also considers stochastic demands ...

in this paper, the capacitated location-routing problem with fuzzy demands (clrp-fd) is considered. the clrp-fd is composed of two well-known problems: facility location problem and vehicle routing problem. the problem has many real-life applications of which some have been addressed in the literature such as management of hazardous wastes and food and drink distribution. in clrp-fd, a set of c...

During the last decade, the stringent pressures from environmental and social requirements have spurred an interest in designing a reverse logistics (RL) network. The success of a logistics system may depend on the decisions of the facilities locations and vehicle routings. The location-routing problem (LRP) simultaneously locates the facilities and designs the travel routes for vehicles among ...

We propose a fast generalization method for DQN-Routing, an algorithm based on multi-agent deep reinforcement learning that suffers from problem when introduced to new topologies even if it was trained similar topology. The proposed is the wisdom of crowds and allows distributed routing algorithm, generalize better were not seen before during training. also aims decrease solution search time as...

Recently, a new routing algorithm called inside-out routing algorithm was proposed for routing an arbitrary permutation in the omega-based 2log2 N stage networks. This paper discusses the problems of the inside-out routing algorithm and shows that the suggested condition for proper routing in the omega-omega network is insufficient. An extended necessary and sufficient condition for proper rout...

Integrated optical interconnect is believed to be one of the main technologies to replace electrical wires. Optical Network-on-Chip (ONoC) has attracted more attentions nowadays. Benes topology is a good choice for ONoC for its rearrangeable non-blocking character, multistage feature and easy scalability. Routing algorithm plays an important role in determining the performance of ONoC. But trad...

We present SAMCRA, an exact QoS routing algorithm that guarantees to Þnd a feasible path if such a path exists. Because SAMCRA is an exact algorithm, its complexity also characterizes that of QoS routing in general. The complexity of SAMCRA is simulated in speciÞc classes of graphs. Since the complexity of an algorithm involves a scaling of relevant parameters, the second part of this paper ana...