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, cilt.47, sa.9, ss.1150-1165, 1996 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 47 Sayı: 9
  • Basım Tarihi: 1996
  • Doi Numarası: 10.1057/palgrave.jors.0470906
  • Dergi Adı: JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.1150-1165
  • Anahtar Kelimeler: concave-cost optimisation, heuristics, network programming, tabu search, transshipment problem, NETWORK DESIGN, TRANSPORTATION, MODELS, FLOWS, ASSIGNMENT
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.