KR102070918B1 - Method and Server for compulsive allocation of car considering driver's fatigue - Google Patents

Abstract

According to a preferred embodiment of the present invention, a method of performing forced allocation of a vehicle in consideration of fatigue of a driver comprises: a storage step of accumulating and storing the driving distance, a driving route, driving time, and driving itinerary information of each of at least one driver in a database unit as a driving history; and a step of forcibly allocating, in an allocation request allocating unit, each allocation request received from at least one passenger to each of the at least one driver by referring to the driving history of each of the at least one driver.

Description

Method and Server for compulsive allocation of car considering driver's fatigue}

The present invention relates to a method of forcibly arranging a vehicle to provide a transportation service. In more detail, the present invention relates to a method of considering a driver's fatigue when forcing a vehicle.

In general, in order to use a transportation service, a user calls a taxi in a tolerant state on the road and gets on, or rides a taxi which is allocated through a call center.

When requested by the user, the call center checks the user's location or origin and destination, and provides the user's information to terminals installed in a plurality of taxis through the communication network. The taxi driver refers to the user's information output to the terminal, transfers the intention to provide the service to the call center, and then moves to the user's location or starting point.

In recent years, a method of calling a taxi by transmitting information about a user's location or origin and destination through a mobile / portable terminal possessed by the user to a server has been studied.

KR 1583301

In a preferred embodiment of the present invention, a forced dispatch method and a forced dispatch server for performing a dispatch in consideration of the article fatigue degree is proposed.

As a preferred embodiment of the present invention, the forced dispatch server considering the article fatigue degree accumulates and stores the driving distance, the driving route, the operating time and the traveling itinerary information of each of the at least one driver in the driving history, and the driving itinerary information is a driving process. A database unit including information on traffic accidents, lost and found information, route detour information, stopover information, destination change, passenger and driver's contention information, and starting and destination information from at least one passenger. A dispatch request allocating unit for receiving at least one dispatch request and forcibly assigning each of the received dispatch requests to each of the at least one article; the dispatch request assigning unit forcing the dispatch request to each of the at least one article. Refer to the driving history of each of the at least one article when assigning And that is characterized.

As a preferred embodiment of the present invention, the forced dispatch server considering the article fatigue degree controls the balance of the long distance call and the short distance call based on the driving history of each driver.

As a preferred embodiment of the present invention, the database unit of the forced dispatch server considering the article fatigue degree call classification unit for classifying each of the driving route into a long distance call and a short distance call based on the driving distance; A counting unit for recording the number of the long distance call and the number of the short distance call for each of the at least one article; And a travel time calculator configured to calculate a accumulated travel time for each of the at least one article.

In a preferred embodiment of the present invention, the dispatch request allocating unit is configured to calculate an average value of the long distance call counts and the average value of the short distance call counts based on the number of the long distance calls and the short distance calls recorded in the counting unit. An average value calculator for calculating; And an article classification unit for classifying articles in which the number of long-distance calls exceeds the average value of the long-distance call count among the at least one article. In this case, the dispatch request assigning unit is a long-distance call. The long distance call is assigned to the at least one article other than the articles classified by the article classification unit.

In a preferred embodiment of the present invention, the dispatch request allocating unit is forcibly allocating the dispatch request to at least one driver whose accumulated travel time calculated by the travel time calculation unit is less than a predetermined value.

As a preferred embodiment of the present invention, the counting unit constituting the database unit records the number of the long-distance call and the number of the short-range call based on the first period, and the running time calculation unit constituting the database unit based on the second period The cumulative driving time is calculated, and when the long distance call is more than a predetermined number of times within the second period, the cumulative running time is calculated by giving a weight greater than 1 to the accumulated running time, and the first period and the second period are It is characterized by setting the same or different.

In a preferred embodiment of the present invention, the dispatch request allocating unit assigns an identification number and a predetermined fatigue score to each piece of information included in the journey itinerary trip section; and the at least one at the trip journey section. And a journey journey fatigue calculation unit that accumulates and manages fatigue scores assigned to each of the articles of travel, wherein the dispatch request allocating unit is based on the fatigue scores of each of the at least one article accumulated during a third period. The allocation request is forcibly allocated, and if the fatigue score is high, the allocation request except for a long distance call is allocated.

