Abstract
In this paper we consider the space-planning problem, where a fixed set of objects have to be allocated on a single defined area. This is a Constraint Satisfaction Problem where the constraints are: the objects must be placed without overlapping. We have already designed a sequential evolutionary algorithm for space planning problem that has shown to be more performant than others approaches. Our aim is to be able to find more solutions than the sequential approach. The key idea is to design a self-adaptable distributed evolutionary algorithm. The first adaptation of our algorithm comes from the benefit of results already achieved by other nodes of the processors pool. In the paper we compare the first experimental results of our approach for solving space planning problem to the sequential ones. The implementation is running on an heterogeneous environment.
Partially supported by CNRS/CONICYT Collaboration Project France-Chile
This is a preview of subscription content, log in via an institution to check access.
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
Bennett F., Koza J., Shipman J., Stiffelman O., Building a Parallel Computer System for $18,000 that Performs a Half Peta-Flop per Day. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO’1999.
Bowen J., Dozier G., Solving Constraint Satisfaction Problems Using A Genetic/Systematic Search Hybrid That Realizes When to Quit. Proceedings of the Sixth International Conference on Genetic Algorithms pp. 122–129, 1995.
Charman P., Gestion des contraintes geometriques pour l’aide de l’amenagement spatial. These-Ecole Nationale des Ponts et Chaussées, 1995.
Cruz I., Marriott K., Van Hentenryck P,. Proceedings of the International Workshop on Constraints for Graphics and Visualization. In association with CP’95, 1995.
Dozier G., Bowen J., Bahler D., Solving Small and Large Scale Constraint Satisfaction Problems Using a Heuristic-Based Microgenetic Algorithm. Proc. of the First IEEE Conf on Evolutionary Computation, Orlando, pp 306–311, 1994.
Eastman C., Representations for Space Planning. Communications of ACM, Volume 13, Number 4, 1970.
Eiben A.E., van Hemert J.I., Marchiori E., Steenbeek A.G., Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive fitness function. Proceedings of the 5th Conference on Parallel Problem Solving from Nature, number 1498 in LNCS pages 196–205. Springer, Berlin, 1998.
Freuder E., A sufficient condition of backtrack-free search. J. ACM. 29, pp. 24–32, 1982.
Freuder E., The Many Paths to Satisfaction. Constraint Processing, Ed. Manfred Meyer, CA Pringer-Verlag LNCS 923, pp. 103–119, 1995.
Haralick and Elliott, Increasing tree search efficiency for Constraint Satisfaction Problems. Artificial Intelligence 14, pp. 263–313, 1980.
Hopper E., Turton B.C.H, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European Journal of Operational Research 128, 34–57, 2001.
Kumar. Algorithms for constraint satisfaction problems:a survey. AI Magazine, 13(1):32–44, 1992.
Michalewicz Z., Genetic Algorithms + Data Structures = Evolution Programs. Ed. SPringer-Verlag, Artifial Intelligence Series, 1994.
Nicolini C., Bernard M., Jacquenet F., Induction of Constraint Logic Programs for Computer Aided Publishing. International Conference on Artificial Intelligence and Soft Computing, 1997.
Riff M.-C., From Quasi-solutions to Solution: An Evolutionary Algorithm to Solve CSP. Constraint Processing (CP96), Ed. Eugene Freuder, pp. 367–381, 1996.
Riff M-C, Bonnaire X., An effective evolutionary approach for the Space-Planning Problem. Proceedings of the 3rd. Metaheuristic International Conference, Brasil, 1999.
Simonis H., Van Hentenryck P., Solving a cutting-stock problem in constraint logic programming Technical Report TR-LP-28, ECRC, January 1988.
Tokuyama, Asano T., Tsukiyama S., A dynamic algorithm for placing rectangles without overlapping. Journal of Information Processing, 14(1):30–35, 1991.
Tsang E., Applying Genetic Algorithms to Constraint Satisfaction Optimization Problems. Proc. of ECAI-90, Pitman Publishing, pp 649–654, 1990
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bonnaire, X., Riff, MC. (2002). A Self-Adaptable Distributed Evolutionary Algorithm to Tackle Space Planning Problems. In: Fagerholm, J., Haataja, J., Järvinen, J., Lyly, M., Råback, P., Savolainen, V. (eds) Applied Parallel Computing. PARA 2002. Lecture Notes in Computer Science, vol 2367. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48051-X_40
Download citation
DOI: https://doi.org/10.1007/3-540-48051-X_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43786-4
Online ISBN: 978-3-540-48051-8
eBook Packages: Springer Book Archive