All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Time Minimizing Transportation Problems with Partial Limitations of Transported Amount for Transport Participants

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62156489%3A43110%2F15%3A43906656" target="_blank" >RIV/62156489:43110/15:43906656 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1063/1.4912945" target="_blank" >http://dx.doi.org/10.1063/1.4912945</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1063/1.4912945" target="_blank" >10.1063/1.4912945</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Time Minimizing Transportation Problems with Partial Limitations of Transported Amount for Transport Participants

  • Original language description

    In the field of transportation problems the most common optimization criterion is transportation costs minimization. However, there are situations where it is necessary to transport the materials quickly. This is especially in the case of transportationof perishable materials. In case the material is transported in time, i.e. before it expires, it may further be used which brings economic profit. Otherwise, there is degradation with all ensuing consequences. This paper seeks to find out how to minimizethe time of transportation from collection points to places of processing. Emphasis was placed on minimizing the transportation time, because the transported material is a perishable fruit. Each of the transport points has its own daily limitations regarding the number of material sent and number of material received and also its total limitations per whole transport campaign. When the total limitation is met, the transport point does not participate in the process any more. For solving

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BB - Applied statistics, operational research

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2015

  • Confidentiality

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

Data specific for result type

  • Article name in the collection

    Proceedings of the International Conference on Numerical Analysis and Applied Mathematics 2014 (ICNAAM 2014)

  • ISBN

    978-0-7354-1287-3

  • ISSN

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

  • Publisher name

    American Institute of Physics (AIP)

  • Place of publication

    Melville

  • Event location

    Rhodes

  • Event date

    Sep 22, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000355339704075