Techniques for behavioral pairing in a dispatch center system

Information

  • Patent Grant
  • 10970658
  • Patent Number
    10,970,658
  • Date Filed
    Wednesday, April 5, 2017
    7 years ago
  • Date Issued
    Tuesday, April 6, 2021
    3 years ago
  • Inventors
  • Original Assignees
  • Examiners
    • Gart; Matthew S
    • Holzmacher; Derick J
    Agents
    • Wilmer Cutler Pickering Hale and Dorr LLP
Abstract
Techniques for behavioral pairing in a dispatch center system are disclosed. In one particular embodiment, the techniques may be realized as a method for behavioral pairing in a dispatch center system comprising determining, by at least one computer processor communicatively coupled to and configured to operate in the dispatch center system, a dispatch request for a customer; determining, by the at least one computer processor, a plurality of field agents available to service the customer's dispatch request; determining, by the at least one computer processor, a model of preferred field agent-customer pairings based at least in part on historical field agent-customer interaction outcome data; selecting, by the at least one computer processor, one of the plurality of field agents based on the model; and outputting, by the at least one computer processor, the selection to facilitate dispatching the selected field agent to the customer.
Description
FIELD OF THE DISCLOSURE

This disclosure generally relates to pairing dispatched field agents with customers through dispatch centers and, more particularly, to techniques for behavioral pairing in a dispatch center system.


BACKGROUND OF THE DISCLOSURE

A typical dispatch center algorithmically assigns customers requesting service to field agents available for assignment to those customers. The dispatch center may include a contact center for receiving customer requests (e.g., telephone calls, Internet chat sessions or forms, emails, text messages). The field agents may perform a variety of tasks in various sectors, such as cable installation for a telecommunications company, claim adjusting for an insurance company, etc.


In some typical dispatch centers, customers are assigned to field agents ordered based on which field agent has been waiting the longest for a new dispatch, appointment availability, location, etc. Field agents and/or customers may be assigned to each other on a first-come, first-served basis. This strategy may be referred to as a “first-in, first-out”, “FIFO”, or “round-robin” strategy.


In some advanced contact centers, contacts (e.g., callers) are paired with agents (e.g., phone agents) using a “behavioral pairing,” or a “BP” strategy, under which contacts and agents may be deliberately (preferentially) paired in a fashion that enables the assignment of subsequent contact-agent pairs such that when the benefits of all the assignments under a BP strategy are totaled they may exceed those of FIFO and other strategies such as performance-based routing (“PBR”) strategies. BP is designed to encourage balanced utilization of agents within a skill queue while nevertheless simultaneously improving overall contact center performance beyond what FIFO or PBR methods will allow. This is a remarkable achievement inasmuch as BP acts on the same contacts and same agents as FIFO or PBR methods, utilizes agents approximately evenly as FIFO provides, and yet improves overall contact center performance. BP is described in, e.g., U.S. Pat. No. 9,300,802, which is incorporated by reference herein. Additional information about these and other features regarding the pairing or matching modules (sometimes also referred to as “SATMAP”, “routing system”, “routing engine”, etc.) is described in, for example, U.S. Pat. No. 8,879,715, which is incorporated by reference herein.


However, even these advanced contact centers using BP dispatch field agents to customers using a suboptimal strategy such as FIFO. Field agents have numerous opportunities to deliver value to customers on behalf of their companies, such as customer satisfaction, up-selling and cross-selling, job completion time, etc., and under a FIFO pairing strategy, field agents will not be paired with customers so as to optimize dispatch center performance.


For example, in the television provider industry, a field technician may be dispatched to a customer residence to install or repair access to content via satellite, fiber optics, coaxial cable, etc. During the customer interaction, the field technician may have an opportunity to develop a rapport with the customer, thereby improving customer satisfaction with the installation or repair experience. The field technician may also have an opportunity to assess the customer's other needs and inform the customer about additional products or services (e.g., premium channel subscriptions, warranties, screen wipes, sound bars), generating additional up-sell or cross-sell revenue along with increased customer satisfaction. Therefore, determining a preferred pairing between a field agent and a customer may increase the likelihood of an optimal field agent-customer interaction over a typical FIFO pairing strategy.


In view of the foregoing, it may be understood that there is a need for a system that enables improving the efficiency and performance of dispatch pairing strategies that are distend to choose among multiple possible dispatch pairings such as a BP strategy.


SUMMARY OF THE DISCLOSURE

Techniques for behavioral pairing in a dispatch center system are disclosed. In one particular embodiment, the techniques may be realized as a method for behavioral pairing in a dispatch center system comprising determining, by at least one computer processor communicatively coupled to and configured to operate in the dispatch center system, a dispatch request for a customer; determining, by the at least one computer processor, a plurality of field agents available to service the customer's dispatch request; determining, by the at least one computer processor, a model of preferred field agent-customer pairings based at least in part on historical field agent-customer interaction outcome data; selecting, by the at least one computer processor, one of the plurality of field agents based on the model; and outputting, by the at least one computer processor, the selection to facilitate dispatching the selected field agent to the customer.


In accordance with other aspects of this particular embodiment, the dispatch request comprises at least one requested dispatch time, and determining the plurality of field agents available to service the customer's dispatch request is constrained based on the at least one requested dispatch time.


In accordance with other aspects of this particular embodiment, the techniques may further comprise selecting, by the at least one computer processor, at least one suggested dispatch time, wherein the selected field agent is available during the at least one suggested dispatch time.


In accordance with other aspects of this particular embodiment, the selected field agent may be dispatched immediately or as soon as practicable after the selection.


In accordance with other aspects of this particular embodiment, the techniques may further comprise recording, by the at least one computer processor, results for a first plurality of field-agent customer interactions paired using a behavioral pairing strategy; recording, by the at least one computer processor, results for a second plurality of field-agent customer interactions paired using a FIFO pairing strategy; and outputting, by the at least one computer processor, a measure of relative performance between the behavioral pairing strategy and the FIFO pairing strategy based on the recorded results for the first and second pluralities of field-agent customer interactions.


In accordance with other aspects of this particular embodiment, the techniques may further comprise updating, by the at least one computer processor, the model based at least in part on one or more of: the results for the first plurality of field-agent customer interactions, the results for the second plurality of field-agent customer interactions, and the measure of relative performance.


