Volume 41, Number 4, October-December 2007
|Page(s)||381 - 398|
|Published online||11 October 2007|
Towards optimal formwork pairing on construction sites
Bouygues e-lab, 32 av Hoche, 75008 Paris, France; firstname.lastname@example.org
Accepted: 6 February 2007
Minimizing shutterings assembling time on construction sites can yield significant savings in labor costs and crane moves. It requires solving a pairing problem that optimizes the ability for the crane to move chains of shutterings as a whole when they can be later reused together to frame another wall of the site. In this paper, we show that this problem is NP-hard in the strong sense as well as both its multiflow and ordering aspects. We also introduce a linear relaxation that computes reasonably good lower bounds of the objective, and describe a Tabu Search based on pairings insertion and ejection that builds promising solutions.
Mathematics Subject Classification: 90B90
Key words: Pairing / Russian dolls / tabu / fixed-charge multi-commodity flow
© EDP Sciences, ROADEF, SMAI, 2007
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.