Szczegóły publikacji
Opis bibliograficzny
A hybrid genetic algorithm and variable neighborhood search for multi-family capacitated lot-sizing problem / Jerzy DUDA // Electronic Notes in Discrete Mathematics ; ISSN 1571-0653. — 2017 — vol. 58, s. 103–110. — Bibliogr. s. 110, Abstr. — ICVNS'16 : 4th International Conference on Variable Neighborhood Search : Málaga, Spain, October 3–5, 2016
Autor
Słowa kluczowe
Dane bibliometryczne
| ID BaDAP | 109987 |
|---|---|
| Data dodania do BaDAP | 2017-11-29 |
| Tekst źródłowy | URL |
| DOI | 10.1016/j.endm.2017.03.014 |
| Rok publikacji | 2017 |
| Typ publikacji | referat w czasopiśmie |
| Otwarty dostęp |  |
| Czasopismo/seria | Electronic Notes in Discrete Mathematics |
Abstract
The paper presents a genetic algorithm (GA) hybridized with variable neighborhood search (VNS) to solve multi-item capacitated lot-sizing multi-family problem with setup times. The problem has a practical application in production planning e.g., in foundry industry, so test cases for computational experiments were based on the data from the real production process in a foundry. The VNS algorithm is used after a certain number of GA generations for all individuals in the population to improve solutions. The presented method applied for large instances of the problem outperforms both a dedicated genetic algorithm and a CLPEX Solver-based rolling horizon methods known from the literature.