Flowshop Scheduling - Hybrid Tabu Search/Genetic Algorithm

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F03%3A00007549" target="_blank" >RIV/60461373:22340/03:00007549 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Flowshop Scheduling - Hybrid Tabu Search/Genetic Algorithm
Original language description
The purpose of this paper is to propose a combination tabu search / genetic algorithms approach to construction of optimization algorithms for problems such as the serial multiproduct batch plant sequencing. The algorithm we have proposed is able to optimize schedules for a hybrid flowshop. The combined algorithm we propose combines the parallelism and information-exchange of genetic algorithms with a strong local optimization of the recency-based tabu search. The algorithm was tested against pure tabusearch (TS) and pure genetic algorithms (GA). The results indicate that performance of the combined algorithm is better than that of either pure TS or pure GA. The algorithm is, thanks to its composite nature, more adaptable to changes, and retains the advantages commonly associated with heuristics.
Czech name
—
Czech description
—

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

Article name in the collection
Proc. of 30th Int. Conf. of Slovak Soc. of Chem. Engineering
ISBN
80-227-1889-0
ISSN
—
e-ISSN
—
Number of pages
7
Pages from-to
"IEP2/1"-"IEP2/7"
Publisher name
Slovak University of Technology
Place of publication
Bratislava
Event location
Tatranské Matliare
Event date
May 26, 2003
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)