All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F02%3APU31548" target="_blank" >RIV/00216305:26210/02:PU31548 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Using Genetic Algorithms to Solve a General Dynamic Lot Sizing Problem

  • Original language description

    This paper deals with a dynamic multi-level multi-item lot sizing problem in a general production-assembly structure represented by a directed acyclic network, where each node may have several predecessors and/or successors. We assume a finite planning horizon consisting of discrete time periods, known deterministic demands at each time period, dynamic lot sizes, multiple constrained resources and time-varying cost parameters. The objective is to minimize the sum of setup, production, and inventory holdding costs over the planning horizon. We propose the methods for solving this problem based on genetic algorithms.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BB - Applied statistics, operational research

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2002

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 8th International Conference on Soft Computing MENDEL 2002

  • ISBN

    80-214-2135-5

  • ISSN

  • e-ISSN

  • Number of pages

    131

  • Pages from-to

    125-255

  • Publisher name

    Brno University of Technology

  • Place of publication

    Brno, Czech Republic

  • Event location

    Brno

  • Event date

    Jun 5, 2002

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article