This lesson describes how you can use evolutionary algorithms to solve a classic optimization problem: that of bin packing. The solution method uses a direct encoding, meaning that the genetic operators used operate directly on the natural problem representation. (Contrast this with the indirect encoding used in the next lesson, Chapter 32, Car Sequencing Using EA.) The direct encoding normally only works well when tailored genetic operators are used and this lesson will show you how you can write such a genetic operator which tries to take the best features from parents, while discarding the worst ones.
Make a copy of the example file YourSolverHome/examples/src/tutorial/eabinpack_partial.cpp and open this copy in your development environment. This file is a program that is only partially completed. You will fill in the blanks in each step in this section. At the end of the section, you will have completed the example and you can compile and run the program.
PREVIOUS
NEXT