Szczegóły publikacji
Opis bibliograficzny
Lot-sizing in a foundry using genetic algorithm and repair functions / Jerzy DUDA // W: Evolutionary computation in combinatorial optimization : 5th European conference, EvoCOP 2005 : Lausanne, Switzerland, March 30–April 1, 2005 : proceedings / eds. Günther R. Raidl, Jens Gottlieb. — Berlin ; Heidelberg : Springer-Verlag, 2005. — (Lecture Notes in Computer Science ; ISSN 0302-9743 ; 3448). — S. 101–111. — Bibliogr. s. 111, Abstr.
Autor
Dane bibliometryczne
| ID BaDAP | 26152 |
|---|---|
| Data dodania do BaDAP | 2006-02-21 |
| Rok publikacji | 2005 |
| Typ publikacji | materiały konferencyjne (aut.) |
| Otwarty dostęp |  |
| Czasopisma/serie | Lecture Notes in Computer Science, Theoretical Computer Science and General Issues |
Abstract
The paper presents a study of genetic algorithms applied to a lot-sizing problem, which has been formulated for an operational production planning in a foundry. Three variants of genetic algorithm are considered, each of them using special crossover and mutation operators as well as repair functions. The real size test problems, based on the data taken from the production control system, are presented for assessment of the proposed algorithms. The obtained results show that the genetic algorithm with two repair functions can generate good suboptimal solutions in the time, which can be acceptable from the decision maker point of view.