Time minimization delivery planning with the time-quantity dependence

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F25%3A00002946" target="_blank" >RIV/75081431:_____/25:00002946 - isvavai.cz</a>

Výsledek na webu

<a href="https://sjsutst.polsl.pl/archives/2025/vol128/095_SJSUTST128_2025_Kowalik_Stopka.pdf" target="_blank" >https://sjsutst.polsl.pl/archives/2025/vol128/095_SJSUTST128_2025_Kowalik_Stopka.pdf</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Time minimization delivery planning with the time-quantity dependence

Popis výsledku v původním jazyce

One of the classical problems in transportation planning is represented minimizing the maximal delivery time of a uniform commodity between sources and destinations, known as the Bottleneck Transportation Problem (BTP). It assumes that a fixed transportation time – independent of the quantity of the transported commodity – is assigned to each source-to-destination route. In some cases, however, the quantity of the transported commodity may affect the transportation time, e.g., because of the duration of loading/unloading the commodity to/from the vehicle. Extensions of the BTP as well as the closely related Total Time Minimization Transportation Problem (TTMTP) which include the linear time-quantity dependence of the delivery time are considered. Whereas similar optimization problems known in the literature are nonlinear, linear programming is used in this research. Linear optimization provides better performance of the optimization software in comparison with nonlinear optimization. The above fact is illustrated by improving solutions to the problems known in the literature. A detailed insight into the issue of the existence of integer optimal solutions and interpretations of optimal solutions is also provided.

Název v anglickém jazyce

Time minimization delivery planning with the time-quantity dependence

Popis výsledku anglicky

One of the classical problems in transportation planning is represented minimizing the maximal delivery time of a uniform commodity between sources and destinations, known as the Bottleneck Transportation Problem (BTP). It assumes that a fixed transportation time – independent of the quantity of the transported commodity – is assigned to each source-to-destination route. In some cases, however, the quantity of the transported commodity may affect the transportation time, e.g., because of the duration of loading/unloading the commodity to/from the vehicle. Extensions of the BTP as well as the closely related Total Time Minimization Transportation Problem (TTMTP) which include the linear time-quantity dependence of the delivery time are considered. Whereas similar optimization problems known in the literature are nonlinear, linear programming is used in this research. Linear optimization provides better performance of the optimization software in comparison with nonlinear optimization. The above fact is illustrated by improving solutions to the problems known in the literature. A detailed insight into the issue of the existence of integer optimal solutions and interpretations of optimal solutions is also provided.

Druh

J_SC - Článek v periodiku v databázi SCOPUS

CEP obor

—

OECD FORD obor

50703 - Transport planning and social aspects of transport (transport engineering to be 2.1)

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2025

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ů

Název periodika

Scientific Journal of Silesian University of Technology. Series Transport

ISSN

0209-3324

e-ISSN

—

Svazek periodika

128

Číslo periodika v rámci svazku

2025

Stát vydavatele periodika

PL - Polská republika

Počet stran výsledku

20

Strana od-do

95-114

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-105016468125