According to another preferred embodiment of the present invention, a method of performing forced dispatch in a forced dispatch server considering a road fatigue may include a driving distance, a travel path, a travel time, and a travel itinerary information of at least one driver in a database. Accumulating and storing, wherein the driving itinerary information indicates information generated during the driving process, and includes traffic accident information, lost and found information, route detour information, stopover information, destination change, passenger and driver's quarrel information; And receiving at least one or more dispatch requests including departure and destination information from at least one or more passengers in the dispatch request allocating unit, and forcibly assigning each of the received dispatch requests to each of the at least one driver. The requesting unit may refer to the driving history of each of the at least one article in the forcibly allocating step.

In another preferred embodiment of the present invention, each of the at least one article in the forced dispatch server considering the article fatigue degree each time when receiving the forcibly allocated allocation request from the dispatch request allocation unit using a rental car rental service including a driver The rental agreement is made through acceptance of the terms and conditions, in which case the article is characterized in that it operates a vehicle of 11 seats or more.

As a preferred embodiment of the present invention, the forced dispatch method in consideration of the fatigue of the driver has an effect that can protect the driver from overwork and provide a good driving service.

In addition, since the quality of the driving service may vary according to the fatigue of the driver, the safety of the forced dispatch system can be increased by inferring the fatigue of the driver through data analysis and forcing the vehicle based on the fatigue.

1 is a preferred embodiment of the present invention, showing a forced dispatch server for performing a forced dispatch in consideration of the fatigue of the driver.
2 is a diagram illustrating an internal configuration of a forced dispatch server that performs forced dispatch as a preferred embodiment of the present invention.
3 is a diagram illustrating an example of processing information of a database in a forced dispatch server according to a preferred embodiment of the present invention.
4 to 5 show an example of storing the driving history of the driver as a preferred embodiment of the present invention.
6 illustrates an example of calculating a travel journey fatigue diagram as a preferred embodiment of the present invention.
7 illustrates an example of an interface for inputting driving itinerary information according to an exemplary embodiment of the present invention.
8 to 9 illustrate a flow chart of a method of performing forced dispatch in a forced dispatch server in consideration of the fatigue degree as a preferred embodiment of the present invention.

DETAILED DESCRIPTION Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings so that those skilled in the art may easily implement the present invention. As those skilled in the art would realize, the described embodiments may be modified in various different ways, all without departing from the spirit or scope of the present invention. In the drawings, parts irrelevant to the description are omitted in order to clearly describe the present invention, and like reference numerals designate like parts throughout the specification.

Throughout the specification, when a part is "connected" to another part, it includes not only "directly connected" but also "electrically connected" with another element in between. . In addition, when a part is said to "include" a certain component, this means that it may further include other components, except to exclude other components unless otherwise stated.

1 is a preferred embodiment of the present invention, showing a forced dispatch server for performing a forced dispatch in consideration of the fatigue of the driver.

The forced dispatch server illustrated in FIG. 1 includes a forced dispatch server 120, at least one terminal 100, 101, 102 used by at least one passenger, and at least one terminal 110 used by a driver of a vehicle providing a driving service. , 111, 112).

