본문 바로가기
  • Home

Optimal Solution Algorithm for Delivery Problem on Graphs

  • Journal of The Korea Society of Computer and Information
  • Abbr : JKSCI
  • 2021, 26(3), pp.111-117
  • DOI : 10.9708/jksci.2021.26.03.111
  • Publisher : The Korean Society Of Computer And Information
  • Research Area : Engineering > Computer Science
  • Received : January 14, 2021
  • Accepted : February 9, 2021
  • Published : March 31, 2021

Lee Kwang Eui 1

1동의대학교

Accredited

ABSTRACT

The delivery problem on a graph is that of minimizing the object delivery time from one vertex to another vertex on a graph with  vertices using  various speed robot agents. In this paper, we propose two optimal solution algorithms for the delivery problem on a graph with time complexity of   and   . After preprocessing to obtain the shortest path for all pairs of the graph, our algorithm processed by obtaining the shortest delivery path in the order of the vertices with the least delivery time. Assuming that the graph reflects the terrain on which to solve the problem, our    algorithm actually has a time complexity of   as only one preprocessing is required for the various deployment of n robot agents.

Citation status

* References for papers published after 2023 are currently being built.

This paper was written with support from the National Research Foundation of Korea.