Using Genetic Algorithms for Solving Hard Problems in GIS

Genetic algorithms (GAs) are powerful combinatorial optimizers that are able to find close-to-optimal solutions for difficult problems by applying the paradigm of adaptation through Darwinian evolution. We describe a framework for GAs capable of solving certain optimization problems encountered in geographical information systems (GISs). The framework is especially suited for geographical problems since it is able to exploit their geometrical structure with a novel operator called the geometrically local optimizer. Three such problems are presented as case studies: map labeling, generalization while preserving structure, and line simplification. Experiments show that the GAs give good results and are flexible as well.

[1]  Dirk Thierens Estimating the significant non-linearities in the genome problem-coding , 1999 .

[2]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[3]  Hillol Kargupta,et al.  Function induction, gene expression, and evolutionary representation construction , 1999 .

[4]  Dirk Thierens,et al.  Elitist recombination: an integrated selection recombination GA , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[5]  Dirk Thierens,et al.  Robust genetic algorithms for high quality map labeling , 1998 .

[6]  Günther R. Raidl,et al.  A Genetic Algorithm for Labeling Point Features , 2003 .

[7]  David E. Goldberg,et al.  Genetic Algorithms and Walsh Functions: Part I, A Gentle Introduction , 1989, Complex Syst..

[8]  Joe Marks,et al.  The Computational Complexity of Cartographic Label Placement , 1991 .

[9]  C. Reeves Modern heuristic techniques for combinatorial problems , 1993 .

[10]  Fernando G. Lobo,et al.  A parameter-less genetic algorithm , 1999, GECCO.

[11]  Dirk Thierens,et al.  Scalability Problems of Simple Genetic Algorithms , 1999, Evolutionary Computation.

[12]  Dirk Thierens,et al.  Scalability and Efficiency of Genetic Algorithms for Geometrical Applications , 2000, PPSN.

[13]  Steven van Dijk,et al.  Genetic algorithms for map labeling , 2001 .

[14]  M. Iri,et al.  Polygonal Approximations of a Curve — Formulations and Algorithms , 1988 .

[15]  G. E. Liepins,et al.  A Genetic Algorithm Approach to Multiple-Fault Diagnosis , 1991 .

[16]  Joe Marks,et al.  An empirical study of algorithms for point-feature label placement , 1995, TOGS.

[17]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[18]  Dirk Thierens,et al.  On The Design of Genetic Algorithms for Geographical Applications , 1999, GECCO.

[19]  Karen Aardal,et al.  An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling , 1999, ESA.

[20]  Dirk Thierens,et al.  Mixing in Genetic Algorithms , 1993, ICGA.

[21]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[22]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[23]  Roger L. Wainwright,et al.  Placing Text Labels an Maps and Diagrams using Genetic Algorithms with Masking , 1997, INFORMS J. Comput..

[24]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[25]  Martin Pelikan,et al.  Parameter-less Genetic Algorithm: A Worst-case Time and Space Complexity Analysis , 2000, GECCO.