Abstract
Heuristics for combinatorial optimization are often controlled by discrete and continuous parameters that define its behavior. The number of possible configurations of the heuristic can be large, resulting in a difficult analysis. Manual tuning can be time-consuming, and usually considers a very limited number of configurations. An alternative to manual tuning is automatic tuning. In this paper, we present a scheme for automatic tuning of GRASP with evolutionary path-relinking heuristics. The proposed scheme uses a biased random-key genetic algorithm (BRKGA) to determine good configurations. We illustrate the tuning procedure with experiments on three optimization problems: set covering, maximum cut, and node capacitated graph partitioning. For each problem we automatically tune a specific GRASP with evolutionary path-relinking heuristic to produce fast effective procedures.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Adenso-Diaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental designs and local search. Operations Research 54, 99–114 (2006)
Aiex, R., Pardalos, P., Resende, M., Toraldo, G.: GRASP with path-relinking for three-index assignment. INFORMS J. on Computing 17, 224–247 (2005)
Bean, J.: Genetic algorithms and random keys for sequencing and optimization. ORSA Journal on Computing 2, 154–160 (1994)
Beasley, J.: An algorithm for set covering problem. European Journal of Operational Research 31, 85–93 (1987)
Deng, Y., Bard, J.: A reactive GRASP with path relinking for capacitated clustering. J. of Heuristics 17, 119–152 (2011)
Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters 8, 67–71 (1989)
Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. of Global Optimization 6, 109–133 (1995)
Ferreira, C., Martin, A., de Souza, C., Weismantel, R., Wolsey, L.: The node capacitated graph partitioning problem: A computational study. Mathematical Programming 81, 229–256 (1998)
Festa, P., Gonçalves, J.F., Resende, M.G.C., Silva, R.M.A.: Automatic tuning of GRASP with path-relinking heuristics with a biased random-key genetic algorithm. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 338–349. Springer, Heidelberg (2010)
Festa, P., Pardalos, P., Resende, M., Ribeiro, C.: Randomized heuristics for the MAX-CUT problem. Optimization Methods and Software 7, 1033–1058 (2002)
Glover, F.: Tabu search and adaptive memory programming – Advances, applications and challenges. In: Barr, R., Helgason, R., Kennington, J. (eds.) Interfaces in Computer Science and Operations Research, pp. 1–75. Kluwer Academic Publishers (1996)
Gonçalves, J., Resende, M.: Biased random-key genetic algorithms for combinatorial optimization. J. of Heuristics 17, 487–525 (2011)
Helmberg, C., Rendl, F.: A spectral bundle method for semidefinite programming. SIAM Journal on Optimization 10, 673–696 (1997)
Hutter, F., Hoos, H., Stützle, T.: Automatic algorithm configuration based on local search. In: Proceedings of the Twenty-second Conference on Artificial Intelligence (AAAI 2007), pp. 1152–1157 (2007)
Johnson, D.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences 9, 256–278 (1974)
Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85–103. Plenum Press, NY (1972)
Laguna, M., Martí, R.: GRASP and path relinking for 2-layer straight line crossing minimization. INFORMS J. on Computing 11, 44–52 (1999)
Matsumoto, M., Nishimura, T.: Mersenne Twister: A 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Transactions on Modeling and Computer Simulation 8, 3–30 (1998)
Mehrotra, A., Trick, M.: Cliques and clustering: A combinatorial approach. Operations Research Letters 22, 1–12 (1997)
Morán-Mirabal, L., Gonzalez-Velarde, J., Resende, M.: Randomized heuristics for handover minimization in mobility networks. Technical report, AT&T Labs Research, Florham Park, New Jersey (August 2012)
Pedrola, O., Castro, A., Velasco, L., Ruiz, M., Fernández-Palacios, J.P., Careglio, D.: CAPEX study for a multilayer IP/MPLS-over-flexgrid optical network. J. of Optical Communications and Networking 4, 639–650 (2012)
Prais, M., Ribeiro, C.: Reactive GRASP: An application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J. on Computing 12, 164–176 (2000)
Resende, M., Werneck, R.: A hybrid heuristic for the p-median problem. J. of Heuristics 10, 59–88 (2004)
Spears, W., DeJong, K.: On the virtues of parameterized uniform crossover. In: Proceedings of the Fourth International Conference on Genetic Algorithms, pp. 230–236 (1991)
Toso, R., Resende, M.: A C++ application programming interface for biased random-key genetic algorithms. Technical report, AT&T Labs Research, Florham Park, NJ (2012)
University of Wisconsin: Condor high throughput computing (2012), http://research.cs.wisc.edu/condor (last visited on June 25, 2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Morán-Mirabal, L.F., González-Velarde, J.L., Resende, M.G.C. (2013). Automatic Tuning of GRASP with Evolutionary Path-Relinking. In: Blesa, M.J., Blum, C., Festa, P., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2013. Lecture Notes in Computer Science, vol 7919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38516-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-38516-2_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38515-5
Online ISBN: 978-3-642-38516-2
eBook Packages: Computer ScienceComputer Science (R0)