A TABU-SEARCH BASED ALGORITHM FOR CONCAVE COST TRANSPORTATION NETWORK PROBLEMS

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.

[1]  H. Kuhn,et al.  An approximative algorithm for the fixed‐charges transportation problem , 1962 .

[2]  W. Zangwill.  Minimum Concave Cost Flows in Certain Networks , 1968 .

[3]  Darwin Klingman,et al.  NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[4]  Larry J. LeBlanc.  Global Solutions for a Nonconvex Nonconcave Rail Network Model , 1976 .

[5]  G. Gallo,et al.  Adjacent extreme flows and application to min concave cost flow problems , 1979, Networks.

[6]  Giorgio Gallo,et al.  An algorithm for the min concave cost flow problem , 1980 .

[7]  B. Golden,et al.  Using simulated annealing to solve routing and location problems , 1986 .

[8]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[9]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[10]  Gerhard W. Dueck,et al.  Threshold accepting: a general purpose optimization algorithm appearing superior to simulated anneal , 1990 .

[11]  N. Hu.  Tabu search method with random moves for globally optimal design , 1992 .

[12]  Colin R. Reeves,et al.  Improving the Efficiency of Tabu Search for Machine Sequencing Problems , 1993 .

[13]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[14]  Marius Sinclair,et al.  Comparison of the performance of modern heuristics for combinatorial optimization on real data , 1993, Comput. Oper. Res..

[15]  Mikael Rönnqvist,et al.  A Lagrangean heuristic for the capacitated concave minimum cost network flow problem , 1994 .

[16]  Shangyao Yan.  Approximating reduced costs under degeneracy in a network flow problem with side constraints , 1996 .