About: Planar Multifacility Location - the Location-Allocation Problem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • 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 basic criterion 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.
  • 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 basic criterion 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. (en)
Title
  • Planar Multifacility Location - the Location-Allocation Problem
  • Planar Multifacility Location - the Location-Allocation Problem (en)
skos:prefLabel
  • Planar Multifacility Location - the Location-Allocation Problem
  • Planar Multifacility Location - the Location-Allocation Problem (en)
skos:notation
  • RIV/60461373:22340/02:00006985!RIV/2004/MSM/223404/N
http://linked.open.../vavai/riv/strany
  • 260;267
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM 223400007)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 658369
http://linked.open...ai/riv/idVysledku
  • RIV/60461373:22340/02:00006985
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • multifacility location; location-allocation problem; conversion of geographical coordinates (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [9C6889355FB5]
http://linked.open...v/mistoKonaniAkce
  • Vysoké Tatry - Podbanské
http://linked.open...i/riv/mistoVydani
  • Bratislava
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 16th Conference on Scientific Computing ALGORITMY 2002
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...ocetUcastnikuAkce
http://linked.open...nichUcastnikuAkce
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hanta, Vladimír
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Slovenská technická univerzita v Bratislave
https://schema.org/isbn
  • 80-227-1750-9
http://localhost/t...ganizacniJednotka
  • 22340
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 48 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software