An example of at least one terminal (100, 101, 102) used by the passenger and at least one terminal (110, 111, 112) used by the driver of the vehicle includes a terminal capable of installing an application. The terminals 110, 111, and 112 are 3G, 4G, and 5G terminals, smart phones, smart pads, tablet PCs, personal communication systems, and global systems for GSM. Mobile communications (PDC), Personal Digital Cellular (PDC), Personal Handyphone System (PHS), Personal Digital Assistant (PDA), International Mobile Telecommunication (IMT) -2000, Code Division Multiple Access (CDMA) -2000, W-CDMA (W- It may include all kinds of wireless communication devices such as Code Division Multiple Access (WDI), Wireless Broadband Internet (Wibro), handheld devices, wearable devices, and the like.

The terminal may be a camera or an image input unit for inputting a video signal, a microphone or audio input unit for inputting an audio signal, a user input unit for receiving information from a user, for example, a touch key or a push key. mechanical keys), and the like. Voice data or image data collected by the input unit may be analyzed and processed as a passenger control command. The terminal may also include a sensing unit. The sensing unit may include one or more sensors for sensing at least one of information in the mobile terminal, surrounding environment information surrounding the mobile terminal, and user information. For example, the sensing unit may include a proximity sensor, an illumination sensor, a touch sensor, an acceleration sensor, a magnetic sensor, a gravity sensor, and a gyro. Scope sensor (gyroscope sensor), motion sensor (motion sensor), RGB sensor, infrared sensor (IR sensor: infrared sensor), fingerprint scan sensor (finger scan sensor), ultrasonic sensor (ultrasonic sensor), optical sensor (example) For example, cameras, microphones, battery gauges, environmental sensors (e.g. barometers, hygrometers, thermometers, radioactivity sensors, heat sensors, gas sensors, etc.), chemical sensors (e.g. For example, the electronic nose, a health care sensor, a biometric sensor, and the like may be included. The terminal also includes a GPS sensor. Meanwhile, the mobile terminal disclosed herein may utilize a combination of information sensed by at least two or more of these sensors.

As a preferred embodiment of the present invention, a vehicle providing a driving service includes various types of vehicles, rental cars, taxis, and the like, and may further include a rental car type including an driver. As a preferred embodiment of the present invention, the driving service means a service for moving a passenger from a departure point to a destination, and further includes a passenger transportation service made through a short-term rental agreement between a car rental company and a rider. In another preferred embodiment of the present invention, the driver includes a driver who drives a vehicle and a driver who rents a car and provides a ride service.

As a preferred embodiment of the present invention, the forced dispatch server checks the location or the departure and destination of the passenger in the forced dispatch server 120, when there is a request for dispatch from at least one passenger, providing a service through the communication network The vehicle is forcibly dispatched to the terminals 110, 111, and 112 of the driver of the vehicle.

When the forced dispatch server 120 receives a dispatch request including the origin and destination requested by the passenger, regardless of the driver's intention of providing the service, the forced dispatch server 120 dispatches the dispatch request to the waiting driver forcing the passenger to refrain from boarding the passenger. It can provide reliable service without harm. However, in the case of a driver, when a mandatory allocation request is operated, fatigue may accumulate, such as a case where only a long distance call is continuously arranged or an accident occurs during the journey.

In a preferred embodiment of the present invention will be described with respect to the forced dispatch method considering the fatigue of each article in order to solve such problems that may occur to the article.

Figure 2 is a preferred embodiment of the present invention, showing the internal configuration of the forced dispatch server to perform the dispatch optimization in consideration of the closing time of the driver.

As a preferred embodiment of the present invention, the forced dispatch server 200 includes a database unit 210 and the dispatch request allocating unit 260.

The database unit 210 accumulates and stores the driving distance 200a, the driving route 200b, the driving time 200c, and the driving itinerary information 200d of each of the at least one article as a driving history. ). An example of the driving history storage unit 220 is described with reference to FIGS. 4 to 5. Referring to FIG. 4, the driving history storage unit 220 may operate in the time unit 430a or 430b, the daily unit 420, 420a, 420b or 420c, the weekly unit, or the monthly unit 410 or 430. It can store and manage the driving time, the driving passenger, the driving route including the departure place and the destination, the sales amount, etc.

In addition, referring to FIG. 5, the driving history storage unit 220 includes information 511 of each driver, vehicle information 512 of each driver, driving distance 513 for each driving route, driving time 514, Evaluation (515), map information (520) showing the distance traveled, time information (531, 532, 533) passengers boarded, information on the departure point (532) and destination (533), fare details (540), car rental contract The information 550 may be accumulated and stored for each driving route.

The driving itinerary information 200d indicates information generated during the driving process, and includes traffic accident information, lost and found information, route detour information, stopover information, destination change, and passenger and driver quarrel information. The driving history storage unit 220 provides an interface 700 for inputting driving itinerary information to the terminal of each driver in the forced dispatch server 200 as in the exemplary embodiment shown in FIG. 7, and each driving route. The driving itinerary information 200d may also be managed by a method 701 to 708 for receiving the driving itinerary information every time.

As a preferred embodiment of the present invention, the forced dispatch server 200 may further include a dispatch request receiver 240 and a dispatch request analyzer 250.

The dispatch request receiver 240 receives at least one dispatch request including source and destination information from at least one passenger. The dispatch request analysis unit 250 transmits the dispatch request received from the dispatch request receiver 240 to at least one article based on the driving history information of each of at least one article accumulated and stored in the travel history storage unit 220. Forced dispatch

