A hybrid metaheuristic approach to solving the UBQP problem

European Journal of Operational Research

Volumn 207, Issue 3, 2010, Pages 1254-1262

  Lü, Zhipeng ^a   Glover, Fred ^b   Hao, Jin Kao ^a  

^a UNIVERSITÉ D'ANGERS   (France)

^b OptTek Systems Inc   (United States)

Author keywords

Memetic algorithm; Pool updating; Tabu search; UBQP

Indexed keywords

BINARY QUADRATIC PROGRAMMING; COMBINATION OPERATORS; KEY ELEMENTS; MEMETIC ALGORITHMS; META-HEURISTIC APPROACH; POOL UPDATING; RANDOM INSTANCE; SEARCH PROCEDURES; SET-PARTITIONING PROBLEMS; SOLUTION QUALITY; UBQP;

COMPUTATIONAL EFFICIENCY; HEURISTIC METHODS; LAKES; MATHEMATICAL OPERATORS; TABU SEARCH;

EVOLUTIONARY ALGORITHMS;

EID: 77957723198     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.06.039     Document Type: Article

References (45)

1. B. Alidaee, G.A. Kochenberger, and A. Ahmadian 0-1 Quadratic programming approach for the optimal solution of two scheduling problems International Journal of Systems Science 25 1994 401 408
2. B. Alidaee, G.A. Kochenberger, K. Lewis, M. Lewis, and H. Wang A new approach for modelling and solving set packing problems European Journal of Operational Research 86 2 2008 504 512
3. T.M. Alkhamis, M. Hasan, and M.A. Ahmed Simulated annealing for the unconstrained binary quadratic pseudo-boolean function European Journal of Operational Research 108 1998 641 652
4. M. Amini, B. Alidaee, and G.A. Kochenberger A Scatter Search Approach to Unconstrained Quadratic Binary Programs New Methods in Optimization 1999 McGraw-Hill New York, NY 317-330
5. J.E. Beasley Obtaining test problems via internet Journal of Global Optimization 8 1996 429 433
6. J.E. Beasley, Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem, Working Paper, The Management School, Imperial College, London, England.
7. I. Borgulya An evolutionary algorithm for the binary quadratic problems Advances in Soft Computing 2 2005 3 16
8. E. Boros, P.L. Hammer, R. Sun, and G. Tavares A max-flow approach to improved lower bounds for quadratic 0-1 minimization Discrete Optimization 5 2 2008 501 529
9. E. Boros, P.L. Hammer, and G. Tavares Local search heuristics for quadratic unconstrained binary optimization (QUBO) Journal of Heuristics 13 2007 99 132
10. P. Chardaire, and A. Sutter A decomposition method for quadratic zero-one programming Management Science 41 4 1994 704 712
11. C. Fleurent, J.A. Ferland, Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability, in: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, 1996, pp. 619-652.
12. G. Gallo, P. Hammer, and B. Simeone Quadratic knapsack problems Mathematical Programming 12 1980 132 149
13. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-completeness 1979 Freeman New York
14. F. Glover, and M. Laguna Tabu Search 1997 Kluwer Academic Publishers Boston
15. F. Glover, M. Laguna, and R. Marti Fundamentals of scatter search and path-relinking Control and Cybernetics 39 2000 654 684
16. F. Glover, G.A. Kochenberger, and B. Alidaee Adaptive memory tabu search for binary quadratic programs Management Science 44 1998 336 345
17. F. Glover, B. Alidaee, C. Rego, and G. Kochenberger One-pass heuristics for large-scale unconstrained binary quadratic problems European Journal of Operational Research 137 2 2002 272 287
18. F. Glover, and J.K. Hao Efficient evaluations for solving large 0-1 unconstrained quadratic optimization problems International Journal of Metaheuristics 1 1 2010 3 10
19. F. Glover, and J.K. Hao Fast 2-flip move evaluations for binary unconstrained quadratic optimization problems International Journal of Metaheuristics 1 2 2010 100 107
20. F. Glover, Z. Lü, and J.K. Hao Diversification-driven tabu search for unconstrained binary quadratic problems 4OR: A Quarterly Journal of Operations Research 2010 10.1007/s10288-009-0115-y
21. F. Harary On the notion of balanced of a signed graph Michigan Mathematical Journal 2 1953 143 146
22. C. Helmberg, and F. Rendl Solving quadratic (0, 1)-problem by semidefinite programs and cutting planes Mathematical Programming 82 1998 388 399
23. R. Horst, P.M. Pardalos, and N.V. Thoai Introduction to Global Optimization second ed. 2000 Kluwer Academic Publishers
24. K. Katayama, and H. Narihisa Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem European Journal of Operational Research 134 2001 103 119
25. K. Katayama, M. Tani, and H. Narihisa Solving large binary quadratic programming problems by an effective genetic local search algorithm Proceedings of the Genetic and Evolutionary Computation Conference (GECCO00) 2000 Morgan Kaufmann 643 650
26. G.A. Kochenberger, F. Glover, B. Alidaee, and C. Rego A unified modeling and solution framework for combinatorial optimization problems OR Spectrum 26 2004 237 250
27. G.A. Kochenberger, F. Glover, B. Alidaee, and C. Rego An unconstrained quadratic binary programming approach to the vertex coloring problem Annals of Operations Research 139 2005 229 241
28. J. Krarup, and A. Pruzan Computer aided layout design Mathematical Programming Study 9 1978 75 94
29. D.J. Laughunn Quadratic binary programming Operations Research 14 1970 454 461
30. M. Lewis, G.A. Kochenberger, and B. Alidaee A new modelling and solution approach for the set-partitioning problem Computers and Operations Research 35 3 2008 807 813
31. M. Lewis, B. Alidaee, F. Glover, and G.A. Kochenberger A note on xQx as a modelling and solution framework for the Linear Ordering Problem International Journal of Operational Research 5 2 2009 152 162
32. A. Lodi, K. Allemand, and T.M. Liebling An evolutionary heuristic for quadratic 0-1 programming European Journal of Operational Research 119 3 1999 662 670
33. Z. Lü, and J.K. Hao A memetic algorithm for graph coloring European Journal of Operational Research 203 1 2010 241 250
34. R.D. McBride, and J.S. Yormark An implicit enumeration algorithm for quadratic integer programming Management Science 26 1980 282 296
35. P. Merz, and B. Freisleben Genetic algorithms for binary quadratic programming Proceedings of the Genetic and Evolutionary Computation Conference (GECCO99) 1999 Morgan Kaufmann 417 424
36. P. Merz, and B. Freisleben Greedy and local search heuristics for unconstrained binary quadratic programming Journal of Heuristics 8 2002 197 213
37. P. Merz, and K. Katayama Memetic algorithms for the unconstrained binary quadratic programming problem BioSystems 78 2004 99 118
38. P. Moscato, On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms, Caltech Concurrent Computation Program, C3P Report 826, 1989.
39. P. Moscato Memetic Algorithms: A Short Introduction New Ideas in Optimization 1999 Mcgraw-Hill Ltd. Maidenhead, UK pp. 219-234
40. G. Palubeckis Multistart tabu search strategies for the unconstrained binary quadratic optimization problem Annals of Operations Research 131 2004 259 282
41. G. Palubeckis Iterated tabu search for the unconstrained binary quadratic optimization problem Informatica 17 2 2006 279 296
42. P. Pardalos, and G.P. Rodgers Computational aspects of a branch and bound algorithm for quadratic zero-one programming Computing 45 1990 131 144
43. M.G.C. Resende, C. Ribeiro, F. Glover, R. Marti, Scatter search and path-relinking: Fundamentals, advances and applications, in: M. Gendreau, J.-Y. Potvin (Eds.), Handbook of Metaheuristics, Second ed., Springer, 2010.
44. G. Syswerda, Uniform crossover in genetic algorithms, in: Proceedings of the 3rd International Conference on Genetic Algorithms, 1989, pp. 2-9.
45. C. Witsgall, Mathematical Methods of Site Selection for Electronic System (ems), NBS Internal Report, 1975.