Local Search with P Systems: A Case Study

Abstract

Local search is currently one of the most used methods for finding solutions in real-life problems. It is usually considered when the research is interested in the final solution of the problem instead of the how the solution is reached. In this paper, the authors present an implementation of local search with Membrane Computing techniques applied to the N-queens problem as a case study. A CLIPS program inspired in the Membrane Computing design has been implemented and several experiments have been performed. The obtained results show better average times than those obtained with other Membrane Computing implementations that solve the N-queens problem. DOI: 10.4018/jncr.2011040104 48 International Journal of Natural Computing Research, 2(2), 47-55, April-June 2011 Copyright © 2011, IGI Global. Copying or distributing in print or electronic forms without written permission of IGI Global is prohibited. (2010), a first study on depth-first search in the framework of Membrane Computing was presented. In this paper we go further with the study of searching methods in Membrane Computing by exploring local search. We consider the N-queens problem as a case study and we present a family of P systems which solves it by implementing local search ideas. The paper is organized as follows: First we recall some basic definitions related to local search. Then, we recall the problem used as a case study: the N-queens problem, previously studied in the framework of Membrane Computing in Gutiérrez-Naranjo, Martínezdel-Amor, Pérez-Hurtado, and Pérez-Jiménez (2009). Next, we provide some guidelines of the implementation of local search in our case study and show some experimental results. The paper finishes with some final remarks.