This paper presents a coevolutionary approach to the numerical optimization of large facility layouts. Our work is based on a mixed integer model for the layout constraints and objectives, which improves formulations found in the literature. Nevertheless, layouts with more than seven departments are difficult to solve. One way out is to apply genetic algorithms - searching systematically for solutions but without guarantee of finding an optimum. In this paper we suggest some improved mutation and cross-over operators. Yet, with increasing number of departments also genetic algorithms take very long. In this case we propose to use additional structures given by qualitative or quantitative reasoning. Clustering the departments into groups we ...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper presents an algorithm combining dynamic programming and genetic search for solving a dyna...
This paper is dedicated to a coevolutionary approach to the numerical optimization of large facility...
This chapter is devoted to an application of genetic algorithms and coevolutionary principles to a l...
The unequal-area, shape constrained facility layout problem is a NP-hard combinatorial optimization ...
International audienceThis work proposes a new methodology and mathematical formulation to address t...
International audienceThis work proposes a new methodology and mathematical formulation to address t...
Colloque sans acte à diffusion restreinte.We propose efficient approximate solutions to large size p...
Finding locations or positions of machines, cells, facilities, or departments in a workspace is cate...
Rapport interne.In this paper, we solve approximately a physical facility layout by using two geneti...
This paper is concerned with the application of the technique of genetic algorithms to solve the pro...
The Facility Layout Problem (FLP) concerns minimising total traffic cost between facilities in a par...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper presents an algorithm combining dynamic programming and genetic search for solving a dyna...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper presents an algorithm combining dynamic programming and genetic search for solving a dyna...
This paper is dedicated to a coevolutionary approach to the numerical optimization of large facility...
This chapter is devoted to an application of genetic algorithms and coevolutionary principles to a l...
The unequal-area, shape constrained facility layout problem is a NP-hard combinatorial optimization ...
International audienceThis work proposes a new methodology and mathematical formulation to address t...
International audienceThis work proposes a new methodology and mathematical formulation to address t...
Colloque sans acte à diffusion restreinte.We propose efficient approximate solutions to large size p...
Finding locations or positions of machines, cells, facilities, or departments in a workspace is cate...
Rapport interne.In this paper, we solve approximately a physical facility layout by using two geneti...
This paper is concerned with the application of the technique of genetic algorithms to solve the pro...
The Facility Layout Problem (FLP) concerns minimising total traffic cost between facilities in a par...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper presents an algorithm combining dynamic programming and genetic search for solving a dyna...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper presents an algorithm combining dynamic programming and genetic search for solving a dyna...