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

Bazlamacci C. F., Hindi K.

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, vol.47, no.9, pp.1150-1165, 1996 (SCI-Expanded) identifier identifier

  • Publication Type: Article / Article
  • Volume: 47 Issue: 9
  • Publication Date: 1996
  • Doi Number: 10.1057/palgrave.jors.0470906
  • Journal Name: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Journal Indexes: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Page Numbers: pp.1150-1165
  • Keywords: concave-cost optimisation, heuristics, network programming, tabu search, transshipment problem, NETWORK DESIGN, TRANSPORTATION, MODELS, FLOWS, ASSIGNMENT
  • Middle East Technical University Affiliated: Yes

Abstract

Practicable methods for optimising concave-cast, uncapacitated transshipment networks are non exact. In this paper, one such effective method, that of adjacent extreme point search, is further developed to enhance its overall computational efficiency. The enhanced search algorithm is then imbedded in a tabu search scheme which proved capable of finding better solutions, by a wide margin in some instances. Another tabu search scheme, somewhat inferior in terms of solution quality but computationally more efficient, is also developed to provide an alternative solution vehicle for larger networks. Results of extensive computational testing are included.