Application of Clark and Wright´s Savings Algorithm Model to Solve Routing Problem in Supply Logistics

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F75081431%3A_____%2F16%3A00000728" target="_blank" >RIV/75081431:_____/16:00000728 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Application of Clark and Wright´s Savings Algorithm Model to Solve Routing Problem in Supply Logistics

Popis výsledku v původním jazyce

Distribution logistics is an inseparable part of a logistics chain. It starts at the moment of a finished product supply to a warehouse of finished products and ends at the moment of its delivery to a final customer. Only a minimal amount of products is supplied directly to the final customer. It is more common to supply the product to the customer indirectly using several distribution degrees. While the product is supplied to the final customer, it is necessary to encompass a whole range of logistics activities. The objective of the article is to highlight the possibility of solving the problem of routing according to Clarke-Wright´s method. It is one of a large number of heuristic methods which solves the problem of vehicle routing.

Název v anglickém jazyce

Application of Clark and Wright´s Savings Algorithm Model to Solve Routing Problem in Supply Logistics

Popis výsledku anglicky

Distribution logistics is an inseparable part of a logistics chain. It starts at the moment of a finished product supply to a warehouse of finished products and ends at the moment of its delivery to a final customer. Only a minimal amount of products is supplied directly to the final customer. It is more common to supply the product to the customer indirectly using several distribution degrees. While the product is supplied to the final customer, it is necessary to encompass a whole range of logistics activities. The objective of the article is to highlight the possibility of solving the problem of routing according to Clarke-Wright´s method. It is one of a large number of heuristic methods which solves the problem of vehicle routing.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2016

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

Nase More

ISSN

0469-6255

e-ISSN

—

Svazek periodika

63

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

HR - Chorvatská republika

Počet stran výsledku

5

Strana od-do

115-119

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—