Abstract
In this paper we consider the rectilinear version of the quadratic assignment problem (QAP). We define a class of edge-weighted graphs with nonnegatively valued bisections. For one important type of such graphs we provide a characterization of point sets on the plane for which the optimal value of the related QAP is zero. These graphs are used in the algorithms for generating rectilinear QAP instances with known provably optimal solutions. The basic algorithm of such type uses only triangles. Making a reduction from 3-dimensional matching, it is shown that the set of instances which can be generated by this algorithm is hard. The basic algorithm is extended to process graphs larger than triangles. We give implementation details of this extension and of four other variations of the basic algorithm. We compare these five and also two existing generators experimentally employing multi-start descent heuristic for the QAP as an examiner. The graphs with nonnegatively valued bisections can also be used in the construction of lower bounds on the optimal value for the rectilinear QAP.
Similar content being viewed by others
References
Battiti, R. and Tecchiolli, G. (1994), The Reactive Tabu Search, ORSA J. on Computing 6, 126–140.
Burkard, R.E. (1984), Quadratic Assignment Problems, European J. of Operational Research 15, 283–289.
Burkard, R.E., Çela, E., Pardalos, P.M. and Pitsoulis L.S. (1998), The Quadratic Assignment Problem, SFB Report 126, Institute of Mathematics, Technical University Graz, Austria, to appear in Pardalos, P.M. and Du, D.-Z. (eds.), Handbook of Combinatorial Optimization, Kluwer Academic Publishers, Dordrecht/Boston/London.
Burkard, R.E., Karisch, S.E. and Rendl, F. (1997), QAPLIB-A Quadratic Assignment Problem Library, J. of Global Optimization 10, 391–403.
Burkard, R.E. and Rendl, F. (1984), A Thermodynamically Motivated Simulation Procedure for Combinatorial Optimization Problems, European J. of Operational Research 17, 169–174.
Çela, E. (1998), The Quadratic Assignment Problem: Theory and Algorithms, Kluwer Academic Publishers, Dordrecht/Boston/London.
Clausen, J. and Perregaard, M. (1997), Solving Large Quadratic Assignment Problems in Parallel, Computational Optimization and Applications 8, 111–127.
Connolly, D.T. (1990), An Improved Annealing Scheme for the QAP, European J. of Operational Research 46, 93–100.
Cyganski, D., Vaz, R.F. and Virball, V.G. (1994), Quadratic Assignment Problems Generated with the Palubetskis Algorithm Are Degenerate, IEEE Transactions on Circuits and Systems-I: Fundamental Theory and Applications 41, 481–484.
Dyer, M.E. and Frieze, A.M. (1985), On the Complexity of Partitioning Graphs into Connected Subgraphs, Discrete Applied Mathematics 10, 139–153.
Feo, T.A. and Resende, M.G.C. (1995), Greedy Randomized Adaptive Search Procedures, J. of Global Optimization 6, 109–133.
Finke, G., Burkard, R.E. and Rendl, F. (1987), Quadratic Assignment Problems, Annals of Discrete Mathematics 31, 61–82.
Fleurent, C. and Ferland, J.A. (1994), Genetic Hybrids for the Quadratic Assignment Problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 173–187.
Gambardella, L.M., Taillard, E.D. and Dorigo, M. (1997), Ant Colonies for the QAP, Technical Report IDSIA–4–97, Istituto Dalle Molle di Studi sull'Intelligenza Artificiale, Lugano, Switzerland.
Garey, M.R. and Johnson, D.S. (1979), Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H.Freeman and Co., San Francisco.
Gilmore, P.C. (1962), Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem, J. SIAM 10, 305–313.
Hasselberg, J., Pardalos, P.M. and Vairaktarakis, G. (1993), Test Case Generators and Computational Results for the Maximum Clique Problem, J. of Global Optimization 3, 463–482.
Lawler, E.L. (1963), The Quadratic Assignment Problem, Management Science 9, 586–599.
Li, Y. and Pardalos, P.M. (1992), Generating Quadratic Assignment Test Problems with Known Optimal Permutations, Computational Optimization and Applications 1, 163–184.
Li, Y., Pardalos, P.M., Ramakrishnan, K.G. and Resende, M.G.C. (1994), Lower Bounds for the Quadratic Assignment Problem, Annals of Operations Research 50, 387–411.
Li, Y., Pardalos, P.M. and Resende, M.G.C. (1994), A Greedy Randomized Adaptive Search Procedure for the Quadratic Assignment Problem, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 237–261.
Mautor, T. and Roucairol, C. (1994), A New Exact Algorithm for the Solution of Quadratic Assignment Problems, Discrete Applied Mathematics 55, 281–293.
Murthy, K.A., Pardalos, P.M. and Li, Y. (1992), A Local Search Algorithm for the Quadratic Assignment Problem, Informatica 3, 524–538.
Palubeckis, G.S. (1988), A Generator of Quadratic Assignment Test Problems with Known Optimal Solution, U.S.S.R. Computational Mathematics and Mathematical Physics 28, 97–98. [Translated from Zh. Vychisl. Mat. Mat. Fiz. 28, 1740–1743.]
Palubeckis, G. (1997), The Use of Special Graphs for Obtaining Lower Bounds in the Geometric Quadratic Assignment Problem, Informatica 8, 377–400.
Pardalos, P.M., Rendl, F. and Wolkowicz, H. (1994), The Quadratic Assignment Problem: A Survey and Recent Developments, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 16, 1–42.
Pardalos, P.M., Resende, M.G.C. and Li, Y. (1996), FORTRAN Subroutines for Approximate Solution of Dense Quadratic Assignment Problems Using GRASP, ACM Transactions on Mathematical Software 22, 104–118.
Pardalos, P.M., Resende, M.G.C. and Pitsoulis, L.S. (1997), Algorithm 769: FORTRAN Subroutines for Approximate Solution of Sparse Quadratic Assignment Problems Using GRASP, ACM Transactions on Mathematical Software 23, 196–208.
Sanchis, L.A. (1990), On the Complexity of Test Case Generation for NP-Hard Problems, Information Processing Letters 36, 135–140.
Sanchis, L.A. and Jagota, A. (1996), Some Experimental and Theoretical Results on Test Case Generators for the Maximum Clique Problem, INFORMS J. on Computing 8, 87–102.
Skorin-Kapov, J. (1990), Tabu Search Applied to the Quadratic Assignment Problem, ORSA J. on Computing 2, 33–45.
Taillard, E. (1991), Robust Taboo Search for the Quadratic Assignment Problem, Parallel Computing 17, 443–455.
Taillard, E.D. (1995), Comparison of Iterative Searches for the Quadratic Assignment Problem, Location Science 3, 87–105.
Tate, D.M. and Smith, A.E. (1995), A Genetic Approach to the Quadratic Assignment Problem, Computers and Operations Research 22, 73–83.
Wilhelm, M.R. and Ward, T.L. (1987), Solving Quadratic Assignment Problems by Simulated Annealing, IEEE Transactions 19, 107–119.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Palubeckis, G. Generating Hard Test Instances with Known Optimal Solution for the Rectilinear Quadratic Assignment Problem. Journal of Global Optimization 15, 127–156 (1999). https://doi.org/10.1023/A:1008303023616
Issue Date:
DOI: https://doi.org/10.1023/A:1008303023616