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”

Finding an Optimal Route of a Consignment in a Seaport

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F19%3APU134192" target="_blank" >RIV/00216305:26230/19:PU134192 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/document/8880154" target="_blank" >https://ieeexplore.ieee.org/document/8880154</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ICITE.2019.8880154" target="_blank" >10.1109/ICITE.2019.8880154</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Finding an Optimal Route of a Consignment in a Seaport

  • Original language description

    The paper describes the functioning of the seaport in terms of a consignment transshipment and transporting processes proceeding in it. Existing methods for presenting and modelling port activities, classical methods for finding optimal routes using the set-theoretic model, DEA method and Bellman's optimality principle are considered.The authors propose to consider the seaport as a graph, the nodes of which are warehouses and berths, and the sea road and land seaport gates are the endpoints for the cargo intraport routes.We propose in this study to decompose the route into separate transitions with the detection for the optimizing at each stage in accordance with the principles of dynamic programming. To determine the optimal transition, a metric of optimal routes has been developed. It is based on three main factors: the remoteness of the designated berth from the transition node (place, where transition is planned); total performance of technological lines selected for transshipment; total cost of cargo operations.Moreover, authors offer to use a system with a dynamic priority as appropriate one for planning operations of a universal cargo terminal, since use of dynamic priority allows to take into account changes in the external environment and internal terminal performance indicators, affecting the actual schedule of processes.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/LQ1602" target="_blank" >LQ1602: IT4Innovations excellence in science</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2019

  • 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

    4th International Conference on Intelligent Transportation Engineering (ICITE)

  • ISBN

    978-1-7281-4553-2

  • ISSN

  • e-ISSN

  • Number of pages

    5

  • Pages from-to

    29-33

  • Publisher name

    Institute of Electrical and Electronics Engineers

  • Place of publication

    Singapore

  • Event location

    Singapore

  • Event date

    Sep 5, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000591798700007