Real world optimization problems are typically complex and difficult to solve. In this work it is intended to address these problems through a combination of two techniques: Constraint Logic Programming (CLP) and Genetic Algorithms (GA). This approach aims to benefit, on the one hand, from the easiness and naturalness of the CLP to express problems whose formulation is based on constraints, and...

Genetic algorithms have proven to be a wellsuited technique for solving selected combinatorial optimization problems. When solving real-world problems, often the main task is to find a proper representation for the candidate solutions. Strings of elementary data types with standard genetic operators may tend to create infeasible individuals during the search because of the discrete and often co...

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...

We describe a branch and bound algorithm for an assignment problem subject to a special set of side constraints. The problem has application in the design of tool carousels for certain flexible manufacturing systems. The resulting model represents a special case of the restricted facilities layout problem in which it is forbidden to locate any facility in certain zones. The bounds for the algor...

This paper addresses a reliable facility location problem with considering facility capacity constraints. In reliable facility location problem some facilities may become unavailable from time to time. If a facility fails, its clients should refer to other facilities by paying the cost of retransfer to these facilities. Hence, the fail of facilities leads to disruptions in facility location dec...

Preliminary layout design of buildings has a substantial effect on the ultimate design of structural components and accordingly influences the construction cost. Exploring structurally efficient forms and shapes during the conceptual design stage of a project can also facilitate the optimum integrated design of buildings. This paper presents an automated method of determining column layout desi...

The single row facility layout problem (SRFLP) is the problem of arranging facilities with given lengths on a line, with the objective of minimizing the weighted sum of the distances between all pairs of facilities. The problem is NP-hard and research has focused on heuristics to solve large instances of the problem. In this paper we present four scatter search algorithms to solve large sized S...

This paper introduces a novel approach to enhance the general practice of layout planning of construction sites for producing the efficient utilization. In this work, a solution to the problem is attempted for unequal and irregular temporary facility using robust search and optimization capabilities of Ant Colony Optimization (ACO) algorithm, inspired by the foraging behaviour of real ants. The...

Using SLP method obtains the comprehensive correlation through analysis of logistics relationship and non-logistics between various operating units warehouse. According to current situation related warehouse problem, designers can formulate a feasible plan. However, owing is insufficient in solving problem facility layout, that is, it easy be influenced by subjective factors designer, especiall...

The purpose of this research paper is to present a three-stage method using mathematicalprogramming techniques that finds high-quality solutions to the multi-floor facility layout problem. The first stage is a linear mixed-integer program that assigns departments to floors such that the total of the departmental interaction costs between floors is globally minimized. Subsequent stages find a lo...