Sustainable distribution logistics of retail chains

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25510%2F18%3A39912389" target="_blank" >RIV/00216275:25510/18:39912389 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Sustainable distribution logistics of retail chains

Popis výsledku v původním jazyce

Distribution logistics of retail chains is very specific, because the network of retail chains is usually very extensive and there are many constraints for distribution of goods, for example time windows of central warehouses (depots) and stores for loading and unloading, more deliveries within the same day to stores or distribution of objects of reverse logistics from stores to central warehouses. There are many flows between stores and central warehouses, for example product flows, information flows, financial flows, reverse flows etc. Sustainable distribution logistics should respect three pillars of sustainability, there are: economic, social and environmental pillars. Sustainable distribution logistics of retail chains should investigate the possibilities of streamlining with consideration to the pillars of sustainability. The article will focus on the distribution planning tools which are being used for planning of distribution logistics for retail chains. There are some algorithms of graph theory, for example: Vehicle routing problem with pickup and delivery with time windows. The aim of the article will be to find an algorithm for this type of exercise which will respect all defined constraints and pillars of sustainability for distribution logistics of retail chains. The algorithm will be simulated on a specific network of retail chain as a case study.

Název v anglickém jazyce

Sustainable distribution logistics of retail chains

Popis výsledku anglicky

Distribution logistics of retail chains is very specific, because the network of retail chains is usually very extensive and there are many constraints for distribution of goods, for example time windows of central warehouses (depots) and stores for loading and unloading, more deliveries within the same day to stores or distribution of objects of reverse logistics from stores to central warehouses. There are many flows between stores and central warehouses, for example product flows, information flows, financial flows, reverse flows etc. Sustainable distribution logistics should respect three pillars of sustainability, there are: economic, social and environmental pillars. Sustainable distribution logistics of retail chains should investigate the possibilities of streamlining with consideration to the pillars of sustainability. The article will focus on the distribution planning tools which are being used for planning of distribution logistics for retail chains. There are some algorithms of graph theory, for example: Vehicle routing problem with pickup and delivery with time windows. The aim of the article will be to find an algorithm for this type of exercise which will respect all defined constraints and pillars of sustainability for distribution logistics of retail chains. The algorithm will be simulated on a specific network of retail chain as a case study.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

50204 - Business and management

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach<br>I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2018

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 statě ve sborníku

Proceedings of the Fourth International Conference on Traffic and Transport Engineering

ISBN

978-86-916153-4-5

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

454-459

Název nakladatele

Scientific Research Center Ltd.

Místo vydání

Belgrade

Místo konání akce

Bělehrad

Datum konání akce

27. 9. 2018

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

000542956800061