Planar Multifacility Location - the Location-Allocation Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F60461373%3A22340%2F02%3A00006985" target="_blank" >RIV/60461373:22340/02:00006985 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Planar Multifacility Location - the Location-Allocation Problem

Popis výsledku v původním jazyce

The contribution is concerned with a common case of a location-allocation problem, which involves both the location of distribution centres or warehouses and an allocation of customers to warehouses. Warehouses receive products from production plants anddistribute them to customers such as retail or wholesale outlets. The well-known Weiszfeld algorithm was adapted for sequentially increasing number of warehouses until adding of another warehouse is advantageous from transport cost standpoint. The basiccriterion for decision is minimizing of the freight cost, but increasing expenses of product stocks are considered as well. Distances between warehouses and customers are given by a suitable two-dimensional metric corresponding to the network of routes.Location of customers is given by means of either geographical information systems or GPS system.

Název v anglickém jazyce

Planar Multifacility Location - the Location-Allocation Problem

Popis výsledku anglicky

The contribution is concerned with a common case of a location-allocation problem, which involves both the location of distribution centres or warehouses and an allocation of customers to warehouses. Warehouses receive products from production plants anddistribute them to customers such as retail or wholesale outlets. The well-known Weiszfeld algorithm was adapted for sequentially increasing number of warehouses until adding of another warehouse is advantageous from transport cost standpoint. The basiccriterion for decision is minimizing of the freight cost, but increasing expenses of product stocks are considered as well. Distances between warehouses and customers are given by a suitable two-dimensional metric corresponding to the network of routes.Location of customers is given by means of either geographical information systems or GPS system.

Druh

D - Stať ve sborníku

CEP obor

JD - Využití počítačů, robotika a její aplikace

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2002

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

Proceedings of the 16th Conference on Scientific Computing ALGORITMY 2002

ISBN

80-227-1750-9

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

260-267

Název nakladatele

Slovak University of Technology

Místo vydání

Bratislava

Místo konání akce

Vysoké Tatry - Podbanské

Datum konání akce

8. 9. 2002

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

EUR - Evropská akce

Kód UT WoS článku

—