THE SHORTEST PATH PROBLEM IN LOGISTICS

THE SHORTEST PATH PROBLEM IN LOGISTICS

Authors

  • Andrey Bogdanov KONSTANTIN PRESLAVSKY UNIVERSITY OF SHUMEN, 9700, SHUMEN, BULGARIA

DOI:

https://doi.org/10.46687/jsar.v11i1.214

Keywords:

logistics management, Shortest Path Problems, algorithm

Abstract

The shortest path problem is one of the fundamental network flow problems. A large number of problems from diverse areas such as routing in telecommunication networks are an intrinsic part of this problem. The report examines different algorithms to solve this major problem for logistics.

Author Biography

Andrey Bogdanov, KONSTANTIN PRESLAVSKY UNIVERSITY OF SHUMEN, 9700, SHUMEN, BULGARIA

KONSTANTIN PRESLAVSKY UNIVERSITY OF SHUMEN, 9700, SHUMEN, BULGARIA

Downloads

Published

19.03.2023

How to Cite

Bogdanov, A. . (2023). THE SHORTEST PATH PROBLEM IN LOGISTICS: THE SHORTEST PATH PROBLEM IN LOGISTICS. JOURNAL SCIENTIFIC AND APPLIED RESEARCH, 11(1), 68–72. https://doi.org/10.46687/jsar.v11i1.214

Issue

Vol. 11 No. 1 (2017): Journal Scientific and Applied Research

Section

Technical Sciences

License

Copyright (c) 2023 JOURNAL SCIENTIFIC AND APPLIED RESEARCH

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.