Abstract Aiming at the problem of facility layout in intelligent workshops, a collaborative optimization method and AGV path planning based on discrete event simulation (DES) is proposed. This can increase production capacity workshop by solving open-field (OFLP). First, to simplify complex constraints OFLP, mathematical programming model established. Second, hybrid algorithm proposed solve opt...

In the desgin-process of a facility layout, the focus has been mainly on the placement of the machine resources. The material-ow, and therefore the desgin of the aisles has not appropriately been taken into account. We developed a hybrid genetic algorithm (GA) to generate the aisles in a facility layout at minimal xed and variable cost. The application of the GA to a practical problem leads to ...

The facility layout problem is concerned with finding the most efficient arrangement of a given number of departments with unequal area requirements within a facility. The facility layout problem is a hard problem, and therefore, exact solution methods are only feasible for small or greatly restricted problems. In this paper, we propose a spring-embedding approach that unlike previous approache...

Despite the reported effectiveness of analytical algorithms in facility layout planning, a detailed literature survey suggests a lack of new analytical methods in recent years. This paper focuses on open space facilities layout planning that involves modules with constant aspect ratios. We propose a construction-cum-improvement algorithm involving a novel combination of a boundary search-based ...

This paper applies genetic optimization with an adaptive penalty function to the shapeconstrained unequal area facility layout problem. We implement a genetic search for unequal area facility layout, and show how optimal solutions are affected by constraints on permitted department shapes, as specified by a maximum allowable aspect ratio for each department. We show how an adaptive penalty func...

This paper presents a history of a difficult facility layout problem that falls into the category of the Koopmans-Beckmann variant of the Quadratic Assignment Problem (QAP), wherein 30 facilities are to be assigned to 30 locations. The problem arose in 1972 as part of the design of a German university hospital, Klinikum Regensburg. This problem, known as the Krarup30a upon its inclusion in the ...

The design of facility layouts involves a decision process which, in general, due to its complexity, has to be decomposed into several sub-problems, namely: the selection of the most adequate manufacturing processes, the planning of equipment and labour requirements, the allocation of manufacturing operations to machines, the grouping of machines into sections (cells or departments), the select...

With increasing production costs and constraints, demand has increased for manufacturers to minimize maintenance cost and product transport time. We address some aspects of this problem by examining how to choose the optimal layout of stations (machines or buffers) in a production facility based on how the station layout affects the maintenance and product transport times. Specifically, we cons...

A construction site represents a conflux of concerns, constantly calling for a broad and multi-criteria approach to solving problems related to site planning and design. As an important part of site planning and design, the objective of site-level facility layout is to allocate appropriate locations and areas for accommodating temporary site-level facilities such as warehouses, job offices, wor...

this paper offers an approach that could be useful for diverse types of layout problems or even area allocation problems. by this approach there is no need to large number of discrete variables and only by few continues variables large-scale layout problems could be solved in polynomial time. this is resulted from dividing area into discrete and continuous dimensions. also defining decision var...