The structure of the genetic algorithm of lot-sizing and scheduling problem formulated as capacitated lot sizing problem
In this paper the structure of the genetic algorithm utilised for solving an integer programming model of lot-sizing and scheduling problem is introduced. The genetic algorithm presented in the paper was employed for solving a lot-sizing and scheduling problem formulated as Capacitated Lot Sizing Problem. The method of chromosome encoding, utilised crossover operators and mutation operators employed in this genetic algorithm are presented and explained, moreover, implemented modifications are indicated.
- 0
- Kategoria: Pozostałe zagadnienia