Consider the problem of using a vehicle to transport k objects one at a time between s stations on a circular track. Let the cost of the transportation be the total distance traveled by the vehicle on the track. An O(k + M (s, q)) time algorithm is presented to find a minimum cost transportation, where M (m, n) is the time to solve a minimum spanning tree problem on a graph with m edges and n vertices, and q less-than-or-equal-to min{k, s} is the number of strongly connected components in an associated balanced problem. Also, the minimum spanning tree problem on a graph with m edges and n vertices is reduced to a transportation problem on a linear track with O(m) stations, O(m) objects, and O(n) strongly connected components in O(m) time.