Implementation of placement and routing algorithms for computer aided design of printed circuit boards

doi:10.1016/0097-8493(83)90028-6

Computers & Graphics

Volume 7, Issues 3–4, 1983, Pages 333-347

https://doi.org/10.1016/0097-8493(83)90028-6 Get rights and content

Abstract

The Printed Circuit Board (PCB) layout design is one of the most important and time consuming phases during equipment design process in all electronic industries. This paper is concerned with the development and implementation of a computer aided PCB design package. A set of programs which operate on a description of the circuit supplied by the user in the form of a data file and subsequently design the layout of a double-sided PCB has been developed. The algorithms used for the design of the PCB optimise the board area and the length of copper tracks used for the interconnections. The output of the package is the layout drawing of the PCB, drawn on a CALCOMP hard copy plotter and a Tektronix 4012 storage graphics display terminal. The routing density (the board area required for one component) achieved by this package is typically 0.8 sq. inch per IC. The package is implemented on a DEC 1090 system in Pascal and FORTRAN and SIGN(1) graphics package is used for display generation.

References (18)

M.A. Breuer
S. Sahni
The complexity of design automation problems
M. Hanan et al.
Some experimental results on placement techniques
S. Goto
An efficient algorithm for the two-dimensional placement problem in electrical circuit layout
IEEE Trans. Circuits and Systems
(1981)
D.G. Schweikert
A two dimensional placement algorithm for the layout of electrical circuits
B.A. Gadkari et al.
Computer aided design of printed circuit boards
C. S. Horng & B. S. Ting, A routing program for multilayered printed circuit boards. Memo, Electronic Research...
C.Y. Lee
An algorithm for path connections and its applications
IRE Trans. Electronic Computers
(1961)
D.W. Hightower
A solution to line routing problems on the continuous plane

There are more references available in the full text version of this article.

Cited by (1)

A double-loop hybrid algorithm for the traveling salesman problem with arbitrary neighbourhoods
2018, European Journal of Operational Research
Citation Excerpt :
TSPN has numerous applications in various fields. In recent decades, it was widely applied to practical problems such as warehouse-order selection (Daniels, Rummel, & Schantz, 1998; Guenov & Raeside, 1992; Lu, Mcfarlane, Giannikas, & Zhang, 2015; Ratliff & Rosenthal, 1983), very large-scale integration (VLSI) circuits and printed circuit-board (PCB) automatic routing (Patnaik, Gadkari, & Ramakrishnan, 1983; Recski, 2001; Reich & Widmayer, 1990), vehicle routing (Koç, Bektaş, Jabali, & Laporte, 2016; Razali, 2015; Zhang, Chen, Xin, & Peng, 2014), robot path planning (Lai & Jiang, 2013; Tekdas, Isler, Lim, & Terzis, 2009) and communication-network optimization (Mitchell, 2000; Moazzez-Estanjini & Paschalidis, 2011; Tang, Guo, & Yang, 2015). Though TSPN has been widely applied in many fields and given much attention, few algorithms for TSP with arbitrary neighbourhoods can be found in the literature, as it is usually transformed to a tractable special case, mainly using two methods, (1) neighbourhood predigestion and (2) neighbourhood discretization, both of which have some shortcomings.
This paper addresses the traveling salesman problem with arbitrary neighbourhoods, which is an NP-hard problem in combinatorial optimization and is important in operations research and theoretical computer science. Existing methods based on neighbourhood predigestion and discretization are impractical in cases in which the neighbourhoods are arbitrary. In this paper, the neighbourhoods of the traveling salesman problem are generalized to arbitrarily connected regions in planar Euclidean space. A novel approach to solving this problem is proposed, including a boundary-based encoding scheme and a double-loop hybrid algorithm based on particle swarm optimization and genetic algorithm. In the hybrid algorithm, linear descending inertia weight particle swarm optimization is adopted to search continuous visiting positions in the outer loop, and the genetic algorithm is used to optimize the discrete visiting sequence in the inner loop. The boundary-based encoding scheme can reduce the search space significantly without degrading the solution quality, and the hybrid algorithm can find a high-quality solution in a reasonable time. The computational results on both small and large instances demonstrate that the proposed approach can guarantee a high-quality solution in a reasonable time, compared with three other state-of-the-art algorithms: iterative algorithm, branch-and-bound algorithm, and upper and lower bound algorithm. Moreover, the proposed approach works efficiently in a real-world application that cannot be solved by existing algorithms.

View full text

Technical sectionImplementation of placement and routing algorithms for computer aided design of printed circuit boards

Abstract

The complexity of design automation problems

Some experimental results on placement techniques

An efficient algorithm for the two-dimensional placement problem in electrical circuit layout

IEEE Trans. Circuits and Systems

A two dimensional placement algorithm for the layout of electrical circuits

Computer aided design of printed circuit boards

An algorithm for path connections and its applications

IRE Trans. Electronic Computers

A solution to line routing problems on the continuous plane

Technical section
Implementation of placement and routing algorithms for computer aided design of printed circuit boards