Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-27T15:27:57.134Z Has data issue: false hasContentIssue false
  • English
  • Français

Towards optimal formwork pairingon construction sites

Published online by Cambridge University Press:  11 October 2007

Thierry Benoist
Thierry Benoist*
Affiliation:
Bouygues e-lab, 32 av Hoche, 75008 Paris, France; tbenoist@bouygues.com
Get access

Abstract

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.

Keywords

PairingRussian dollstabufixed-chargemulti-commodity flow
Type
Research Article
Information
RAIRO - Operations Research , Volume 41 , Issue 4 , October 2007 , pp. 381 - 398
Copyright
© EDP Sciences, ROADEF, SMAI, 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

J. Agnèse, N. Bataille, E. Bensana, D. Blumstein and G. Verfaillie, Exact and Approximate methods for the Daily Management of an Earth Observation Satellite, in Proc. of the 5th ESA Workshop on Artificial Intelligence and Knowledge Based Systems for Space (1995).
T. Benoist and F. Chauvet, Complexity of some FPP related Problems, E-lab Technical Report (2001).
Y. Caseau and F. Laburthe, Improved CLP Scheduling with Task Intervals, in Proc. of the 11th International Conference on Logic Programming, MIT Press (1994).
M.R. Garey and D.S. Johnson, Complexity results for multiprocessor scheduling under resource constraints. SIAM J. Comput. 4 (1975), 397–411.
M.R. Garey and D.S. Johnson, Computers and intractability, a guide to the theory of NP-completeness. W.H. Freeman, New York (1979).
Gu, Z., Nemhauser, G.L. and Savelsbergh, M.W.P., Lifted flow cover inequalities for mixed 0-1 integer programs. Math. Program. 85 (1999) 439-467. CrossRef
G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization. Wiley Interscience Series in Discrete Mathematics and Optimization, John Wiley & Sons (1988).
G. Verfaillie, M. Lemaître and T. Schiex, Russian Doll Search for Solving Constraint Optimization Problems, in Proc. of AAAI-96, Portland, OR, (1996) 181–187.
Vasquez, M., Dupont, A. and Habet, D.. Consistency checking within local search applied to the frequency assignement with polarization problem. RAIRO Oper. Res. 37 (2003) 311-323. CrossRef