On the variable-depth-search heuristic for the linear-cost generalized assignment problem

Bertrand M.T. Lin, Y. S. Huang, H. K. Yu

研究成果: Article同行評審

摘要

The classical assignment problem seeks to determine a mapping between a set of assignees and a set of assignments. The linear cost assignment problem (LCGAP), as a generalized model, incorporates the relative workloads between assignees and assignments. Although LCGAP is computationally intractable, it has been extensively studied because of its practical implications in many real world situations. Variable-depth-search heuristic (VDSH) method is one of the solution methods that have been developed to produce quality near-optimal solutions to LCGAP. The main structure of VDSH consists of two basic operations: reassign and swap. In this paper, we make further observations on this effective heuristic method through a series of computational experiments. The numerical results statistically evince that different combinations of these two operations will result in solutions of different quality levels. These findings are expected to have similar implications to search heuristics for other optimization problems.

原文English
頁(從 - 到)535-544
頁數10
期刊International Journal of Computer Mathematics
77
發行號4
出版狀態Published - 2001

All Science Journal Classification (ASJC) codes

  • 電腦科學應用
  • 計算機理論與數學
  • 應用數學

指紋

深入研究「On the variable-depth-search heuristic for the linear-cost generalized assignment problem」主題。共同形成了獨特的指紋。

引用此