Constrained GA applied to production and energy management of a pulp and paper mill

3Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

Abstract

Optimization tasks issued from real industrial problems are often characterized by being multicriteria, mixed, nonconvex, large scale, ill-defined [2][9][26]. In this work such a problem is obtained from the optimization of production scheduling and energy management in industrial complexes (in the case of a kraft pulp and paper mill). Consider two criteria, one of real variables issued from the energy optimization, and another of integer (logical) variables issued from production scheduling optimization, submitted to a high number of equality and inequality constraints [19][20]. To solve this problem it is proposed a strategy based on genetic algorithms. Computational results are presented to support discussion of the several developed techniques, namely selection methods, crossover and mutation operators, and diversification techniques. Results about the industrial relevance of the method are also presented, showing that genetic algorithms can solve important industrial problems although they need yet powerful computers to get answers in an interactive way.

Cite

CITATION STYLE

APA

Santos, A., & Dourado, A. (1999). Constrained GA applied to production and energy management of a pulp and paper mill. In Proceedings of the ACM Symposium on Applied Computing (pp. 324–332). Association for Computing Machinery. https://doi.org/10.1145/298151.298366

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free