1 / 2

Algorithm

Algorithm. An instance of Constrained S hortest P ath (CSP) Inputs : source, destination, flight info., preferences Output : Minimum cost flight satisfying all preferences Common constraints : flow conservation, arrival precedes departure at an intermediate node etc.

gary
Download Presentation

Algorithm

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Algorithm An instance of Constrained Shortest Path (CSP) Inputs: source, destination, flight info., preferences Output: Minimum cost flight satisfying all preferences Common constraints: flow conservation, arrival precedes departure at an intermediate node etc. Preferences enforced using constraints e.g. total travel time, number of stops, airline(s), stopover city, departure/arrival time of day, departure day range etc. Any combination of preferences can be specified together e.g. stopover city together with departure day range

  2. Implementation • Implemented in AMPL • Edges: set ARCS within {nodes, nodes, flight_numbers, data_days}; • Variables: itinerary {ARCS} binary; • Objective: minimize opt_cost: sum { (i,j,k,l) in ARCS } itinerary[i,j,k,l]*cost[k,l]; • Constraints: about 20 generalized constraints AA327, 5/6/2013 . . . AA327 5/15/2013 SFO JFK

More Related