:::
Trans. Planning Journal
| Title | Neighborhood Search Algorithms for Concave Cost Transshipment Problems |
|---|---|
| Author | Shangyao Yan, Chien-Rong Chen, Chin-Hui Tang |
| Summary | The minimum cost transshipment problems are traditionally defined as a linear cost problem, to reduce problem complexity. In reality, the unit cost decreases as the amount transported increases, resulting in a concave cost function. Great efforts have been devoted to the development of solution algorithms. However, they were confined to specical transportation networks. Besdies, their methods were focused on local search algorithms or traditional heuristics. Recently, researchers began to use advanced neighborhood search algorithms to solve concave cost bi-partite transportation network problems to enlarge search area and find near-optimal solutions. This type of research, however, neglected flow transfers in transportation networks. We developed two neighborhood search algorithms referring to the threshold accepting algorithm and the great deluge algorithm to efficiently solve transshipment problems. Problem characteristics were first explored to efficiently generate initial solutions, which are then improved by neighborhood search algorithms to near-optimal solutions. To evaluate the proposed neighborhood search algorithms, we designed a randomized network generator to produce many test problems. We employed C++ computer language to code all necessary programs and perform tests on personal computers. The results show that the developed neighborhood search algorithms performed well in the tests. |
| Vol. | 33 |
| No. | 2 |
| Page | 277 |
| Year | 2004 |
| Month | 6 |
Count Views:465