Suboptimal algorithms for the quadratic assignment problem
作者:
G. K. Gaschütz,
J. H. Ahrens,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1968)
卷期:
Volume 15,
issue 1
页码: 49-62
ISSN:0028-1441
年代: 1968
DOI:10.1002/nav.3800150105
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractThe idea of combining relatively simple continuous methods with discrete procedures is used for the construction of suboptimal algorithms for quadratic assignment problems. Depending on the nature of the special problem these steps may vary in complexity. The simplest procedures require minimum storage space and result in tolerable computation times. Different choices of parameters and random variations may be used in order to obtain statistical distributions of suboptimal solutions. Computational results for sample problems indicate improvements on results of Steinberg, Gilmore, and Hillier and Connors.
点击下载:
PDF
(1369KB)
返 回