This paper presents an application of genetic algorithm to a problem of finding of an optimal layout of objects on a material strip with the aim to reduce the total length of material used. In order to reduce the total search space the problem was solved as an ordering problem. This paper focuses on the representation issues of the problem and on designing of such a crossover operator that would allow building blocks formation and facilitate their mixing. Different implementations of the genetic algorithm were experimentally evaluated on a number of test cases. Some interesting results which illustrate a performance of the genetic algorithm are presented here.
CITATION STYLE
Kubalík, J., Lažanský, J., & Zikl, P. (2002). Layout Problem Optimization Using Genetic Algorithms. In Knowledge and Technology Integration in Production and Services (pp. 493–500). Springer US. https://doi.org/10.1007/978-0-387-35613-6_56
Mendeley helps you to discover research relevant for your work.