DocumentCode
450595
Title
A New Heuristic for Single Row Routing Problems
Author
Sherwani, Naveed A. ; Deogun, Jitender S.
Author_Institution
Department of Computer Science, Western Michigan University, Kalamazoo, MI
fYear
1989
fDate
25-29 June 1989
Firstpage
167
Lastpage
172
Abstract
In this paper, we present a new heuristic algorithm for the classical single row routing problem. The algorithm is based on a graph theoretic decomposition scheme and uses modified cut-numbers. The algorithm was implemented in C on VAX 8200. The experimental results show that the quality of solutions generated by our algorithm could be up to 36% better as compared to the existing algorithms.
Keywords
Algorithm design and analysis; Computer science; Distributed computing; Heuristic algorithms; Integrated circuit interconnections; Machinery; Nonhomogeneous media; Permission; Printed circuits; Routing;
fLanguage
English
Publisher
ieee
Conference_Titel
Design Automation, 1989. 26th Conference on
ISSN
0738-100X
Print_ISBN
0-89791-310-8
Type
conf
DOI
10.1109/DAC.1989.203389
Filename
1586373
Link To Document