As another preferred embodiment of the present invention, the database unit 210 may also include a call classification unit 232, a counting unit 234, a running time calculation unit 236, a driving journey reference unit 238 and a traveling journey fatigue. The calculator 239 is further included, and the travel time calculator 236 may further include a weight reflecting unit 237.

The call classification unit 232 classifies each of the driving paths 200b into a long distance call and a short distance call based on the driving distance 200a for each of the driving paths 200b stored in the driving history storage unit 220.

The counting unit 234 records the number of long-distance calls and the number of short-range calls classified by the call classification unit 232 for each of the at least one article during the first period.

The travel time calculator 236 calculates the accumulated travel time for each of the at least one driver. In this case, the running time calculator 236 may calculate the accumulated running time on a daily basis, a weekly basis, a monthly basis, or an annual basis, and may also calculate the accumulated running time for an arbitrary section according to a setting.

The weight reflecting unit 237 calculates the accumulated running time for each article for a second period. If the long distance call is more than a predetermined number of times within the second period, the weight reflecting unit 237 weights more than one to the accumulated running time of each article. Calculate by In this case, the second period set by the weight reflecting unit 237 may be the same as or different from the first period set by the counting unit 234.

The driving journey participation unit 238 assigns a fatigue score to each piece of information included in the driving journey information according to an identification number and a predetermined criterion as shown in FIG. 7. For example, in the case of a traffic accident 701, detailed items constituting travel itinerary information such as +30, +20, and +10 in the upper, middle, and lower cases according to ID1 and the degree of the traffic accident (701 to 708) Give each one an identification number and a fatigue score. The preset criteria may be set in consideration of the time, cost, etc. required to resolve the corresponding trip itinerary information.

The driving journey fatigue calculation unit 239 accumulates and manages, in chronological order, fatigue scores assigned to each of the driving paths to each of the at least one driver in the driving journey taking part 238. For example, if there were three trips by 3 pm on August 13, the fatigue score was +5 for the first route, the fatigue score was +3 for the second route, and the fatigue score was +3. For 35, the fatigue score until 3 pm on August 13 is calculated as +43. It should be noted, however, that the fatigue scores accumulated and managed by the driving journey fatigue calculation unit 239 may be in units of days, weeks, months, and years, and may be managed by setting an arbitrary section as necessary.

Referring to the exemplary embodiment of the driving itinerary fatigue calculation unit 239, the train route from the Starbucks Samsung City Airport Branch 620 to the Baskin Robbins Nakseong Band 630 is operated near Maebong Station. In the case of a contact accident, the driver may input a journey itinerary item using the interface illustrated in FIG. 7. In this case, a predetermined fatigue score '+25' may be given by the driving journey taking part 238 (650).

If the passenger changes the route during the operation near the Seoul Arts Center during the resumption of operation, the driver may enter the journey itinerary item while inputting the change destination 640 'Seoseo Station' in his terminal at the corresponding point. In this case, a predetermined fatigue score '+5' may be given (652).

The driver may also enter a journey itinerary at that point if the passenger stops in the middle of the route. In this case, a predetermined fatigue score '+3' may be given (654). In this case, the driving journey fatigue calculation unit 239 may calculate the fatigue degree in the corresponding driving route as +33.

In this case, the dispatch request allocating unit 260 forcibly allocates the dispatch request received from the passenger based on the fatigue scores of the articles accumulated for a certain period of time, and allocates the dispatch request except the long distance call in the case of a high fatigue score. can do.

In addition, the dispatch request allocator 260 may forcibly allocate the dispatch request only to at least one driver whose accumulated running time is less than a predetermined value.

As a preferred embodiment of the present invention, the dispatch request allocating unit 260 may further include an average value calculator 262 and an article classification unit 264.

The average value calculator 262 calculates an average value of long distance call counts and an average value of short distance call counts based on the number of long distance calls per article and the number of short distance calls recorded in the counting unit 234. In this case, the average value calculator 262 may set a schedule to calculate the average value of the long distance call count and the average value of the short distance call count for a predetermined period.

The article classification unit 264 classifies articles having a high degree of fatigue as articles having a high fatigue rate, wherein the number of long-distance calls among the at least one article in the queue exceeds the average value of the long-distance call count calculated by the average value calculator 262 by a predetermined ratio or more. In this case, the dispatch request allocating unit 260 receives the long distance received from the passenger to at least one driver who is not an article classified as a high fatigue article by the article classification unit 264 when the dispatch request received from the passenger is a long distance call. Allocate a call

