Optimalizace ve výrobní logistice používající kombinaci genetických algoritmů a algoritmu tabu search
Identifikátory výsledku
Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F05%3A00014413" target="_blank" >RIV/60461373:22340/05:00014413 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—
Alternativní jazyky
Jazyk výsledku
angličtina
Název v původním jazyce
Optimization in Production Logistics Using Combination Genetic/Tabu Search Algorithm
Popis výsledku v původním jazyce
Our work focuses on plants where several different products are being manufactured using similar technology. The flexibility of such plants puts increased demands on production planning and control. Finding optimal product sequence is a typical NP-complete problem. The paper presents a new algorithm for solving it. The algorithm is a stochastic heuristic based on two design philosophies developed in artificial intelligence research. It combines the parallelism and information-exchange of genetics algorithm with a strong local optimization of the recency-based tabu search. The algorithm is fast enough to be usable on PCs, the solutions found are near-optimal even for larger problems, and the batch processes model used in this work is detailed enough tosuggest that the algorithm should be applicable to industrial problems with satisfactory results.
Název v anglickém jazyce
Optimization in Production Logistics Using Combination Genetic/Tabu Search Algorithm
Popis výsledku anglicky
Our work focuses on plants where several different products are being manufactured using similar technology. The flexibility of such plants puts increased demands on production planning and control. Finding optimal product sequence is a typical NP-complete problem. The paper presents a new algorithm for solving it. The algorithm is a stochastic heuristic based on two design philosophies developed in artificial intelligence research. It combines the parallelism and information-exchange of genetics algorithm with a strong local optimization of the recency-based tabu search. The algorithm is fast enough to be usable on PCs, the solutions found are near-optimal even for larger problems, and the batch processes model used in this work is detailed enough tosuggest that the algorithm should be applicable to industrial problems with satisfactory results.
Klasifikace
Druh
O - Ostatní výsledky
CEP obor
JD - Využití počítačů, robotika a její aplikace
OECD FORD obor
—
Návaznosti výsledku
Projekt
—
Návaznosti
Z - Vyzkumny zamer (s odkazem do CEZ)
Ostatní
Rok uplatnění
2005
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ů