Software Specification Assignment 1 Travel planner Merijn Bellekom Vassilis Boucharas Ard Bahlman Martijn Nijenhof

Introduction InputInput RestrictionsRestrictions Problem descriptionProblem description QuestionsQuestions

Input User input consists solely ofUser input consists solely of –Departure location A –Destination location B –Arrival time T T is the latest time the user wants to arrive at BT is the latest time the user wants to arrive at B Database inputDatabase input –Hop schemes

Restrictions Standard user input validationStandard user input validation –A != B –Arrival time must be in the future –A and B must exist Timestamps should be unambiguousTimestamps should be unambiguous –Time zones, spanning multiple days, DST No double hops or looping routesNo double hops or looping routes –Unique hops within travel plan In case of multiple optimal routes, pick firstIn case of multiple optimal routes, pick first Avoid excessive lag between user input and system outputAvoid excessive lag between user input and system output

Problem description T = arrival time as user inputT = arrival time as user input Hop = (departure location, arrival location, departure time, arrival time) ‏Hop = (departure location, arrival location, departure time, arrival time) ‏ Travel plan = list of hops. for which it holds that:Travel plan = list of hops. for which it holds that: –If there is more than one hop: every non-first hop’s departure location = previous hop’s arrival location and is connected to the next hop in the listevery non-first hop’s departure location = previous hop’s arrival location and is connected to the next hop in the list every non-first hop’s departure time = previous hop’s arrival time and is connected to the next hop in the list (instantaneous) ‏every non-first hop’s departure time = previous hop’s arrival time and is connected to the next hop in the list (instantaneous) ‏ A location might at most occur twice in the travel plan and if it does, it should be one time a departure location and the other time a arrival location. (no looping) ‏A location might at most occur twice in the travel plan and if it does, it should be one time a departure location and the other time a arrival location. (no looping) ‏ Feasible Travel Plan = Travel plan for which arrival time of the last hop is before or on time T.Feasible Travel Plan = Travel plan for which arrival time of the last hop is before or on time T. Optimal Travel Plan = Feasible Travel Plan that has the shortest total travel time and the latest arrival time.Optimal Travel Plan = Feasible Travel Plan that has the shortest total travel time and the latest arrival time. Output = List of Feasible Travel Plans ordered ascending by total travel time and secondly on latest arrival time descending.Output = List of Feasible Travel Plans ordered ascending by total travel time and secondly on latest arrival time descending.

Questions