Circuit Routing Problem Research Articles

Routing Algorithm for Flexible Printed Circuit Channel Area

The flexible printed circuit routing problem has lower routability and lower utilization of routing space due to fewer routing region and fewer routing blockage. Therefore, a new routing algorithm based on pin-line-channel model is proposed for solving the defects mentioned above. Firstly, the PIN-LINE-CHANNEL model is established, which utilizes the characteristics of flexible printed circuit routing problem, such as fewer routing region, available routing direction references and fewer routing blockage. Then the right chain is selected by using the pin-line-channel model. Finally, the routing of flexible printed circuit channel area is completed using a computation geometry method, which is based on the chain. The algorithm runs in a Windows 10 environment with a 2.20 GHz CPU and 16 GB of RAM. The algorithm validation experiments use the test data from industrial case, and the experimental results show that the algorithm achieves a 10 % increase in routability compared with an open-source router named free-routing.

Research on channel routing model of integrated circuit

Based on the research and analysis of integrated circuit routing problem, this paper puts forward a judgment method of no solution for one layer metal channel routing, establishes an optimal routing model for one layer metal routing problem based on 0-1 integer linear programming, an optimal routing algorithm for multi-layer metal routing problem with via, and an improved model for multi-layer metal routing problem with via spacing.

Restart strategies for GRASP with path-relinking heuristics

GRASP with path-relinking is a hybrid metaheuristic, or stochastic local search (Monte Carlo) method, for combinatorial optimization. A restart strategy in GRASP with path-relinking heuristics is a set of iterations {i 1, i 2, …} on which the heuristic is restarted from scratch using a new seed for the random number generator. Restart strategies have been shown to speed up stochastic local search algorithms. In this paper, we propose a new restart strategy for GRASP with path-relinking heuristics. We illustrate the speedup obtained with our restart strategy on GRASP with path-relinking heuristics for the maximum cut problem, the maximum weighted satisfiability problem, and the private virtual circuit routing problem.

A Design Expert System for Auto-Routing of Ship Pipes

Finding the optimum route of ship pipes is a complicated and time-consuming process. Experience of designers is the main tool in this process. To reduce design man-hours and human errors an expert system shell and a geometric modeling kernel are integrated to automate the design process. Existing algorithms for routing problems have been analyzed -most of them are to solve 2-D circuit routing problems. Design of the ship piping system, especially within the engine room, is a complicated, large-scale 3-D routing problem. Methods of expert systems have been implemented to find the routes of ship pipes on the main deck of a bulk carrier. A framework of the intelligent CAD system for pipe auto-routing is suggested. The CADDS 5 of Computer vision is used as the overall CAD environment, the Nexpert Object of Neuron Data is used as the expert system shell, and the CADDS 5 ISSM is used to build user interface through which geometric models" of pipes are created and modified.

AN ANALOG NEURAL NETWORK APPROACH TO GLOBAL ROUTING PROBLEM

Neural networks have been successfully applied to many combinatorial optimization problems. However, applying this technique in the integrated circuit routing problem has yet to be investigated. This paper proposes a modified Hopfield network to solve the global routing problem, which has been proven to be NP-complete. This network is constructed of two layers of neurons. One layer is used for reducing the interconnection wire length and the other layer is used for channel capacity enforcement. The operation and theory under this design are thoroughly discussed and a software simulator will be implemented to monitor the performance of this network. On the average, an approximate 20% total wire length reduction of randomly generated data is obtained.

Optimal routing in circuit switched communication networks

Consideration is given to the optimal circuit routing problem in an existing circuit-switched network. The objective is to find circuit routing which accommodates a given circuit demand while maximizing the residual capacity of the network. In addition, the cost of accommodating the circuit demand should not exceed a given amount. Practical considerations require that a solution be robust to the variations in circuit demand and cost. The objective function for the optimal circuit routing problem is not a smooth one. In order to overcome the difficulties of nonsmooth optimization, the objective function is approximated by smooth concave functions. The optimization algorithm for the circuit routing problem is obtained as a limiting case of the sequence of optimal routing strategies for the corresponding smooth convex optimization problems, and the proof of its convergence to the optimal solution is given. An approach to calculating the optimal multicommodity flow is presented. The optimization algorithm efficiently handles networks with a large number of commodities, satisfies the robustness requirements, and can be used to solve circuit routing problems for large networks. >

Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)

Bibliography on Algorithms for Shortest Path, Shortest Spanning Tree, and Related Circuit Routing Problems (1956–1974)