Searching Museum Routes using CBR ⋆ Jesús Aguirre Pemán, Belén Díaz-Agudo, and Guillermo Jimenez-Diaz Department of Software Engineering and Artificial Intelligence Universidad Complutense de Madrid, Spain email: belend@ucm.es, gjimenez@ucm.es Abstract. In this paper, we describe a CBR solution to the route plan- ning problem for groups of people. We have compared keyword coverage results for our CBR approach and heuristic search algorithms. User pref- erences are important for individual visits but when dealing with group visits there are other aspects to consider. In our case study a group of people plans a visit to MIGS 1 , a museum about computer science history located at the Computer Science Faculty of Complutense University in Madrid. CBR results are promising and we discuss the benefits of the ex- perience in the case base when planning a group visit. CBR has become specially appropriate given that it assists the knowledge discovery task when learning about subtle differences affecting the suitability of group plans over individual plans computed by traditional search algorithms. 1 Introduction When planning a route visit, either in a museum, a city or a mall, user prefer- ences are important and typically, the resulting route should aim to satisfy user preferences. Different users may weigh their preferences differently. The problem is different when considering an individual visit or a group visit. Group prefer- ences are modelled as an aggregation (e.g. weighted average) of the individual preferences of the group members [11]. Besides, when dealing with groups there are other aspects to consider, like the number of people, physical features if there are space restrictions, average age, etc. In this paper, we describe a CBR system to help in planning a route for a group of people. In our case study a group of people plans a visit to MIGS (Museo de Informática, Garcia Santesmases 2 ), a museum about computer science history located at the Computer Science Faculty of Complutense University in Madrid. We characterize the museum map as an undirected graph where nodes sym- bolize Points Of Interest (POIs) tagged with keywords or labels that represent description features, and the edges symbolize transitions between the museum POIs. Besides, there are time labels, both in nodes and edges, representing the ⋆ Supported by UCM (Group 910494) and Spanish Committee of Economy and Com- petitiveness (TIN2014-55006-R). 1 Museo de Informática, Garcia Santesmases http://www.fdi.ucm.es/migs/ 2 Professor Jose Garcia Santesmases built the first computer in Spain, between 1953 y 1954