Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem

Proceedings of the ACM Symposium on Applied Computing

Volumn 2, Issue , 2004, Pages 980-984

  Julstrom, Bryant A ^a   Antoniades, Athos ^b  

^a ST CLOUD STATE UNIVERSITY   (United States)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

Genetic algorithm; Permutation coding; Perturbation coding; Rectilinear Steiner arborescence

Indexed keywords

CODES (SYMBOLS); ENCODING (SYMBOLS); PERTURBATION TECHNIQUES; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS); VLSI CIRCUITS;

PERMUTATION CODING; PERTURBATION CODING; RECTILINEAR STEINER ARBORESCENCE; VERTICAL LINE SEGMENTS;

EVOLUTIONARY ALGORITHMS;

EID: 2442549948     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/967900.968100     Document Type: Conference Paper

References (16)

1. J. E. Beasley. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41:1069-1072, 1990.
2. J. P. Cohoon, J. E. Karro, W. N. Martin, and W. D. Niebel. 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, pages 118-127. SPIE Press, 1998.
3. J. Cong, A. B. Khang, and K.-S. Leung. 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(1):24-39, 1998.
4. J. Córdova and Y.-H. Lee. A heuristic algorithm for the rectilinear Steiner arborescence problem. Technical Report TR-94-025, Department of Computer Science, University of Florida, 1994.
5. D. E. Goldberg and J. Robert Lingle. Alleles, loci, and the traveling salesman problem. In J. J. Greffenstette, editor, Proceedings of the First International Conference on Genetic Algorithms, pages 154-159, Hillsdale, NJ, 1985. Lawrence Erlbaum.
6. B. A. Julstrom. Encoding rectilinear Steiner trees as lists of edges. In G. B. Lament, E. A. Yfantis, H. Haddad, G. A. Papadopoulos, and J. Carroll, editors, Proceedings of the 16th ACM Symposium on Applied Computing, pages 356-360, New York, 2001. ACM Press.
7. B. A. Julstrom. A hybrid evolutionary algorithm for the rectilinear Steiner problem, In A. Barry, editor, 2003 Genetic and Evolutionary Computation Workshop Program, pages 49-55, Chicago, IL, July 2003.
8. R. R. Ladeira de Matos. A rectilinear arborescence problem. PhD thesis, University of Alabama, 1979.
9. K.-S. Leung and J. Cong. Fast optimal algorithms for the minimum rectilinear Steiner arborescence problem. In Proceedings of the International Symposium on Circuits and Systems, pages 1568-1571, 1997.
10. L. Natansky, S. M. Selkow, and N. F. Stewart. Cost minimum trees in directed acyclic graphs. Journal of Operations Research, 18:59-67, 1974.
11. R. C. Prim. Shortest connection networks and some generalizations. Bell System Technical Journal, 36:1389-1401, 1957.
12. S. Ramnath. New approximations for the rectilinear Steiner arborescence problem. IEEE Transactions on Computer-Aided Design, pages 859-869, July 2003.
13. S. K. Rao, P. Sadayappan, F. K. Hwang, and P. W. Shor. The rectilinear Steiner arborescence problem. Algorithmica, 7:277-288, 1992.
14. W. Shi and C. Su. The rectilinear Steiner arborescence problem is NP-complete. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pages 780-786, 2000.
15. V. A. Trubin. Subclass of the Steiner problems on a plane with a rectilinear metric. Cybernetics, 21:320-322, 1985.
16. C. L. Valenzuela and L. P. Williams. Improving simple heuristic algorithms for the traveling salesman problem using a genetic algorithm. In T. Back, editor, Proceedings of the Seventh International Conference on Genetic Algorithms, pages 458-464, San Francisco, CA, 1997. Morgan Kaufmann Publishers.