ABSTRACT
The design of a double reduction gear train problem has been used on performance comparisons between different evolutionary algorithms. The problem displays low density of solutions in some areas of the Pareto optimal front, a characteristic that makes it harder for metaheuristics to solve it. This chapter provides a step by step description of how to apply an evolutionary algorithm to solve this problem. The presentation is complemented with pseudocode, graphs, and Python code.
