发明名称 System and method for accommodating disrupted travelers so that respective optimized itineraries for the disrupted travelers are identified simultaneously and a result comprising a simultaneous assignment of the respective optimized alternative itineraries is returned to a JMS out queue and outputted in XML format
摘要 A system and method for accommodating disrupted travelers utilizing scoring and optimization techniques.
申请公布号 US9639842(B1) 申请公布日期 2017.05.02
申请号 US201414487732 申请日期 2014.09.16
申请人 AMERICAN AIRLINES, INC. 发明人 Green Tuell Coleman;Ande Murali;Leist Steven D.;Diamond James Tullos
分类号 G06Q30/00;G06Q10/02 主分类号 G06Q30/00
代理机构 Haynes and Boone, LLP 代理人 Haynes and Boone, LLP
主权项 1. An apparatus for automatically, and simultaneously, assigning respective optimized alternative itineraries to a plurality of airline passenger name records associated with an airline, each of the airline passenger name records having a quantity of airline travelers and an original itinerary, the original itinerary having an initial origin, an initial departure time from the initial origin, a final destination, and a final arrival time to the final destination, the apparatus comprising: a computer travel reservation system; one or more servers, the one or more servers comprising: at least one processor; and a non-transitory computer readable medium having stored thereon a plurality of instructions executable with the at least one processor, wherein the one or more servers are adapted to access, from the computer travel reservation system, data associated with the airline passenger name records; a gateway through which the one or more servers are adapted to access from the computer travel reservation system the data associated with the airline passenger name records; and a database accessible by the one or more servers; wherein the plurality of instructions are executed with the at least one processor so that the following steps are executed: accessing, from the computer travel reservation system and through the gateway, the data associated with the airline passenger name records; parsing the data associated with the airline passenger name records to extract relevant travel information; storing the relevant travel information in the database; generating, using the relevant travel information, one or more candidate alternative itineraries for each of the airline passenger name records in the plurality of airline passenger name records, wherein generating the one or more candidate alternative itineraries for each of the airline passenger name records comprises: accessing, using Java Database Connectivity (JDBC) technology, the relevant travel information stored in the database, andrequesting, from the computer travel reservation system through the gateway, the one or more candidate alternative itineraries for each of the airline passenger name records, classifying each of the airline travelers in each of the passenger name records into groups belonging to a first class of groups, wherein the first class of groups is one of the following:a frequent flyer level class of groups, the criteria for which is based on the frequency with which the airline traveler uses the airline;a historical profitability class of groups, the criteria for which is based on the profitability of the airline traveler's use of the airline;a fare class of groups, the criteria for which is based on an amount that the airline traveler paid for a ticket; anda cabin class of groups, the criteria for which is based on the cabin in which the airline traveler travels;wherein classifying each of the airline travelers in each of the passenger name records into the groups belonging to the first class of groups generates at least: a first subset of candidate alternative itineraries for airline passenger name records having airline travelers classified into a first group in the first class of groups; anda second subset of candidate alternative itineraries for airline passenger name records having airline travelers classified into a second group in the first class of groups;wherein the first group in the first class of groups is prioritized over the second group in the first class of groups; classifying each of the airline travelers in each of the passenger name records into groups belonging to a second class of groups, wherein the second class is another of the frequent flyer class, the historical profitability class, the fare class, and the cabin class;wherein classifying each of the airline travelers in each of the passenger name records into at least first and second classes generates at least: a third subset of candidate alternative itineraries for airline passenger name records having airline travelers classified in a first group in the second class of groups; anda fourth subset of candidate alternative itineraries for airline passenger name records having airline travelers classified in a second group in the second class of groups;wherein the first group in the second class of groups is prioritized over the second group in the second class of groups; solving, for the first class of groups, a mixed integer program to generate a first set of feasible solutions having respective objective function values and determine, from the first set of feasible solutions, the feasible solution having the minimum objective function value; wherein each of the feasible solutions in the first set of feasible solutions is a set of respective assignments drawn from at least one of the first and second subsets of candidate alternative itineraries for airline passenger name records having airline travelers classified in the first class; solving, for the second class of groups, the mixed integer program to generate a second set of feasible solutions having respective objective function values and determine, from the second set of feasible solutions, the feasible solution having the minimum objective function value; wherein each of the feasible solutions in the second set of feasible solutions is a set of respective assignments drawn from at least one of the third and fourth subsets of candidate alternative itineraries for airline passenger name records having airline travelers classified in the second class; assigning the respective optimized alternative itineraries to the plurality of airline passenger name records associated with the airline; wherein the respective optimized alternative itineraries assigned to the plurality of airline passenger name records associated with the airline are at least partially based on the respective priorities of the first and second groups in the first class of groups and/or the respective priorities of the first and second groups in the second class of groups and thus are: assignments of candidate alternative itineraries to airline passenger name records having airline travelers classified in at least the first class of groups and thus comprising the feasible solution having the minimum objective function value from the first set of feasible solutions;assignments of candidate alternative itineraries to airline passenger name records having airline travelers classified in at least the second class of groups and thus comprising the feasible solution having the minimum objective function value from the second set of feasible solutions; orassignments of candidate alternative itineraries to airline passenger name records having airline travelers classified in at least the first and second classes of groups and thus comprising a combination of the feasible solution having the minimum objective function value from the first set of feasible solutions and the feasible solution having the minimum objective function value from the second set of feasible solutions; returning a result to a Java Message Service (JMS) out queue, the result comprising the simultaneous assignment of the respective optimized alternative itineraries to the plurality of airline passenger name records; and outputting the result in XML format, wherein outputting the result in XML format comprises sending or more messages from the JMS out queue to a WebService.
地址 Fort Worth TX US