Quadratic assignment problems and \(M/G/C/C/\) state dependent network flows. (English) Zbl 1135.90311
Summary: 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.
MSC:
90B15 | Stochastic network models in operations research |
90B22 | Queues and service in operations research |
90C59 | Approximation methods and heuristics in mathematical programming |