Near Optimal Algorithm for Delivery Problem

The delivery problem is that of minimizing the object delivery time from one place to another using n various speed robots. In this paper we propose two algorithms for the delivery problem. The first one is an optimal algorithm with some restriction in handover places. In this algorithm, we assume that the handover can be made at predefined spots called station. The second algorithm is a near optimal algorithm for general case delivery problem which is based on the previous algorithm. The second algorithm does not generate an optimal solution but we can make the result better than what we expect.