Abstract
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.
Original language | English |
---|---|
Pages (from-to) | 327-335 |
Number of pages | 9 |
Journal | Journal of the Chinese Institute of Engineers, Transactions of the Chinese Institute of Engineers,Series A/Chung-kuo Kung Ch'eng Hsuch K'an |
Volume | 21 |
Issue number | 3 |
DOIs | |
State | Published - 1998 |
Keywords
- Concave Cost
- Tabu Search
- Transportation Problem