This research employs the tabu search method to develop an algorithm for efficiently solving concave cost transportation network problems which are characterized as NP-hard. An initial solution method and a linear approximation approach are also developed, to evaluate the algorithm. The preliminary results show that the algorithm is potentially useful.
