Three evolutionary codings of rectilinear steiner arborescences

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3102, Issue , 2004, Pages 1282-1291

  Julstrom, Bryant A ^a   Antoniades, Athos ^b  

^a ST CLOUD STATE UNIVERSITY   (United States)

^b UNIVERSITY OF NICOSIA   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; GEOMETRY;

EUCLIDEAN PLANES; GEOMETRIC PROBLEMS; GREEDY HEURISTICS; NEAR OPTIMUM; NP-HARD; RECTILINEAR STEINER ARBORESCENCES; TOTAL LENGTH; VLSI DESIGN;

EVOLUTIONARY ALGORITHMS;

EID: 35048843748     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24854-5_123     Document Type: Article

References (18)

1. 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 (1998) 24-39
2. Shi, W., Su, C.: The rectilinear Steiner arborescence problem is NP-complete. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms. (2000) 780-786
3. Rao, S.K., Sadayappan, P., Hwang, F.K., Shor, P.W.: The rectilinear Steiner arborescence problem. Algorithmica 7 (1992) 277-288
4. Cordova, J., Lee, Y.H.: A heuristic algorithm for the rectilinear Steiner arbores cence problem. Technical Report TR-94-025, Department of Computer Science, University of Florida (1994)
5. 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. (1997) 1568-1571
6. Ramnath, S.: New approximations for the rectilinear Steiner arborescence problem. IEEE Transactions on Computer-Aided Design 22 (2003) 859-869
7. Julstrom, B.A.: Encoding rectilinear Steiner trees as lists of edges. In Lamont, G.B., Yfant is, E.A., Haddad, H., Papadopoulos, G.A., Carroll, J., eds.: Proceedings of the 16th ACM Symposium on Applied Computing, New York, ACM Press (2001) 356-360
8. 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 (2003) 49-55
9. 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, San Francisco, CA, Morgan Kaufmann Publishers (1997) 458-464
10. Cohoon, J.P., Karro, J.E., Martin, W.N., Niebel, W.D.: Perturbation method for probabilistic search for the traveling salesperson problem. In: Applications and Science of Neural Networks, Fuzzy Systems, and Evolutionary Computation. Volume 3455 of Proceedings of SPIE. SPIE Press (1998) 118-127
11. Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36 (1957) 1389-1401
12. 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)
13. Goldberg, D.E., Robert Lingle, J.: Alleles, loci, and the traveling salesman problem. [18] 154-159
14. Reeves, C.R.: A genetic algorithm for flowshop sequencing. Computers and Operations Research 22 (1995) 5-13
15. Smith, D.: Bin packing with adaptive search. [18] 202-207
16. Presser, P.: A hybrid genetic algorithm for pallet loading. In: Proceedings of the 8th European Conference on Artificial Intelligence, London, Pitman (1988)
17. Beasley, J.E.: OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society 41 (1990) 1069-1072
18. Greffenstette, J.J., ed.: Proceedings of the First International Conference on Genetic Algorithms. In Greffenstette, J.J., ed.: Proceedings of the First International Conference on Genetic Algorithms, Hillsdale, NJ, Lawrence Erlbaum (1985)