پروژه دانشجويي پرولوگ

---

شرح پروژه

قسمت الف 2a. Trip planner in London, minimize number of stations Find a map of the London underground (the "Tube") and model it using facts. One way to model could be line(lineName, stationList). Your database should start with information on who wants to go where. Example: passenger_wants(john, kings_cross, picadilly_circus). /* john wants to go from kings_cross to picadilly */ passenger_wants(mary, oxford, wood_green). /* mary wants to go from oxford to wood_green */ For each person who wants to travel, generate a travel plan that minimizes the number of stations passed through. (including the starting station and the ending station). When your program stops execution, the database should contain facts of the form plan(john, [(kings_cross, line_1), (station2, line_1), (station3, line_1), (station3, line_2), (station4, line_2), (picadilly_circus, line_2)]. number_of_satations(john, 5). how_many_transfers(john, 1). meaning john starts on line_1 at kings_cross, passes through station2, changes lines in station 3, continues on line 2 through station_4, finally arriving at picadilly_circus (note that data has been made up!). Also how many stations john has been to, as well as how many times he has to change lines is given. قسمت ب 2b. Trip planner in London, minimize number of transfers Same as part a, except you should minimize number of transfers. ************************ * پروژه شماره 2 CMPE 532 Term Project 2 - Flight Planner To be done in groups of two. Pick your partner! Due date: 24 June, 2014, 16:00 When traveling from one city to the next via airplane, often there is no direct flight from the source to the destination, and passengers have to take connecting flights. Different people may have different priorities, such as minimizing the total price, number of transfers, total flight time, or total waiting time in transit. Your job is to write a program in Eclipse that takes from the user the source airport, destination airport, a day in which the flight should start (monday, tuesday etc.) as well as the criterion according to which optimization will take place (price, transfers, flight_time, waiting_time), and presents the user with the full flight plan according to his/her preferences. Assume that • at least one hour is needed between connecting flights (a constraint) • all times are in GMT, so that you do not need to perform time conversion Represent your facts in the following format: flight(flight_no, source_airport, destination_airport, departure_day_time, arrival_day_time_time, price) For example, here are two flights: flight( no('TK7385'), from(lefkosa(ercan)), to(ankara(esenboga)), departure( day(tuesday), hour(20), minute(30)), arrival(day(tuesday), hour(21), minute(45)), price(263))). flight( no('TK2183'), from(ankara(esenboga)), to(istanbul(ataturk)), departure( day(thursday)), hour(23), minute(30)), arrival(day(friday), hour(21), minute(45)), price(223))). For your data, use the Turkish airlines website http://www.turkishairlines.com/en-tr/ to obtain all flight information between Lefkosa, Ankara and Istanbul and Konya. Since the price information is constantly changing, just use whatever price the site gives you for a given date. Sample queries: ?- find_flight( from(lefkosa(ercan)), to(istanbul(ataturk)), day(monday), optimizing(price), Result). ?- find_flight( from(ankara(esenboga)), to(konya(konya)), day(thursday), optimizing(flight_time), Result). and • Allow connections between the Ataturk airport and Sabiha Gokcen airport in Istanbul. The minimum transfer time allowed in this case (i.e. a passenger arriving at Ataturk airport and transferring into a flight starting at Sabiha Gokcen airport, or vice versa) should be 3 hours, instead of 1 hour. ************


قابل تحویل:

مهارت ها و تخصص های مورد نیاز

---

---