Exploring the Accuracy of a Parallel Cooperative Model for Trajectory-Based Metaheuristics
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.
KeywordsSimulated Annealing Crossover Operator Parallel Model Simulated Annealing Algorithm Conjunctive Normal Form
Unable to display preview. Download preview PDF.
- 4.Crainic, T.G., Toulouse, M.: Parallel Strategies for Metaheuristics. In: Glover, F.W., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. Kluwer, Dordrecht (2003)Google Scholar
- 5.Garey, M., Johnson, D. (eds.): Computers and Intractability. A guide to the Theory of NP-Completeness. Freeman (1979)Google Scholar
- 6.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)Google Scholar
- 8.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)Google Scholar