Referring to FIG. 3, the database unit 300 may manage a table in the form shown in FIG. 3 for waiting articles or a group of scheduled articles, or the entire article, and may be specified for each article 310 and 320. The operating hours 330 and 340, the long distance call recovery 350, the short distance call recovery 360 and the cumulative driving distance 370 during the periods 331, 341, 351, 361 and 371 may be managed.

The database unit 300 may calculate the average value of the long distance call counts, the average value of the short distance call counts, the average travel time value, and the average travel distance value by using the information in the form of a table shown in FIG. 3. The dispatch request allocating unit 260 may forcibly allocate the dispatch request to each driver who is waiting for the dispatch request based on the data of FIG. 3 or information obtained by processing the data.

FIG. 8 is a flowchart illustrating a method of performing forced dispatch in a forced dispatch server in consideration of an article fatigue diagram as a preferred embodiment of the present invention.

The database unit accumulates and stores the driving distance, the driving route, the driving time, and the driving itinerary information of each of the at least one article in the driving history (S810).

The dispatch request allocator receives at least one dispatch request including departure and destination information from at least one passenger (S820). Then, the dispatch request allocating unit forcibly allocates each of the received dispatch requests by referring to the driving history of each of the at least one driver waiting (S830).

FIG. 9 is a flowchart illustrating a forced dispatch method in which a dispatch request allocator of a forced dispatch server taking into account fatigue fatigue is used as a preferred embodiment of the present invention.

In the classification unit of the database unit, which accumulates and stores the driving history, each driving route provided by the driver based on the driving distance is classified into a long distance call and a short distance call (S910). The counting unit records the number of long-distance calls and the short-range call for each article (S920), and the average value calculating unit waits for the articles based on the number of long-distance calls and the short-range calls recorded for each article recorded in the counting unit. The average value of the long distance call times and the short distance call times for the article group or the entire article is calculated (S930).

The article classification unit classifies articles having a high number of long-distance calls among at least one article exceeding the average value of long-distance call counts as high-fatigue articles (S940), and the driving route allocator is a long-distance call received from a passenger. In this case, the article classification unit forcibly allocates the long-distance call to at least one article in the queue other than the article classified as a high fatigue article (S950).

One embodiment of the present invention can also be implemented in the form of a recording medium containing instructions executable by a computer, such as a program module executed by the computer. Computer readable media can be any available media that can be accessed by a computer and includes both volatile and nonvolatile media, removable and non-removable media. In addition, computer readable media may include both computer storage media and communication media. Computer storage media includes both volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data. Communication media typically includes computer readable instructions, data structures, program modules, or other data in a modulated data signal such as a carrier wave, or other transmission mechanism, and includes any information delivery media.

Although the methods and systems of the present invention have been described in connection with specific embodiments, some or all of their components or operations may be implemented using a computer system having a general purpose hardware architecture.

The above description of the present invention is intended for illustration, and it will be understood by those skilled in the art that the present invention may be easily modified in other specific forms without changing the technical spirit or essential features of the present invention. will be. Therefore, it should be understood that the embodiments described above are exemplary in all respects and not restrictive. For example, each component described as a single type may be implemented in a distributed manner, and similarly, components described as distributed may be implemented in a combined form.

The scope of the present invention is shown by the following claims rather than the above description, and all changes or modifications derived from the meaning and scope of the claims and their equivalents should be construed as being included in the scope of the present invention. do.

Claims (11)

