Selected Heuristic Methods used in Industrial Engineering

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23210%2F14%3A43921773" target="_blank" >RIV/49777513:23210/14:43921773 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.sciencedirect.com/science/article/pii/S1877705814002811" target="_blank" >http://www.sciencedirect.com/science/article/pii/S1877705814002811</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.proeng.2014.03.035" target="_blank" >10.1016/j.proeng.2014.03.035</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Selected Heuristic Methods used in Industrial Engineering

Popis výsledku v původním jazyce

This paper deals with a heuristic approach to material supplies of assembly lines (e.g. automotive industry) and to optimization of a stacker which is used in production lines or stores. A modern method for supplying assembly lines with material is usingthe so called 'milk run' - trains supplying not only one point in assembly production lines but several points. A graph model is used. An analytical solution for creation of trains is not known; most probably it does not exist. Solutions using "brute force" may be very slow. They cannot be used for more than a dozen demands. A repeated random selection of n-tuples of transport demands and building of trains from this selection could be a good way to solve this task. A model of assembly production lineshas been developed and the speed of convergence of random selections to a suboptimal solution has been calculated and measured. A thousand selections give good results. These heuristic results have been compared with some deterministic s

Název v anglickém jazyce

Selected Heuristic Methods used in Industrial Engineering

Popis výsledku anglicky

This paper deals with a heuristic approach to material supplies of assembly lines (e.g. automotive industry) and to optimization of a stacker which is used in production lines or stores. A modern method for supplying assembly lines with material is usingthe so called 'milk run' - trains supplying not only one point in assembly production lines but several points. A graph model is used. An analytical solution for creation of trains is not known; most probably it does not exist. Solutions using "brute force" may be very slow. They cannot be used for more than a dozen demands. A repeated random selection of n-tuples of transport demands and building of trains from this selection could be a good way to solve this task. A model of assembly production lineshas been developed and the speed of convergence of random selections to a suboptimal solution has been calculated and measured. A thousand selections give good results. These heuristic results have been compared with some deterministic s

Druh

D - Stať ve sborníku

CEP obor

JP - Průmyslové procesy a zpracování

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

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

Procedia Engineering

ISBN

—

ISSN

1877-7058

e-ISSN

—

Počet stran výsledku

8

Strana od-do

622-629

Název nakladatele

Elsevier

Místo vydání

Vienna

Místo konání akce

Zadar

Datum konání akce

23. 10. 2013

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

WRD - Celosvětová akce

Kód UT WoS článku

—