Distance potential concept and its applications to the design of regional biomass supply chains and solving vehicle routing problems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26210%2F17%3APU127425" target="_blank" >RIV/00216305:26210/17:PU127425 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.jclepro.2016.12.166" target="_blank" >http://dx.doi.org/10.1016/j.jclepro.2016.12.166</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.jclepro.2016.12.166" target="_blank" >10.1016/j.jclepro.2016.12.166</a>
Alternative languages
Result language
angličtina
Original language name
Distance potential concept and its applications to the design of regional biomass supply chains and solving vehicle routing problems
Original language description
This paper presents a new concept, distance potential, which is the sum of the distances from the source points to the demand point being considered (for supply chains), or the sum of the distances from the demand (customer) being considered to other demands and the depot (for vehicle routing problems). We also investigate the applications of the new concept to the design of regional biomass supply chains and solving vehicle routing problems. In designing a supply chain, the values of the distance potentials are used to determine the precedence order: the demand point with the largest distance potential value will be satisfied first. While satisfying a demand point, the source point with the shortest distance to the demand will be used first. In solving a vehicle routing problem, the new concept is used to identify the customer which should be included in the first routing to be considered. Then, the network can be designed starting from the customer identified, and based on a few heuristic rules proposed in this paper. The results obtained in this work are comparable to or even better than that obtained in the literature. It is shown that the method proposed is simple and of high computational efficiency.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
20402 - Chemical process engineering
Result continuities
Project
<a href="/en/project/EF15_003%2F0000456" target="_blank" >EF15_003/0000456: Sustainable Process Integration Laboratory (SPIL)</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2017
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
Journal of Cleaner Production
ISSN
0959-6526
e-ISSN
1879-1786
Volume of the periodical
neuveden
Issue of the periodical within the volume
144
Country of publishing house
US - UNITED STATES
Number of pages
11
Pages from-to
426-436
UT code for WoS article
000393249300040
EID of the result in the Scopus database
2-s2.0-85008471522