Enhanced adjacent extreme-point search and tabu search for the minimum concave-cost uncapacitated transshipment problem

Journal of the Operational Research Society

Volumn 47, Issue 9, 1996, Pages 1150-1165

  Bazlamacci, Cüneyt F ^a,c   Hindi, Khalil S ^b  

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

^b BRUNEL UNIVERSITY   (United Kingdom)

^c MIDDLE EAST TECHNICAL UNIVERSITY   (Turkey)

Author keywords

Concave cost optimisation; Heuristics; Network programming; Tabu search; Transshipment problem

Indexed keywords

HEURISTICS; NETWORK PROGRAMMING; TABU SEARCH; TRANSSHIPMENT PROBLEM;

ALGORITHMS; CALCULATIONS; COMPUTER APPLICATIONS; OPERATIONS RESEARCH;

OPTIMIZATION;

EID: 0030242925     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.143     Document Type: Article

References (32)

1. M. Florian (1986) Nonlinear cost network models in transportation analysis. Math. Prog. Study. 26, 167-196.
2. B. Yaged, Jr. (1971) Minimum cost routing for static network models. Networks. 1, 139-172.
3. N. Zadeh (1973) On building minimum cost communication networks. Networks. 3, 315-331.
4. I. Baybars and R. H. Edahl (1988) A heuristic method for facility planning in telecommunications networks with multiple alternate routes. Naval Res. Logist. 35, 503-528.
5. W. I. Zangwill (1968) Minimum concave cost flows in certain networks. Mgmt Sci. 14, 429-450.
6. W. I. Zangwill (1969) A backlogging model and a multi-echelon model of an economic lot size production system a network approach. Mgmt Sci. 15, 506-527.
7. W. I. Zangwill (1966) A deterministic multi-period production scheduling model with backlogging. Mgmt Sci. 13, 105-119.
8. H. Konno (1988) Minimum concave cost production system: multi-echelon model. Math. Prog. 41, 185-193.
9. R. M. Soland (1974) Optimal facility location with concave costs. Opns Res. 22, 373-382.
10. G. Gallo and C. Sodini (1979) Concave cost minimization on networks. Eur. J. Opl Res. 3, 239-249.
11. J. J. Jarvis, Y. E. Unger, R. L. Rardin and R. W. Moore (1978) Optimal design of regional wastewater systems: a fixed charge network flow model. Opns Res. 26, 538-550.
12. F. Glover, M. Lee and J. Ryan (1991) Least-cost network topology design for a new service: an application of tabu search. Ann. Opns Res. 33, 351-362.
13. A. Hertz and D. de Werra (1990) The tabu search metaheuristic: how we used it. Ann. Math, and Artificial Intelligence. 1, 111-121.
14. M. Sun and P. G. McKeown (1993) Tabu search applied to the general fixed charge problem. Ann. Opns Res. 41, 405-420.
15. G. Gallo and C. Sodini (1979) Adjacent extreme flows and application to minimum concave cost flow problems. Networks. 9, 95-121.
16. T L. Magnanti and R. T. Wong (1984) Network design and transportation planning: models and algorithms. Trans. Sci. 18, 1-55.
17. G. M. Guisewite and P. M. Pardalos (1990) Minimum concave cost network flow problems: applications, complexity and algorithms. Ann. Opns Res. 25, 75-100.
18. P. M. Pardalos and J. B. Rosen (1986) Methods for global concave minimization: a bibliographic survey. SIAM Review. 28, 367-379.
19. P. M. Pardalos (1988) Enumerative techniques for solving some nonconvex global optimization problems. OR Spectrum. 10, 29-35.
20. P. Rech and L. G. Barton (1970) A non-convex transportation algorithm. In Application of Mathematical Programming Techniques. (E. M. L. Beale, Ed.) pp 250-260. The English Universities Press, London.
21. G. Gallo, C. Sandi and C. Sodini (1980) An algorithm for the minimum concave cost flow problem. Eur. J. Opl Res. 4, 248-255.
22. R. E. Erickson, C. L. Monma and A. F. Veinott (1987) Send-and-split method for minimum concave cost network flows. Math. Oper. Res. 12, 634-664.
23. M. Minoux (1976) Multiflots de cout minimal avec fonctions de cout concaves. Annales des Telecommunications. 31, 77-92.
24. M. Minoux (1989) Network synthesis and optimum network design problems: models, solution methods and applications. Networks. 19, 313-360.
25. G. Daeninck and Y. Smeers (1977) Using shortest paths in some transshipment problems with concave costs. Math. Prog. 12, 18-25.
26. F. Glover (1986) Future paths for integer programming and links to artificial intelligence. Comps and Opns Res. 13, 533-549.
27. F. Glover and M. Laguna (1993) Tabu search. In Modern Heuristic Techniques in Combinatorial Problems. (C. Reeves, Ed.) pp 70-150. Blackwell Scientific Publications, London.
28. M. Florian, M. Arthiat and D. De Werra (1971) A property of minimum concave cost flows in capacitated networks. INFOR. 9, 293-304.
29. R. E. Tarjan (1983) Data structures and network algorithms. In CBMS-NFS Regional Conference Series in Applied Mathematics. 44 (R. E. Tarjan) pp 90-91. Society for Industrial and Applied Mathematics, Philadelphia.
30. E. Taillard (1991) Robust taboo search for the quadratic assignment problem. Parallel Comp. 17, 443-455.
31. K. S. Hindi (1993) Efficient Implementation of Network Simplex Algorithms. DTG Report 93(3) (update of DTG report 87(7)), Department of Computation, UMIST.
32. D. Klingman, A. Napier and J. Stutz (1974) A program for generating large scale capacitated assignment, transportation and minimum cost flow network problems. Mgmt Sci. 20, 814-821.