In accordance with other aspects of this particular embodiment, the model may be based on a diagonal strategy.


In another particular embodiment, the techniques may be realized as a system for behavioral pairing in a dispatch center system comprising at least one computer processor communicatively coupled to and configured to operate in the dispatch center system, wherein the at least one computer processor is further configured to perform the steps in the above-discussed method.


In another particular embodiment, the techniques may be realized as an article of manufacture for behavioral pairing in a dispatch center system comprising a non-transitory processor readable medium and instructions stored on the medium, wherein the instructions are configured to be readable from the medium by at least one computer processor communicatively coupled to and configured to operate in the dispatch center system and thereby cause the at least one computer processor to operate to perform the steps in the above-discussed method.


The present disclosure will now be described in more detail with reference to particular embodiments thereof as shown in the accompanying drawings. While the present disclosure is described below with reference to particular embodiments, it should be understood that the present disclosure is not limited thereto. Those of ordinary skill in the art having access to the teachings herein will recognize additional implementations, modifications, and embodiments, as well as other fields of use, which are within the scope of the present disclosure as described herein, and with respect to which the present disclosure may be of significant utility.





BRIEF DESCRIPTION OF THE DRAWINGS

To facilitate a fuller understanding of the present disclosure, reference is now made to the accompanying drawings, in which like elements are referenced with like numerals. These drawings should not be construed as limiting the present disclosure, but are intended to be illustrative only.



FIG. 1 shows a block diagram of a dispatch center system according to embodiments of the present disclosure.



FIG. 2 shows an example of a BP dispatching method according to embodiments of the present disclosure.



FIG. 3 depicts an example of a dispatch benchmarking method according to embodiments of the present disclosure.





DETAILED DESCRIPTION


FIG. 1 shows a block diagram of a dispatch center system 100 according to embodiments of the present disclosure. The description herein describes network elements, computers, and/or components of a system and method for simulating dispatch center systems that may include one or more modules. As used herein, the term “module” may be understood to refer to computing software, firmware, hardware, and/or various combinations thereof. Modules, however, are not to be interpreted as software which is not implemented on hardware, firmware, or recorded on a processor readable recordable storage medium (i.e., modules are not software per se). It is noted that the modules are exemplary. The modules may be combined, integrated, separated, and/or duplicated to support various applications. Also, a function described herein as being performed at a particular module may be performed at one or more other modules and/or by one or more other devices instead of or in addition to the function performed at the particular module. Further, the modules may be implemented across multiple devices and/or other components local or remote to one another. Additionally, the modules may be moved from one device and added to another device, and/or may be included in both devices.


As shown in FIG. 1, the dispatch center system 100 may include a central dispatch 110. The central dispatch 110 may receive incoming customer requests (e.g., requests from callers) or support outbound connections to customers via a telecommunications network (not shown). The central dispatch 110 may include customer request routing hardware and software for helping to route customer requests among one or more dispatch centers, or to one or more PBX/ACDs or other queuing or switching components, including other Internet-based, cloud-based, or otherwise networked agent-customer hardware or software-based dispatch center solutions.


The central dispatch 110 may not be necessary such as if there is only one dispatch center, or if there is only one PBX/ACD routing component, in the dispatch center system 100. If more than one dispatch center is part of the dispatch center system 100, each dispatch center may include at least one local dispatch (e.g., local dispatches 120A and 120B). The local dispatches 120A and 120B may be communicatively coupled to the central dispatch 110. In embodiments, various topologies of routing and network components may be configured to implement the dispatch center system.


Each local dispatch for each dispatch center may be communicatively coupled to a plurality (or “pool”) of field agents. Each dispatch center may support a certain number of field agents to be available for scheduling during a given time. At any given time, a field agent may be available and waiting to be dispatched to a contact (e.g., for immediate dispatch, or for an open appointment time at a future date and time), or the field agent may be unavailable for any of a number of reasons, such as already having been dispatched—or scheduled for a future dispatch—to another customer. The dispatch center may also account for additional field agent activities such as travel time to and from the customer, and performing certain post-dispatch functions such as logging information about the dispatch, or taking breaks.


In the example of FIG. 1, the central dispatch 110 routes customer requests to one of two local dispatches via local dispatch 120A and local dispatch 120B, respectively. Each of the local dispatches 120A and 120B are shown with two field agents each. Field agents 130A and 130B may be assigned or otherwise delegated to local dispatch 120A, and field agents 130C and 130D may be assigned or otherwise delegated to local dispatch 120B.


The dispatch center system 100 may also be communicatively coupled to an integrated service from, for example, a third party vendor. In the example of FIG. 1, dispatch BP module 140 may be communicatively coupled to one or more dispatches in the dispatch center system 100, such as central dispatch 110, local dispatch 120A, or local dispatch 120B. In some embodiments, central or local dispatches of the dispatch center system 100 may be communicatively coupled to multiple dispatch BP modules. In some embodiments, dispatch BP module 140 may be embedded within a component of a dispatch center system (e.g., embedded in or otherwise integrated with a dispatch center component, or a “BP dispatch center”). The dispatch BP module 140 may receive information from a dispatch component (e.g., local dispatch 120A) about field agents assigned to the dispatch (e.g., field agents 130A and 130B) and about incoming customer requests via another dispatch component (e.g., central dispatch 110) or, in some embodiments, from a network (e.g., the Internet or a telecommunications network) (not shown).


A dispatch center may include multiple pairing modules (e.g., a dispatch BP module and a dispatch FIFO module) (not shown), and one or more pairing modules may be provided by one or more different vendors. In some embodiments, one or more pairing modules may be components of dispatch BP module 140 or one or more dispatch components such as central dispatch 110 or local dispatches 120A and 120B. In some embodiments, a dispatch BP module may determine which pairing module may handle pairing for a particular customer or other contact. For example, the dispatch BP module may alternate between enabling pairing via the dispatch BP module and enabling pairing with the dispatch FIFO module. In other embodiments, one pairing module (e.g., the dispatch BP module) may be configured to emulate other pairing strategies. For example, a dispatch BP module, or a dispatch BP component integrated with dispatch BP components in the dispatch BP module, may determine whether the dispatch BP module may use BP or emulated FIFO pairing for a particular customer request. In this case, “BP on” may refer to times when the dispatch BP module is applying the BP strategy, and “BP off” may refer to other times when the dispatch BP module is applying a different pairing strategy (e.g., FIFO).


