Facility Location Problems with Semi-fixed Costs and Time Availability

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F18%3A10240107" target="_blank" >RIV/61989100:27230/18:10240107 - isvavai.cz</a>

Alternative codes found

RIV/68407700:21260/18:00323250

Result on the web

<a href="https://mme2018.fm.vse.cz/wp-content/uploads/2018/09/MME2018-Electronic_proceedings.pdf" target="_blank" >https://mme2018.fm.vse.cz/wp-content/uploads/2018/09/MME2018-Electronic_proceedings.pdf</a>

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Facility Location Problems with Semi-fixed Costs and Time Availability

Original language description

Logistic chains must be planned efficiently and economically. Effectiveness demands goods being delivered to the required quality while economic criteria ask for delivery of goods at minimal cost. The following article considers the economic facets of the delivery process as expressed against the total costs of the process. Operation research methods, specifically mathematical programming models, will be used to calculate economic optimization scenarios. A range of distribution problems can be calculated by means of mathematical programming. Mathematical models applied to various problems may differ: some variants of the problems include locations of warehouses which are known; for others warehouse locations must be determined. In addition, particular customers may require deliveries from different locations at the same time; other customers may restrict deliveries to a single supplier. This article examines a problem in which warehouse locations must be determined (potential locations are known) and each customer may only take delivery from a single (operational) storage point. This type of problems is termed a facility location problem. In the course of this problem it shall be assumed that storage points at each location may be set up in any of multiple variants, which differ in capacity and subsequent associated setup costs. The optimization criteria taken into account will be the total costs for setting up a warehouse, its maintenance and cargo delivering. In addition to these cost criteria, the problem will take into account a second variable expressing the worst (maximum) time availability. A requirement for minimization will be set for both criteria. The STEM methodology will be used for calculations.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

20104 - Transport engineering

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2018

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Mathematical Methods in Economics : MME 2018 : 36th international conference : September 12-14, 2018, Jindřichův Hradec

ISBN

978-80-7378-371-6

ISSN

—

e-ISSN

neuvedeno

Number of pages

6

Pages from-to

579-584

Publisher name

MATFYZPRESS

Place of publication

Praha

Event location

Jindřichův Hradec

Event date

Sep 12, 2018

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—