Removal of Intersection for Multi-net Multi-pin Routing Problem with Layer Assignment

With the increasing density of VLSI circuits, the interconnection wires are getting packed even closer. This has increased the effect of interaction between these wires on circuit performance and hence, the importance of controlling crosstalk. We consider the gridded channel routing problem where, specifically, the channel has 3 routing layers in the VHV configuration. Given a horizontal track assignment for the nets, we present an optimal algorithm for minimizing the crosstalk between vertical wiring segments in the channel by finding an optimal vertical layer assignment for them. We give an algorithm that minimizes total crosstalk between vertical wires on the same V layer on adjacent columns of the grid in O(ν logν) time using O(ν) memory, where the channel has ν columns. We then extend this algorithm to consider crosstalk between wires in nonadjacent columns and between wires on different layers. Finally, we show how our algorithms can be extended to take crosstalk tolerance specifications for nets into account.

Download Full-text

Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls

Journal of the Operational Research Society ◽

10.1057/palgrave/jors/2601263 ◽

2002 ◽

Vol 53 (1) ◽

pp. 115-118 ◽

Cited By ~ 47

Author(s):

J Dethloff

Keyword(s):

Vehicle Routing ◽

Vehicle Routing Problem ◽

Vehicle Routing Problems ◽

Routing Problems ◽

Routing Problem ◽

Simultaneous Delivery ◽

Insertion Heuristic

Download Full-text

Fuzzy multi-objective location and routing problem

Journal of Intelligent & Fuzzy Systems ◽

10.3233/jifs-191654 ◽

2020 ◽

Vol 39 (3) ◽

pp. 3259-3273

Author(s):

Nasser Shahsavari-Pour ◽

Najmeh Bahram-Pour ◽

Mojde Kazemi

Keyword(s):

Firefly Algorithm ◽

High Reliability ◽

Research Area ◽

Nsga Ii ◽

Location Routing Problem ◽

Routing Problem ◽

Location Allocation ◽

Multi Objective ◽

Location Routing ◽

The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

Download Full-text