YURI (Rid‟ in Comfort) Tours and Travel is a system that gives you the facility of booking any type of Tours and Travels. This system is made so that customer will not have to come to us to Book his or her Tours. The project „YURI (Rid‟ in Comfort) Tours and Travel‟ is developed to replace the currently existing system, which helps in keeping records of the customer details of destination as well as payment received. In the current era where “time” proves to be the most important asset for an individual. By replacing the current registration system to fully computerize, it not only saves the precious asset that is time, but also accuracy, reliability and uniformity can be maintained. This project is useful for the manager of the company as it helps them to search the data faster than the existing system, to get a customer record easily and report of the customer, payment etc. are generated as per requirement. Our system has bonded with hotels and also with cab services. The customer can select the hotel and cab service according to his need and plan his or her travel.
Integrated banking, Multi banking, Web Services.
 Makino K, Uno T. New Algorithms for Enumerating All Maximal Cliques[ C]. Algorithm Theory Swat 2004, Lecture Notes in Computer Science. Heidelberg, Germany: Springer, 2004, 260-272.
 Applegate D, Bixby R, Chital V, Cook A. The Travelling Salesman Problem: A Computation Study[M]. Princeton, New Jersey, USA: Princeton University Press, 2006.
 TabbD L, ThompsonM R, Khalsa-Moyers G. et. a.l MS2Grouper: Group Assessment and Synthet is Replacement of Duplicate Proteomic Tandem Mass Spectra [J]. Journal of Mass Spectrometry, 2005, 16: 1250- 1261.
 Chiba. N and Nishizeki T. Arboricity and Subgraph Listing Algorithms [J]. SIAM J. Comput. , 1985, 14: 210-223.
 Johnson D.S, Yankak is Mand Papadimitriou CH. On Generating All Maximal Independent Sets [ J]. Info. Proceeding Letter, 1998, 27:119- 123.
 Dijkstra E. A Note on Two Problems in Connexion with Graphs [ J]. NumerischeMathematik, 1959, 1: 267-271.
 Fredman M.L and Tarjan RE. Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms [J]. Journal of the Association for Computing Machinery, 1987, 34( 3): 596-615.
 K. Hasegawa, Q. Ma, M. Yoshikawa, “Trip Tweets Search by Considering Spatio-temporal Continuity of User Behavior,” Proc. of DEXA 2012, pp.141–155, 2012.
 K. Tamura, H. Kasahara, M. Mukunoki, M. Minoh, “Modeling tourist activity for tourism spot recommendation consideringvarious factors,” Proc. of 77th National Convention of IPSJ, pp.1-597–1-598, 2015.
 Z. Gou, S. Tsugawa, A. Korkaew, S. Yamaguchi, T. Khamket, B. Manaskasemsak, A. Rungsawang, “An Interest-based Tour Planning Tool by Process Mining From Twitter,” Proc. of IEEE GCCE 2016, pp.636– 639, 2016.
 W.M.P. van der Aalst et al. “Process Mining Manifesto,” Lecture Notes in Business Information Processing, vol.99.pp.169– 194, 2012.
 W.M.P. van der Aalst, Process Mining: Discovery, Conformance and Enhancement of Business Processes, pp.163–169, Springer Verlag, Berlin, 2012.