Vše

Co hledáte?

Vše
Projekty
Výsledky výzkumu
Subjekty

Rychlé hledání

  • Projekty podpořené TA ČR
  • Významné projekty
  • Projekty s nejvyšší státní podporou
  • Aktuálně běžící projekty

Chytré vyhledávání

  • Takto najdu konkrétní +slovo
  • Takto z výsledků -slovo zcela vynechám
  • “Takto můžu najít celou frázi”

Transportation problem with degressively stepped costs

Identifikátory výsledku

  • Kód výsledku v IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27230%2F17%3A10237052" target="_blank" >RIV/61989100:27230/17:10237052 - isvavai.cz</a>

  • Výsledek na webu

    <a href="http://fim2.uhk.cz/mme/conferenceproceedings/mme2017_conference_proceedings.pdf" target="_blank" >http://fim2.uhk.cz/mme/conferenceproceedings/mme2017_conference_proceedings.pdf</a>

  • DOI - Digital Object Identifier

Alternativní jazyky

  • Jazyk výsledku

    angličtina

  • Název v původním jazyce

    Transportation problem with degressively stepped costs

  • Popis výsledku v původním jazyce

    The transportation problem belongs to one of elementary decision problems we can meet in practice. The problem can be solved with linear programming methods. In specialized literature, we can find many possible modifications of the transportation problem which have been formulated and solved on the basis of many real situations. This fact reveals its broad area of possible applicability. The article deals with a modification of the transportation problem; the modification consists in a specific nonlinear form of the objective function which has not been found in literature. In the article, it is considered that a carrier offers a lower carriage to a customer if a certain (minimum) number of goods is transported. Such type of the transportation problem has already been considered in the past but the objective criterion has been assumed to be continuous nonlinear. In our modification nonlinearity of the objective criterion is discontinuous (stepped) and is decreasing (the carriage per unit is decreasing with the increasing number of transported goods). The task can be solved as balanced (the total supply and the total demand are equal) or unbalanced (the total supply and the total demand are not equal). A linear mixed integer mathematical model which models the modification of the transportation problem is presented in the article. To test the model and to find a dependence of the calculation time on input data some calculation experiments are presented in the article. The calculation experiments are carried out using optimisation software Xpress – IVE.

  • Název v anglickém jazyce

    Transportation problem with degressively stepped costs

  • Popis výsledku anglicky

    The transportation problem belongs to one of elementary decision problems we can meet in practice. The problem can be solved with linear programming methods. In specialized literature, we can find many possible modifications of the transportation problem which have been formulated and solved on the basis of many real situations. This fact reveals its broad area of possible applicability. The article deals with a modification of the transportation problem; the modification consists in a specific nonlinear form of the objective function which has not been found in literature. In the article, it is considered that a carrier offers a lower carriage to a customer if a certain (minimum) number of goods is transported. Such type of the transportation problem has already been considered in the past but the objective criterion has been assumed to be continuous nonlinear. In our modification nonlinearity of the objective criterion is discontinuous (stepped) and is decreasing (the carriage per unit is decreasing with the increasing number of transported goods). The task can be solved as balanced (the total supply and the total demand are equal) or unbalanced (the total supply and the total demand are not equal). A linear mixed integer mathematical model which models the modification of the transportation problem is presented in the article. To test the model and to find a dependence of the calculation time on input data some calculation experiments are presented in the article. The calculation experiments are carried out using optimisation software Xpress – IVE.

Klasifikace

  • Druh

    D - Stať ve sborníku

  • CEP obor

  • OECD FORD obor

    20104 - Transport engineering

Návaznosti výsledku

  • Projekt

  • Návaznosti

    S - Specificky vyzkum na vysokych skolach

Ostatní

  • Rok uplatnění

    2017

  • 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ů

Údaje specifické pro druh výsledku

  • Název statě ve sborníku

    Mathematical Methods in Economics: MME 2017 : 35th international conference : book of abstracts : Hradec Králové, Czech Republic, September 13th-15th, 2017

  • ISBN

    978-80-7435-677-3

  • ISSN

  • e-ISSN

    neuvedeno

  • Počet stran výsledku

    6

  • Strana od-do

    201-206

  • Název nakladatele

    Gaudeamus

  • Místo vydání

    Hradec Králové

  • Místo konání akce

    Hradec Králové

  • Datum konání akce

    13. 9. 2017

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

    EUR - Evropská akce

  • Kód UT WoS článku