In some embodiments, regardless of whether pairing strategies are handled by separate modules, or if some pairing strategies are emulated within a single pairing module, the single pairing module may be configured to monitor and store information about pairings made under any or all pairing strategies. For example, a dispatch BP module may observe and record data about FIFO pairings made by a FIFO module, or the BP module may observe and record data about emulated FIFO pairings made by a BP module operating in FIFO emulation mode.



FIG. 2 shows an example of a BP dispatching method 200 according to embodiments of the present disclosure. BP dispatching method 200 may begin at block 210.


At block 210, at least one customer dispatch request may be determined. For example, a customer may call a call center, and the call center agent may assess the customer's needs and determine that a field agent should be dispatched to provide technical service to the customer. In some embodiments, an interactive voice response (IVR) system or other automated computer system may assess the customer's needs and/or determine the at least one customer dispatch request. After—or in parallel with—determining the at least one customer dispatch request, BP dispatching method 200 may proceed to block 220.


At block 220, available field agents may be determined. In some embodiments, available field agents may be limited to those field agents that are available for immediate (or otherwise near-term) dispatch to the customer. In other embodiments, available field agents may be limited to those field agents that are available during the requested dates or time windows requested by the customer, or to those field agents that are available during dates or time windows suggested by the dispatcher (e.g., a call center agent). In other embodiments, the available field agents may be any or all of the agents assigned or otherwise delegated to a particular dispatch center or dispatch queue (e.g., local dispatch), regardless of potential scheduling constraints. After determining available field agents, BP dispatching method 200 may proceed to block 230.


At block 230, a dispatch BP model of preferred field agent-customer pairings may be determined, based at least in part on an analysis of historical field agent-customer interaction outcome data. In some embodiments, historical outcome data, customer attribute data (e.g., customer relationship management or CRM data), and/or third-party data may be analyzed, and a computer-generated model of preferred field agent-customer pairings may be generated. In some embodiments, the dispatch BP model may be based on a diagonal strategy for BP. In some embodiments, the dispatch BP model may be used to increase the overall performance of the dispatch center system while targeting a balanced utilization of field agents. After determining the dispatch BP model, BP dispatching method 200 may proceed to block 240.


At block 240, one of the field agents determined at block 220 may be selected for pairing to a customer whose request was determined at block 210 based on the dispatch BP model determined at block 230. In some embodiments, such as those in which the available field agents may be any or all of the agents assigned or otherwise delegated to a particular dispatch center or dispatch queue (e.g., local dispatch), regardless of potential scheduling constraints, the BP dispatching method 200 may suggest specific dates or time windows to the customer during which one or more preferred field agents would be available.


The selected pairing may be outputted to another component of the dispatch center system or otherwise displayed or used to assign the field agent and schedule the dispatch. After outputting the selected field agent-customer pairing, BP dispatching method 200 may end.



FIG. 3 depicts an example of a dispatch benchmarking method 300 according to embodiments of the present disclosure. At block 310, dispatch benchmarking method 300 may begin.


At block 310, results for a first plurality of field agent-customer interactions paired using a first pairing strategy of alternating pairing strategies may be recorded or otherwise determined. For example, after a field technician finishes installing cable television service in a customer's home, the customer may be asked to rate the field technician's performance and answer other questions regarding customer satisfaction. In another example, a field technician may sell the customer additional products or services during the interaction, such as a warranty, a premium channel subscription, or a speaker system. During or after the interaction, the field technician may submit or otherwise record information about the sale. In another example, information about the interaction outcome may be recorded automatically, such as the amount of time the field technician spent during the interaction.


In some embodiments, the alternating strategies may be BP and a FIFO pairing strategy, and the first pairing strategy may be BP. In these embodiments, each of the first plurality of field agent-customer interactions may have been paired using BP and thus have a likelihood of improving the overall performance of the dispatch center compared with pairing using FIFO. In some embodiments, pairing strategies may alternate according to periodic cycling (e.g., cycling BP on and off). In some embodiments, the dispatch center system may cycle among more than two pairing strategies.


After—or in parallel with—determining results for a first plurality of field agent-customer interactions paired using the first pairing strategy, dispatch benchmarking method 300 may proceed to block 320.


At block 320, results for a second plurality of field agent-customer interactions paired using the second pairing strategy of the alternating pairing strategies may be recorded or otherwise determined. In some embodiments, the second pairing strategy may be FIFO or another non-BP pairing strategy. In these embodiments, each of the second plurality of field agent-customer interactions may have been paired using FIFO (or another non-BP pairing strategy) and thus likely have a worse overall performance of the dispatch center compared with pairing using BP. After determining results for the second plurality of field agent-customer interactions paired using the second pairing strategy, dispatch benchmarking method 300 may proceed to block 330.


At block 330, relative performance between the alternating pairing strategies may be determined. For example, if the alternating pairing strategies are BP and FIFO, dispatch benchmarking method may compare the performance of the first plurality of interactions with the performance of the second plurality of interactions. The relative performance may represent a performance gain achieved using BP instead of FIFO. In some embodiments, such as those in which BP is provided by a third-party vendor, payments to the third-party vendor may be calculated based at least in part on the extent of performance gain actually measured over a period of time that is attributable to BP.


At this point it should be noted that behavioral pairing in a dispatch center system in accordance with the present disclosure as described above may involve the processing of input data and the generation of output data to some extent. This input data processing and output data generation may be implemented in hardware or software. For example, specific electronic components may be employed in a behavioral pairing module or similar or related circuitry for implementing the functions associated with behavioral pairing in a dispatch center system in accordance with the present disclosure as described above. Alternatively, one or more processors operating in accordance with instructions may implement the functions associated with behavioral pairing in a dispatch center system in accordance with the present disclosure as described above. If such is the case, it is within the scope of the present disclosure that such instructions may be stored on one or more non-transitory processor readable storage media (e.g., a magnetic disk or other storage medium), or transmitted to one or more processors via one or more signals embodied in one or more carrier waves.


