This paper reports heuristic and exact solution advances for the Quadratic Assignment Problem (QAP). QAP instances most often discussed in the literature are relatively well solved by heuristic approaches. Indeed, solutions at a fraction of one percent from the best known solution values are rapidly found by most heuristic methods. Exact methods are not able to prove optimality for these instan...

The quadratic assignment problem (QAP) is very challengeable and interesting problem that can model many real-life problems. In this paper, we will simply discuss the meaning of quadratic assignment problem, solving techniques and we will give a survey of some developments and researches.

Local search procedures are popular methods to solve combinatorial problems and neighborhood structures are the main part of those algorithms. This paper presents a new neighborhood for the Quadratic Assignment Problem. The proposed neighborhood is compared with the classical 2-exchange neighborhood.

We consider transformations of the (metric) Quadratic Assignment Problem (QAP), that exploit the metric structure of a given instance. We show in particular, how the structural properties of rectangular grids can be used to improve a given lower bound. Our work is motivated by previous research of G.S. Palubetskes, and it extends a bounding approach proposed by J. Chakrapani and J. Skorin-Kapov...

Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto 606-8501, Japan Leeds School of Business, University of Colorado at Boulder, Campus Box 419, Boulder, Colorado 80309-0419, USA [email protected] • [email protected]...

We address the exact solution of the famous esc instances of the quadratic assignment problem. These are extremely hard instances that remained unsolved—even allowing for a tremendous computing power—by using all previous techniques from the literature. During this challenging task we found that three ideas were particularly useful, and qualified as a breakthrough for our approach. The present ...

In this paper, it is shown that by exploiting the explicit parametric state feedback solution, it is feasible to obtain the ultimate solution to minimum sensitivity problem. A numerical algorithm for construction of a robust state feedback in eigenvalue assignment problem for a controllable linear system is presented. By using a generalized parametric vector companion form, the problem of eigen...

Traffic assignment algorithms are used to determine possible use of paths between origin-destination pairs and predict traffic flow in network links. One of the main deficiencies of ordinary traffic assignment methods is that in most of them one measure (mostly travel time) is usually included in objective function and other effective performance measures in traffic assignment are not considere...