Finding low-cost designs of water distribution systems (WDSs) which satisfy appropriate levels of network performance within a manageable time is a complex problem of increasing importance. A novel multi-objective memetic algorithm (MA) is introduced as a solution method to this type of problem....

Central composite discrepancy (CCD) has been proposed to measure the uniformity of a design over irregular experimental region. However, how CCD-based optimal uniform designs can be efficiently computed remains a challenge. Focusing on this issues, we proposed a particle swarm optimization-based...

Bayesian inference for stochastic volatility models using MCMC methods highly depends on actual parameter values in terms of sampling efficiency. While draws from the posterior utilizing the standard centered parameterization break down when the volatility of volatility parameter in the latent...

In this work we propose a highly optimized version of a simulated annealing (SA) algorithm adapted to the more recently developed graphic processor units (GPUs). The programming has been carried out with compute unified device architecture (CUDA) toolkit, specially designed for Nvidia GPUs. For...

We present a parallelization of the revised simplex method for large extensive forms of two-stage stochastic linear programming (LP) problems. These problems have been considered too large to solve with the simplex method; instead, decomposition approaches based on Benders decomposition or, more...

This work deals with parallel algorithms for the optical design and analysis of solar fields for Central Receiver Systems. The proposed implementation based on desktop workstations equipped with multiple Graphics Processing Units (GPU) is motivated by the need to have an accurate and fast...