The design of a manufacturing layout is incomplete without consideration of aisle structure for material handling. This paper presents a method to solve the layout and aisle structure problems simultaneously by a slicing floorplan. In this representation, the slicing lines are utilised as the aisles for a material handling system. The method decomposes the problem into two stages. The first stage minimises the material handling cost with aisle distance, and the second stage optimises the aisles in the aisle structure. A representation of slicing floorplan is introduced for the optimisation by genetic algorithms (GAs). The corresponding operators of the GA are also developed. Computational tests demonstrate the goodness of the method. A comp...
This paper proposes a two-phase genetic algorithm (GA) to solve the problem of obtaining an optimum ...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
Abstract:- Real world optimization problems are typically complex and difficult to solve. In this wo...
This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorpla...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper outlines an approach for the automatic design of material layouts for the residential bui...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper outlines an approach for the automatic design of material layouts for the residential bui...
The use of genetic algorithms to solve facility layout problems has gained popularity in recent year...
This paper is concerned with the application of the technique of genetic algorithms to solve the pro...
Abstract. This proposed research focus on an aisle construction system for automated multiple-floor ...
As of this writing, many success stories exist yet of powerful genetic algorithms (GAs) in the field...
Rapport interne.In this paper, we solve approximately a physical facility layout by using two geneti...
The facility layout problem (FLP) is one of the most important classic industrial engineering and pr...
The unequal-area, shape constrained facility layout problem is a NP-hard combinatorial optimization ...
This paper proposes a two-phase genetic algorithm (GA) to solve the problem of obtaining an optimum ...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
Abstract:- Real world optimization problems are typically complex and difficult to solve. In this wo...
This is a preliminary study in which we use a genetic algorithm to solve the multiple layer floorpla...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper outlines an approach for the automatic design of material layouts for the residential bui...
The component layout problem requires efficient search of large, discontinuous spaces. Theefficient ...
This paper outlines an approach for the automatic design of material layouts for the residential bui...
The use of genetic algorithms to solve facility layout problems has gained popularity in recent year...
This paper is concerned with the application of the technique of genetic algorithms to solve the pro...
Abstract. This proposed research focus on an aisle construction system for automated multiple-floor ...
As of this writing, many success stories exist yet of powerful genetic algorithms (GAs) in the field...
Rapport interne.In this paper, we solve approximately a physical facility layout by using two geneti...
The facility layout problem (FLP) is one of the most important classic industrial engineering and pr...
The unequal-area, shape constrained facility layout problem is a NP-hard combinatorial optimization ...
This paper proposes a two-phase genetic algorithm (GA) to solve the problem of obtaining an optimum ...
Cutting and packing problems are combinatorial optimisation problems. In most manufacturing situatio...
Abstract:- Real world optimization problems are typically complex and difficult to solve. In this wo...