Solving the quadratic assignment problem using F-MSG algorithm

Journal of Industrial and Management Optimization

Volumn 3, Issue 2, 2007, Pages 173-191

  Gasimov, R N ^a   Ustun, O ^a  

^a ESKISEHIR OSMANGAZI UNIVERSITY   (Turkey)

Author keywords

F MSG algorithm; Global optimization; Modified sub gradient algorithm; Nonconvex optimization; Quadratic assignment problem; Sharp augmented Lagrangian

Indexed keywords

EID: 57249088620     PISSN: 15475816     EISSN: 1553166X     Source Type: Journal    
DOI: 10.3934/jimo.2007.3.173     Document Type: Article

References (51)

1. K. Anstreicher, X. Chen, H. Wolkowicz and Y.X. Yuan, Strong duality for a trust-region type relaxation of the quadratic assignment problem, Linear Alg. and Its Appl., 301 (1999), 121-136.
2. K.M. Anstreicher and N.W. Brixins, A new bound for the quadratic assignment problem based on convex quadratic programming, Mathematical Programming, 89 (2001), 341-357.
3. K. M. Anstreicher, Recent advances in the solution of quadratic assignment problems, Mathematical Programming Series B, 97 (2003), 27-42.
4. A. Y. Azimov and R. N. Gasimov, Stability and Duality of Nonconvex Problems via Augmented Lagrangian, Cybernetics and Systems Analysis, 38 (2002), 412-421.
5. A. Baykasoglu, A meta-heuristic algorithm to solve quadratic assignment formulations of cell formation problems without presetting number of cells, Journal of Intelligent Manufacturing, 15 (2004), 753-759.
6. M.S. Bazaraa and O. Kirca, A branch-and-bound based heuristic for solving the quadratic assignment problem, Naval Research Logistics Quarterly, 30 (1983), 287-304.
7. M. S. Bazaraa, H. D. Sherali and C. M. Shetty, "Nonlinear Programming: Theory and Algorithms," John Wiley & Sons, Inc., New York, 1993.
8. D.P. Bertsekas, "Nonlinear Programming," Athena Scientific, Belmont, Massachusetts, 1995.
9. N.W. Brixins and K.M. Anstreicher, Solving quadratic assignment problems using convex quadratic programming relaxations, Optimization Methods and Software, 16 (2001), 49-68.
10. A. Bruengger, J. Clausen, A. Marzetta and M. Perregaard, Joining forces in solving large-scale quadratic assignment problems in parallel, DIKU Technical Report, University of Copenhagen, 1996.
11. A. Brungger, A. Marzetta, J. Clansen, and M. Perregaard, Solving large-scale QAP problems in parallel with the search library ZRAM, Journal of Parallel and Distributed Computing, 50 (1998), 157-169.
12. R. S. Burachik, R. N. Gasimov, N. A. Ismayilova and C. Y. Kaya, On a Modified Subgradient Algorithm for Dual Problems via Sharp Augmented Lagrangian, Journal of Global Optimization, 34 (2006), 55-78.
13. S. Burer and D. Vandenbussche, Solving lift-and-project relaxations of binary integer programs, SIAM Journal on Optimization, 16 (2006), 726-750.
14. R. E. Burkard and U. Derigs, Assignment and matching problems: Solutions methods with Fortran programs, Lectures Notes in Economics and Mathematical Systems, 184 (1980), Springer-Verlag, New York, Secaucus, NJ.
15. V. D. Cung, T. Mautor, P. Michelon and A. Tavares, A scatter search based approach for the quadratic assignment problem, in "Proceedings of IEEE International Conference on Evolutionary Computation," 1997, 165-169.
16. E. Çela, "The Quadratic Assignment Problem: Theory and Algorithms," Kluwer Academic Publishers, Dordrecht, The Netherlands, 1998.
17. Z. Drezner, Compounded genetic algorithms for the quadratic assignment problem, Operations Research Letters, 33 (2005), 475-480.
18. Z. Drezner, P. Hahn, and E. Taillard, (in press), A study of quadratic assignment problem instances that are difficult for meta-heuristic methods, in "Annals of Operations Research" (eds: M. Guignard-Spielberg, K. Spielberg), Special issue devoted to the State-of-the-Art in Integer Programming.
19. G. Erdogan and B. Tansel, A branch-and-cut algorithm for quadratic assignment problems based on linearizations, Computers and Operations Research, 34 (2007), 1085-1106.
20. B. Eschermann and H. J. Wunderlich, Optimized Synthesis of Self-testable Finite State Machines, in "20th International Symposium on Fault-Tolerant Computing (FFTCS 20)," Newcastle upon Tyne, 26-28th June 1990.
21. L. M. Gambardella, D. Taillard, M. Dorigo, Ant colonies for the QAP, Journal of the Operational Research Society, 50 (1999), 167176.
22. R. N. Gasimov, Augmented Lagrangian duality and nondifferentiable optimization methods in nonconvex programming, Journal of Global Optimization, 24 (2002), 187-203.
23. R. N. Gasimov and A. M. Rubinov, On augmented Lagrangians for optimization problems with a single constraint, Journal of Global Optimization, 28 (2004), 153-173.
24. R. N. Gasimov and O. Ustun, Solving The quadratic assignment problems using modified subgradient algorithm, in "Proceedings of 35th International Conference on Computers and Industrial Engineering," Istanbul, June 2005, 757-762.
25. R. N. Gasimov, O. Ustun and A. M. Rubinov, (submitted paper), The Modified Subgradient Algorithm Based on Feasible Values.
26. J. W. Gavett and N. V. Plyter, The optimal assignment of facilities to locations by branch-and-bound, Operations Research, 14 (1966), 210-232.
27. A. M. Geoffrion, Lagrengean relaxation for integer programming, Mathematical Programming Study, 2 (1974), 82-114.
28. P. C. Gilmore, Optimal and suboptimal algorithms for the quadratic assignment problem, SIAM Journal on Applied Mathematics, 10 (1962), 305-313.
29. F. Glover and E. Woolsey, Converting 0-1 Polynomial Programming Problem to a 0-1 Linear Program, Operations Research, 22 (1974), 180-182.
30. M. Guignard and S. Kim, Lagrangean decomposition: A model yielding stronger Lagrangean bounds, Math: Programming, 32 (1987), 215-228.
31. P. Hahn and T. Grant, Lower bounds for the quadratic assignment problem based upon a dual formulation, Operations Research, 46 (1998), 912-922.
32. T. C. Koopmans and M. J. Beckmann, Assignment problems and the location of economic activities, Econometrica, 25 (1957), 53-76.
33. E. L. Lawler, The quadratic assignment problem, Management Science, 9 (1963), 586-599.
34. D. Li, Zero duality gap in integer programming: P-norm surrogate constraint method, Operations Research Letters, 25 (1999), 89-96.
35. E. M. Loiola, N. M. M. Abreu, P. O. Boaventura-Netto, P. Hahn and T. Querido, A survey for the quadratic assignment problem, European Journal of Operational Research, 176 (2007), 657-690.
36. P. Michelon and N. Maculan, Lagrangean decomposition for integer nonlinear programming with linear constraints, Mathematical Programming, 52 (1991), 303-313.
37. P. Michelon, and N. Maculan, Lagrangean methods for 0-1 quadratic problems, Discrete Applied Mathematics, 42 (1993), 257-269.
38. I.Z. Milis and V.F. Magirou, A Lagrangean-relaxation algorithm for sparse quadratic assignment problems, Operations Research Letters, 17 (1995), 69-76.
39. C. Nugent, T. Vollman and J. Ruml, An experimental comparison of techniques for the assignment of facilities to locations, Operations Research, 16 (1968), 150-173, http://www.seas.upenn.edu/qaplib/.
40. C. A. S. Oliveira, M. P. Pardalos, M. G. G. Resende, GRASP with path relinking for the quadratic assignment problem, in "Experimental and Efficient Algorithms," Third International Workshop (WEA 2004), Brazil, LNCS 3059, Springer, 2004, 356-368.
41. P. M. Pardalos, F. Rendl, H. Wolkowicz, The quadratic assignment problem: A survey of recent developments, in "Quadratic Assignment and Related Problems" (Eds: H. Pardalos, H. Wolkowicz), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 16 (1994), AMS, Rhode Island, 1-42.
42. P. M. Pardalos, K. G. Ramakrishnan, M. G. C. Resende and Y. Li, Implementation of a variance reduction-based lower bound in a branch-and-bound algorithm for the quadratic assignment problems, SIAM Journal on Optimization, 7 (1997), 280-294.
43. C. Roucairol, A reduction method for quadratic assignment problem, Methods of Operations Research, 32 (1979), 185-187.
44. A. M. Rubinov and R. N. Gasimov, The Nonlinear and Augmented Lagrangians for Nonconvex Optimization Problems with a Single Constraint, Applied and Computational Mathematics, 1 (2002), 142-157.
45. A. M. Rubinov and R. N. Gasimov, Strictly increasing positively homogeneous functions with applications to exact penalization, Optimization, 52 (2003), 1-28.
46. A. M. Rubinov, X. Q. Yang, A. M. Bagirov and R. N. Gasimov, Lagrange-type functions in constrained optimization, Journal of Mathematical Sciences, 115 (2003), 2437-2505.
47. S. Sahni, and T. Gonzales, P-complete approximation problems, Journal of the Association for Computing Machinery, 23 (1976), 555-565.
48. T. Stutzle, Iterated local search for the quadratic assignment problem, European Journal of Operational Research, 174 (2006), 1519-1539.
49. E. Taillard, Comparison of iterative searches for the quadratic assignment problem, Location Science, 3 (1995), 87-105.
50. D. J. White, A Lagrangean relaxation approach for a turbine design quadratic assignment problem, Journal of the Operational Research Society, 47 (1996), 766-775.
51. Q. Zhao, S. E. Karisch, F. Rendl and H. Wolkowicz, Semidefinite programming relaxations for the quadratic assignment problem, Journal of Combinatorial Optimization, 2 (1998), 71-109.