The task of estimating the spatial layout of cluttered indoor scenes from a single RGB image is addressed in this work. Existing solutions to this problems largely rely on hand-craft features and vanishing lines, and they often fail in highly cluttered indoor rooms. The proposed coarse-to-fine indoor layout estimation (CFILE) method consists of two stages: 1) coarse layout estimation; and 2) fi...

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

This paper proposes a new integrative view of manufacturing cell formation and both inter-cell and intra-cell layout problems. Cells formation and their popular bi-directional linear layout are determined simultaneously through a Dynamic Programming algorithm (with the objective of minimizing the inter-cell flow cost under a cell size constraint). This Dynamic Programming algorithm is implement...

This paper presents an efficient solution approach to tackle large-scale singlefloor process plant layout problems. Based on the mixed integer linear programming (MILP) model proposed by Papageorgiou and Rotstein [1], the final layout (i.e. coordinates and dimensions) is determined from an initial feasible solution by an iterative improvement procedure using mixed integer optimisation. The appl...

In the predecessor to this paper, three fundamental concepts of uniformity, information and structure were introduced, and general guidance given on each of them. In this paper, more practical advice is given, specifically in two areas: guidance on actual dimensions, proportions and layout; and guidance on implementing some of the ideas through the medium of the TEX language. Finally, some diff...

Parallel genetic algorithms techniques have been used in a variety of computer engineering and science areas. This paper presents a parallel genetic algorithm to solve the geometrically constrained site layout problem that involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. The algorithm is parallelized based on a message passing ...

Traditionally, the objective of a service facility layout problem is to minimize the material handling cost and optimize the physical spaces that support a productive activity of the service system. Service delivering interface has direct impact to the efficiency and effectiveness of service system in light of customer’s contact. Layout problem of service facilities has received little attentio...

In this paper we discuss two particular layout problems, namely the Single-Row Equidistant Facility Layout Problem (SREFLP) and the Single-Row Facility Layout Problem (SRFLP). Our aim is to consolidate the two respective branches in the layout literature. We show that the (SREFLP) is not only a special case of the Quadratic Assignment Problem but also a special case of the (SRFLP). This new con...