Abstract
Classical cooperative parallel models for metaheuristics have one major issue when the underlying search method is based on the exploration of the neighborhood of one single solution, i.e., a trajectory-based metaheuristic. Whenever a cooperation step takes place by exchanging solutions, either the incoming or the local solution has to be discarded because the subalgorithm does only work with one single solutions. Therefore, important information may be lost. A recent new parallel model for trajectory-based metaheuristics has faced this issue by adding a crossover operator that is aimed at combining valuable information from both the incoming and the local solution. This work is targeted to further evaluate this parallel model by addressing two well-known, hard optimization problems (MAXSAT and RND) using Simulated Annealing as the search method in each subalgorithm. The results have shown that the new model is able to outperform the classical cooperative method under the experimental conditions used.
This work has been partially funded by the Spanish Ministry of Science and Innovation and FEDER under contract TIN2008-06491-C04-01 (the MSTAR project). It has also been partially funded by the Andalusian Government under contract P07-TIC-03044 (the DIRICOM project).
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
Alba, E. (ed.): Parallel Metaheuristics: A New Class of Algorithms. Wiley, Chichester (2005)
Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35(3), 268–308 (2003)
Calégari, P., Guidec, F., Kuonen, P., Kobler, D.: Parallel island-based genetic algorithm for radio network design. Journal of Parallel and Distributed Computing 47(1), 86–90 (1997)
Crainic, T.G., Toulouse, M.: Parallel Strategies for Metaheuristics. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. Kluwer, Dordrecht (2003)
Garey, M., Johnson, D. (eds.): Computers and Intractability. A guide to the Theory of NP-Completeness. Freeman (1979)
Jong, K.D., Potter, M., Spears, W.: Using problem generators to explore the effects of epistasis. In: 7th Int. Conf. on Genetic Algorithms (ICGA), pp. 338–345 (1997)
Kirkpatrick, S., Gellatt, C., Vecchi, M.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)
Luque, G., Luna, F., Alba, E.: A new parallel cooperative model for trajectory based metaheuristics. In: DCAI 2010. AISC, vol. 79, pp. 559–567 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Luque, G., Luna, F., Alba, E., Nesmachnow, S. (2012). Exploring the Accuracy of a Parallel Cooperative Model for Trajectory-Based Metaheuristics. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2011. EUROCAST 2011. Lecture Notes in Computer Science, vol 6927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27549-4_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-27549-4_41
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27548-7
Online ISBN: 978-3-642-27549-4
eBook Packages: Computer ScienceComputer Science (R0)