The present disclosure is not to be limited in scope by the specific embodiments described herein. Indeed, other various embodiments of and modifications to the present disclosure, in addition to those described herein, will be apparent to those of ordinary skill in the art from the foregoing description and accompanying drawings. Thus, such other embodiments and modifications are intended to fall within the scope of the present disclosure. Further, although the present disclosure has been described herein in the context of at least one particular implementation in at least one particular environment for at least one particular purpose, those of ordinary skill in the art will recognize that its usefulness is not limited thereto and that the present disclosure may be beneficially implemented in any number of environments for any number of purposes. Accordingly, the claims set forth below should be construed in view of the full breadth and spirit of the present disclosure as described herein.

Claims
  • 1. A method for behavioral pairing in a dispatch center system comprising: processing, by at least one dispatch center communicatively coupled to and configured to support behavioral pairing operations in the dispatch center system, a dispatch request for a customer based upon a customer request received at the dispatch center, wherein the dispatch center is configured to route the dispatch request to at least one queueing or switching component in the dispatch center system;determining, by the at least one dispatch center, a plurality of field agents available to service the customer's dispatch request based upon the plurality of field agents assigned to the dispatch center;generating, by at least one dispatch behavioral pairing module communicatively coupled to and configured to perform behavioral pairing operations in the dispatch center system, a model of preferred field agent-customer pairings based at least in part on historical field agent-customer interaction outcome data, wherein the model is determined further based upon information regarding the dispatch request and the plurality of field agents that is received from the dispatch center at the dispatch behavioral pairing module, wherein the model is used to increase the overall performance of the dispatch center system by causing the at least one queueing or switching component to more efficiently operate while targeting a balanced utilization of field agents;selecting, by the at least one dispatch behavioral pairing module, one of the plurality of field agents based on the model; andoutputting, by the at least one dispatch behavioral pairing module, the selection to facilitate routing the dispatch request to the at least one queueing or switching component in the dispatch center system and dispatching the selected field agent to the customer.
  • 2. The method of claim 1, wherein the dispatch request comprises at least one requested dispatch time, and wherein determining the plurality of field agents available to service the customer's dispatch request is constrained based on the at least one requested dispatch time.
  • 3. The method of claim 1, further comprising selecting, by the at least one dispatch behavioral pairing module, at least one suggested dispatch time, wherein the selected field agent is available during the at least one suggested dispatch time.
  • 4. The method of claim 1, further comprising scheduling, by the at least one dispatch behavioral pairing module, the dispatching of the selected field agent to the customer.
  • 5. The method of claim 1, further comprising: recording, by the at least one dispatch behavioral pairing module, results for a first plurality of field-agent customer interactions paired using a behavioral pairing strategy;recording, by the at least one dispatch behavioral pairing module, results for a second plurality of field-agent customer interactions paired using a FIFO pairing strategy; andoutputting, by the at least one dispatch behavioral pairing module, a measure of a performance gain between the behavioral pairing strategy and the FIFO pairing strategy based on the recorded results for the first and second pluralities of field-agent customer interactions.
  • 6. The method of claim 5, further comprising updating, by the at least one dispatch behavioral pairing module, the model based at least in part on one or more of: the results for the first plurality of field-agent customer interactions, the results for the second plurality of field-agent customer interactions, and the measure of the performance gain.
  • 7. The method of claim 1, wherein the model is based on a diagonal behavioral pairing strategy, wherein field agents and customers having percentile rankings with closest midpoints comprise the preferred field agent-customer pairings.
  • 8. A system for behavioral pairing in a dispatch center system comprising: at least one dispatch center communicatively coupled to and configured to support behavioral pairing operations in the dispatch center system, wherein the at least one dispatch center is further configured to: process a dispatch request for a customer based upon a customer request received at the dispatch center, wherein the dispatch center routes the dispatch request to at least one queueing or switching component in the dispatch center system; anddetermine a plurality of field agents available to service the customer's dispatch request based upon the plurality of field agents assigned to the dispatch center;at least one dispatch behavioral pairing module communicatively coupled to and configured to perform behavioral pairing operations in the dispatch center system, wherein the at least one dispatch behavioral pairing module is further configured to: generate a model of preferred field agent-customer pairings based at least in part on historical field agent-customer interaction outcome data, wherein the model is determined further based upon information regarding the dispatch request and the plurality of field agents that is received from the dispatch center at the dispatch behavioral pairing module, wherein the model is used to increase the overall performance of the dispatch center system by causing the at least one queueing or switching component to more efficiently operate while targeting a balanced utilization of field agents;select one of the plurality of field agents based on the model; andoutput the selection to facilitate routing the dispatch request to the at least one queueing or switching component in the dispatch center system and dispatching the selected field agent to the customer.
  • 9. The system of claim 8, wherein the dispatch request comprises at least one requested dispatch time, and wherein determining the plurality of field agents available to service the customer's dispatch request is constrained based on the at least one requested dispatch time.
  • 10. The system of claim 8, wherein the at least one dispatch behavioral pairing module is further configured to select at least one suggested dispatch time, wherein the selected field agent is available during the at least one suggested dispatch time.
  • 11. The system of claim 8, wherein the at least one dispatch behavioral pairing module is further configured to schedule the dispatching of the selected field agent to the customer.
  • 12. The system of claim 8, wherein the at least one dispatch behavioral pairing module is further configured to: record results for a first plurality of field-agent customer interactions paired using a behavioral pairing strategy;record results for a second plurality of field-agent customer interactions paired using a FIFO pairing strategy; andoutput a measure of a performance gain between the behavioral pairing strategy and the FIFO pairing strategy based on the recorded results for the first and second pluralities of field-agent customer interactions.
  • 13. The system of claim 12, wherein the at least one dispatch behavioral pairing module is further configured to update the model based at least in part on one or more of: the results for the first plurality of field-agent customer interactions, the results for the second plurality of field-agent customer interactions, and the measure of the performance gain.
  • 14. The system of claim 8, wherein the model is based on a diagonal behavioral pairing strategy, wherein field agents and customers having percentile rankings with closest midpoints comprise the preferred field agent-customer pairings.
  • 15. An article of manufacture for behavioral pairing in a dispatch center system comprising: at least one non-transitory processor readable medium; andinstructions stored on the at least one medium;wherein the instructions are configured to be readable from the at least one medium by at least one computer processor in at least one dispatch center communicatively coupled to and configured to perform behavioral pairing operations in the dispatch center system and thereby cause the at least one dispatch center to operate so as to: process a dispatch request for a customer based upon a customer request received at the dispatch center, wherein the dispatch center routes the dispatch request to at least one queueing or switching component in the dispatch center system; anddetermine a plurality of field agents available to service the customer's dispatch request based upon the plurality of field agents assigned to the dispatch center;wherein the instructions are further configured to be readable from the at least one medium by at least one computer processor in at least one dispatch behavioral pairing module communicatively coupled to and configured to perform behavioral pairing operations in the dispatch center system and thereby cause the at least one dispatch behavioral pairing module to operate so as to: generate a model of preferred field agent-customer pairings based at least in part on historical field agent-customer interaction outcome data, wherein the model is determined further based upon information regarding the dispatch request and the plurality of field agents that is received from the dispatch center at the dispatch behavioral pairing module, wherein the model is used to increase the overall performance of the dispatch center system by causing the at least one queueing or switching component to more efficiently operate while targeting a balanced utilization of field agents;select one of the plurality of field agents based on the model; andoutput the selection to facilitate routing the dispatch request to the at least one queueing or switching component in the dispatch center system and dispatching the selected field agent to the customer.
  • 16. The article of manufacture of claim 15, wherein the dispatch request comprises at least one requested dispatch time, and wherein determining the plurality of field agents available to service the customer's dispatch request is constrained based on the at least one requested dispatch time.
  • 17. The article of manufacture of claim 15, wherein the instructions further cause the at least one dispatch behavioral pairing module to operate so as to select at least one suggested dispatch time, wherein the selected field agent is available during the at least one suggested dispatch time.
  • 18. The article of manufacture of claim 15, wherein the instructions further cause the at least one dispatch behavioral pairing module to schedule the dispatching of the selected field agent to the customer.
  • 19. The article of manufacture of claim 15, wherein the instructions further cause the at least one dispatch behavioral pairing module to operate so as to: record results for a first plurality of field-agent customer interactions paired using a behavioral pairing strategy;record results for a second plurality of field-agent customer interactions paired using a FIFO pairing strategy; andoutput a measure of a performance gain between the behavioral pairing strategy and the FIFO pairing strategy based on the recorded results for the first and second pluralities of field-agent customer interactions.
  • 20. The article of manufacture of claim 19, wherein the instructions further cause the at least one dispatch behavioral pairing module to operate so as to update the model based at least in part on one or more of: the results for the first plurality of field-agent customer interactions, the results for the second plurality of field-agent customer interactions, and the measure of the performance gain.
  • 21. The article of manufacture of claim 15, wherein the model is based on a diagonal behavioral pairing strategy, wherein field agents and customers having percentile rankings with closest midpoints comprise the preferred field agent-customer pairings.
