Research on 3MO-based genetic algorithm for solving order planning
This paper proposes a mixed integer-programming model for order planning of iron-steel enterprise. Because this problem is a kind NP-hard problem and the size of this problem is bigger, the genetic algorithm based on repeatable natural scale code and 3-mutation operator is presented to solve the model. For ensuring the quality of copy strategy of the genetic algorithm, this paper develops an improving selection function for copying. Finally, this paper uses the order planning of Shanghai Baoshan iron-steel enterprise as an example to test the model and the algorithm. The numerical analysis shows that the model comes up to the production process, the solutions obtained by this algorithm are superior to those obtained by the human-machine system. So, the model and the algorithm are valid.