Time minimization delivery planning with the time-quantity dependence

Result code in 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>
Result on the web
<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
—

Result language
angličtina
Original language name
Time minimization delivery planning with the time-quantity dependence
Original language description
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.
Czech name
—
Czech description
—

Type
J<sub>SC</sub> - Article in a specialist periodical, which is included in the SCOPUS database
CEP classification
—
OECD FORD branch
50703 - Transport planning and social aspects of transport (transport engineering to be 2.1)

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

Name of the periodical
Scientific Journal of Silesian University of Technology. Series Transport
ISSN
0209-3324
e-ISSN
—
Volume of the periodical
128
Issue of the periodical within the volume
2025
Country of publishing house
PL - POLAND
Number of pages
20
Pages from-to
95-114
UT code for WoS article
—
EID of the result in the Scopus database
2-s2.0-105016468125

Similar results(10)