Abstract
Evolutionary algorithms (EAs) have been applied to many optimization problems successfully in recent years. The genetic algorithm (GAs) and evolutionary programming (EP) are two different types of EAs. GAs use crossover as the primary search operator and mutation as a background operator, while EP uses mutation as the primary search operator and does not employ any crossover. This paper proposes a novel EP algorithm for cutting stock problems with and without contiguity. Two new mutation operators are proposed. Experimental studies have been carried out to examine the effectiveness of the EP algorithm. They show that EP can provide a simple yet more effective alternative to GAs in solving cutting stock problems with and without contiguity. The solutions found by EP are significantly better (in most cases) than or comparable to those found by GAs.
Original language | English |
---|---|
Pages (from-to) | 1641-1659 |
Number of pages | 19 |
Journal | Computers & Operations Research |
Volume | 29 |
Issue number | 12 |
DOIs | |
Publication status | Published - 1 Oct 2002 |
Keywords
- cutting stock problems
- evolutionary algorithm
- combinatorial optimization