Abstract
Most of the adaptive metaheuristics face the resolution of an instance from scratch, without considering previous runs. Basing on the idea that the computa- tional effort done and knowledge gained when solving an instance should be use to solve similar ones, we present a new metaheuristic strategy that permits the simul- taneous solution of a group of instances. The strategy is based on a set of adaptive operators that works on several sets of solutions belonging to different problem in- stances. The method has been tested on MAX-SAT with sets of various instances obtaining promising results.
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.
References
J. Crawford and L. Auton. Experimental results on the crossover pint in random 3sat. Artificial Intelligence, 81(1–2):31–57, 1996.
M. Garey and D. Johnson. Computers and Intractability: a Guide to the Theory of NP-completeness. W. H. Freeman, 1979.
W. Hart, N. Krasnogor, and J. Smith, editors. Recent Advances in Memetic Algorithms. Studies in Fuzziness and Soft Computing. Physica-Verlag, 2004.
H. Hoos and T. Stutzle. Local search algorithms for sat: An empirical evaluation. Journal of Automated Reasoning, 24:421–481, 2000.
H. Hoos and T. Stutzle. Satlib: An online resource for research on sat. In H. van Maaren I. P. Gent and T. Walsh, editors, SAT2000, pages 283–292. IOS Press, 2000.
J. Mateo and L. de la Ossa. Lio: Tool for metaheuristics. http://www.info-ab.uclm.es/simd/SOFTWARE/LIO/, 2006.
Y.-S. Ong, M.-H. Lim, N. Zhu, and K.-W. Wong. Classification of adaptive memetic algorithms:a comparative study. IEEE transactions on systems, man, and cyberneticsart b: cybernetics, 36(1), 2006.
D. Pelta, A. Blanco, and J. Verdegay. A fuzzy valuation-based local search framework for combinatorial optimization problems. Journal of Fuzzy Optimization and Decision Making, 1(2):177–193, 2002.
D. Pelta and N. Krasnogor. Multimeme algorithms using fuzzy logic based memes for protein structure prediction. In W. Hart, N. Krasnogor, and J. Smith, editors, Recent Advances in Memetic Algorithms, Studies in Fuzziness and Soft Computing. Physica-Verlag, 2004.
B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pages 337 – 343. MIT Press, 1994.
J. Smith. Coevolving memetic algorithms: A review and progress report. IEEE Transactions On Systems, Man, And Cyberneticsart B: Cybernetics, 37(1), 2007.
J. Smith. Credit assignment in adaptive memetic algorithms. In Proceedings of GECCO 2007, 2007.
M. Yokoo. Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of csps. Lecture Notes In Computer Sciences, 1330:357–370, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Masegosa, A.D., Royo, A.S., Pelta, D. (2008). An Adaptive Metaheuristic for the Simultaneous Resolution of a Set of Instances. In: Krasnogor, N., Nicosia, G., Pavone, M., Pelta, D. (eds) Nature Inspired Cooperative Strategies for Optimization (NICSO 2007). Studies in Computational Intelligence, vol 129. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-78987-1_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-78987-1_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-78986-4
Online ISBN: 978-3-540-78987-1
eBook Packages: EngineeringEngineering (R0)