1. ? ? RavKav Web application supplying an easy way for retrieving information about public transportation in Israel. הרצלייה,רכבת רכבת ת"א, רכבת מרכז RavKav was built using the most up to date development tools: ASP.NET technology, C# based system core, Microsoft.NET based graphic module and SQL Server database. Luba Rashkovsky 369מטרופולין Ilana Koreh AllaGraife ב"ש, ת"מ Architecture Internet Our Crawler collects data from public transport companies web sites and builds RavKav’s DB THE TEAM Academic Supervisors: Dr. Elovici YuvalMr. Rozenberg BorisIndustry Supervisor:Yaron Lapidot – Leocord.NetAdministrative Staff:Yehudit, Lior, Hila Paths assembling algorithm The algorithm developed for RavKav system is a hybrid of 2 well known algorithms: “Dijkstra” for shortest-path finding, “DFS” for a tree scanning and “Δ near-optimal-paths” for an inappropriate paths pruning. The hybrid algorithm was developed with domain-specific assumptions in mind, which makes the k-shortest-paths problem solvable in reasonable time. Generated in 3 sec (avg) Generated in 3 sec (avg) Generated in 10 sec (avg), max 30 sec Ben-Gurion University, Project in Software Engineering RavKav allows getting all information about public transport in one web site. By entering RavKav's site the user can get information about bus/train lines, information about lines going through stations, information about traveling paths containing lines from different companies which were built according user's preferences (time, price, etc') and many other general information about public transport. In Israel there are more than 10 public transport companies. Each company has web site for providing information about it's lines. This situation forces the user to enter many sites to get information about different lines (and all this after figuring out the company responsible on specific line). In addition, there is no way to get traveling path containing lines from different companies.