A configuration that minimizes cost subject to the constraints is selected. A Simple Genetic Algorithm (SGA) is modified to incorporate the handling of constraints. The SGA is further modified to incorporate Optimal-Storage-Profiling to produce an increased number of fit individuals in each generation, developing a policy which will consider configurations of all storage-consumption levels and favor those configurations whose storage-consumption indicate they more likely to be strong candidates. An ideal-distribution of configurations, based on their storage-consumption, for each generation is developed. Different elitist policies are also incorporated to achieve greater scalability without sacrificing the quality of the solution.