Abstract
Metaheuristics - general search procedures whose principles allow them to escape the trap of local optimality using heuristic designs-have been successfully employed to address a variety of important optimization problems over the past few years. Particular gains have been achieved in obtaining high quality solutions to problems that classical exact methods (which guarantee convergence) have found too complex to handle effectively. Typically a metaheuristic method is crafted to suit the particular characteristics of the problem at hand, exploiting to the extent possible the structure available to enable a fruitful and efficient search process. An alternative to this problem specific solution approach is a more general methodology that recasts a given problem into a common modeling format, permitting solutions to be derived by a common, rather than tailor-made, heuristic method.
The optimization folklore strongly emphasizes the unproductive consequences of converting problems from a specific class to a more general representation, since the “domain-specific structure” of the original setting then becomes invisible and can not be exploited by a method for the more general problem representation. Nevertheless, there is a strong motivation to attempt such a conversion in many applications to avoid the necessity to develop a new method for each new class. We demonstrate the existence of a general problem representation that frequently overcomes the limitation commonly ascribed to such models. Contrary to expectation, when a specially structured problem is translated into this general form, it often does not become much harder to solve, and sometimes becomes even easier to solve provided the right type of solution approach is applied. The model with this appealing property is the Quadratic Unconstrained Integer Programming (QUIP) problem in binary variables, accompanied by the device of introducing quadratic infeasibility penalty functions to handle constraints. Not only is the model capable of representing a wide range of “special case” problem classes, but it can be advantageously exploited by adaptive memory (tabu search) metaheuristics and associated evolutionary (scatter search) methods. Computational outcomes disclose the effectiveness of this combined modeling and solution approach for problems from a diverse collection of challenging settings.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alidaee, B., Kochenberger, G., and Ahmadian, A. (1994). 0–1 quadratic programming approach for the optimal solution of two scheduling problems. International Journal of Systems Science, 25:1–408.
Alkhamis, T. M., Hasan, M., and Ahmed, M. A. (1998). Simulated annealing for the unconstrained binary quadratic pseudo-boolean function. European Journal of Operational Research, 108:641–652.
Amini, M., Alidaee, B., and Kochenberger, G. (1999). A scatter search approach to unconstrained quadratic binary programs. In Come, Dorigo, and Glover, F., editors, To appear in New Methods in Optimization. McGraw-Hill Publishers.
Beasley, J. E. (1999). Heuristic algorithms for the unconstrained binary quadratic programming problem. Working Paper, Imperial College.
Boros, E., Hammer, P., and Sun, X. (1989). The ddt method for quadratic 0–1 minimization. Technical Report RRR 39-89, RUTCOR Research Center.
Chardaire, P. and Sutter, A. (1994). A decomposition method for quadratic zero-one programming. Management Science, 4:704–712.
Gallo, G., Hammer, P., and Simeone, B. (1980). Quadratic knapsack problems. Mathematical Programming, 12:132–149.
Glover, F., Amini, M., Kochenberger, G., and Alidaee, B. (1999a). A new evolutionary metaheuristic for the unconstrained binary quadratic programming: A case study of the scatter search. Technical report, School of Business, University of Colorado, Boulder.
Glover, F., Kochenberger, G., and Alidaee, B. (1998). Adaptive memory tabu search for binary quadratic programs. Management Science, 44:336–345.
Glover, F., Kochenberger, G., Alidaee, B., and Amini, M. (1999b). Unconstrained quadratic binary program approach to quadratic knapsack problems. Working Paper, Hearin Center for Enterprise Science, University of Mississippi.
Glover, F., Kochenberger, G., Alidaee, B., and Amini, M. (1999c). Tabu with search critical event memory: An enhanced application for binary quadratic programs. In Voss, S., Martello, S., Osman, I., and Roucairol, C., editors, Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publisher, Boston.
Hammer, P. and Rudeanu, S. (1968). Boolean Methods in Operations Research. Springer-Verlag, New York.
Hansen, P. (1979). Methods of nonlinear 0–1 programming. Annals Discrete Math, 5:53–70.
Harary, F. (1953/54). On the notion of balanced of a signed graph. Michigan Mathematical Journal, 2:143–146.
Katayama, K., Tani, M., and Narihisa, H. (2000). Solving large binary quadratic programming problems by an effective genetic local search algorithm. In Proceedings of the 2002 Genetic and Evolutionary Computation Conference, San Francisco, CA. Morgan Kaufmann.
Kochenberger, G., Glover, F., Alidaee, B., and Rego, C. (1998). Applications of the unconstrained quadratic binary program. Working Paper, University of Colorado.
Krarup, J. and Pruzan, A. (1978). Computer aided layout design. Mathematical Programming Study, 9:75–94.
Laughunn, D. J. (1970). Quadratic binary programming. Operations Research, 14:454–461.
Lodi, A., Allemand, K., and Liebling, T. M. (1997). An evolutionary heuristic for quadratic 0–1 programming. Technical Report OR-97-12, D.E.I.S., University of Bologna.
McBride, R. D. and Yormack, J. S. (1980). An implicit enumeration algorithm for quadratic integer programming. Management Science, 26:282–296.
Merz, P. and Freisleben, B. (1999). Genetic algorithms for binary quadratic programming. In Proceedings of the 1999 International Genetic and Evolutionary Computation Conference (GECCO’ 99), pages 417–424. Morgan Kaufmann.
Pardalos, F. and Xue, J. (1994). The maximum clique problem. The Journal of Global Optimization, 4:301–328.
Pardalos, P. and Rodgers, G. P. (1990). Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing, 45:131–144.
Pardalos, P. and Rodgers, G. P. (1992). A branch and bound algorithm for maximum clique problem. Computer & OR, 19:363–375.
Phillips, A. T. and Rosen, J. B. (1994). A quadratic assignment formulation of the molecular conformation problem. The Journal of Global Optimization, 4:229–241.
Williams, A. C. (1985). Quadratic 0–1 programming using the roof duality with computational results. Technical Report Rutcor Research Report 8–85, Rutgers University, New Brunswick, NJ.
Witsgall, C. (1975). Mathematical methods of site selection for electronic system (ems). NBS Internal Report.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Kochenberger, G.A., Glover, F., Alidaee, B., Rego, C. (2004). Solving Combinatorial Optimization Problems Via Reformulation and Adaptive Memory Metaheuristics. In: Menon, A. (eds) Frontiers of Evolutionary Computation. Genetic Algorithms and Evolutionary Computation, vol 11. Springer, Boston, MA. https://doi.org/10.1007/1-4020-7782-3_5
Download citation
DOI: https://doi.org/10.1007/1-4020-7782-3_5
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4020-7524-7
Online ISBN: 978-1-4020-7782-1
eBook Packages: Springer Book Archive