World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

A COEVOLUTIONARY GENETIC SEARCH FOR A LAYOUT PROBLEM

    https://doi.org/10.1142/9789812561794_0020Cited by:0 (Source: Crossref)
    Abstract:

    This chapter is devoted to an application of genetic algorithms and coevolutionary principles to a large optimization problem. Starting point is a mixed integer linear program which models our problem—in this case a facility layout problem. As the number of binary variables increases quadratically with the problem size, currently available solvers fail already for small problem instances. Using a genetic search our algorithm reduces the number of binary variables by setting a considerable part of them. The genetic operators were specially designed to yield a high percentage of feasible variable settings. In order to further speed up the computation of large problems we propose a partition into interdependent subproblems. Each subproblem ("species") is evolved by a genetic algorithm respecting the constraints ("environment") generated by the others. Numerical experiments verify this revolutionary approach.