A methodology to simulate peak water demand for water supply systems using semi-direct methods: A case study for a residential building in Mexico.

Historically, approaches for determining peak water demand in buildings have been based on probabilistic methods. Extensive research has shown that these methods lack accuracy because of the human factor in the probability of use. Inaccuracy in the calculation of peak water demand is the main cause of oversized water supply systems in buildings.

Femicide in Mexico: Statistical evidence of an increasing trend.

This study analyzes whether femicide in Mexico has increased more severely than other life and bodily integrity crimes (e.g., homicide, culpable homicide, injuries, malicious injuries, abortion, and other crimes that threaten life).

Production planning of a furniture manufacturing company with random demand and production capacity using stochastic programming.

In this article two multi-stage stochastic linear programming models are developed, one applying the stochastic programming solver integrated by Lingo 17.0 optimization software that utilizes an approximation using an identical conditional sampling and Latin-hyper-square techniques to reduce the sample variance, associating the probability distributions to normal distributions with defined mean and standard deviation; and a second proposed model with a discrete distribution with 3 values and their respective probabilities of occurrence. In both cases, a scenario tree is generated.

Solution to travelling salesman problem by clusters and a modified multi-restart iterated local search metaheuristic.

This article finds feasible solutions to the travelling salesman problem, obtaining the route with the shortest distance to visit n cities just once, returning to the starting city. The problem addressed is clustering the cities, then using the NEH heuristic, which provides an initial solution that is refined using a modification of the metaheuristic Multi-Restart Iterated Local Search MRSILS; finally, clusters are joined to end the route with the minimum distance to the travelling salesman problem. The contribution of this research is the use of the metaheuristic MRSILS, that in our knowledge had not been used to solve the travelling salesman problem using clusters.