Modelling Distribution Routes in City Logistics by Applying Operations Research Methods

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F22%3A00002533" target="_blank" >RIV/75081431:_____/22:00002533 - isvavai.cz</a>

Výsledek na webu

<a href="https://www-scopus-com.ezproxy.techlib.cz/record/display.uri?eid=2-s2.0-85141419616&origin=resultslist&sort=plf-f&src=s&sid=18879668d554bcb45b65300dcbbe5815&sot=b&sdt=b&s=TITLE-ABS-KEY%28Modelling+Distribution+Routes+in+City+Logistics+by+Applying+Operati" target="_blank" >https://www-scopus-com.ezproxy.techlib.cz/record/display.uri?eid=2-s2.0-85141419616&origin=resultslist&sort=plf-f&src=s&sid=18879668d554bcb45b65300dcbbe5815&sot=b&sdt=b&s=TITLE-ABS-KEY%28Modelling+Distribution+Routes+in+City+Logistics+by+Applying+Operati</a>

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Modelling Distribution Routes in City Logistics by Applying Operations Research Methods

Popis výsledku v původním jazyce

The article focuses on the up-to-date subject from the practical as well as scientific point of view. It specifically discusses a proposal of an approach concerning transport or distribution problems in the range of city logistics and investigates possibilities to use opted operations research methods in this particular area. Specific suggestions lie first and foremost in using selected tools of operations research (i.e. a set of methods concerning vehicle routing problem) to model multiple variants of distribution paths from a determined hub to multiple spokes in order to minimise the overall travelled distance in an urban area. As far as the very research goes, to define distribution paths to supply multiple logistics objects in the range of city logistics, ensuing methods are step by step used: Clarke-Wright algorithm, Mayer algorithm and the nearest neighbour algorithm. The article consists of a conceptual section, describing the relevant theory as well as data and methods used, the practical part and the section encompassing an assessment of the key findings, along with the discussion. A suitable combination of adequate operations research methods and their application to city logistics issues is where an innovative solution of this research lies.

Název v anglickém jazyce

Modelling Distribution Routes in City Logistics by Applying Operations Research Methods

Popis výsledku anglicky

The article focuses on the up-to-date subject from the practical as well as scientific point of view. It specifically discusses a proposal of an approach concerning transport or distribution problems in the range of city logistics and investigates possibilities to use opted operations research methods in this particular area. Specific suggestions lie first and foremost in using selected tools of operations research (i.e. a set of methods concerning vehicle routing problem) to model multiple variants of distribution paths from a determined hub to multiple spokes in order to minimise the overall travelled distance in an urban area. As far as the very research goes, to define distribution paths to supply multiple logistics objects in the range of city logistics, ensuing methods are step by step used: Clarke-Wright algorithm, Mayer algorithm and the nearest neighbour algorithm. The article consists of a conceptual section, describing the relevant theory as well as data and methods used, the practical part and the section encompassing an assessment of the key findings, along with the discussion. A suitable combination of adequate operations research methods and their application to city logistics issues is where an innovative solution of this research lies.

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

<a href="/cs/project/CK03000085" target="_blank" >CK03000085: Implementace městské logistiky do procesu plánování udržitelné městské mobility</a><br>

Návaznosti

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

Rok uplatnění

2022

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

Promet – Traffic&Transportation

ISSN

1848-4069

e-ISSN

1848-4069

Svazek periodika

Vol. 34

Číslo periodika v rámci svazku

No. 5

Stát vydavatele periodika

HR - Chorvatská republika

Počet stran výsledku

16

Strana od-do

739-754

Kód UT WoS článku

—

EID výsledku v databázi Scopus

2-s2.0-85141419616