Manuel López-Ibáñez
Franco Mascia
ABSTRACT
Single-solution metaheuristics are among the earliest and most successful metaheuristics, with many variants appearing in the literature. Even among the most popular variants, there is a large degree of overlap in terms of actual behavior. Moreover, in the case of hybrids of different metaheuristics, traditional names do not actually reflect how the hybrids are composed. In this paper, we discuss a template for single-solution hybrid metaheuristics. Our template builds upon the Paradiseo-MO framework, but restricts itself to a pre-defined structure based on iterated local search (ILS). The flexibility is given by generalizing the components of ILS (perturbation, local search and acceptance criterion) in order to incorporate components from other metaheuristics. We give precise definitions of these components within the context of our proposed template. The template proposed is flexible enough to reproduce many classical single-solution metaheuristics and hybrids thereof, while at the same time being sufficiently concrete to generate code from a grammar description in order to support automatic design of algorithms. We give examples of three IG-VNS hybrids that can be instantiated from the proposed template.
- H.-G. Beyer and H.-P. Schwefel. Evolution stratagies: a comprehensive introduction. Natural Computing, 1: 3--52, 2002. Google Scholar
Digital Library
- P. Hansen and N. Mladenovic. Variable neighborhood search: Principles and applications. European Journal of Operational Research, 130 (3): 449--467, 2001.Google ScholarCross Ref
- H. H. Hoos and T. Stützle. Stochastic Local Search - Foundations and Applications. Morgan Kaufmann Publishers, San Francisco, CA, 2005. Google ScholarDigital Library
- J. Humeau, A. Liefooghe, E.-G. Talbi, and S. Verel. ParadisEO-MO: From fitness landscape analysis to efficient local search algorithms. Journal of Heuristics, 19 (6): 881--915, June 2013. Google ScholarDigital Library
- M. S. Hussin and T. Stützle. Hierarchical iterated local search for the quadratic assignment problem. In M. J. Blesa et al., editors, Hybrid Metaheuristics, volume 5818 of LNCS, pages 115--129. Springer, 2009. Google ScholarDigital Library
- S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220: 671--680, 1983.Google ScholarCross Ref
- H. R. Lourenço, O. Martin, and T. Stützle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, pages 321--353. Kluwer Academic Publishers, Norwell, MA, 2002.Google Scholar
- M.-E. Marmion, F. Mascia, M. López-Ibáñez, and T. Stützle. Automatic design of hybrid stochastic local search algorithms. In M. J. Blesa et al., editors, Hybrid Metaheuristics, volume 7919 of LNCS, pages 144--158. Springer, 2013.Google ScholarCross Ref
- D. Pisinger and S. Ropke. Large neighborhood search. In M. Gendreau and J.-Y. Potvin, editors, Handbook of Metaheuristics, volume 146 of International Series in Operations Research & Management Science, pages 399--419. Springer, New York, NY, 2 edition, 2010.Google ScholarCross Ref
- R. Ruiz and T. Stützle. A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem. European Journal of Operational Research, 177 (3): 2033--2049, 2007.Google ScholarCross Ref
- G. Schrimpf, J. Schneider, H. Stamm-Wilbrandt, and G. Dueck. Record breaking optimization results using the ruin and recreate principle. Journal of Computational Physics, 159 (2): 139--171, 2000. Google ScholarDigital Library
- J. Swan, E. Özcan, and G. Kendall. Hyperion - a recursive hyper-heuristic framework. In C. A. Coello Coello, editor, Learning and Intelligent Optimization, 5th International Conference, LION 5, volume 6683 of LNCS, pages 616--630. Springer, 2011. Google ScholarDigital Library
- J. Swan, J. Woodward, E. Özcan, G. Kendall, and E. Burke. Searching the hyper-heuristic design space. Cognitive Computation, 6 (1): 66--73, Mar. 2014.Google ScholarCross Ref
- R. J. M. Vaessens, E. H. L. Aarts, and J. K. Lenstra. A local search template. Computers & Operations Research, 25 (11): 969--979, 1998. Google ScholarDigital Library
Index Terms
- A template for designing single-solution hybrid metaheuristics
Recommendations
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
The set multicovering or set k-covering problem is an extension of the classical set covering problem, in which each object is required to be covered at least k times. The problem finds applications in the design of communication networks and in ...
Hybrid GRASP Heuristics to Solve an Unrelated Parallel Machine Scheduling Problem with Earliness and Tardiness Penalties
This paper considers an unrelated parallel machine scheduling problem with the objective of minimizing the total earliness and tardiness penalties. Machine and job-sequence dependent setup times and idle times are considered. Since the studied problem ...
Multiple local searches to balance intensification and diversification in a memetic algorithm for the linear ordering problem
HAIS'11: Proceedings of the 6th international conference on Hybrid artificial intelligent systems - Volume Part IIThe Linear Ordering problem (LOP) is an NP-hard problem, which has been solved using different metaheuristic approaches. The best solution for this problem is a memetic algorithm, which uses the traditional approach of hybridizing a genetic algorithm ...
Comments