This research employs the tabu search method to develop an algorithm f
or efficiently solving concave cost transportation network problems wh
ich are characterized as NP-hard. An initial solution method and a lin
ear approximation approach are also developed, to evaluate the algorit
hm. The preliminary results show that the algorithm is potentially use
ful.