首页 | 本学科首页   官方微博 | 高级检索  
     


Quadratic Assignment Problems and M/G/C/C/ State Dependent Network Flows
Authors:J. Macgregor Smith  Wu-Ji Li
Affiliation:(1) Department of Mechanical and Industrial Engineering, University of Massachusetts, Amherst, MA 01003, USA;(2) ATT Solutions, Room 1D337, 307 Middletown-Lincroft Road, Lincroft, New Jersey 07738, USA
Abstract:One of the most notorious network design problems is the Quadratic Assignment Problem (QAP). We develop an heuristic algorithm for QAPs along with an M/G/C/C state dependent queueing model for capturing congestion in the traffic system interconnecting the nodes in the network. Computational results are also presented.
Keywords:quadratic assignment  stochastic networks
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号