Check patentability & draft patents in minutes with Patsnap Eureka AI!

Call routing algorithm based on multi-dimensional queue model

A multi-dimensional, queuing technology, applied in the field of call routing algorithm based on multi-dimensional queuing model, can solve the problems of uneconomical call center, multi-level calculation, large investment, etc., to reduce computational complexity, improve efficiency, and reduce dependence. Effect

Active Publication Date: 2012-06-27
JIANGSU ELECTRIC POWER INFORMATION TECH +1
View PDF2 Cites 11 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

At present, the call routing of the call center system is often implemented by designing a complex routing analysis process, which has many calculation levels, requires high hardware resources of the system, and requires a large investment.
With this method, it is very uneconomical for some medium-sized call centers

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Call routing algorithm based on multi-dimensional queue model
  • Call routing algorithm based on multi-dimensional queue model
  • Call routing algorithm based on multi-dimensional queue model

Examples

Experimental program
Comparison scheme
Effect test

Embodiment Construction

[0029] The preferred embodiments of the present invention will be described in detail below in conjunction with the accompanying drawings.

[0030] A call routing algorithm based on a multi-dimensional queue model. First, a group of queues are combined in the processor according to the dimension of routing judgment conditions, and agent groups are formed according to different agent skills. Each agent group is associated with each queue one by one. The weights form an associated weight matrix; the phone call information is then fed into a processor for processing.

[0031] figure 2 It is a routing schematic diagram based on the multi-dimensional queue model. From the realization of the routing algorithm, three parts are set in the processor: incoming call judgment, queue queuing, and routing judgment. The routing process is as follows: image 3 As shown, the specific steps are as follows:

[0032] 1) Incoming call judgment. Incoming call judgment Analyze and judge the inco...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a call routing algorithm based on a multi-dimensional queue model. The call routing algorithm comprises the steps of: firstly, combining a group of queue in a processor according to routing judgment condition dimensions, constituting a seat group according to different seat skills, and constituting a relevance weight matrix by using the weights of the one-to-one relevance of each seat group and each queue; and then, inputting telephone call information into a processor and processing the telephone call information. The call routing algorithm specifically comprises the following steps of: putting telephone calling information into different queues one by one for queuing according to call characteristics; carrying out the queuing of the telephone call information according to a first-in first-out rule in each queue; sequentially extracting the telephone call information of the queue head of each queue according to a sort order of the queue; selecting the seat group, with a maximum relevance weight, corresponding to the queue of the telephone call information of the queue head according to the relevance weight matrix; and selecting an idle seat for answering the call in the seat group. According to the invention, the call routing efficiency of a call center under a complex condition can be increased, and the dependence degree of the call center on hardware resources is lowered.

Description

technical field [0001] The invention relates to a call center technology, in particular to a call routing algorithm based on a multi-dimensional queue model. Background technique [0002] Call center system, also known as customer service system, is a comprehensive information system based on computer and telephone integration (CTI), communication, network, database and other technologies. Its purpose is to quickly answer customer calls, E-mail, Web and other media calls, accept and handle customer inquiries, repairs, complaints and other service business. At present, large enterprises or public service industries have built their own call centers. In the actual operation of the call center, it is often necessary to provide layered services. The so-called hierarchical service refers to providing different levels of differentiated services for different customer groups and business demands according to the needs of enterprises. [0003] A fast routing algorithm is very cri...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
IPC IPC(8): H04M3/523H04L12/56H04L47/6275
Inventor 费建法邹云峰刘凤华
Owner JIANGSU ELECTRIC POWER INFORMATION TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More