Abstract
In this paper, a system for spatial layout and its application to cartographic domain is proposed. Genetic algorithms have been used as a way to deal with several kinds of constraints (fuzzy and Boolean), by means of the fitness function.
When a representation other than bit strings is used, it is often necessary to redefine the genetic operators. This led us to consider specific mutation and crossover operators. Specific probabilities are also needed in order to realise the combined goals of maintaining diversity in the population and sustaining the convergence capacity of the resolution process. Mutation process needs probabilistic model and is performed by means of the Gibbs-Boltzman probability. In this way, our system profits by the simulated annealing efficiency. This mixed method permits to examine solutions space without falling into a local minimum. The search process decreases a fitness function. This function describes the sum of costs inherent to different constraints. In order to explore entirely the solutions space, crossover process has been set up using adaptive probability. This probability varies during the resolution process. This variation is defined in order to process all regions of the cartographic map considering that, mutation operator is more dedicated to a given region of the map.
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
Djouadi, Y.: Fuzzy modelling of spatial relationships for automated Placement/Retrieval System. Eurocarto conference, IX. 1 (1994).
Zoraster, S.: Integer Programing Applied to the Map Label Placement Problem. Cartographica Review, Vol 23, N° 3, 16 (1986).
Freeman, H., Doerschler, J.S.: A Rule-Based System for Dense-map Name Placement. Communications of the ACM, Vol 35, No 1, 68 (1992).
Basoglu, U., Johnson, D.S.: The Use of Artificial Intelligence in the Automated Placement of Cartographic Names. Ninth Int. Sym. on Computer-Assisted Cartography, 225 (1989).
Cohoon, J.P., Paris, W.D.: Genetic Placement. Proc of the 23rd Design Automation Conference, 422 (1986).
Shahookar, K., Mazumder, P.: GASP — A Genetic Algorithm for Standard Cell Placement. EDAC Conference, 660 (1990).
Djouadi, Y.: Cartage - A Cartographic Layout System based on Genetic Algorithms. EGIS Conference, 48 (1994).
Grefenstette, J.J.: Genetic Algorithms. IEEE Review on Intelligent Systems and their Applications, 5 (1993).
Khatib, O. (1987), A Unified Approach for Motion and Force Control of Robot Manipulators: The Operational Space Formulation. IEEE Journal of Robotics and Automation, vol. RA-3, No 1, pp. 43–53.
Srinivas, M., Patnik, L.M.: Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms. IEEE Trans, on SMC, Vol 24, N° 4, 656 (1994).
Metropolis, N., Rosenbluth, A., Teller, A.: Equations of State Calculations by fast Computing Machines. Journal Chem. Phys., vol 21, 1087 (1953).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag/Wien
About this paper
Cite this paper
Djouadi, Y. (1995). Resolution of Cartographic Layout Problem by Means of Improved Genetic Algorithms. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_11
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7535-4_11
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82692-8
Online ISBN: 978-3-7091-7535-4
eBook Packages: Springer Book Archive