Optimization Heuristics for Supplies of Assembly Lines

Kód výsledku v IS VaVaI

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

Výsledek na webu

<a href="http://www.pp.bme.hu/tr/article/view/7118" target="_blank" >http://www.pp.bme.hu/tr/article/view/7118</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.3311/PPtr.7118" target="_blank" >10.3311/PPtr.7118</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimization Heuristics for Supplies of Assembly Lines

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). A modern method for supplying assembly lines with material is using the 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 lines has 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 strategies (nearest demand, building of n-tuples).

Název v anglickém jazyce

Optimization Heuristics for Supplies of Assembly Lines

Popis výsledku anglicky

This paper deals with a heuristic approach to material supplies of assembly lines (e.g. automotive industry). A modern method for supplying assembly lines with material is using the 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 lines has 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 strategies (nearest demand, building of n-tuples).

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

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 periodika

Periodica Polytechnica Transportation Engineering

ISSN

0303-7800

e-ISSN

—

Svazek periodika

42

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

HU - Maďarsko

Počet stran výsledku

4

Strana od-do

49-52

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—