Lokalizační problém pro více distribučních center

Kód výsledku v IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F05%3A00014334" target="_blank" >RIV/60461373:22340/05:00014334 - isvavai.cz</a>
Výsledek na webu
—
DOI - Digital Object Identifier
—

Jazyk výsledku
angličtina
Název v původním jazyce
More then one Distribution Centres Location Problem
Popis výsledku v původním jazyce
The main goal of this contribution was illustration of the algorithm of stepwise partition supplied geographical areas and optimal location of the distribution centers in each of them. Designed algorithm substitute subjective separation of supplied geographical area with the systematic procedure. The methodology and algorithm were successfully verified on the real problem of distribution centers location for company, which supply operating liquids for motor cars to 190 customers. The method is illustrated on the simple case on 14 customers, whose is necessary to supply from new distribution centers.
Název v anglickém jazyce
More then one Distribution Centres Location Problem
Popis výsledku anglicky
The main goal of this contribution was illustration of the algorithm of stepwise partition supplied geographical areas and optimal location of the distribution centers in each of them. Designed algorithm substitute subjective separation of supplied geographical area with the systematic procedure. The methodology and algorithm were successfully verified on the real problem of distribution centers location for company, which supply operating liquids for motor cars to 190 customers. The method is illustrated on the simple case on 14 customers, whose is necessary to supply from new distribution centers.

Druh
J<sub>x</sub> - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
CEP obor
BB - Aplikovaná statistika, operační výzkum
OECD FORD obor
—

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ů

Podobné výsledky(10)