US20170126893A1 - Method and computer readable medium for geographic agent routing - Google Patents
Method and computer readable medium for geographic agent routing Download PDFInfo
- Publication number
- US20170126893A1 US20170126893A1 US15/409,015 US201715409015A US2017126893A1 US 20170126893 A1 US20170126893 A1 US 20170126893A1 US 201715409015 A US201715409015 A US 201715409015A US 2017126893 A1 US2017126893 A1 US 2017126893A1
- Authority
- US
- United States
- Prior art keywords
- agent
- customer
- distance
- ranking
- preference
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Abandoned
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/51—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing
- H04M3/523—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing with call distribution or queueing
- H04M3/5232—Call distribution algorithms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/51—Centralised call answering arrangements requiring operator intervention, e.g. call or contact centers for telemarketing
- H04M3/5183—Call or contact centers with computer-telephony arrangements
- H04M3/5191—Call or contact centers with computer-telephony arrangements interacting with the Internet
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M2242/00—Special services or facilities
- H04M2242/14—Special services or facilities with services dependent on location
Definitions
- the present invention relates to the general field of routing agents from call centers and in particular to a method and computer readable medium for optimally routing such agents.
- the present invention comprises a method and computer readable media (or software) for routing a call or other communication to a best available individual, such as a call center agent, customer service representative, and the like, who has a certain relationship with a caller, such as, for example, a physical proximity between the individual and the caller.
- a best available individual such as a call center agent, customer service representative, and the like
- a caller such as, for example, a physical proximity between the individual and the caller.
- the present invention accordingly, provides a computer readable medium and a method for routing calls to geographically dispersed agents based on agent skill-set, agent location and/or caller location, that results in call or non-voice message delivery to a best available agent.
- a method chooses a best available agent to service a customer call based on the ranking of all agents. If a customer has a preference for proximity of the agent to the customer, the system adjusts the agent rankings according to their distance from the customer prior to making a selection.
- the method of the present invention is implemented via a call center system, which is comprised of a call center application module coupled to a database module.
- a communications network is used to couple incoming calls from customers, as well as various call center agents, to the system. The communications network will accommodate both static (fixed location) and dynamic (wireless) communications.
- a database contains a ranking of available agents based on a dataset including information regarding skill-set, previous interaction with the customer, proximity to the customer, language capability, current availability, and the like.
- a proximity preference factor PPF
- ARP agent range preference
- the final ranking is determined by subtracting the distance adjustment from the initial ranking for each agent.
- the agent with the lowest ranking is then assigned to service the call.
- the present invention provides a fast, automated selection of the best available agent to service an incoming request based on the customer's preferences.
- FIG. 1 depicts a call center system for implementing a first method of the present invention
- FIG. 2 depicts a flowchart illustrating the method steps for agent selection in accordance with a first embodiment of the present invention
- FIG. 4 depicts a second exemplary configuration in accordance with a first embodiment of the present invention
- FIG. 5 depicts a third exemplary configuration in accordance with a first embodiment of the present invention
- FIG. 6 depicts a fourth exemplary configuration in accordance with a first embodiment of the present invention.
- FIG. 7 depicts a flowchart for agent selection in accordance with a preferred embodiment of the present invention.
- FIG. 8 depicts a first exemplary configuration in accordance with a preferred embodiment of the present invention.
- FIG. 9 depicts a second exemplary configuration in accordance with a preferred embodiment of the present invention.
- FIG. 10 depicts a third exemplary configuration in accordance with a preferred embodiment of the present invention.
- FIG. 11 depicts a fourth exemplary configuration in accordance with a preferred embodiment of the present invention.
- the overall system 10 for implementing a first method of the invention includes a call center system 12 , which is comprised of a call center application module 14 and a database module 16 containing customer data, agent data, and the like. It should be noted that the functionality performed by the modules 14 , 16 can be performed by one of these modules or by another module (not shown) that may be a part of the call center system 12 or communicate with the system 12 . These modules 14 , 16 may include software, hardware, firmware, and/or a combination of software, hardware, and/or firmware.
- a customer 18 who may desire to purchase a product or a service, for example, communicates (for example, calls, emails, FAX, etc.) with a call center agent 20 - 24 via the call center system 12 over a communications network 26 .
- the network 26 may be a Public Switched Telephone Network (PSTN), an Internet Protocol Network, a wired network, a wireless network, or any combination of these networks.
- PSTN Public Switched Telephone Network
- Internet Protocol Network Internet Protocol Network
- wired network a wired network
- wireless network wireless network, or any combination of these networks.
- the call center system 12 of the present invention uses the procedure of flowchart 28 , described herein, along with computer readable media of the present invention to determine the best available agent from a set of geographically dispersed agents 20 - 24 for servicing a customer call, and routes the call accordingly to a particular agent. For purposes of this example only, the call is depicted as being routed to agent 24 .
- a first agent selection procedure is implemented using a computer readable medium of the present invention.
- the procedure or method begins 30 by calculating 32 an initial ranking for each agent based on skill-set and/or other attributes, which include race, sex, etc.
- the method proceeds by retrieving 34 two pieces of data associated with the caller.
- the first is a Proximity Preference Factor (PPF).
- PPF Proximity Preference Factor
- a PPF of 100% turns even the worst agent into the best agent if they happen to be the closest.
- a PPF of 50% turns the worst agent who happens to be the closest to an agent better than 50% of the available agents.
- a PPF of 0% effectively disables distance factors in agent selection.
- the second piece of retrieved data is an Agent Range Preference (ARP).
- ARP Agent Range Preference
- the ARP consists of a minimum and a maximum distance value. The minimum can be used to filter out agents who might be calling themselves. The maximum can be used to stop giving preference to agents outside a particular range. For example, an agent 2500 miles away is probably no more preferable to an agent 2600 miles away.
- agent distance is not a factor for this caller. Given this, the method proceeds to agent selection 52 based on the initial agent ranking.
- a distance between the caller and each agent is calculated 38 . This can be done with simple calculations that take advantage of static (address, NPA-NXX, zip code, etc.) and/or dynamic (cell site, GPS coordinates, etc.) data associated with the caller and the available agents.
- the method determines 40 if there is at least one agent whose distance falls within the ARP. If not, then the distance of the available agents is still not a factor, so the method proceeds to agent selection 52 .
- the method proceeds to calculate an ARP Delta 42 .
- the ARP delta is the difference between the maximum and the minimum ARP distance values as shown by the formula below:
- ADS Adjusted Distance Scale
- ADS ARP Delta ⁇ Closest Agent Distance
- the method continues by calculating 46 an Agent Ranking Range (ARR), which is determined by subtracting the lowest agent ranking from the highest agent ranking or setting the value of equal to 1 if the result of the subtraction is zero, as derived by the following formula:
- ARR Agent Ranking Range
- This formula uses the Agent Ranking Range (ARR) and the callers Proximity Preference Factor (PPF) to scale the adjustment.
- ARR Agent Ranking Range
- PPF Proximity Preference Factor
- the method proceeds to calculate 50 the final ranking of all the agents. This calculation is performed by subtracting any adjustment from the initial ranking determined previously 32 .
- the initial ranking 62 of the various agents 70 - 78 listed in the agent column 60 is determined as listed.
- the PPF 80 and the ARP 82 submitted by the call center application are retrieved.
- the PPF is 50% and the ARP is 100 to 500. Since the callers PPF (50%) is greater than zero, the distance 64 between the caller and each agent 70 - 78 is calculated.
- the procedure then proceeds using formula 4 to calculate the distance adjustment 66 for each agent 72 - 76 within the ARP 84 range.
- agents 70 , 78 outside the ARP range receive a 0 adjustment.
- the adjustment values 66 are then calculated according to formula 4.
- Tom 72 receives the biggest adjustment, 12, as he is closest to the caller.
- the ARR is 24 and 0.50 is the callers' 50% PPF.
- the remaining within-range agent adjustments are calculated similarly, with Joe 74 receiving an adjustment of 7.3 and Mary 76 receiving an adjustment of 6.4.
- the final rankings 68 for the agents are then calculated by subtracting the adjustment value 66 from the initial ranking 62 .
- the result in this exemplary configuration is that Mary 76 has the lowest final ranking, 11.6, and therefore is chosen as the best agent. Note that Mary is not the closest agent within the agent range preference, but the adjustment to her already low initial ranking of 18 moved her ahead of Jim, the agent with the best initial ranking.
- the caller's PPF 110 is now set to 100, indicating that proximity is of utmost importance to the caller.
- the PPF factor in formula 4 equals 1, instead of 0.5.
- the ARP 112 is 100-500 so that the ARP delta 116 is 400, minimum distance within the ARP 117 is 120, the ARR 114 is 24, and the ADS 118 is 280.
- Jim 100 and Frank 108 are outside the ARP 112 range and receive zero adjustments 96 .
- Adjustments 96 of 24 for Tom 102 , 14.6 for Joe 104 , and ⁇ 4.3 for Mary 106 are calculated.
- the resulting final rankings 98 depict that Joe has the lowest ranking and is therefore chosen as the best agent.
- Mary has a better initial ranking than Joe, Joe is closer than Mary and that is more important to the caller in this exemplary configuration.
- the caller's PPF 140 is again set to 50% and the ARP 142 is 100-400.
- the ranking 122 for the Agents 120 shows Jim 130 at 20.3, Tom 132 at 19.5, Joe 134 at 20.1, Mary 136 at 19.9, and Frank 138 at 20.4. Since the distances 124 for Jim 130 and Frank 138 are 20 and 450, respectively, these are outside the ARP 142 range of >100 and ⁇ 400, so the adjustment for each of these two agents is set at zero.
- the ARP delta 146 is 300, the minimum distance within ARP 147 is 120, and ADS 148 is 180.
- the ARR 144 is calculated to be 1 as a result of the agent rankings 122 being tightly packed. This results in an adjustment 126 of 0.50 for Tom 132 , 0.19 for Joe 134 , and 0.14 for Mary 136 .
- the resulting final rankings 128 depict that Tom has the lowest ranking and is therefore chosen as the best agent. In this example, Tom had both the best initial ranking and the best adjusted ranking.
- a fourth exemplary configuration is shown, which has the same initial ranking 122 and distance 124 for the agents 130 - 138 as for the first exemplary configuration discussed in FIG. 3 .
- the caller's PPF 170 is now set to 90%, indicating that proximity is of fairly high importance to the caller, the ARP 172 is 0-600, the ARR 174 is 24, the ARP delta 176 is 600, the minimum distance in ARP 177 is 20, and the ADS 178 is 580.
- this example is much like the first exemplary configuration, now all five agents 160 - 168 are within the ARP 172 range and therefore need to be adjusted.
- FIG. 7 shows the flowchart for a preferred embodiment of the agent selection procedure of the present invention.
- the method uses the procedure illustrated in flowchart 230 .
- the method begins 232 by calculating 234 an initial ranking for each agent based on skill-set and/or other attributes, which include race, sex, etc.
- the method proceeds by retrieving 236 two pieces of data associated with the caller.
- the first is a Proximity Preference Factor (PPF).
- PPF Proximity Preference Factor
- a PPF of 100% turns even the worst agent into the best agent if they happen to be the closest.
- a PPF of 50% turns the worst agent who happens to be the closest to an agent better than 50% of the available agents.
- a PPF of 0% effectively disables distance factors in agent selection.
- the second piece of retrieved data is an Agent Range Preference (ARP).
- ARP Agent Range Preference
- the ARP consists of a minimum and a maximum distance value. The minimum can be used to filter out agents who might be calling themselves. The maximum can be used to stop giving preference to agents outside a particular range. For example, an agent 2500 miles away is probably no more preferable to an agent 2600 miles away.
- agent distance is not a factor for this caller. Given this, the method proceeds to agent selection 248 based on the initial agent ranking.
- a distance between the caller and each agent is calculated 240 . This can be done with simple calculations that take advantage of static (address, NPA-NXX, zip code, etc.) and/or dynamic (cell site, GPS coordinates, etc.) data associated with the caller and the available agents.
- the method determines 242 if there is at least one agent whose distance falls within the ARP. If not, then the distance of the available agents is still not a factor, so the method proceeds to agent selection 248 .
- the method proceeds to calculate 243 an Agent Ranking Range using the formula
- this Agent Ranking Range is used to calculate a distance adjustment 244 for each agent within the ARP, using the formula:
- Adjustment ARR*PPF*(ARPmax+ClosestDistanceInARR ⁇ AgentDistance)/ARPmax (6).
- This formula uses the Agent Ranking Range (ARR) and the callers Proximity Preference Factor (PPF) to scale the adjustment.
- ARR Agent Ranking Range
- PPF Proximity Preference Factor
- the method proceeds to calculate 246 the final ranking of all the agents. This calculation is performed by subtracting each adjustment from the initial ranking determined previously 234 .
- the initial ranking 252 of the various agents 260 - 268 listed in the agent column 250 is determined as listed.
- the PPF 270 and the ARP 272 submitted by the call center application are retrieved.
- the PPF is 50% and the ARP is 100 to 500.
- the callers PPF (50%) is greater than zero, the distance 254 between the caller and each agent 260 - 268 is calculated.
- the ARR 274 is 24 and the PPF 270 is 0.50 or 50%.
- the remaining within-range agent adjustments are calculated similarly, with Joe 264 receiving an adjustment of 9.4 and Mary 266 receiving an adjustment of 8.9.
- the final rankings 258 for the agents are then calculated by subtracting the adjustment 256 values from the initial ranking 252 values.
- the resulting final rankings 27.0 for Tom 262 , 10.6 for Joe 264 , and 9.1 for Mary 266 depict that Mary 266 has the lowest final ranking of 9.1 and is therefore chosen as the best agent.
- the caller's PPF 300 is now set to 100%, indicating that proximity is of utmost importance to the caller.
- the PPF factor in formula (6) equals 1.0, instead of 0.5.
- the ARP 302 is 100-500 and the ARR 304 is 24.
- Jim 290 and Frank 298 are outside the ARP 310 range and receive zero adjustments 286 . Adjustments 286 of 24 for Tom 292 , 18.7 for Joe 294 , and 8.2 for Mary 296 are calculated using equation (6).
- the resulting final rankings 288 of 15.0 for Tom 292 , 1.3 for Joe 294 , and 9.8 for Mary 296 depict that Joe 294 has the lowest final ranking of 1.3 and is therefore chosen as the best agent. Although Mary 296 has a better initial ranking than Joe 294 , Joe is closer than Mary and that is more important to the caller in this exemplary configuration.
- the caller's PPF 330 is again set to 50% and the ARP 332 is 100-400.
- the initial ranking 312 for the Agents 310 shows Jim 320 at 20.3, Tom 322 at 19.5, Joe 324 at 20.1, Mary 326 at 19.9, and Frank 328 at 20.4.
- the ARR 334 is 0.9 determined as the difference between the highest and lowest ranking of 20.4 and 19.5. Since the distances 314 for Jim 320 and Frank 328 are 20 and 450, respectively, and are outside the ARP 332 range of 100 and 400, the adjustment for each of these two agents is set to zero.
- Equation (6) is then used to calculate the adjustments for the remaining three agents, which results in an adjustment 316 of 0.45 for Tom 322 , 0.33 for Joe 324 , and 0.31 for Mary 326 .
- the resulting final rankings 318 of 19.05 for Tom 322 , 19.8 for Joe 324 , and 19.6 for Mary 326 depict that Tom 322 has the lowest ranking and is therefore chosen as the best agent. In this example, Tom had both the best initial ranking and the best adjusted ranking.
- a fourth exemplary configuration is shown, which has the same initial ranking 342 and distance 344 for the agents 350 - 358 as for the first exemplary configuration discussed in FIG. 8 .
- the caller's PPF 360 is now set to 90%, indicating that proximity is of fairly high importance to the caller, the ARP 362 is 0-600, and the ARR 364 is 24.
Landscapes
- Business, Economics & Management (AREA)
- Marketing (AREA)
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Telephonic Communication Services (AREA)
Abstract
A method and computer readable medium for routing a call to geographically dispersed agents based on agent skill-set, agent location and caller location that results in the call being delivered to the best available agent. The computer readable medium and method are utilized with a system comprised of a call center application module coupled to a database module with a communications network being used to couple incoming calls from customers with the best available agent. A database contains a ranking of available agents, based on a dataset including information regarding skill-set, previous interaction with the customer, proximity to the customer, language capability, current availability, and the like. The method chooses the best available agent to service a customer call based on the agent rankings. In the case where the customer has a preference for proximity of the agent to the customer, the system adjusts the agent rankings according to the agent's distance from the customer prior to making a selection.
Description
- The present patent application is a continuation from U.S. patent application Ser. No. 13/912,663, filed Jun. 7, 2013, and entitled “METHOD AND COMPUTER READABLE MEDIUM FOR GEOGRAPHIC AGENT ROUTING”, now issued U.S. Pat. No. 9,553,989, issued Jan. 24, 2017, which is a continuation from U.S. patent application Ser. No. 13/115,297, filed May 25, 2011, and entitled “METHOD AND COMPUTER READABLE MEDIUM FOR GEOGRAPHIC AGENT ROUTING”, now issued U.S. Pat. No. 8,472,609, issued Jun. 25, 2013, which is a continuation from U.S. patent application Ser. No. 11/421,846, filed Jun. 2, 2006, and entitled “METHOD AND COMPUTER READABLE MEDIUM FOR GEOGRAPHIC AGENT ROUTING”, now issued U.S. Pat. No. 7,961,866, issued Jun. 14, 2011, which is incorporated by reference herein in its entirety. The present patent application is related to and has the same priority date as U.S. patent application Ser. No. 11/421,841, entitled “SYSTEM FOR GEOGRAPHIC AGENT ROUTING”, now issued U.S. Pat. No. 8,009,822, issued Aug. 30, 2011, which is incorporated by reference herein in its entirety.
- The present invention relates to the general field of routing agents from call centers and in particular to a method and computer readable medium for optimally routing such agents.
- The present invention comprises a method and computer readable media (or software) for routing a call or other communication to a best available individual, such as a call center agent, customer service representative, and the like, who has a certain relationship with a caller, such as, for example, a physical proximity between the individual and the caller.
- Currently, many businesses utilize call centers, each with multiple agents, to provide customer service. Typically, businesses employ multiple physical call centers to enable around-the-clock call handling and to utilize cheaper labor markets. Current call center applications enable call routing by a number of methods including time-of-day (TOD), agent availability, caller location and agent skill-set. In some cases, these methods can be combined to form a routing plan. There are limitations to this approach however, including the need to group agents at certain physical locations and the strict prioritization of one routing method over another. These limitations may result in a customer who is not very comfortable with his agent due to accent, lack of local knowledge, etc.
- Therefore, what is needed to overcome the aforementioned limitations, is a computer readable medium utilized in conjunction with a call center system or with a system utilized by an agent based at a residence or other non-call center location, and a call routing method for geographically dispersed agents, based on agent skill-set, agent location, and/or caller location that results in delivery of an incoming call to a best available agent, while allowing a certain preference towards agents who are geographically closer to the caller.
- The present invention, accordingly, provides a computer readable medium and a method for routing calls to geographically dispersed agents based on agent skill-set, agent location and/or caller location, that results in call or non-voice message delivery to a best available agent.
- In a preferred embodiment of the invention, a method chooses a best available agent to service a customer call based on the ranking of all agents. If a customer has a preference for proximity of the agent to the customer, the system adjusts the agent rankings according to their distance from the customer prior to making a selection. The method of the present invention is implemented via a call center system, which is comprised of a call center application module coupled to a database module. A communications network is used to couple incoming calls from customers, as well as various call center agents, to the system. The communications network will accommodate both static (fixed location) and dynamic (wireless) communications. A database contains a ranking of available agents based on a dataset including information regarding skill-set, previous interaction with the customer, proximity to the customer, language capability, current availability, and the like.
- In operation, when a customer places a call (for example, to a system utilizing the present method and computer readable medium), he/she specifies a proximity preference factor (PPF) from 0%-100%. If the PPF is 0% then the customer does not care about the distance between the customer (caller) and the agent, then the system selects an agent solely on the initial agent ranking. However, if the customer specifies a PPF>0 with an agent range preference (ARP), then a distance adjustment is made, as follows: First, an agent ranking range (ARR) is calculated by subtracting the lowest agent ranking from the highest agent ranking. Then a distance adjustment is made for each agent within the ARP according to the formula:
-
ARR*PPF*(ARPmax+ClosestDistanceInARR—AgentDistance)/ARPmax, - and the final ranking is determined by subtracting the distance adjustment from the initial ranking for each agent. The agent with the lowest ranking is then assigned to service the call.
- The present invention provides a fast, automated selection of the best available agent to service an incoming request based on the customer's preferences.
- The above listed and further advantages of the invention may be better understood by referring to the following description in conjunction with the accompanying drawings, in which:
-
FIG. 1 depicts a call center system for implementing a first method of the present invention; -
FIG. 2 depicts a flowchart illustrating the method steps for agent selection in accordance with a first embodiment of the present invention; -
FIG. 3 depicts a first exemplary configuration in accordance with a first embodiment of the present invention; -
FIG. 4 depicts a second exemplary configuration in accordance with a first embodiment of the present invention; -
FIG. 5 depicts a third exemplary configuration in accordance with a first embodiment of the present invention; -
FIG. 6 depicts a fourth exemplary configuration in accordance with a first embodiment of the present invention; and -
FIG. 7 depicts a flowchart for agent selection in accordance with a preferred embodiment of the present invention; -
FIG. 8 depicts a first exemplary configuration in accordance with a preferred embodiment of the present invention; -
FIG. 9 depicts a second exemplary configuration in accordance with a preferred embodiment of the present invention; -
FIG. 10 depicts a third exemplary configuration in accordance with a preferred embodiment of the present invention; -
FIG. 11 depicts a fourth exemplary configuration in accordance with a preferred embodiment of the present invention. - In the description that follows, like elements are marked throughout the specification and drawings with the same reference numerals, respectively. The drawing figures are not necessarily to scale and certain elements may be shown in generalized or schematic form in the interest of clarity and conciseness. Certain routine steps, in flow charts, normally included in the operation of the present invention have been omitted in the interest of conciseness. However, the steps which include methodology in accordance with the present invention are indicated in the charts. As is conventional, the letters Y and N designate “yes” and “no”, respectively.
- Referring now to
FIG. 1 , theoverall system 10 for implementing a first method of the invention includes acall center system 12, which is comprised of a callcenter application module 14 and adatabase module 16 containing customer data, agent data, and the like. It should be noted that the functionality performed by themodules call center system 12 or communicate with thesystem 12. Thesemodules - A
customer 18, who may desire to purchase a product or a service, for example, communicates (for example, calls, emails, FAX, etc.) with a call center agent 20-24 via thecall center system 12 over acommunications network 26. Thenetwork 26 may be a Public Switched Telephone Network (PSTN), an Internet Protocol Network, a wired network, a wireless network, or any combination of these networks. Thecall center system 12 of the present invention, uses the procedure offlowchart 28, described herein, along with computer readable media of the present invention to determine the best available agent from a set of geographically dispersed agents 20-24 for servicing a customer call, and routes the call accordingly to a particular agent. For purposes of this example only, the call is depicted as being routed toagent 24. - Referring now to
FIG. 2 , a first agent selection procedure is implemented using a computer readable medium of the present invention. The procedure or method begins 30 by calculating 32 an initial ranking for each agent based on skill-set and/or other attributes, which include race, sex, etc. - The method proceeds by retrieving 34 two pieces of data associated with the caller. The first is a Proximity Preference Factor (PPF). This allows the caller to weight the importance of proximity in agent selection. A PPF of 100% turns even the worst agent into the best agent if they happen to be the closest. A PPF of 50% turns the worst agent who happens to be the closest to an agent better than 50% of the available agents. A PPF of 0% effectively disables distance factors in agent selection.
- The second piece of retrieved data is an Agent Range Preference (ARP). This allows a customer to specify a distance range in which proximity is going to be given consideration. The ARP consists of a minimum and a maximum distance value. The minimum can be used to filter out agents who might be calling themselves. The maximum can be used to stop giving preference to agents outside a particular range. For example, an agent 2500 miles away is probably no more preferable to an agent 2600 miles away.
- Once the data has been retrieved, a
decision point 36 is reached. If the PPF=0, then agent distance is not a factor for this caller. Given this, the method proceeds toagent selection 52 based on the initial agent ranking. - However, if the PPF>0, then distance is a factor for this caller. Given this, a distance between the caller and each agent is calculated 38. This can be done with simple calculations that take advantage of static (address, NPA-NXX, zip code, etc.) and/or dynamic (cell site, GPS coordinates, etc.) data associated with the caller and the available agents.
- Once complete, the method determines 40 if there is at least one agent whose distance falls within the ARP. If not, then the distance of the available agents is still not a factor, so the method proceeds to
agent selection 52. - If there is at least one agent that falls within the ARP, then the method proceeds to calculate an
ARP Delta 42. The ARP delta is the difference between the maximum and the minimum ARP distance values as shown by the formula below: -
ARP Delta−ARP Maximum−ARP Minimum (1) - The ARP Delta is then used to calculate 44 an Adjusted Distance Scale (ADS), which is determined by subtracting the closest agent distance (CAD) within the ARP range from the ARP Delta as shown by the formula below:
-
ADS=ARP Delta−Closest Agent Distance (2) - The method continues by calculating 46 an Agent Ranking Range (ARR), which is determined by subtracting the lowest agent ranking from the highest agent ranking or setting the value of equal to 1 if the result of the subtraction is zero, as derived by the following formula:
-
ARR−Maximum (1, High Agent Ranking−Lowest Agent Ranking) (3) - Once the ARP Delta, ADS and ARR have been calculated (42-46), a ranking adjustment is calculated 48 for each agent whose distance falls within the ARP. The adjustment is calculated using the formula:
-
Adjustment=ARR*PPF*(ARPDelta−AgentDistance)/ADS (4) - This formula uses the Agent Ranking Range (ARR) and the callers Proximity Preference Factor (PPF) to scale the adjustment. The closest agent will receive the largest adjustment. The furthest agent will receive the smallest adjustment.
- Once the adjustments have been calculated, the method proceeds to calculate 50 the final ranking of all the agents. This calculation is performed by subtracting any adjustment from the initial ranking determined previously 32.
- With the final rankings calculated, the selection ends 54 by selecting 52 the lowest ranking and therefore, the best agent.
- In order to understand the benefits of the method, several applications of the invention in various caller/agent configurations will now be described. Referring now to
FIG. 3 , in a first exemplary configuration, theinitial ranking 62 of the various agents 70-78 listed in theagent column 60 is determined as listed. Once determined, thePPF 80 and theARP 82 submitted by the call center application are retrieved. In this case the PPF is 50% and the ARP is 100 to 500. Since the callers PPF (50%) is greater than zero, thedistance 64 between the caller and each agent 70-78 is calculated. - Three agents, 72-76 are within the ARP range, so their rankings must be adjusted. To do this, the
ARP Delta 86 is calculated first. As shown by theformula 1, the ARP delta is calculated by subtracting the agent range minimum from the agent range maximum. In this case, given that the maximum is 500 and the minimum is 100 (FIG. 3-82 ), theARP Delta 86 is 400. The method then proceeds to calculate theADS 88, which is calculated byformula 2. In this case, the closest agent within the range isTom 87 at 120 miles, so theADS 88=400-120=280. - The procedure then proceeds using formula 4 to calculate the
distance adjustment 66 for each agent 72-76 within theARP 84 range. Note thatagents Tom 72 receives the biggest adjustment, 12, as he is closest to the caller. The figure is arrived at by the following calculation of equation 4: 24*0.50*(400-120)/280=12. The ARR is 24 and 0.50 is the callers' 50% PPF. The remaining within-range agent adjustments are calculated similarly, withJoe 74 receiving an adjustment of 7.3 andMary 76 receiving an adjustment of 6.4. - The
final rankings 68 for the agents are then calculated by subtracting theadjustment value 66 from theinitial ranking 62. The result in this exemplary configuration is thatMary 76 has the lowest final ranking, 11.6, and therefore is chosen as the best agent. Note that Mary is not the closest agent within the agent range preference, but the adjustment to her already low initial ranking of 18 moved her ahead of Jim, the agent with the best initial ranking. - Referring now to
FIG. 4 , in a second exemplary configuration, the caller'sPPF 110 is now set to 100, indicating that proximity is of utmost importance to the caller. In this case, since the PPF=100, instead of 50, the PPF factor in formula 4 equals 1, instead of 0.5. Here, theARP 112 is 100-500 so that theARP delta 116 is 400, minimum distance within theARP 117 is 120, theARR 114 is 24, and theADS 118 is 280. Again,Jim 100 andFrank 108 are outside theARP 112 range and receive zeroadjustments 96.Adjustments 96 of 24 forTom 102, 14.6 forJoe 104, and −4.3 forMary 106 are calculated. The resultingfinal rankings 98 depict that Joe has the lowest ranking and is therefore chosen as the best agent. Although Mary has a better initial ranking than Joe, Joe is closer than Mary and that is more important to the caller in this exemplary configuration. - Referring now to
FIG. 5 , in a third exemplary configuration, the caller'sPPF 140 is again set to 50% and theARP 142 is 100-400. However, theranking 122 for theAgents 120 showsJim 130 at 20.3,Tom 132 at 19.5,Joe 134 at 20.1,Mary 136 at 19.9, andFrank 138 at 20.4. Since thedistances 124 forJim 130 andFrank 138 are 20 and 450, respectively, these are outside theARP 142 range of >100 and <400, so the adjustment for each of these two agents is set at zero. Furthermore, theARP delta 146 is 300, the minimum distance withinARP 147 is 120, andADS 148 is 180. In this case then, using formula (3) (ARR=Maximum (1, High Agent Ranking−Lowest Agent Ranking), theARR 144 is calculated to be 1 as a result of theagent rankings 122 being tightly packed. This results in anadjustment 126 of 0.50 forTom 132, 0.19 forJoe 134, and 0.14 forMary 136. The resultingfinal rankings 128 depict that Tom has the lowest ranking and is therefore chosen as the best agent. In this example, Tom had both the best initial ranking and the best adjusted ranking. - Referring now to
FIG. 6 , a fourth exemplary configuration is shown, which has the sameinitial ranking 122 anddistance 124 for the agents 130-138 as for the first exemplary configuration discussed inFIG. 3 . However, here the caller'sPPF 170 is now set to 90%, indicating that proximity is of fairly high importance to the caller, theARP 172 is 0-600, theARR 174 is 24, theARP delta 176 is 600, the minimum distance inARP 177 is 20, and theADS 178 is 580. Although this example is much like the first exemplary configuration, now all five agents 160-168 are within theARP 172 range and therefore need to be adjusted. In this case, since the PPF=90%, instead of 50%, the PPF factor in formula 4 equals 0.9, instead of 0.5. This results inadjustments 156 of 21.6 forJim 160, 17.9 forTom 162, 13.8 forJoe 164, 13.0 forMary 166, and 3.7 forFrank 168. The resultingfinal rankings 158 depict thatJim 160 with and afinal ranking 158 of −6.6 has the lowest ranking after adjustment and is therefore chosen as the best agent. -
FIG. 7 shows the flowchart for a preferred embodiment of the agent selection procedure of the present invention. The method uses the procedure illustrated inflowchart 230. Here, the method begins 232 by calculating 234 an initial ranking for each agent based on skill-set and/or other attributes, which include race, sex, etc. - The method proceeds by retrieving 236 two pieces of data associated with the caller. The first is a Proximity Preference Factor (PPF). This allows the caller to weight the importance of proximity in agent selection. A PPF of 100% turns even the worst agent into the best agent if they happen to be the closest. A PPF of 50% turns the worst agent who happens to be the closest to an agent better than 50% of the available agents. A PPF of 0% effectively disables distance factors in agent selection.
- The second piece of retrieved data is an Agent Range Preference (ARP). This allows a customer to specify a distance range in which proximity is going to be given consideration. The ARP consists of a minimum and a maximum distance value. The minimum can be used to filter out agents who might be calling themselves. The maximum can be used to stop giving preference to agents outside a particular range. For example, an agent 2500 miles away is probably no more preferable to an agent 2600 miles away.
- Once the data has been retrieved, a
decision point 238 is reached. If the PPF=0, then agent distance is not a factor for this caller. Given this, the method proceeds toagent selection 248 based on the initial agent ranking. - However, if the PPF>0, then distance is a factor for this caller. Given this, a distance between the caller and each agent is calculated 240. This can be done with simple calculations that take advantage of static (address, NPA-NXX, zip code, etc.) and/or dynamic (cell site, GPS coordinates, etc.) data associated with the caller and the available agents.
- Once complete, the method determines 242 if there is at least one agent whose distance falls within the ARP. If not, then the distance of the available agents is still not a factor, so the method proceeds to
agent selection 248. - However, if at least one agent falls within the ARP, then the method proceeds to calculate 243 an Agent Ranking Range using the formula;
-
ARR=Highest Agent Ranking−Lowest Agent Ranking (5) - Next, this Agent Ranking Range is used to calculate a
distance adjustment 244 for each agent within the ARP, using the formula: -
Adjustment=ARR*PPF*(ARPmax+ClosestDistanceInARR−AgentDistance)/ARPmax (6). - This formula uses the Agent Ranking Range (ARR) and the callers Proximity Preference Factor (PPF) to scale the adjustment. The closest agent will receive the largest adjustment. The furthest agent will receive the smallest adjustment.
- Once the adjustments have been calculated, the method proceeds to calculate 246 the final ranking of all the agents. This calculation is performed by subtracting each adjustment from the initial ranking determined previously 234.
- With the final rankings calculated, the selection ends 250 by selecting 248 the lowest ranking and therefore, the best agent.
- Again, in order to understand the benefits of the method for this preferred embodiment of the invention, several applications of the invention in various caller/agent configurations will now be described. Referring now to
FIG. 8 , in a first exemplary configuration, theinitial ranking 252 of the various agents 260-268 listed in theagent column 250 is determined as listed. Once determined, thePPF 270 and theARP 272 submitted by the call center application are retrieved. In this case the PPF is 50% and the ARP is 100 to 500. Since the callers PPF (50%) is greater than zero, thedistance 254 between the caller and each agent 260-268 is calculated. Finally, theARR 274 is calculated as the Highest Ranked Agent−Lowest Ranked Agent. In this case, sinceTom 262 is the highest ranked agent with a ranking of 39 andJim 260 is the lowest ranked agent with a ranking of 15, the ARR=39-15=24 (5). - Since three agents, 262-266 are within the ARP range, their rankings must be adjusted using formula (6), as follows to calculate the
distance adjustment 256 for each agent 262-266 within theARP 272 range. Note thatagents Tom 262 receives the biggest adjustment, 12, as he is closest to the caller. This figure is arrived at by the following calculation of formula (6): -
Adjustment=24*0.50*(500+120−120)/500=12. - The
ARR 274 is 24 and thePPF 270 is 0.50 or 50%. The remaining within-range agent adjustments are calculated similarly, withJoe 264 receiving an adjustment of 9.4 andMary 266 receiving an adjustment of 8.9. - The
final rankings 258 for the agents are then calculated by subtracting theadjustment 256 values from theinitial ranking 252 values. The resulting final rankings 27.0 forTom 262, 10.6 forJoe 264, and 9.1 forMary 266 depict thatMary 266 has the lowest final ranking of 9.1 and is therefore chosen as the best agent. - Referring now to
FIG. 9 , in a second exemplary configuration, the caller'sPPF 300 is now set to 100%, indicating that proximity is of utmost importance to the caller. In this case, since the PPF=100%, instead of 50%, the PPF factor in formula (6) equals 1.0, instead of 0.5. Here, theARP 302 is 100-500 and theARR 304 is 24. Again,Jim 290 andFrank 298 are outside theARP 310 range and receive zeroadjustments 286.Adjustments 286 of 24 forTom 292, 18.7 forJoe 294, and 8.2 forMary 296 are calculated using equation (6). The resultingfinal rankings 288 of 15.0 forTom 292, 1.3 forJoe 294, and 9.8 forMary 296 depict thatJoe 294 has the lowest final ranking of 1.3 and is therefore chosen as the best agent. AlthoughMary 296 has a better initial ranking thanJoe 294, Joe is closer than Mary and that is more important to the caller in this exemplary configuration. - Referring now to
FIG. 10 , in a third exemplary configuration, the caller'sPPF 330 is again set to 50% and theARP 332 is 100-400. However, theinitial ranking 312 for theAgents 310 showsJim 320 at 20.3,Tom 322 at 19.5,Joe 324 at 20.1,Mary 326 at 19.9, andFrank 328 at 20.4. TheARR 334 is 0.9 determined as the difference between the highest and lowest ranking of 20.4 and 19.5. Since thedistances 314 forJim 320 andFrank 328 are 20 and 450, respectively, and are outside theARP 332 range of 100 and 400, the adjustment for each of these two agents is set to zero. Equation (6) is then used to calculate the adjustments for the remaining three agents, which results in anadjustment 316 of 0.45 forTom 322, 0.33 forJoe 324, and 0.31 forMary 326. The resultingfinal rankings 318 of 19.05 forTom 322, 19.8 forJoe 324, and 19.6 forMary 326 depict thatTom 322 has the lowest ranking and is therefore chosen as the best agent. In this example, Tom had both the best initial ranking and the best adjusted ranking. - Referring now to
FIG. 11 , a fourth exemplary configuration is shown, which has the sameinitial ranking 342 anddistance 344 for the agents 350-358 as for the first exemplary configuration discussed inFIG. 8 . However, here the caller'sPPF 360 is now set to 90%, indicating that proximity is of fairly high importance to the caller, theARP 362 is 0-600, and theARR 364 is 24. Although this example is much like the first exemplary configuration ofFIG. 9 , now all five agents 350-358 are within theARP 362 range and therefore need to be adjusted. In this case, since the PPF=90%, instead of 50%, the PPF factor in formula (6) is set to 0.9. This results inadjustments 346 of 21.6 forJim 350, 18.0 forTom 352, 14.0 forJoe 354, 13.3 forMary 356, and 4.3 forFrank 358. The resultingfinal rankings 348 of −6.60 forJim 350, 21.0 forTom 352, 6.0 forJoe 354, 4.7 forMary 356, and 15.7 forFrank 358 depict thatJim 350 with and afinal ranking 348 of −6.6 has the lowest ranking after adjustment and is therefore chosen as the best agent. - Although embodiments of a method and computer readable medium for various embodiments of geographic agent routing have been described in detail herein, it will be appreciated that the present invention may provide applicable inventive concepts that can be embodied in a wide variety of specific contexts. For example, while the preferred embodiment of the invention has principally referenced a method for optimally routing agents it should be understood that the method may also be utilized for alternative applications, such as selecting particular computers, security systems, imaging systems, and the like. Also, a lesser or greater number of modules or components may be utilized in the system of the present invention to make the selection of the best available agent. The specific embodiments discussed herein are merely illustrative of specific ways to make and use the invention, and do not delimit the scope of the invention. Those skilled in the art will recognize that various substitutions and modifications and a lesser or greater number of modules or components may be utilized in the invention without departing from the scope and spirit of the appended claims.
Claims (16)
1. A method, comprising:
calculating an agent range preference by subtracting a minimum distance from one agent to a customer from a maximum distance from another agent to the customer;
calculating an adjusted distance scale by subtracting said minimum distance from the agent range preference;
determining a distance adjustment for an agent within the agent range preference by multiplying the agent range preference times a proximity preference factor times a difference between the agent range preference and an agent distance to the customer and dividing by the calculated adjusted distance scale; and
assigning an agent of a plurality of agents, by a processor, to service a customer based on the calculating and determining.
2. The method of claim 1 comprising assigning an agent to service a customer based on an agent distance adjustment being made relative to a closest agent distance prior to assigning an agent to service a customer when said customer specifies an agent range preference.
3. The method of claim 1 comprising receiving a call based on an initial agent ranking of all available agents, a caller's proximity preference factor, and an agent range preference.
4. The method of claim 1 comprising coupling a plurality of incoming customer calls and available agents.
5. The method of claim 1 comprising providing an initial agent ranking based on a dataset including information of at least one from the group of: skill-set, previous interaction with a customer, language capability, race, sex, minimum distance from an agent to a customer, maximum distance from an agent to a customer, and current availability.
6. The method of claim 1 , wherein an agent is assigned to service a customer based on an initial agent ranking when said customer specifies no agent range preference indicating distance between said customer and said agent.
7. The method of claim 1 , wherein the customer and the assigned agent communicate via at least one of: a landline phone call, an e-mail, a fax, Internet, a wireless phone call, a wireless intercom, and a wireless Internet.
8. The method of claim 1 , wherein the minimum distance and the maximum distance are determined using at least one of: an address, a NPA-NXX, a Zip Code, cell cite locations and GPS coordinates.
9. A non-transitory computer readable medium comprising instructions for:
calculating an agent range preference by subtracting a minimum distance from one agent to a customer from a maximum distance from another agent to the customer;
calculating an adjusted distance scale by subtracting said minimum distance from the agent range preference;
determining a distance adjustment for an agent within the agent range preference by multiplying the agent range preference times a proximity preference factor times a difference between the agent range preference and an agent distance to the customer and dividing by the calculated adjusted distance scale; and
assigning an agent of a plurality of agents, by a processor, to service a customer based on the calculating and determining.
10. The non-transitory computer readable medium of claim 9 comprising assigning an agent to service a customer based on an agent distance adjustment being made relative to a closest agent distance prior to assigning an agent to service a customer when said customer specifies an agent range preference.
11. The non-transitory computer readable medium of claim 9 comprising receiving a call based on an initial agent ranking of all available agents, a caller's proximity preference factor, and an agent range preference.
12. The non-transitory computer readable medium of claim 9 comprising coupling a plurality of incoming customer calls and available agents.
13. The non-transitory computer readable medium of claim 9 comprising providing an initial agent ranking based on a dataset including information of at least one from the group of: skill-set, previous interaction with a customer, language capability, race, sex, minimum distance from an agent to a customer, maximum distance from an agent to a customer, and current availability.
14. The non-transitory computer readable medium of claim 9 , wherein an agent is assigned to service a customer based on an initial agent ranking when said customer specifies no agent range preference indicating distance between said customer and said agent.
15. The non-transitory computer readable medium of claim 9 , wherein the customer and the assigned agent communicate via at least one of: a landline phone call, an e-mail, a fax, Internet, a wireless phone call, a wireless intercom, and a wireless Internet.
16. The non-transitory computer readable medium of claim 9 , wherein the minimum distance and the maximum distance are determined using at least one of: an address, a NPA-NXX, a Zip Code, cell cite locations and GPS coordinates.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US15/409,015 US20170126893A1 (en) | 2006-06-02 | 2017-01-18 | Method and computer readable medium for geographic agent routing |
Applications Claiming Priority (4)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
US11/421,846 US7961866B1 (en) | 2006-06-02 | 2006-06-02 | Method and computer readable medium for geographic agent routing |
US13/115,297 US8472609B1 (en) | 2006-06-02 | 2011-05-25 | Method and computer readable medium for geographic agent routing |
US13/912,663 US9553989B1 (en) | 2006-06-02 | 2013-06-07 | Method and computer readable medium for geographic agent routing |
US15/409,015 US20170126893A1 (en) | 2006-06-02 | 2017-01-18 | Method and computer readable medium for geographic agent routing |
Related Parent Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US13/912,663 Continuation US9553989B1 (en) | 2006-06-02 | 2013-06-07 | Method and computer readable medium for geographic agent routing |
Publications (1)
Publication Number | Publication Date |
---|---|
US20170126893A1 true US20170126893A1 (en) | 2017-05-04 |
Family
ID=44121945
Family Applications (4)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/421,846 Expired - Fee Related US7961866B1 (en) | 2006-06-02 | 2006-06-02 | Method and computer readable medium for geographic agent routing |
US13/115,297 Expired - Fee Related US8472609B1 (en) | 2006-06-02 | 2011-05-25 | Method and computer readable medium for geographic agent routing |
US13/912,663 Active - Reinstated US9553989B1 (en) | 2006-06-02 | 2013-06-07 | Method and computer readable medium for geographic agent routing |
US15/409,015 Abandoned US20170126893A1 (en) | 2006-06-02 | 2017-01-18 | Method and computer readable medium for geographic agent routing |
Family Applications Before (3)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US11/421,846 Expired - Fee Related US7961866B1 (en) | 2006-06-02 | 2006-06-02 | Method and computer readable medium for geographic agent routing |
US13/115,297 Expired - Fee Related US8472609B1 (en) | 2006-06-02 | 2011-05-25 | Method and computer readable medium for geographic agent routing |
US13/912,663 Active - Reinstated US9553989B1 (en) | 2006-06-02 | 2013-06-07 | Method and computer readable medium for geographic agent routing |
Country Status (1)
Country | Link |
---|---|
US (4) | US7961866B1 (en) |
Cited By (10)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110177181A (en) * | 2016-12-30 | 2019-08-27 | 欧洲阿菲尼帝科技有限责任公司 | Technology for L3 pairing |
CN110213450A (en) * | 2019-05-14 | 2019-09-06 | 长沙手之声信息科技有限公司 | Based on polycentric sign language online customer service allocation management method, apparatus and system |
US20190335038A1 (en) * | 2018-04-30 | 2019-10-31 | Aurelio Luis Miguel ALONSO Y CALOCA | Contact center system and methods for handling voice and data teleservices through mobile devices |
CN111147675A (en) * | 2019-12-05 | 2020-05-12 | 商客通尚景科技(上海)股份有限公司 | Shunting method and device for cloud call center telephone |
CN111277712A (en) * | 2019-07-11 | 2020-06-12 | 上海联逾信息技术有限公司 | Telephone calling-out system based on language type classification processing |
CN111277713A (en) * | 2019-07-11 | 2020-06-12 | 上海联逾信息技术有限公司 | Customer service switching system based on telephone call |
CN112188012A (en) * | 2020-09-15 | 2021-01-05 | 中信银行股份有限公司 | Method and device for establishing customer service session, electronic equipment and readable storage medium |
US11595522B2 (en) | 2016-12-30 | 2023-02-28 | Afiniti, Ltd. | Techniques for workforce management in a contact center system |
US11785144B2 (en) | 2018-04-30 | 2023-10-10 | Aurelio Luis Miguel ALONSO Y CALOCA | Methods for handling voice and data teleservices through mobile devices with asynchronous communication |
US11831808B2 (en) | 2016-12-30 | 2023-11-28 | Afiniti, Ltd. | Contact center system |
Families Citing this family (64)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US10708431B2 (en) | 2008-01-28 | 2020-07-07 | Afiniti Europe Technologies Limited | Techniques for hybrid behavioral pairing in a contact center system |
US9712676B1 (en) | 2008-01-28 | 2017-07-18 | Afiniti Europe Technologies Limited | Techniques for benchmarking pairing strategies in a contact center system |
US10750023B2 (en) | 2008-01-28 | 2020-08-18 | Afiniti Europe Technologies Limited | Techniques for hybrid behavioral pairing in a contact center system |
US8670548B2 (en) * | 2008-01-28 | 2014-03-11 | Satmap International Holdings Limited | Jumping callers held in queue for a call center routing system |
US9692898B1 (en) | 2008-01-28 | 2017-06-27 | Afiniti Europe Technologies Limited | Techniques for benchmarking paring strategies in a contact center system |
US9774740B2 (en) | 2008-01-28 | 2017-09-26 | Afiniti Europe Technologies Limited | Techniques for benchmarking pairing strategies in a contact center system |
US8824658B2 (en) | 2008-11-06 | 2014-09-02 | Satmap International Holdings Limited | Selective mapping of callers in a call center routing system |
US9712679B2 (en) | 2008-01-28 | 2017-07-18 | Afiniti International Holdings, Ltd. | Systems and methods for routing callers to an agent in a contact center |
US10708430B2 (en) | 2008-01-28 | 2020-07-07 | Afiniti Europe Technologies Limited | Techniques for benchmarking pairing strategies in a contact center system |
US9654641B1 (en) | 2008-01-28 | 2017-05-16 | Afiniti International Holdings, Ltd. | Systems and methods for routing callers to an agent in a contact center |
US20090232294A1 (en) * | 2008-01-28 | 2009-09-17 | Qiaobing Xie | Skipping a caller in queue for a call routing center |
US8718271B2 (en) * | 2008-01-28 | 2014-05-06 | Satmap International Holdings Limited | Call routing methods and systems based on multiple variable standardized scoring |
US10567586B2 (en) * | 2008-11-06 | 2020-02-18 | Afiniti Europe Technologies Limited | Pooling callers for matching to agents based on pattern matching algorithms |
US9781269B2 (en) | 2008-01-28 | 2017-10-03 | Afiniti Europe Technologies Limited | Techniques for hybrid behavioral pairing in a contact center system |
US9300802B1 (en) | 2008-01-28 | 2016-03-29 | Satmap International Holdings Limited | Techniques for behavioral pairing in a contact center system |
US9787841B2 (en) | 2008-01-28 | 2017-10-10 | Afiniti Europe Technologies Limited | Techniques for hybrid behavioral pairing in a contact center system |
US8781100B2 (en) * | 2008-01-28 | 2014-07-15 | Satmap International Holdings Limited | Probability multiplier process for call center routing |
US8903079B2 (en) * | 2008-01-28 | 2014-12-02 | Satmap International Holdings Limited | Routing callers from a set of callers based on caller data |
US20090190745A1 (en) * | 2008-01-28 | 2009-07-30 | The Resource Group International Ltd | Pooling callers for a call center routing system |
US8879715B2 (en) | 2012-03-26 | 2014-11-04 | Satmap International Holdings Limited | Call mapping systems and methods using variance algorithm (VA) and/or distribution compensation |
US20090190750A1 (en) * | 2008-01-28 | 2009-07-30 | The Resource Group International Ltd | Routing callers out of queue order for a call center routing system |
US20100020961A1 (en) * | 2008-07-28 | 2010-01-28 | The Resource Group International Ltd | Routing callers to agents based on time effect data |
US8781106B2 (en) * | 2008-08-29 | 2014-07-15 | Satmap International Holdings Limited | Agent satisfaction data for call routing based on pattern matching algorithm |
US8644490B2 (en) * | 2008-08-29 | 2014-02-04 | Satmap International Holdings Limited | Shadow queue for callers in a performance/pattern matching based call routing system |
USRE48412E1 (en) | 2008-11-06 | 2021-01-26 | Afiniti, Ltd. | Balancing multiple computer models in a call center routing system |
US20100111288A1 (en) * | 2008-11-06 | 2010-05-06 | Afzal Hassan | Time to answer selector and advisor for call routing center |
US8472611B2 (en) | 2008-11-06 | 2013-06-25 | The Resource Group International Ltd. | Balancing multiple computer models in a call center routing system |
US8649491B1 (en) * | 2008-11-25 | 2014-02-11 | West Corporation | System and method for real-time geographical call display of automatic call distributor calls |
US8634542B2 (en) | 2008-12-09 | 2014-01-21 | Satmap International Holdings Limited | Separate pattern matching algorithms and computer models based on available caller data |
US8724797B2 (en) | 2010-08-26 | 2014-05-13 | Satmap International Holdings Limited | Estimating agent performance in a call routing center system |
US8699694B2 (en) | 2010-08-26 | 2014-04-15 | Satmap International Holdings Limited | Precalculated caller-agent pairs for a call center routing system |
US8750488B2 (en) | 2010-08-31 | 2014-06-10 | Satmap International Holdings Limited | Predicted call time as routing variable in a call routing center system |
US20120173296A1 (en) * | 2011-01-03 | 2012-07-05 | Mcmullin Dale Robert | Method and system for outage restoration |
US8369509B2 (en) | 2011-05-23 | 2013-02-05 | Avaya Inc. | System and method for search-based work assignments in a contact center |
US9025757B2 (en) | 2012-03-26 | 2015-05-05 | Satmap International Holdings Limited | Call mapping systems and methods using bayesian mean regression (BMR) |
US8792630B2 (en) | 2012-09-24 | 2014-07-29 | Satmap International Holdings Limited | Use of abstracted data in pattern matching system |
US9569430B2 (en) | 2014-10-24 | 2017-02-14 | International Business Machines Corporation | Language translation and work assignment optimization in a customer support environment |
CA3028696C (en) | 2015-12-01 | 2021-06-08 | Afiniti Europe Technologies Limited | Techniques for case allocation |
US10142473B1 (en) | 2016-06-08 | 2018-11-27 | Afiniti Europe Technologies Limited | Techniques for benchmarking performance in a contact center system |
US9692899B1 (en) | 2016-08-30 | 2017-06-27 | Afiniti Europe Technologies Limited | Techniques for benchmarking pairing strategies in a contact center system |
US9888121B1 (en) | 2016-12-13 | 2018-02-06 | Afiniti Europe Technologies Limited | Techniques for behavioral pairing model evaluation in a contact center system |
US10320984B2 (en) | 2016-12-30 | 2019-06-11 | Afiniti Europe Technologies Limited | Techniques for L3 pairing in a contact center system |
US9955013B1 (en) | 2016-12-30 | 2018-04-24 | Afiniti Europe Technologies Limited | Techniques for L3 pairing in a contact center system |
US10257354B2 (en) | 2016-12-30 | 2019-04-09 | Afiniti Europe Technologies Limited | Techniques for L3 pairing in a contact center system |
US10135986B1 (en) | 2017-02-21 | 2018-11-20 | Afiniti International Holdings, Ltd. | Techniques for behavioral pairing model evaluation in a contact center system |
US10970658B2 (en) | 2017-04-05 | 2021-04-06 | Afiniti, Ltd. | Techniques for behavioral pairing in a dispatch center system |
US9930180B1 (en) | 2017-04-28 | 2018-03-27 | Afiniti, Ltd. | Techniques for behavioral pairing in a contact center system |
US10122860B1 (en) | 2017-07-10 | 2018-11-06 | Afiniti Europe Technologies Limited | Techniques for estimating expected performance in a task assignment system |
US10509669B2 (en) | 2017-11-08 | 2019-12-17 | Afiniti Europe Technologies Limited | Techniques for benchmarking pairing strategies in a task assignment system |
US10110746B1 (en) | 2017-11-08 | 2018-10-23 | Afiniti Europe Technologies Limited | Techniques for benchmarking pairing strategies in a task assignment system |
US11399096B2 (en) | 2017-11-29 | 2022-07-26 | Afiniti, Ltd. | Techniques for data matching in a contact center system |
US10509671B2 (en) | 2017-12-11 | 2019-12-17 | Afiniti Europe Technologies Limited | Techniques for behavioral pairing in a task assignment system |
US10623565B2 (en) | 2018-02-09 | 2020-04-14 | Afiniti Europe Technologies Limited | Techniques for behavioral pairing in a contact center system |
US11250359B2 (en) | 2018-05-30 | 2022-02-15 | Afiniti, Ltd. | Techniques for workforce management in a task assignment system |
US10496438B1 (en) | 2018-09-28 | 2019-12-03 | Afiniti, Ltd. | Techniques for adapting behavioral pairing to runtime conditions in a task assignment system |
US10867263B2 (en) | 2018-12-04 | 2020-12-15 | Afiniti, Ltd. | Techniques for behavioral pairing in a multistage task assignment system |
US11144344B2 (en) | 2019-01-17 | 2021-10-12 | Afiniti, Ltd. | Techniques for behavioral pairing in a task assignment system |
US10757261B1 (en) | 2019-08-12 | 2020-08-25 | Afiniti, Ltd. | Techniques for pairing contacts and agents in a contact center system |
US11445062B2 (en) | 2019-08-26 | 2022-09-13 | Afiniti, Ltd. | Techniques for behavioral pairing in a task assignment system |
US10757262B1 (en) | 2019-09-19 | 2020-08-25 | Afiniti, Ltd. | Techniques for decisioning behavioral pairing in a task assignment system |
US11611659B2 (en) | 2020-02-03 | 2023-03-21 | Afiniti, Ltd. | Techniques for behavioral pairing in a task assignment system |
EP4088186A1 (en) | 2020-02-04 | 2022-11-16 | Afiniti, Ltd. | Techniques for error handling in a task assignment system with an external pairing system |
CA3166786A1 (en) | 2020-02-05 | 2021-08-12 | Ain Chishty | Techniques for behavioral pairing in a task assignment system with an external pairing system |
CN115244554A (en) | 2020-02-05 | 2022-10-25 | 阿菲尼帝有限公司 | Techniques for sharing control of distributed tasks between an external pairing system and a task distribution system having an internal pairing system |
Family Cites Families (20)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4694483A (en) | 1986-06-02 | 1987-09-15 | Innings Telecom Inc. | Computerized system for routing incoming telephone calls to a plurality of agent positions |
US5036535A (en) * | 1989-11-27 | 1991-07-30 | Unifi Communications Corporation | Switchless automatic call distribution system |
US6222919B1 (en) | 1994-09-12 | 2001-04-24 | Rockwell International Corporation | Method and system for routing incoming telephone calls to available agents based on agent skills |
US5646987A (en) | 1994-12-22 | 1997-07-08 | Lucent Technologies Inc. | Dynamic reallocation of calls to agent groups |
US5619557A (en) | 1995-07-10 | 1997-04-08 | Rockwell International Corporation | Telephone switching system and method for controlling incoming telephone calls to remote agents and for collecting and providing call data |
US6055307A (en) | 1996-06-28 | 2000-04-25 | At&T Corp. | System and method for selecting agent destinations and monitoring calls made to network customers |
US5894512A (en) | 1996-07-26 | 1999-04-13 | Ncr Corporation | Method and apparatus for routing voice and video calls to a group of agents |
US6064667A (en) | 1997-02-10 | 2000-05-16 | Genesys Telecommunications Laboratories, Inc. | Apparatus and methods enhancing call routing to and within call centers |
US6744878B1 (en) | 1999-03-02 | 2004-06-01 | Aspect Communications Corporation | Real-time transaction routing augmented with forecast data and agent schedules |
US6535600B1 (en) | 1999-12-06 | 2003-03-18 | Avaya Technology Corp. | System for automatically routing calls to call center agents in an agent surplus condition based on service levels |
US6553114B1 (en) | 1999-12-06 | 2003-04-22 | Avaya Technology Corp. | System for automatically predicting call center agent work time in a multi-skilled agent environment |
US6347139B1 (en) | 1999-12-06 | 2002-02-12 | Avaya Technology Corp. | System for automatically routing calls to call center agents in an agent surplus condition based on agent occupancy |
US6510221B1 (en) | 1999-12-06 | 2003-01-21 | Avaya Technology Corp. | System for automatically routing calls to call center agents in an agent surplus condition based on delay probabilities |
US6603854B1 (en) | 2000-02-25 | 2003-08-05 | Teltronics, Inc. | System and method for evaluating agents in call center |
US6546087B2 (en) | 2001-02-16 | 2003-04-08 | Siemens Information & Communication Networks, Inc. | Method and system for enabling queue camp-on for skills-based routing |
US6865267B2 (en) | 2001-11-27 | 2005-03-08 | Rockwell Electronic Commerce Corp. | Method and system for routing transactions in an automatic call distribution system based on non-voice dialog agent skill set |
US7127059B2 (en) | 2002-02-25 | 2006-10-24 | Genesys Telecommunications Laboratories, Inc. | System and method for integrated resource scheduling, task allocation and agent work management |
US6931119B2 (en) | 2002-08-30 | 2005-08-16 | Rockwell Electronic Commerce Technologies, L. L. C. | Apparatus and method for providing caller-specific data to agent station and for automatically launching corresponding application |
US7349535B2 (en) * | 2004-03-03 | 2008-03-25 | Cisco Technology, Inc. | Method and system for automatic call distribution based on location information for call center agents |
US20070133781A1 (en) * | 2005-12-12 | 2007-06-14 | Barbara Febonio | Method and system for automatic assignment of work units to agents |
-
2006
- 2006-06-02 US US11/421,846 patent/US7961866B1/en not_active Expired - Fee Related
-
2011
- 2011-05-25 US US13/115,297 patent/US8472609B1/en not_active Expired - Fee Related
-
2013
- 2013-06-07 US US13/912,663 patent/US9553989B1/en active Active - Reinstated
-
2017
- 2017-01-18 US US15/409,015 patent/US20170126893A1/en not_active Abandoned
Cited By (11)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN110177181A (en) * | 2016-12-30 | 2019-08-27 | 欧洲阿菲尼帝科技有限责任公司 | Technology for L3 pairing |
US11595522B2 (en) | 2016-12-30 | 2023-02-28 | Afiniti, Ltd. | Techniques for workforce management in a contact center system |
US11831808B2 (en) | 2016-12-30 | 2023-11-28 | Afiniti, Ltd. | Contact center system |
US20190335038A1 (en) * | 2018-04-30 | 2019-10-31 | Aurelio Luis Miguel ALONSO Y CALOCA | Contact center system and methods for handling voice and data teleservices through mobile devices |
US11082562B2 (en) * | 2018-04-30 | 2021-08-03 | Aurelio Luis Miguel ALONSO Y CALOCA | Contact center system and methods for handling voice and data teleservices through mobile devices |
US11785144B2 (en) | 2018-04-30 | 2023-10-10 | Aurelio Luis Miguel ALONSO Y CALOCA | Methods for handling voice and data teleservices through mobile devices with asynchronous communication |
CN110213450A (en) * | 2019-05-14 | 2019-09-06 | 长沙手之声信息科技有限公司 | Based on polycentric sign language online customer service allocation management method, apparatus and system |
CN111277712A (en) * | 2019-07-11 | 2020-06-12 | 上海联逾信息技术有限公司 | Telephone calling-out system based on language type classification processing |
CN111277713A (en) * | 2019-07-11 | 2020-06-12 | 上海联逾信息技术有限公司 | Customer service switching system based on telephone call |
CN111147675A (en) * | 2019-12-05 | 2020-05-12 | 商客通尚景科技(上海)股份有限公司 | Shunting method and device for cloud call center telephone |
CN112188012A (en) * | 2020-09-15 | 2021-01-05 | 中信银行股份有限公司 | Method and device for establishing customer service session, electronic equipment and readable storage medium |
Also Published As
Publication number | Publication date |
---|---|
US9553989B1 (en) | 2017-01-24 |
US8472609B1 (en) | 2013-06-25 |
US7961866B1 (en) | 2011-06-14 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US9553989B1 (en) | Method and computer readable medium for geographic agent routing | |
US8731179B1 (en) | System for geographic agent routing | |
KR101054788B1 (en) | Method, device, and system for selecting a color ring back tone | |
US6542748B2 (en) | Method and system for automatically initiating a telecommunications connection based on distance | |
US6542749B2 (en) | Method and system for connecting proximately located mobile users based on compatible attributes | |
US6539232B2 (en) | Method and system for connecting mobile users based on degree of separation | |
US6249815B1 (en) | Method and apparatus for building subscriber service profile based on subscriber related data | |
US9036803B2 (en) | System and method for providing advanced call forwarding functionality | |
US7184540B2 (en) | Personality based matching of callers to agents in a communication system | |
US6504920B1 (en) | Method and system for initiating conversations between callers having common interests | |
US20020107008A1 (en) | Method and system for selectively connecting mobile users based on physical proximity | |
EP0802664A2 (en) | System and method for controlling and monitoring communication between customers and customer service representatives | |
USRE43205E1 (en) | Skill based chat function in a communication system | |
CN102546985A (en) | Calling method of calling system | |
US20020099670A1 (en) | Call originator access control through user-specified pricing mechanism in a communication network | |
CN107222646A (en) | call request distribution method and device | |
US20070115923A1 (en) | Methods, apparatus and computer program products for secondary routing of calls in a voice over internet protocol communication system | |
US20060270405A1 (en) | Method and system for database content security in directory assistance & information services systems | |
US20110034152A1 (en) | Method and apparatus for using mobility information to select profiles in network systems | |
US8983056B2 (en) | Communication system and call connecting method thereof | |
US20020078042A1 (en) | System and method for determining affinity relationships | |
US8184782B1 (en) | Method and apparatus for processing voice calls | |
US20070086436A1 (en) | Methods, apparatus and computer program products for allowing access to line groups and line group functions in a voice over internet protocol communication system | |
US20070263784A1 (en) | Automated voice answering system correlated to user calendar to provide telephone voice responses based upon user schedule | |
US20090310769A1 (en) | Method and apparatus for a processing of calls in a telecommunications system |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
STCB | Information on status: application discontinuation |
Free format text: ABANDONED -- FAILURE TO RESPOND TO AN OFFICE ACTION |
|
AS | Assignment |
Owner name: ALORICA INC, CALIFORNIA Free format text: MERGER;ASSIGNOR:ALORICA BUSINESS SOLUTIONS LLC;REEL/FRAME:051661/0664 Effective date: 20191231 Owner name: ALORICA INC., CALIFORNIA Free format text: MERGER;ASSIGNOR:ALORICA BUSINESS SOLUTIONS LLC;REEL/FRAME:051661/0664 Effective date: 20191231 |