In this chapter, we introduce the ISPAES evolutionary computation algorithm for truss optimization. The ISPAES algorithm needs little or no modifications to solve single-objective or multi-objective problems with a large number of constraints, either in discrete or continuous search space. Thus, we present a detailed description of the ISPAES algorithm, and solve several truss optimization problems. Different modalities are illustrated, that is, continuous/discrete, single/multiple objective. Pareto fronts in both continuous and discrete space are shown.