A weight-coded genetic algorithm for the minimum weight triangulation problem

Proceedings of the ACM Symposium on Applied Computing

Volumn 02-February-1998, Issue , 1998, Pages 327-331

  Capp, Kerry ^a   Julstrom, Bryant A ^b  

^a NATIONAL MARROW DONOR PROGRAM   (United States)

^b ST CLOUD STATE UNIVERSITY   (United States)

Author keywords

Computational geometry; The minimum weight triangulation problem; Triangulations; Weighted codings

Indexed keywords

CHROMOSOMES; COMPUTATIONAL GEOMETRY; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; SURVEYING;

CONVEX HULL; GENERATIONAL GENETIC ALGORITHMS; GREEDY HEURISTICS; JOIN POINT; MINIMUM WEIGHT TRIANGULATION; PROBLEM INSTANCES; TOTAL LENGTH; WEIGHTED CODINGS;

TRIANGULATION;

EID: 85001907733     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/330560.330833     Document Type: Conference Paper

References (13)

1. Jürgen Branke and Martin Middendorf. Searching for shortest common supersequences by means of a heuristic-based genetic algorithm. In Jarmo T. Alander, editor, Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications (2NWGA), Proceedings of the University of Vaasa Reports, pages 105-113, University of Vaasa, Vaasa, Finland, August 1996.
2. J. C. Davis and M. J. McCullagh. Display and Analysis of Spatial Data. Wiley, 1975.
3. Matthew T. Dickerson, Scott A. McElfresh, and Mark Montague. New algorithms and empirical findings on minimum weight triangulation heuristics. In Proceedings of the Eleventh Annual Symposium on Computational Geometry, pages 238-247, New York, 1995. ACM Press.
4. A. E. Eiben and J. K. van der Hauw. Solving 3-SAT by GAs adapting constraint weights. In Proceedings of 1997 IEEE International Conference on Evolutionary Computation, pages 81-86. IEEE, IEEE Neural Network Council, Evolutionary Programming Society, IEEE, April 1997.
5. L. S. Heath and S. V. Pemmaraju. New results for the minimum weight triangulation problem. Algorithmica, 12(3):533-552, 1994.
6. Bryant A. Julstrom. Representing rectilinear Steiner trees in genetic algorithms. In K. M. George, Janice H. Carroll, Dave Oppenheim, and Jim High-tower, editors, Applied Computing 1996: Official Program of the 1996 ACM Symposium on Applied Computing, pages 245-250, New York, 1996. ACM Press.
7. Bryant A. Julstrom. Strings of weights as chromosomes in genetic algorithms for combinatorial problems. In Jarmo T. Alander, editor, Proceedings of the Third Nordic Workshop on Genetic Algorithms and their Applications (SN WG A ), August 1997.
8. A. Lingas. The greedy Delaunay triangulations are not bad in the average case and minimum weight triangulation of multi-connected polygons is NP-complete. In Foundations of Computation Theory, number 158 in Lecture Notes in Computer Science, pages 270-284. Springer-Verlag, Berlin, 1983.
9. Eroi Lynn Lloyd. On triangulations of a set of points in the plane. In Proceedings of the 18th Annual Symposium on Foundations of Computer Science, pages 228-240, 1977.
10. Joseph O'Rourke. Computational Geometry in C. Cambridge University Press, Cambridge, 1993.
11. Charles C. Palmer and Aaron Kershenbaum. Representing trees in genetic algorithms. In Proceedings of the First IEEE Conference on Evolutionary Computation, volume 1, pages 379-384. IEEE Neural Networks Council and IEEE, June 1994.
12. Kaihuai Qin, Wenping Wang, and Minglun Gong. A genetic algorithm for the minimum weight triangulation. In Proceedings of 1997 IEEE International Conference on Evolutionary Computation, pages 541-546. IEEE, IEEE Neural Network Council, Evolutionary Programming Society, IEEE, April 1997.
13. J. David Schaffer and Larry J. Eshelman. Combinatorial optimization by genetic algorithms: the value of the genotype/phenotype distinction. In Vladimir Uskov, Bill Punch, and Erik D. Goodman, editors, First International Conference on Evolutionary Computation and Its Applications: Program and Proceedings, pages 110-120, Moscow, Russia. 1996.