Abstract
The article presents the problem of supply chain management. One of the main issues in solving such problems is routing. An algorithm to find the shortest path in the temporal dependence and fuzzy-defined parameters of time and distance. Solution is based on the apparatus of graph theory, namely fuzzy temporal graph. This algorithm is a modification of Dijkstra’s algorithm. An illustration of an example of solving the problem of finding an optimal route in fuzzy conditions, as such representation is closest to reality.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ivanov, D.A.: Supply Chain Management, p. 660. Polytechnical Institute (2009) (in Russian)
Bernstein, L.S., Bozhenuk, A.V.: The use of temporal graphs as models of complex systems. In: Proceedings of the SFU. Technical Engineering, vol. 4(105), pp. 198–203 (2010) (in Russian)
Kostakos, V.: Temporal graphs. In: Proc. of Physica A: Statistical Mechanics and its Applications, vol. 388(6), pp. 1007–1023. Elsevier (2008)
Maynika, E.: Optimization Algorithms for Networks and Graphs. Springer (1981)
Bernstein, L.S., Bozhenuk, A.V.: Fuzzy graphs and hypergraphs. Scientific World (2005) (in Russian)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Savelyeva, M., Belyakov, S. (2015). Solution of the Problem Supply Chain Management in Temporal Dependence. In: Filev, D., et al. Intelligent Systems'2014. Advances in Intelligent Systems and Computing, vol 323. Springer, Cham. https://doi.org/10.1007/978-3-319-11310-4_42
Download citation
DOI: https://doi.org/10.1007/978-3-319-11310-4_42
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-11309-8
Online ISBN: 978-3-319-11310-4
eBook Packages: EngineeringEngineering (R0)