This paper evaluates two new tests to characterize cable nets used in slope stabilization; a concentrated load test (CLT) and a distributed load test (DLT). These tests enable engineers to obtain the stress versus displacement graph and the maximum resistance. Both test devices and test methodology have been designed by the Construction Technology Research Group (GITECO) at the University of Cantabria. These two tests have enabled the certification of two different manufacturers of cable nets, Geobrugg and Malla Talud Cantabria (MTC). The results showed that these tests provide representative results of the net resistance. To verify the effectiveness of these new tests, they have been performed with various cable nets, from which homogeneous, logical results have been obtained, which are representative of the real working conditions. When performing the distributed load test, the force was applied to a pyramid of fine gravel sacks that enabled the forces to be distributed throughout the net. With this configuration, the net was deformed, acquiring an elliptical form in the lower free area. In the concentrated load test, the force was applied through a metallic plate of 600 mm diameter that deformed the net locally. The result always showed homogeneous behavior of the different samples tested. This allowed the test to be repeated in the same conditions several times. With the results of both tests an analysis was carried out relating the net grid, the load applied, and the displacement obtained. This enabled the generation of regression functions that provided information about the resistance value and the net displacement according to the chosen grid.
Many problems addressed in operational research are combinatorial and NP-hard type. Therefore, designing binary algorithms based on swarm intelligence continuous metaheuristics is an area of interest in operational research. In this paper we use a general binarization mechanism based on the percentile concept. We apply the percentile concept to multi-verse optimizer algorithm to solve set covering problem (SCP). Experiments are designed to demonstrate the utility of the percentile concept in binarization. Additionally we verify the efficiency of our algorithm through benchmark instances, showing that Binary multi-verse Optimizer (BMVO) obtains adequate results when it is evaluated against another state of the art algorithm.