Abstract
In this paper, a greedy heuristic and two local search algorithms, 1-opt local search and k-opt local search, are proposed for the unconstrained binary quadratic programming problem (BQP). These heuristics are well suited for the incorporation into meta-heuristics such as evolutionary algorithms. Their performance is compared for 115 problem instances. All methods are capable of producing high quality solutions in short time. In particular, the greedy heuristic is able to find near optimum solutions a few percent below the best-known solutions, and the local search procedures are sufficient to find the best-known solutions of all problem instances with n ≤ 100. The k-opt local searches even find the best-known solutions for all problems of size n ≤ 250 and for 11 out of 15 instances of size n = 500 in all runs. For larger problems (n = 500, 1000, 2500), the heuristics appear to be capable of finding near optimum solutions quickly. Therefore, the proposed heuristics—especially the k-opt local search—offer a great potential for the incorporation in more sophisticated meta-heuristics.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alidaee, B., B.G. Kochenberger, and A. Ahmadian. (1994). “0-1 Quadratic Programming Approach for the Optimal Solution of Two Scheduling Problems.” International Journal of Systems Science 25, 401–408.
Amini, M.M., B. Alidaee, and G.A. Kochenberger. (1999). “AScatter Search Approach to Unconstrained Quadratic Binary Programs.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. London: McGraw-Hill, pp. 317–329.
Barahona, F., M. Jünger, and G. Reinelt. (1989). “Experiments in Quadratic 0-1 Programming.” Mathematical Programming 44, 127–137.
Battiti, R. and A. Bertossi. (1998). “Differential Greedy for the 0-1 Equicut Problem.” In D. Du and P. Pardalos (eds.), Proceedings of the DIMACSWorkshop on Network Design: Connectivity and Facilities Location, Vol. 40 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Providence, RI: American Mathematical Society, pp. 3–21.
Beasley, J.E. (1990). “OR-Library: Distributing Test Problems by Electronic Mail.” Journal of the Operational Research Society 41(11), 1069–1072.
Beasley, J.E. (1998). “Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem.” Technical Report, Management School, Imperial College, London, UK.
Billionnet, A. and A. Sutter. (1994). “Minimization of a Quadratic Pseudo-Boolean Function.” European Journal of Operational Research 78, 106–115.
Corne, D., M. Dorigo, and F. Glover (eds.) (1999). New Ideas in Optimization. London: McGraw-Hill.
Gallo, G., P.L. Hammer, and B. Simeone. (1980). “Quadratic Knapsack Problems.” Mathematical Programming 12, 132–149.
Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman.
Glover, F., G.A. Kochenberger, and B. Alidaee. (1998a). “Adaptive Memory Tabu Search for Binary Quadratic Programs.” Management Science 44(3), 336–345.
Glover, F., G. Kochenberger, B. Alidaee, and M. Amini. (1998b). “Tabu Search with Critical Event Memory: An Enhanced Application for Binary Quadratic Programs.” In S. Voss, S. Martello, I. Osman, and C. Roucairol (eds.), Meta-Heuristics—Advances and Trends in Local Search Paradigms for Optimization. Dordrecht: Kluwer Academic Publishers, pp. 83–109.
Helmberg, C. and F. Rendl. (1998). “Solving Quadratic (0,1)-Problems by Semidefinite Programs and Cutting Planes.” Mathematical Programming 82, 291–315.
Ivănescu, P.L. (1965). “Some Network Flow Problems Solved with Pseudo-Boolean Programming.” Operations Research 13, 388–399.
Katayama, K. and H. Narihisa. (1999). “Performance of Simulated Annealing-Based Heuristic for the Unconstrained Binary Quadratic Programming Problem.” Technical Report, Dept. of Information and Computer Engineering, Okayama University of Science, Okayama, Japan.
Katayama, K. and H. Narihisa. (2000). “Solving Large Binary Quadratic Programming Problems by Effective Genetic Local Search Algorithm.” In GECCO-2000: Proceedings of the Genetic and Evolutionary Computation Conference. San Mateo, CA: Morgan Kaufman, pp. 643–650.
Kauffman, S.A. and S. Levin. (1987). “Towards a General Theory of Adaptive Walks on Rugged Landscapes.” Journal of Theoretical Biology 128, 11–45.
Kernighan, B. and S. Lin. (1972). “An Efficient Heuristic Procedure for Partitioning Graphs.” Bell Systems Journal 49, 291–307.
Krarup, J. and P.M. Pruzan. (1978). “Computer-Aided Layout Design.” Mathematical Programming Study 9, 75–94.
Laughunn, D.J. (1970). “Quadratic Binary Programming.” Operations Research 14, 454–461.
Lin, S. and B. Kernighan. (1973). “An Effective Heuristic Algorithm for the Traveling Salesman Problem.” Operations Research 21, 498–516.
Lodi, A., K. Allemand, and T.M. Liebling. (1999). “An Evolutionary Heuristic for Quadratic 0-1 Programming.” European Journal of Operational Research 119, 662–670.
McBride, R.D. and J.S. Yormark. (1980). “An Implicit Enumeration Algorithm for Quadratic Integer Programming.” Management Science 26(3), 282–296.
Merz, P. (2000). “Memetic Algorithms for Combinatorial Optimization Problems: Fitness Landscapes and Effective Search Strategies.” Ph.D. Thesis, Department of Electrical Engineering and Computer Science, University of Siegen, Germany.
Merz, P. and B. Freisleben. (1999a). “Genetic Algorithms for Binary Quadratic Programming.” In W. Banzhaf, J. Daida, A.E. Eiben, M.H. Garzon, V. Honavar, M. Jakiela, and R.E. Smith (eds.), GECCO-1999: Proceedings of the Genetic and Evolutionary Computation Conference. San Mateo, CA: Morgan Kaufman, pp. 417–424.
Merz, P. and B. Freisleben. (1999b). “Fitness Landscapes and Memetic Algorithm Design.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. London: McGraw-Hill, pp. 245–260.
Merz, P. and B. Freisleben. (2000). “Fitness Landscapes, Memetic Algorithms and Greedy Operators for Graph Bi-Partitioning.” Evolutionary Computation 8(1), 61–91.
Moscato, P. (1989). “On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms.” Technical Report No. 790, Caltech Concurrent Computation Program, California Institue of Technology.
Moscato, P. (1999). “Memetic Algorithms: A Short Introduction.” In D. Corne, M. Dorigo, and F. Glover (eds.), New Ideas in Optimization. London: McGraw-Hill, pp. 219–234.
Pardalos, P.M. and G.P. Rodgers. (1990). “Computational Aspects of a Branch and Bound Algorithm for Unconstrained Quadratic Zero-One Programming.” Computing 45, 131–144.
Pardalos, P.M. and G.P. Rodgers. (1992). “A Branch and Bound Algorithm for the Maximum Clique Problem.” Computers and Operations Research 19(5), 363–375.
Pardalos, P.M. and J. Xue. (1994). “The Maximum Clique Problem.” Journal of Global Optimization 4, 301–328.
Phillips, A.T. and J.B. Rosen. (1994). “A Quadratic Assignment Formulation for the Molecular Conformation Problem.” Journal of Global Optimization 4, 229–241.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Merz, P., Freisleben, B. Greedy and Local Search Heuristics for Unconstrained Binary Quadratic Programming. Journal of Heuristics 8, 197–213 (2002). https://doi.org/10.1023/A:1017912624016
Issue Date:
DOI: https://doi.org/10.1023/A:1017912624016