Abstract
The design of multi-layer printed circuit boards is vital in the construction of complex electronic systems. Wire routing is a crucial step in the overall design process, which can be decomposed into a number of single row routing (SRR) problems. This paper proposes an approach to solve the SRR problem based on parallel meta-heuristics. The development of this technique involves the design of an encoding strategy that allows all possible routings to be uniquely represented and the derivation of cost functions that maximizes the quality of the developed solutions. Further, parallelization of the proposed approach is attempted to improve the computational efficiency. The different stages of the development are backed by experiments to show the pros and cons of the sequential and parallel implementations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H.C. So, Some theoretical results on the routing of multilayer printed circuit boards, in: Proceedings IEEE Symposium on Circuits and Systems (1974) pp. 296–303.
B.S. Ting, E.S. Kuh and I. Shirakawa, The multilayer routing problem: Algorithms and necessary and sufficient conditions for the single-row single-layer case, IEEE Transactions on Circuits and Systems 23 (December 1976) 768–777.
R. Raghavan and S.K. Sahni, Single row routing, IEEE Transactions on Computers 32 (March 1983) 209–220.
S. Tsukiyama, E.S. Kuh and I. Shirakawa, An algorithm for single-row routing with prescribed street congestions, IEEE Transactions on Circuits and Systems 27 (September 1980) 765–771.
L.C. Liu and H.C. Du, A near-optimal heuristic algorithm for single-row routing, IEEE Transactions on Computers 38 (April 1989) 603–608.
R. Raghavan and S.K. Sahni, The complexity of single row routing, IEEE Transactions on Circuits and Systems 31 (May 1984) 462–471.
T.T.K. Tarng, M. Marek-Sadowska and E.S. Kuh, An efficient single-row routing algorithm, IEEE Transactions on Computer Aided Design 3 (July 1984) 178–183.
E.S. Kuh, T. Kashiwabara and T. Fujisawa, On optimal single-row routing, IEEE Transactions on Circuits and Systems 26 (June 1979) 361–369.
L.C. Liu and H.C. Du, Heuristic algorithms for single-row routing, IEEE Transactions on Computers 36(3) (1987) 312–320.
A.Y. Zomaya, F. Ercal and S. Olariu (eds.), Solutions to Parallel and Distributed Computing Problems: Lessons from Biological Sciences (Wiley, New York, 2001).
A.Y. Zomaya, C. Ward and B. Macey, Genetic scheduling for parallel processor systems: Comparative studies and performance issues, IEEE Transactions on Parallel and Distributed Systems 10(8) (1999) 795–812.
J. Holland, Adaptation in Natural and Artificial Systems (University of Michigan Press, Ann Arbor, MI, 1975).
D.E. Goldberg, Genetic Algorithms in Search: Optimization and Machine Learning (Addison Wesley, Reading, MA, 1989).
P. Husbands, Genetic algorithms, in: Advances in Parallel Algorithms, eds. L. Kronsjo and D. Shumsheruddin (Blackwell Scientific Publications, UK, 1992) pp. 227–276.
A. Chipperfield and P. Fleming, Parallel genetic algorithms, in: Parallel and Distributed Computing Handbook, ed. A.Y. Zomaya (McGraw Hill, New York 1996) pp. 1118–1143.
H. Muhlenbein, M. Schomisch and J. Born, The parallel genetic algorithm as a function optimiser, Parallel Computing 17 (1991) 619–632.
W. Gropp, E. Lusk and A. Skjellum, Using MPI-Portable Parallel Programming with the Message Passing Interface (The MIT Press, Cambridge, MA, 1996).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Zomaya, A.Y., Patterson, D. & Olariu, S. Sequential and Parallel Meta-Heuristics for Solving the Single Row Routing Problem. Cluster Computing 7, 123–139 (2004). https://doi.org/10.1023/B:CLUS.0000018562.79898.9c
Issue Date:
DOI: https://doi.org/10.1023/B:CLUS.0000018562.79898.9c