| 摘要 |
A system and method according to which data associated with a plurality of trade requests is received, and an optimization network is generated, the optimization network including a plurality of nodes corresponding to the trade requests. The nodes are ranked in accordance with at least one business objective, and one or more of the requests are fulfilled in an order based on the ranking of the nodes. To fulfill the one or more requests, a solution is generated, the solution complying with one or more predetermined rules. In an exemplary embodiment, each of the trade requests corresponds to a request to trade a work assignment. In an exemplary embodiment, each trade request is a request by an airline crew member to trade an airline flight sequence, and the at least one business objective is based on airline crew member seniority. |
| 主权项 |
1. A method, comprising:
receiving, using a computing device, data associated with a plurality of trade requests, with each trade request in the plurality of trade requests being a request by a user; generating, using the computing device, an optimization network using the data, the optimization network comprising a plurality of nodes, each of the nodes corresponding to at least one trade request; ranking, using the computing device, the nodes in accordance with at least one business objective that is based on user seniority; simultaneously fulfilling, using the computing device, one or more of the trade requests in an order based on the ranking of the nodes by generating a solution using the optimization network and the at least one business objective, the solution complying with one or more predetermined rules; and outputting the solution so that:
one or more trade requests that have been fulfilled are indicated;one or more trade requests that have not been fulfilled are indicated; andone or more reasons associated with the one or more trade requests that have not been fulfilled, respectively, are indicated; wherein the optimization network further comprises a plurality of directional arcs, each of the directional arcs extending between two nodes in the plurality of nodes and representing a supply-to-demand relationship between the two nodes; wherein the ranking of the nodes results in a highest ranked node; wherein generating the solution comprises:
solving an optimization model for the highest ranked node;determining whether a cycle that includes the highest ranked node exists, the cycle including at least two directional arcs in the plurality of directional arcs, with one directional arc of the at least two directional arcs pointing to the highest ranked node and another directional arc of the at least two directional arcs pointing away from the highest ranked node;if a cycle including the highest ranked node exists, then:
determining whether the at least two directional arcs comply with the one or more predetermined rules;if the at least two directional arcs comply with the one or more predetermined rules, then adding a fulfillment constraint; andif the at least two directional arcs do not comply with the one or more predetermined rules, then adding a legality constraint to guarantee compliance with the one or more predetermined rules;andif a cycle including the highest ranked node does not exist, then denying the trade request associated with the highest ranked node and solving the optimization model for another node; wherein:
determining whether the at least two directional arcs comply with the one or more predetermined rules only after determining whether a cycle that includes the highest rank node exists;adding a fulfillment constraint only if the at least two directional arcs comply with the one or more predetermined rules; andadding a legality constraint only if the at least two directional arcs do not comply with the one or more predetermined rules;results in fewer legality checks, fewer unnecessary constraints, and minimum computation time thereby improving the function of the computing device; wherein each trade request in the plurality of trade requests comprises at least one of the following:
a request to add a first assignment;a request to drop a second assignment; anda request to drop a third assignment in exchange for adding a fourth assignment; wherein the first, second, third and fourth assignments correspond to respective airline flight sequences, each airline flight sequence comprising at least one airline flight; wherein each user is an airline crew member; wherein user seniority is airline crew member seniority; wherein the highest ranked node corresponds to a trade request by a first airline crew member; and wherein the another node corresponds to a trade request by either the first airline crew member or a second airline crew member. |
