Planning and Scheduling of Batch Processes I

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F01%3A00003861" target="_blank" >RIV/60461373:22340/01:00003861 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Planning and Scheduling of Batch Processes I

Popis výsledku v původním jazyce

Multiproduct batch plants optimization is a typical NP-complete problem, and computation time increases exponentially as the dimension of problem increases. For this reason, tabu search algorithm is used for solving this problem. Considering that this algorithm is a heuristic one, optimal algorithm structure and parameter values for solving such problems have to be determined experimentally. This required solving many test problems and statistical analysis of obtained results. Use of tabu search algorithm for scheduling of multiproduct plant proved successful. Best results can be expected for these modifications of tabu search algorithm: defining neighborhood as the set of all schedules which can be obtained by exchanging positions of two products in sequence, using steepest descent technique and using short-term memory represented by the FIFO-managed tabu-list. Using other structures of tabu search algorithm showed no or little improvements.

Název v anglickém jazyce

Planning and Scheduling of Batch Processes I

Popis výsledku anglicky

Multiproduct batch plants optimization is a typical NP-complete problem, and computation time increases exponentially as the dimension of problem increases. For this reason, tabu search algorithm is used for solving this problem. Considering that this algorithm is a heuristic one, optimal algorithm structure and parameter values for solving such problems have to be determined experimentally. This required solving many test problems and statistical analysis of obtained results. Use of tabu search algorithm for scheduling of multiproduct plant proved successful. Best results can be expected for these modifications of tabu search algorithm: defining neighborhood as the set of all schedules which can be obtained by exchanging positions of two products in sequence, using steepest descent technique and using short-term memory represented by the FIFO-managed tabu-list. Using other structures of tabu search algorithm showed no or little improvements.

Druh

D - Stať ve sborníku

CEP obor

CI - Průmyslová chemie a chemické inženýrství

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2001

Kód důvěrnosti údajů

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

Název statě ve sborníku

Proc. of the 1st Int. Conf. LOADO 2001

ISBN

80-7099-584-X

ISSN

—

e-ISSN

—

Počet stran výsledku

4

Strana od-do

133-136

Název nakladatele

Technical University

Místo vydání

Košice

Místo konání akce

Podbanské, High Tatras, Slovakia

Datum konání akce

6. 6. 2001

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—