Abstract
A rectilinear Steiner arborescence connects points in the Euclidean plane’s first quadrant and the origin with directed rectilinear edges from the origin up and to the right. The search for arborescences of minimum total length is NP-hard and finds applications in VLSI design. A greedy heuristic for this problem often returns near-optimum arborescences. Three genetic algorithms encode candidate arborescences as permutations of the points, as perturbations of the points’ locations, and as perturbations of the points’ rectilinear distances from the origin. In comparisons on twenty collections of 50 to 250 points in the first quadrant, the permutation-coded GA returns arborescences that are longer than those of the greedy heuristic. The two perturbation-coded GAs return nearly identical results, their arborescences are consistently shorter than those of the heuristic, and they preserve their advantage as the number of points grows. These results support the usefulness of perturbation codings in evolutionary algorithms for geometric problems like the search for short rectilinear Steiner arborescences.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cong, J., Khang, A.B., Leung, K.S.: Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 17, 24–39 (1998)
Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 780–786 (2000)
Rao, S.K., Sadayappan, P., Hwang, F.K., Shor, P.W.: The rectilinear Steiner arborescence problem. Algorithmica 7, 277–288 (1992)
Córdova, J., Lee, Y.H.: A heuristic algorithm for the rectilinear Steiner arborescence problem. Technical Report TR-94-025, Department of Computer Science, University of Florida (1994)
Leung, K.S., Cong, J.: Fast optimal algorithms for the minimum rectilinear Steiner arborescence problem. In: Proceedings of the International Symposium on Circuits and Systems, pp. 1568–1571 (1997)
Ramnath, S.: New approximations for the rectilinear Steiner arborescence problem. IEEE Transactions on Computer-Aided Design 22, 859–869 (2003)
Julstrom, B.A.: Encoding rectilinear Steiner trees as lists of edges. In: Lamont, G.B., Yfantis, E.A., Haddad, H., Papadopoulos, G.A., Carroll, J. (eds.) Proceedings of the 16th ACM Symposium on Applied Computing, New York, ACM Press, pp. 356–360. ACM Press, New York (2001)
Julstrom, B.A.: A hybrid evolutionary algorithm for the rectilinear Steiner problem. In: Barry, A. (ed.) 2003 Genetic and Evolutionary Computation Workshop Program, Chicago, IL, pp. 49–55 (2003)
Valenzuela, C.L., Williams, L.P.: Improving simple heuristic algorithms for the traveling salesman problem using a genetic algorithm. In: Bäck, T. (ed.) Proceedings of the Seventh International Conference on Genetic Algorithms, pp. 458–464. Morgan Kaufmann, San Francisco (1997)
Cohoon, J.P., Karro, J.E., Martin, W.N., Niebel, W.D.: Perturbation method for probabilistic search for the traveling salesperson problem. In: Proceedings of SPIE, Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation, vol. 3455, pp. 118–127. SPIE Press, San Jose (1998)
Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)
Julstrom, B.A., Antoniades, A.: Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem. In: Proceedings of the 2004 ACM Symposium on Applied Computing, Nicosia, Cyprus (2004)
Goldberg, D.E., Robert Lingle, J.: Alleles, loci, and the traveling salesman problem, 18th edn., pp. 154–159.
Reeves, C.R.: A genetic algorithm for flowshop sequencing. Computers and Operations Research 22, 5–13 (1995)
Smith, D.: Bin packing with adaptive search, 18th edn., pp. 202–207.
Prosser, P.: A hybrid genetic algorithm for pallet loading. In: Proceedings of the 8th European Conference on Artificial Intelligence, London, Pitman (1988)
Beasley, J.E.: OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41, 1069–1072 (1990)
Greffenstette, J.J.: Proceedings of the First International Conference on Genetic Algorithms, Proceedings of the First International Conference on Genetic Algorithms, Hillsdale, NJ, Lawrence Erlbaum (1985)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Julstrom, B.A., Antoniades, A. (2004). Three Evolutionary Codings of Rectilinear Steiner Arborescences. In: Deb, K. (eds) Genetic and Evolutionary Computation – GECCO 2004. GECCO 2004. Lecture Notes in Computer Science, vol 3102. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24854-5_123
Download citation
DOI: https://doi.org/10.1007/978-3-540-24854-5_123
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22344-3
Online ISBN: 978-3-540-24854-5
eBook Packages: Springer Book Archive