Planning Studies, Context-aware Service-based Tours

With the rapid development of communication technologies and ubiquitous computing technologies, it is possible to capture the context information of user as well as his/her environment. Context-aware service has been a key enabler for providing users with customized services in mobile commerce. In recent years, researchers at home and abroad have done a lot of researches on context information definition, retrieval and it is used to improve the services. Meanwhile, Tourism as information intensity industry, how to use the nature of travelling for its service providers to make high value-added service is one of hot research topics. However the combination with context aware service and the tour information system's research actually was still at the early stage, and mainly limits to concept elaboration, service framework discussion, prototype system development and so on. This paper try to enrich the previous context aware service research framework, and using mathematics modeling and finding the solution, aims to develop new methodology to solve the trip planning problem.This dissertation summarizes the previous researches on context aware service so as to establish the research foundation, and then it put forwarding the research question:context aware service based tour planning problem, a problem with significant theoretical and practical value. The question modeling takes the classical question—Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) as foundation, and for the first time, proposed that to use the Resource Constrain Project Scheduling Problem (RCPSP) with some modification to establish mathematical model. And then, branch and bound algorithm is selected due to nature of our problem, and in the last part of paper, series of simulation experiments are conducted to validate the mathematical model.