Climate and construction delays: case study in Chile

Purpose – Construction projects usually suffer delays, and the causes of these delays and its cost overruns have been widely discussed, the weather being one of the most recurrent. The purpose of this paper is to analyze the influence of climate on standard construction work activities through a case study. Design/methodology/approach – By studying the extent at which some weather variables impede outdoor work from being effectively executed, new maps and tables for planning for delays are presented. In addition, a real case regarding the construction of several bridges in southern Chile is analyzed. Findings – Few studies have thoroughly addressed the influences of major climatic agents on the most common outdoor construction activities. The method detailed here provides a first approximation for construction planners to assess to what extent construction productivity will be influenced by the climate. Research limitations/implications – Although this study was performed in Chile, the simplified method proposed is entirely transferable to any other country, however, other weather or combinations of weather variables could be needed in other environments or countries. Practical implications – The implications will help reducing the negative social, economic and environmental outcomes that usually emerge from project delays. Originality/value – Climatic data were processed using extremely simple calculations to create a series of quantitative maps and tables that would be useful for any construction planner to decide the best moment of the year to start a project and, if possible, where to build it.

Noether-type discrete conserved quantities arising from a finite element approximation of a variational problem

In this work, we prove a weak Noether-type Theorem for a class of variational problems that admit broken extremals. We use this result to prove discrete Noether-type conservation laws for a conforming finite element discretisation of a model elliptic problem. In addition, we study how well the finite element scheme satisfies the continuous conservation laws arising from the application of Noether’s first theorem (1918). We summarise extensive numerical tests, illustrating the conservation of the discrete Noether law using the p-Laplacian as an example and derive a geometric-based adaptive algorithm where an appropriate Noether quantity is the goal functional.

An approximate dynamic programming approach for improving accuracy of lossy data compression by Bloom filters

Bloom filters are a data structure for storing data in a compressed form. They offer excellent space and time efficiency at the cost of some loss of accuracy (so-called lossy compression). This work presents a yes-no Bloom filter, which as a data structure consisting of two parts: the yes-filter which is a standard Bloom filter and the no-filter which is another Bloom filter whose purpose is to represent those objects that were recognised incorrectly by the yes-filter (that is, to recognise the false positives of the yes-filter). By querying the no-filter after an object has been recognised by the yes-filter, we get a chance of rejecting it, which improves the accuracy of data recognition in comparison with the standard Bloom filter of the same total length. A further increase in accuracy is possible if one chooses objects to include in the no-filter so that the no-filter recognises as many as possible false positives but no true positives, thus producing the most accurate yes-no Bloom filter among all yes-no Bloom filters. This paper studies how optimization techniques can be used to maximize the number of false positives recognised by the no-filter, with the constraint being that it should recognise no true positives. To achieve this aim, an Integer Linear Program (ILP) is proposed for the optimal selection of false positives. In practice the problem size is normally large leading to intractable optimal solution. Considering the similarity of the ILP with the Multidimensional Knapsack Problem, an Approximate Dynamic Programming (ADP) model is developed making use of a reduced ILP for the value function approximation. Numerical results show the ADP model works best comparing with a number of heuristics as well as the CPLEX built-in solver (B&B), and this is what can be recommended for use in yes-no Bloom filters. In a wider context of the study of lossy compression algorithms, our researchis an example showing how the arsenal of optimization methods can be applied to improving the accuracy of compressed data.

Scoring rules and competitive behavior in best value construction auctions

This paper examines the extent to which engineers can influence the competitive behavior of bidders in Best Value or multi-attribute construction auctions, where both the (dollar) bid and technical non-price criteria are scored according to a scoring rule. From a sample of Spanish construction auctions with a variety of bid scoring rules, it is found that bidders are influenced by the auction rules in significant and predictable ways. The bid score weighting, bid scoring formula and abnormally low bid criterion are variables likely to influence the competitiveness of bidders in terms of both their aggressive/conservative bidding and concentration/dispersion of bids. Revealing the influence of the bid scoring rules and their magnitude on bidders’ competitive behavior opens the door for the engineer to condition bidder competitive behavior in such a way as to provide the balance needed to achieve the owner’s desired strategic outcomes.