Shuffled Complex Evolution Algorithms in Infrastructure Works Programming

Abstract

Practical optimization of infrastructure preservation works programming has always posed a computational challenge due to the complexity and scale of the problem. Critical to the process is formulations in which the identity of individual projects is preserved. This requirement leads to exponential growth of solution space, often resulting in an unmanageable process using traditional analytical optimization techniques. In this paper, we propose an evolutionary-based multiyear optimization procedure for solving network level infrastructure works programming problems using a relatively new concept known as the shuffled complex evolution algorithm. A case study problem is analyzed to illustrate the robustness of the technique. The findings show convergence characteristics of the solution and demonstrate that the algorithm is very efficient and consistent in simultaneous consideration of the trade-off among various infrastructure preservation strategies. It is concluded that the robust search capability of the shuffled complex evolution technique is well suited for solving the combinatorial problems in network level infrastructure preservation works programming.