US Referenced Citations (268)
Number Name Date Kind
5155763 Bigus et al. Oct 1992 A
5206903 Kohler et al. Apr 1993 A
5327490 Cave Jul 1994 A
5537470 Lee Jul 1996 A
5702253 Bryce et al. Dec 1997 A
5825869 Brooks et al. Oct 1998 A
5903641 Tonisson May 1999 A
5907601 David et al. May 1999 A
5926538 Deryugin et al. Jul 1999 A
6049603 Schwartz et al. Apr 2000 A
6052460 Fisher et al. Apr 2000 A
6064731 Flockhart et al. May 2000 A
6088444 Walker et al. Jul 2000 A
6163607 Bogart et al. Dec 2000 A
6222919 Hollatz et al. Apr 2001 B1
6292555 Okamoto Sep 2001 B1
6324282 McIllwaine et al. Nov 2001 B1
6333979 Bondi et al. Dec 2001 B1
6389132 Price May 2002 B1
6389400 Bushey et al. May 2002 B1
6408066 Andruska et al. Jun 2002 B1
6411687 Bohacek et al. Jun 2002 B1
6424709 Doyle et al. Jul 2002 B1
6434230 Gabriel Aug 2002 B1
6496580 Chack Dec 2002 B1
6504920 Okon et al. Jan 2003 B1
6519335 Bushnell Feb 2003 B1
6535600 Fisher et al. Mar 2003 B1
6535601 Flockhart et al. Mar 2003 B1
6564227 Sakakibara May 2003 B2
6570980 Baruch May 2003 B1
6587556 Judkins et al. Jul 2003 B1
6603854 Judkins et al. Aug 2003 B1
6639976 Shellum et al. Oct 2003 B1
6661889 Flockhart et al. Dec 2003 B1
6704410 McFarlane et al. Mar 2004 B1
6707904 Judkins et al. Mar 2004 B1
6714643 Gargeya et al. Mar 2004 B1
6763104 Judkins et al. Jul 2004 B1
6774932 Ewing et al. Aug 2004 B1
6775378 Villena et al. Aug 2004 B1
6798876 Bala Sep 2004 B1
6829348 Schroeder et al. Dec 2004 B1
6832203 Villena et al. Dec 2004 B1
6859529 Duncan et al. Feb 2005 B2
6895083 Bers et al. May 2005 B1
6922466 Peterson et al. Jul 2005 B1
6937715 Delaney Aug 2005 B2
6956941 Duncan et al. Oct 2005 B1
6970821 Shambaugh et al. Nov 2005 B1
6978006 Polcyn Dec 2005 B1
7023979 Wu et al. Apr 2006 B1
7039166 Peterson et al. May 2006 B1
7050566 Becerra et al. May 2006 B2
7050567 Jensen May 2006 B1
7062031 Becerra et al. Jun 2006 B2
7068775 Lee Jun 2006 B1
7092509 Mears et al. Aug 2006 B1
7103172 Brown et al. Sep 2006 B2
7158628 McConnell et al. Jan 2007 B2
7184540 Dezonno et al. Feb 2007 B2
7209549 Reynolds et al. Apr 2007 B2
7231032 Nevman et al. Jun 2007 B2
7231034 Rikhy et al. Jun 2007 B1
7236584 Torba Jun 2007 B2
7245716 Brown et al. Jul 2007 B2
7245719 Kawada et al. Jul 2007 B2
7266251 Rowe Sep 2007 B2
7269253 Wu et al. Sep 2007 B1
7353388 Gilman et al. Apr 2008 B1
7398224 Cooper Jul 2008 B2
7593521 Becerra et al. Sep 2009 B2
7624024 Levis Nov 2009 B2
7676034 Wu et al. Mar 2010 B1
7725339 Aykin May 2010 B1
7734032 Kiefhaber et al. Jun 2010 B1
7798876 Mix Sep 2010 B2
7817796 Clippinger Oct 2010 B1
7826597 Berner et al. Nov 2010 B2
7864944 Khouri et al. Jan 2011 B2
7899177 Bruening et al. Mar 2011 B1
7916858 Heller et al. Mar 2011 B1
7940917 Lauridsen et al. May 2011 B2
7961866 Boutcher et al. Jun 2011 B1
7995717 Conway et al. Aug 2011 B2
8000989 Kiefhaber et al. Aug 2011 B1
8010607 McCormack et al. Aug 2011 B2
8094790 Conway et al. Jan 2012 B2
8126133 Everingham et al. Feb 2012 B1
8140441 Cases et al. Mar 2012 B2
8175253 Knott et al. May 2012 B2
8229102 Knott et al. Jul 2012 B2
8249245 Jay et al. Aug 2012 B2
8295471 Spottiswoode et al. Oct 2012 B2
8300798 Wu et al. Oct 2012 B1
8359219 Chishti et al. Jan 2013 B2
8433597 Chishti et al. Apr 2013 B2
8472611 Chishti Jun 2013 B2
8565410 Chishti et al. Oct 2013 B2
8606611 Fedorov Dec 2013 B1
8634542 Spottiswoode et al. Jan 2014 B2
8644490 Stewart Feb 2014 B2
8670548 Xie et al. Mar 2014 B2
8699694 Chishti et al. Apr 2014 B2
8712821 Spottiswoode Apr 2014 B2
8718271 Spottiswoode May 2014 B2
8724797 Chishti et al. May 2014 B2
8731178 Chishti et al. May 2014 B2
8737595 Chishti et al. May 2014 B2
8750488 Spottiswoode et al. Jun 2014 B2
8761380 Kohler et al. Jun 2014 B2
8781100 Spottiswoode et al. Jul 2014 B2
8781106 Afzal Jul 2014 B2
8792630 Chishti et al. Jul 2014 B2
8824658 Chishti Sep 2014 B2
8831207 Agarwal Sep 2014 B1
8879715 Spottiswoode et al. Nov 2014 B2
8903079 Xie et al. Dec 2014 B2
8913736 Kohler et al. Dec 2014 B2
8929537 Chishti et al. Jan 2015 B2
8995647 Li et al. Mar 2015 B2
9020137 Chishti et al. Apr 2015 B2
9025757 Spottiswoode et al. May 2015 B2
9077736 Werth Jul 2015 B2
9215323 Chishti Dec 2015 B2
9247065 Walls Jan 2016 B2
9277055 Spottiswoode et al. Mar 2016 B2
9300802 Chishti Mar 2016 B1
9426296 Chishti et al. Aug 2016 B2
9712676 Chishti Jul 2017 B1
9712679 Chishti et al. Jul 2017 B2
9881268 Briggs Jan 2018 B1
9930180 Kan et al. Mar 2018 B1
9942405 Kan et al. Apr 2018 B1
20010032120 Stuart et al. Oct 2001 A1
20020018554 Jensen et al. Feb 2002 A1
20020046030 Haritsa et al. Apr 2002 A1
20020059164 Shtivelman May 2002 A1
20020082736 Lech et al. Jun 2002 A1
20020110234 Walker et al. Aug 2002 A1
20020111172 DeWolf et al. Aug 2002 A1
20020131399 Philonenko Sep 2002 A1
20020138285 DeCotiis et al. Sep 2002 A1
20020143599 Nourbakhsh et al. Oct 2002 A1
20020161765 Kundrot et al. Oct 2002 A1
20020184069 Kosiba et al. Dec 2002 A1
20020196845 Richards et al. Dec 2002 A1
20030002653 Uckun Jan 2003 A1
20030059029 Mengshoel et al. Mar 2003 A1
20030081757 Mengshoel et al. May 2003 A1
20030095652 Mengshoel et al. May 2003 A1
20030169870 Stanford Sep 2003 A1
20030174830 Boyer et al. Sep 2003 A1
20030217016 Pericle Nov 2003 A1
20040028211 Culp et al. Feb 2004 A1
20040057416 McCormack Mar 2004 A1
20040096050 Das et al. May 2004 A1
20040098274 Dezonno et al. May 2004 A1
20040101127 Dezonno et al. May 2004 A1
20040109555 Williams Jun 2004 A1
20040133434 Szlam et al. Jul 2004 A1
20040199805 Yasunaga Oct 2004 A1
20040210475 Starnes et al. Oct 2004 A1
20040230438 Pasquale et al. Nov 2004 A1
20040267816 Russek Dec 2004 A1
20050013428 Walters Jan 2005 A1
20050043986 McConnell et al. Feb 2005 A1
20050047581 Shaffer et al. Mar 2005 A1
20050047582 Shaffer et al. Mar 2005 A1
20050071223 Jain et al. Mar 2005 A1
20050129212 Parker Jun 2005 A1
20050135593 Becerra et al. Jun 2005 A1
20050135596 Zhao Jun 2005 A1
20050187802 Koeppel Aug 2005 A1
20050195960 Shaffer et al. Sep 2005 A1
20050286709 Horton et al. Dec 2005 A1
20060098803 Bushey et al. May 2006 A1
20060110052 Finlayson May 2006 A1
20060124113 Roberts Jun 2006 A1
20060184040 Keller et al. Aug 2006 A1
20060222164 Contractor et al. Oct 2006 A1
20060233346 McIlwaine et al. Oct 2006 A1
20060262918 Karnalkar et al. Nov 2006 A1
20060262922 Margulies et al. Nov 2006 A1
20070036323 Travis Feb 2007 A1
20070071222 Flockhart et al. Mar 2007 A1
20070121602 Sin et al. May 2007 A1
20070121829 Tal et al. May 2007 A1
20070136342 Singhai et al. Jun 2007 A1
20070153996 Hansen Jul 2007 A1
20070154007 Bernhard Jul 2007 A1
20070174111 Anderson et al. Jul 2007 A1
20070198322 Bourne et al. Aug 2007 A1
20070211881 Parker-Stephen Sep 2007 A1
20070219816 Van Luchene et al. Sep 2007 A1
20070274502 Brown Nov 2007 A1
20080002823 Fama et al. Jan 2008 A1
20080008309 Dezonno et al. Jan 2008 A1
20080046386 Pieraccinii et al. Feb 2008 A1
20080065476 Klein et al. Mar 2008 A1
20080118052 Houmaidi et al. May 2008 A1
20080147470 Johri Jun 2008 A1
20080152122 Idan et al. Jun 2008 A1
20080181389 Bourne et al. Jul 2008 A1
20080199000 Su et al. Aug 2008 A1
20080205611 Jordan et al. Aug 2008 A1
20080267386 Cooper Oct 2008 A1
20080273687 Knott et al. Nov 2008 A1
20090018890 Werth Jan 2009 A1
20090043670 Johansson et al. Feb 2009 A1
20090086933 Patel et al. Apr 2009 A1
20090092241 Minert Apr 2009 A1
20090190740 Chishti et al. Jul 2009 A1
20090190743 Spottiswoode Jul 2009 A1
20090190744 Xie et al. Jul 2009 A1
20090190745 Xie et al. Jul 2009 A1
20090190746 Chishti et al. Jul 2009 A1
20090190747 Spottiswoode Jul 2009 A1
20090190748 Chishti et al. Jul 2009 A1
20090190749 Xie et al. Jul 2009 A1
20090190750 Xie et al. Jul 2009 A1
20090232294 Xie et al. Sep 2009 A1
20090234710 Belgaied Hassine et al. Sep 2009 A1
20090245493 Chen et al. Oct 2009 A1
20090304172 Becerra et al. Dec 2009 A1
20090318111 Desai et al. Dec 2009 A1
20090323921 Spottiswoode et al. Dec 2009 A1
20100020959 Spottiswoode Jan 2010 A1
20100020961 Spottiswoode Jan 2010 A1
20100054431 Jaiswal et al. Mar 2010 A1
20100054452 Afzal Mar 2010 A1
20100054453 Stewart Mar 2010 A1
20100086120 Brussat et al. Apr 2010 A1
20100111285 Chishti May 2010 A1
20100111286 Chishti May 2010 A1
20100111287 Xie et al. May 2010 A1
20100111288 Afzal et al. May 2010 A1
20100142698 Spottiswoode et al. Jun 2010 A1
20100158238 Saushkin Jun 2010 A1
20100183138 Spottiswoode et al. Jul 2010 A1
20100312604 Mitchell Dec 2010 A1
20100312605 Mitchell Dec 2010 A1
20110022357 Vock et al. Jan 2011 A1
20110031112 Birang et al. Feb 2011 A1
20110069821 Korolev et al. Mar 2011 A1
20110125048 Causevic et al. May 2011 A1
20120051536 Chishti et al. Mar 2012 A1
20120051537 Chishti et al. Mar 2012 A1
20120084111 Aggarwal Apr 2012 A1
20120224680 Spottiswoode et al. Sep 2012 A1
20120278136 Flockhart et al. Nov 2012 A1
20130003959 Nishikawa et al. Jan 2013 A1
20130054306 Bhalla Feb 2013 A1
20130251137 Chishti et al. Sep 2013 A1
20130287202 Flockhart et al. Oct 2013 A1
20140044246 Klemm et al. Feb 2014 A1
20140079210 Kohler et al. Mar 2014 A1
20140119531 Tuchman et al. May 2014 A1
20140119533 Spottiswoode et al. May 2014 A1
20140149164 Yumbe May 2014 A1
20140278661 Nielsen Sep 2014 A1
20140341370 Li et al. Nov 2014 A1
20150055772 Klemm et al. Feb 2015 A1
20150161563 Mehrabi Jun 2015 A1
20150281448 Putra et al. Oct 2015 A1
20160080573 Chishti Mar 2016 A1
20170064080 Chishti et al. Mar 2017 A1
20170064081 Chishti et al. Mar 2017 A1
Foreign Referenced Citations (50)
Number Date Country
2008349500 May 2014 AU
2009209317 May 2014 AU
2009311534 Aug 2014 AU
102301688 May 2014 CN
102017591 Nov 2014 CN
0 493 292 Jul 1992 EP
0 949 793 Oct 1999 EP
1 032 188 Aug 2000 EP
1335572 Aug 2003 EP
11-098252 Apr 1999 JP
2000-069168 Mar 2000 JP
2000-078291 Mar 2000 JP
2000-078292 Mar 2000 JP
2000-092213 Mar 2000 JP
2000-236393 Aug 2000 JP
2001-292236 Oct 2001 JP
2001-518753 Oct 2001 JP
2002-297900 Oct 2002 JP
3366565 Jan 2003 JP
2003-187061 Jul 2003 JP
2004-056517 Feb 2004 JP
2004-227228 Aug 2004 JP
2006-345132 Dec 2006 JP
2007-324708 Dec 2007 JP
2011-511533 Apr 2011 JP
2011-511536 Apr 2011 JP
5421928 Feb 2014 JP
5631326 Nov 2014 JP
5649575 Jan 2015 JP
2015-514371 May 2015 JP
316118 Dec 2013 MX
322251 Jul 2014 MX
587100 Oct 2013 NZ
587101 Oct 2013 NZ
591486 Jan 2014 NZ
592781 Mar 2014 NZ
1-2010-501704 Feb 2014 PH
1-2010-501705 Feb 2015 PH
WO-9838823 Sep 1998 WO
WO-1999017517 Apr 1999 WO
WO-2001063894 Aug 2001 WO
WO-2006124113 Nov 2006 WO
WO-2009097018 Aug 2009 WO
WO-2009097210 Aug 2009 WO
WO-2010053701 May 2010 WO
WO-2010053701 May 2010 WO
WO-2011081514 Jul 2011 WO
WO-2011081514 Jul 2011 WO
WO-2013148453 Oct 2013 WO
WO-2016048290 Mar 2016 WO
Non-Patent Literature Citations (43)
Entry
Cortés, Cristián E., et al. “Branch-and-price and constraint programming for solving a real-life technician dispatching problem.” European Journal of Operational Research 238.1 (2014): 300-312. (Year: 2014).
Cicirello, Vincent A., and Stephen F. Smith. “Distributed coordination of resources via wasp-like agents.” Workshop on Radical Agent Concepts. Springer, Berlin, Heidelberg, 2002. (Year: 2002).
Anonymous. (2006) “Performance Based Routing in Profit Call Centers,” The Decision Makers' Direct, located at www.decisioncraft.com, Issue Jun. 2002 (3 pages).
Canadian Office Action issued in Canadian Patent Application No. 2713526, dated Oct. 25, 2016, 7 pages.
Cleveland, William S., “Robust Locally Weighted Regression and Smoothing Scatterplots,” Journal of the American Statistical Association, vol. 74, No. 368, pp. 829-836 (Dec. 1979).
Cormen, T. H., et al., “Introduction to Algorithms,” 3rd Edition, Chapter 26 Maximum Flow, pp. 708-766 and Chapter 29 Linear Programming, pp. 843-897 (2009).
Extended European Search Report issued by the European Patent Office for European Application No. 17154781.3 dated May 4, 2017 (7 pages).
Extended European Search Report issued by the European Patent Office for European Application No. 17171761.4 dated Aug. 30, 2017 (8 pages).
Gans, N. et al. (2003), “Telephone Call Centers: Tutorial, Review and Research Prospects,” Manufacturing & Service Operations Management, vol. 5, No. 2, pp. 79-141, 84 pages.
International Preliminary Report on Patentability issued in connection with PCT Application No. PCT/US2009/066254 dated Jun. 14, 2011 (6 pages).
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for International Application No. PCT/IB2016/001762 dated Feb. 20, 2017 (15 pages).
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for International Application No. PCT/IB2016/001776 dated Mar. 3, 2017 (16 pages).
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for International Application No. PCT/IB2017/000570 dated Jun. 30, 2017 (13 pages).
International Search Report and Written Opinion issued by the European Patent Office as International Searching Authority for International Application No. PCT/IB2018/000434 dated Jun. 20, 2018 (14 pages).
International Search Report issued in connection with International Application No. PCT/US13/33268 dated May 31, 2013 (2 pages).
International Search Report issued in connection with PCT Application No. PCT/US/2009/054352 dated Mar. 12, 2010, 5 pages.
International Search Report issued in connection with PCT Application No. PCT/US2008/077042 dated Mar. 13, 2009 (3 pages).
International Search Report issued in connection with PCT Application No. PCT/US2009/031611 dated Jun. 3, 2009 (5 pages).
International Search Report issued in connection with PCT Application No. PCT/US2009/066254 dated Feb. 24, 2010 (4 pages).
International Search Report issued in connection with PCT/US2009/061537 dated Jun. 7, 2010 (5 pages).
International Search Report issued in connection with PCT/US2013/033261 dated Jun. 14, 2013 (3 pages).
International Search Report issued in connection with PCT/US2013/33265 dated Jul. 9, 2013 (2 pages).
Japanese Office Action issued by the Japan Patent Office for Application No. 2015-503396 dated Jun. 29, 2016 (7 pages).
Japanese Office Action issued by the Japanese Patent Office for Japanese Application No. 2016-159338 dated Oct. 11, 2017 (12 pages).
Japanese Office Action issued by the Japanese Patent Office for Japanese Application No. 2016-189126 dated Oct. 19, 2017 (24 pages).
Koole, G. (2004). “Performance Analysis and Optimization in Customer Contact Centers,” Proceedings of the Quantitative Evaluation of Systems, First International Conference, Sep. 27-30, 2004 (4 pages).
Koole, G. et al. (Mar. 6, 2006). “An Overview of Routing and Staffing Algorithms in Multi-Skill Customer Contact Centers,” Manuscript, 42 pages.
Nocedal, J. and Wright, S. J., “Numerical Optimization,” Chapter 16 Quadratic Programming, pp. 448-496 (2006).
Ntzoufras, “Bayesian Modeling Using Winbugs”. Wiley Interscience, Chapter 5, Normal Regression Models, Oct. 18, 2007, pp. 155-220 (67 pages).
Press, W. H. and Rybicki, G. B., “Fast Algorithm for Spectral Analysis of Unevenly Sampled Data,” The Astrophysical Journal, vol. 338, pp. 277-280 (Mar. 1, 1989).
Riedmiller, M. et al. (1993). “A Direct Adaptive Method for Faster Back Propagation Learning: The RPROP Algorithm,” 1993 IEEE International Conference on Neural Networks, San Francisco, CA, Mar. 28-Apr. 1, 1993, 1:586-591.
Stanley et al., “Improving call center operations using performance-based routing strategies,” Calif. Journal of Operations Management, 6(1), 24-32, Feb. 2008; retrieved from http://userwww.sfsu.edu/saltzman/Publist.html.
Subsequent Substantive Examination Report issued in connection with Philippines Application No. 1-2010-501705 dated Jul. 14, 2014 (1 page).
Substantive Examination Report issued in connection with Philippines Application No. 1/2011/500868 dated May 2, 2014 (1 page).
Written Opinion of the International Searching Aurhority issued in connection with PCT Application No. PCT/US2008/077042 dated Mar. 13, 2009, 6 pages.
Written Opinion of the International Searching Authority issued in connection with International Application No. PCT/US13/33268 dated May 31, 2013, 7 pages.
Written Opinion of the International Searching Authority issued in connection with PCT Application No. PCT/US/2009/054352 dated Mar. 12, 2010, 5 pages.
Written Opinion of the International Searching Authority issued in connection with PCT Application No. PCT/US2009/031611 dated Jun. 3, 2009, 7 pages.
Written Opinion of the International Searching Authority issued in connection with PCT Application No. PCT/US2009/066254 dated Feb. 24, 2010, 5 pages.
Written Opinion of the International Searching Authority issued in connection with PCT/US2009/061537 dated Jun. 7, 2010, 10 pages.
Written Opinion of the International Searching Authority issued in connection with PCT/US2013/033261 dated Jun. 14, 2013, 7 pages.
Written Opinion of the International Searching Authority issued in connection with PCT/US2013/33265 dated Jul. 9, 2013, 7 pages.
Ioannis Ntzoufras “Bayesian Modeling Using Winbugs: An Introduction”, Department of Statistics, Athens University of Economics and Business, Wiley-Interscience, A John Wiley & Sons, Inc., Publication, Chapter 5, Jan. 1, 2007, pp. 155-220 (67 pages).
Related Publications (1)
Number Date Country
20180293530 A1 Oct 2018 US