A Polynomial-time Algorithm for Choosing the Shortest Transportation Path of Logistic Material

최적 보급수송로 선정을 위한 다항시간 알고리듬

This paper considers the shortest path problem combined with Min-Min-Sum objective for solving the problem of the military logistics. This paper develops a polynomial-time algorithm for the optimal solution. To analyze the real combat situation, the ability time and distance time of communication line are considered. The complexities of algorithm between previous study and the algorithm developed in this paper is presented. Finally we provide a simple example of application with randomly generated problem.