Application of Clark and Wright´s Savings Algorithm Model to Solve Routing Problem in Supply Logistics
The result's identifiers
Result code in 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>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Application of Clark and Wright´s Savings Algorithm Model to Solve Routing Problem in Supply Logistics
Original language description
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.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
—
Continuities
V - Vyzkumna aktivita podporovana z jinych verejnych zdroju
Others
Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Nase More
ISSN
0469-6255
e-ISSN
—
Volume of the periodical
63
Issue of the periodical within the volume
3
Country of publishing house
HR - CROATIA
Number of pages
5
Pages from-to
115-119
UT code for WoS article
—
EID of the result in the Scopus database
—