The driving distance, driving route, driving time and driving itinerary information of each of the at least one article are accumulated and stored in the driving history, and the driving itinerary information indicates information generated during the driving process, and traffic accident information, lost and found information, and route detour information. A database unit including detailed information on the way off, stopover information, destination change, and quarrel between passengers and drivers; and
A dispatch request allocator configured to receive at least one dispatch request including starting and destination information from at least one passenger, and forcibly allocating each received dispatch request by referring to the driving history of each of the at least one driver who is waiting; Including,
The database unit
The trip itinerary part which gives an identification number and a predetermined fatigue score to the said detail item; And the itinerary fatigue fatigue calculation part which accumulates and manages the fatigue score which the said at least one article has given to each of the said path | route. And further comprising, in this case, the dispatch request allocating unit forcibly performs the dispatch based on the cumulative fatigue score,
The terminal of each of the at least one article is provided with an interface for inputting the driving itinerary information including the details, and each of the at least one article uses the interface for each driving route. If selected, the dispatch server in consideration of the article fatigue degree, characterized in that the fatigue scores given to the sub-items and the sub-items displayed on each terminal of the at least one article. The method of claim 1, wherein the database unit
A call classification unit classifying each of the travel paths into long distance calls and short distance calls based on the travel distances;
A counting unit for recording the number of long-distance calls and short-range calls classified by the call classification unit for each of the at least one article;
Forced dispatch server in consideration of the article fatigue road comprising a; time calculation unit for calculating the running time accumulated for each of the at least one article. According to claim 2, wherein the allocation request allocation unit
An average value calculator for calculating an average value of long distance call counts and an average value of short distance call counts based on the number of long distance calls and the number of short distance calls recorded in the counting unit; And
And an article classification unit for classifying articles in which the number of long-distance calls of the at least one article exceeds an average value of the long-distance call counts.
And the dispatch request allocator allocates the long distance call to the at least one article other than the articles classified by the article classification unit when the dispatch request is a long distance call. According to claim 2, wherein the allocation request allocation unit
Forced dispatch server in consideration of the article fatigue diagram, characterized in that forcibly allocating the dispatch request to at least one article that the accumulated running time calculated by the running time calculation unit is less than a predetermined value. The method of claim 2,
The counting unit records the number of the long-distance call and the number of the short-range call on the basis of the first period,
The running time calculating unit calculates the accumulated running time on the basis of the second period, and when the long distance call is more than a predetermined number of times within the second period, calculates by giving a weight greater than 1 to the accumulated running time. And the first period and the second period are configured to be the same or different. The method of claim 5, wherein the allocation request allocation unit
Forced dispatch server in consideration of the article fatigue diagram, characterized in that forcibly allocating the dispatch request to at least one article that the accumulated running time calculated by the running time calculation unit is less than a predetermined value. delete According to claim 1, wherein the allocation request allocation unit
Forced allocation of the dispatch request based on the fatigue score of each of the at least one article accumulated during the third period, and when the fatigue score is high, the article fatigue road, characterized in that for allocating the dispatch request excluding long distance call Forced dispatch server taking into account. As a method of performing forced dispatch in the forced dispatch server considering the article fatigue,
The database unit accumulates and stores the driving distance, the driving route, the driving time, and the driving itinerary information of each of the at least one article as a driving history, and the driving itinerary information indicates information generated in the driving process, traffic accident information, lost and found information, A storage step including route detour information, way off information, destination change, passenger and driver's contention information, and the like as detailed items; And
And forcibly allocating each of the dispatch requests received from the at least one passenger by the dispatch request allocator to each of the at least one driver waiting by referring to the driving history of each of the at least one article.
The database may include a trip itinerary part for giving an identification number and a predetermined fatigue score to the sub-item; and a trip itinerary that accumulates and manages the fatigue scores assigned to each of the at least one driver by the travel itinerary part. And a fatigue calculation unit; in this case, the dispatch request allocating unit forcibly performs the dispatch based on the cumulative fatigue score,
When each terminal of each of the at least one article is provided with an interface for inputting the driving itinerary information including the details, and each of the at least one article selects the details through the interface for each driving route The selected sub-item and the fatigue score given to the sub-item are displayed on each terminal of the at least one article. The method of claim 9,
The database unit includes a classification unit, a count unit, an average value calculation unit, and an article classification unit, and the database unit is configured through a processor.
Classifying each of the driving routes into a long distance call and a short range call based on the driving distance by the classification unit;
Recording the number of long distance calls and the number of short distance calls for each of the at least one article in the counting unit;
Calculating an average value of a long distance call count and an average value of a short distance call count based on the number of the long distance call and the number of the short distance call recorded in the count unit in the average value calculator; And
And classifying articles in which the number of long-distance calls out of the at least one article exceeds the average value of the long-distance call counts in the article classification unit,
In this case, the dispatch request allocator allocates the long distance call to the at least one article other than the articles classified by the article classification unit when the dispatch request is a long distance call. delete

Images