Evolutionary algorithms (EAs) have been applied to many optimization problems successfully in recent years. The genetic algorithm (GA) and evolutionary programming (EP) are two of the major branches of EAs. GAs use crossover as the main search operator and mutation as a background operator in search. EP uses mutation only. We have developed a new EP that is much simpler and more efficient than GAs in solving the Cutting Stock Problem(CSP). This talk will introduce the EP and present the experimental results on a number of different CSPs.