Dynamic layout planning using a hybrid incremental solution method

Efficiently using site space to accommodate resources throughout the duration of a construction project is a critical problem. It is termed the `dynamic layout pinning' problem. Solving it involves creating a sequence of layouts that span the entire project duration, given resources, the timing of their presence on site, their changing demand for space over time, constraints on their location, and costs for their relocation. A dynamic layout construction procedure is presented here. Construction resources, represented as rectangles, are subjected to two-dimensional geometric constraints on relative locations. The objective is to allow site space to all resources so that no spatial conflicts arise, while keeping distance-based adjacency and relocation costs minimal. The solution is constructed stepwise for consecutive time frames. For each resource, selected heuristically one at a time, constraint satisfaction is used to compute sets of feasible positions. Subsequently, a linear program is solved to find the optimal position for each resource so as to minimize all costs. The resulting sequence of layouts is suboptimal in terms of the stated global objective, but the algorithm helps the layout planner explore better alternative solutions.