Dispatch system, dispatch method and dispatch program

Abstract

To provide a dispatch system capable of selecting candidates to be dispatched from a group of multiple candidates that include at least one of staff and vehicle and dispatching the same according to a request from a requesting person, and automatically changing selection criteria to achieve set goal while selecting candidates properly according to individual requests, a dispatch method. and a dispatch program.SOLUTION: A dispatch system 1 includes: a dispatch planning unit 33 that selects candidates for dispatch from among the candidates capable of meeting the request based on predetermined evaluation criteria; a dispatch result acquisition unit 35 that acquires dispatch results of the dispatching selected candidates; an actual value calculation unit 36 that calculates the actual value for at least one indicator based on dispatch result in a predetermined period; and an updating unit 38 that changes the evaluation criteria based on the actual values.SELECTED DRAWING: Figure 1

Description

[Technical Field]

[0001] The present disclosure relates to a dispatch system, a dispatch method, and a dispatch program for dispatching staff and vehicles based on a request from a requester. [Background technology]

[0002] A service that dispatches staff to deal with troubles at the request of users of automobiles, etc., known as road service, is widely available. In such road service, it is required to quickly dispatch staff who can deal with the trouble to the location of the request (hereinafter referred to as the requested location).

[0003] Therefore, a technology is known in which staff who are in the vicinity of the requested location and who correspond to the nature of the problem are extracted as candidate staff, information on the candidate staff is sent to a terminal held by the requester, and the requester makes a selection (see Patent Document 1). [Prior art documents] [Patent documents]

[0004] [Patent Document 1] Japanese Patent Publication No. 2022-93731 Summary of the Invention [Problem to be solved by the invention]

[0005] However, in a dispatch system such as that described in Patent Document 1, the staff to be dispatched is selected by the requester, which may result in the total travel distance of the dispatched staff being long or the total cost of the dispatched staff being high.

[0006] Therefore, it is conceivable to set targets for the dispatch system, such as keeping the total travel distance within a specified range or keeping the total cost within a specified range, etc. However, it is not easy to achieve these targets while appropriately selecting the staff and vehicles to be dispatched in response to individual requests.

[0007] Therefore, the main purpose of the present disclosure is to automatically change the selection criteria to achieve set goals while appropriately selecting candidates in response to individual requests in a dispatch system, dispatch method, and dispatch program that selects and dispatches candidates to be dispatched from a group of candidates including at least one of staff and vehicles based on a request from a requester. [Means for solving the problem]

[0008] The dispatch system of the present disclosure is a dispatch system that selects a candidate to be dispatched from a candidate group consisting of a plurality of candidates including at least one of staff and vehicles based on a request from a requester and dispatches the candidate, a computer having a processor and a memory unit, the processor being able to execute a corresponding program; a dispatch planning unit that selects the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; It functions as a dispatch result acquisition unit that acquires a dispatch result by dispatching the selected candidate; It functions as a performance value calculation unit that calculates a performance value for at least one index based on the dispatch results for a predetermined period of time; and a target range acquisition unit that acquires a target range for the actual performance value, so that the future actual performance value falls within the target range. an update unit for changing the evaluation criteria; function as The composition is as follows.

[0009] The dispatch method of the present disclosure is a dispatch method for selecting a candidate to be dispatched based on a request from a candidate group including at least one of staff and vehicles, and dispatching the candidate, In a computer including a processor and a storage unit, the processor a step of selecting the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; a step of obtaining dispatch results by dispatching the selected candidate; and a step of calculating an actual value for at least one indicator based on the dispatch results for a predetermined period of time. obtaining a target range for the performance value; and determining whether the future performance value falls within the target range. and a step of changing the evaluation criteria.

[0010] The dispatch program of the present disclosure is a dispatch program that selects a candidate to be dispatched from a candidate group consisting of a plurality of candidates including at least one of staff and vehicles based on a request from a requester and dispatches the candidate, A computer includes a processor and a storage unit, and the processor a step of selecting the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; a step of obtaining dispatch results by dispatching the selected candidate; and a step of calculating an actual value for at least one indicator based on the dispatch results for a predetermined period of time. obtaining a target range for the performance value; and determining whether the future performance value falls within the target range. and a step of changing the evaluation criteria. [Effects of the Invention]

[0011] According to the present disclosure, in a dispatch system, dispatch method, and dispatch program that selects one to be dispatched from a plurality of candidates including at least one of staff and vehicles based on a request from a requester, and dispatches the selected candidate, the selection criteria can be automatically changed to achieve set goals while appropriately selecting candidates in response to individual requests. [Brief explanation of the drawings]

[0012] [Figure 1] 1 is a diagram illustrating the overall configuration of a dispatch service to which a dispatch system according to the present embodiment is applied. [Figure 2] Schematic diagram showing an example of the placement of dispatching agencies [Figure 3] Flow diagram showing the request response process in the dispatch system [Figure 4] Dispatch server configuration diagram [Figure 5] Dispatch system functional block diagram [Figure 6] Flow diagram showing the dispatch process [Figure 7] Flow diagram showing the flow of update processing DETAILED DESCRIPTION OF THE INVENTION

[0013] The first invention made to solve the above problem is a dispatch system that selects a candidate to be dispatched from a candidate group consisting of a plurality of candidates including at least one of staff and vehicles based on a request from a requester, and dispatches the candidate, a computer having a processor and a memory unit, the processor being able to execute a corresponding program; a dispatch planning unit that selects the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; It functions as a dispatch result acquisition unit that acquires a dispatch result by dispatching the selected candidate; It functions as a performance value calculation unit that calculates a performance value for at least one index based on the dispatch results for a predetermined period of time; and a target range acquisition unit that acquires a target range for the actual performance value, so that the future actual performance value falls within the target range. an update unit for changing the evaluation criteria; function as The composition is as follows.

[0014] This allows the evaluation criteria for selecting candidates to be dispatched to be changed based on performance values, making it possible to automatically change the evaluation criteria when desired performance is not achieved. This makes it possible to select candidates appropriately according to individual requests while automatically changing the selection criteria to achieve set goals.

[0015] The second invention is 、 The update unit is configured to change the evaluation criterion when the performance value is outside the target range.

[0016] This allows the evaluation criteria for selecting candidates to be dispatched to be changed when performance values ​​fall outside the target range, so that the selection criteria can be automatically changed to achieve the target while selecting candidates appropriately according to individual requests.

[0017] In a third aspect of the present invention, the dispatch planning unit calculates an evaluation value serving as the evaluation criterion for each of the candidates, and selects one to be dispatched based on the evaluation value.

[0018] This allows easy selection of the combination to be dispatched.

[0019] In addition, in a fourth invention, the dispatch planning unit is configured to obtain item values ​​corresponding to each of a plurality of items for the candidate, and calculate the evaluation value by adding up the products of the coefficients set for each of the items and the corresponding item values.

[0020] This allows the evaluation value to be calculated based on multiple items.

[0025] In addition, a seventh aspect of the present invention is configured such that the coefficient can be set according to the time when the request is made.

[0026] This makes it possible to deal with cases where the evaluation value changes depending on the time.

[0027] In an eighth aspect of the present invention, the candidates include the staff, The storage unit Store staff information related to the staff member death, Staff are classified into operating staff belonging to an operating organization and contracted staff belonging to a subcontracted organization, and the staff information includes affiliation organization information relating to the organization to which each of the staff belongs. The dispatch planning unit is configured to acquire, as the item value, at least one of the ratio of the operating staff to the total number of staff to be dispatched, calculated for each of the candidates, or the ratio of the contracted staff, based on the affiliation organization information.

[0028] This will enable the proportion of dispatched contract staff to be within the target range.

[0029] In a ninth aspect of the present invention, the candidates include the staff, The storage unit Store staff information related to the staff member death, The staff information includes dispatch source information, which is information relating to the dispatch source of each of the staff members, and the dispatch planning unit is configured to acquire the item value based on the location of the dispatch source and the location of the request.

[0030] This allows the item value to be obtained based on the location of the request and the location of the dispatching agency.

[0031] In addition, the tenth invention is configured such that each dispatch source is assigned a corresponding area of ​​responsibility, and the dispatch planning unit acquires the item value based on the area of ​​responsibility and the location of the request.

[0032] This allows the item value to be obtained based on the requested location and the area of ​​responsibility.

[0033] In an eleventh aspect of the present invention, the candidates include the staff, The storage unit Store staff information related to the staff member death, The staff information includes job title information relating to the job title of the staff member, and the dispatch planning unit acquires the item value based on the job title information.

[0034] This allows you to obtain item values ​​based on the staff member's position.

[0035] In a twelfth aspect of the present invention, the candidates include the staff, The storage unit Store staff information related to the staff member death, The staff information includes availability information indicating the types of work that the staff can handle, and the dispatch planning unit is configured to select the candidates to be dispatched based on the availability information.

[0036] This allows candidates who can respond to the request to be selected as candidates to be dispatched.

[0037] In a thirteenth aspect of the present invention, the candidates include the vehicle, The storage unit Stores waiting vehicle information related to the vehicle death, The waiting vehicle information includes availability information that associates the vehicle with the type of work that it can handle, and the dispatch planning unit is configured to select the candidate to be dispatched based on the availability information.

[0038] This allows candidates who can respond to the request to be selected as candidates to be dispatched.

[0039] In addition, a fourteenth aspect of the present invention is configured such that the waiting vehicle information includes power supply function information that associates the vehicle with the power supply capacity from the vehicle to an electric vehicle, and the dispatch planning unit selects the candidate to be dispatched based on the power supply function information.

[0040] This allows a candidate who can respond to a request for power supply to be selected as a candidate to be dispatched, even when a request for power supply is made.

[0041] In addition, the 15th invention is configured such that the waiting vehicle information includes the vehicle and battery remaining capacity information indicating an estimated value of the vehicle's battery remaining capacity, and the dispatch planning unit selects the candidate to be dispatched based on the battery remaining capacity information.

[0042] This allows a candidate who is available to respond to a request to be dispatched to be selected according to the remaining battery power.

[0043] The sixteenth invention is: The storage unit The coefficients are stored as a vector. Structure It is completed.

[0044] This allows the coefficients to be stored in the storage unit with a simple configuration.

[0045] The seventeenth invention is: The storage unit The coefficients are stored as a matrix. Structure It is completed.

[0046] This allows the coefficients to be stored in the storage unit with a simple configuration.

[0047] The eighteenth invention made to solve the above problems is a dispatch method for selecting a candidate to be dispatched from a candidate group including at least one of staff and vehicles based on a request from a requester, and dispatching the candidate, In a computer including a processor and a storage unit, the processora step of selecting the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; a step of obtaining dispatch results by dispatching the selected candidate; and a step of calculating an actual value for at least one indicator based on the dispatch results for a predetermined period of time. obtaining a target range for the performance value; and determining whether the future performance value falls within the target range. and a step of changing the evaluation criteria.

[0048] This allows the evaluation criteria for selecting candidates to be dispatched to be changed based on performance values, making it possible to automatically change the evaluation criteria when desired performance is not achieved. This makes it possible to select candidates appropriately according to individual requests while automatically changing the selection criteria to achieve set goals.

[0049] A nineteenth invention made to solve the above problems is a dispatch program that selects a candidate to be dispatched from a candidate group including at least one of staff and vehicles based on a request from a requester, and dispatches the candidate, A computer includes a processor and a storage unit, and the processor a step of selecting the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; a step of obtaining dispatch results by dispatching the selected candidate; and a step of calculating an actual value for at least one indicator based on the dispatch results for a predetermined period of time. obtaining a target range for the performance value; and determining whether the future performance value falls within the target range. and a step of changing the evaluation criteria.

[0050] This allows the evaluation criteria for selecting candidates to be dispatched to be changed based on performance values, making it possible to automatically change the evaluation criteria when desired performance is not achieved. This makes it possible to select candidates appropriately according to individual requests while automatically changing the selection criteria to achieve set goals.

[0051] Hereinafter, embodiments of the present disclosure will be described with reference to the drawings.

[0052] FIG. 1 is a diagram showing the overall configuration of a dispatching system 1 according to this embodiment.

[0053] The dispatch system 1 is a system for providing a dispatch service (so-called road service) that dispatches staff 3 and a vehicle 4 that can handle the problem in response to a request from a requester 2, such as a driver, when a problem occurs with a car or the like.

[0054] Staff 3 belong to the operating organization (company, organization, etc.) that operates the dispatch system 1, or to a contractor organization (company, organization, etc.) that has been commissioned by the operating organization. Staff 3 who belong to the operating organization are on standby at base 5A or waiting area 5B operated by the operating organization. Staff 3 who belong to a contractor organization are on standby at base 5C operated by the contractor organization.

[0055] The staff members 3 are waiting at either the base 5A, the waiting area 5B, or the base 5C, and the vehicles 4 are also waiting at either the base 5A, the waiting area 5B, or the base 5C.

[0056] Staff 3 belong to the operating organization or the outsourced organization, and are classified into operating staff 3A who belong to the operating organization and outsourced staff 3B who belong to the outsourced organization. In addition, some staff 3 are managers, and at least one manager is assigned to each of base 5A, waiting area 5B, and base 5C.

[0057] Hereinafter, the base 5A, waiting area 5B, and base 5C will be collectively referred to as the dispatching source 5, the staff 3 belonging to the operating organization will be referred to as operating staff 3A, and the staff 3 belonging to the outsourced organization will be referred to as outsourced staff 3B.

[0058] Each staff member 3 is assigned a staff ID as identification information, and each vehicle 4 is assigned a vehicle ID as identification information. Each dispatch agency 5 is assigned a dispatch agency ID as identification information.

[0059] FIG. 2 is a schematic diagram showing an example of the location of dispatch agencies 5. In FIG. 2, base 5A, base 5C, and request locations are indicated by black circles. Each dispatch agency 5 is assigned a coverage area 6 (see the two-dot chain line). It is preferable that a staff member 3 be dispatched from one of the corresponding dispatch agencies 5 in response to each request from within the coverage area 6.

[0060] Some of the requesters 2 are members of the dispatch service. As members, the requesters 2 are required to respond to the request promptly.

[0061] 1, the dispatching system 1 includes a reception terminal 11, a dispatching server 12, a worker terminal 13, and a management terminal 14. The dispatching server 12, the worker terminal 13, the reception terminal 11, and the management terminal 14 are each connected to a known communication network 15 such as the Internet, and are configured to be able to communicate with each other.

[0062] The dispatching system 1 executes a process for providing a dispatching service by executing the request response process shown in Fig. 3. The flow of the request response process will be described below with reference to Fig. 3.

[0063] The reception terminal 11 is used by a receptionist 11A who receives requests for dispatch services. As the reception terminal 11, a known computer having a communication function, such as a desktop PC (Personal Computer) or a notebook PC, is used.

[0064] 3, when a request is received by telephone or the like from requester 2, receptionist 11A acquires the request content and inputs it as request data into reception terminal 11. When reception terminal 11 completes input reception, it transmits the request data to dispatch server 12.

[0065] The dispatch server 12 is an information processing device that executes dispatch processing to select a combination of staff 3 and vehicles 4 to be dispatched to the requester 2 based on the received request data and to formulate a dispatch plan. As shown in Fig. 4, the dispatch server 12 appropriately includes known hardware such as a processor 21 (CPU, MPU, etc.), memory 22 (RAM, ROM, etc.), storage 23 (various storage devices such as HDD, SSD, etc.), a display device 24 such as a display, input devices 25 such as a keyboard and mouse, and a network interface 26.

[0066] The worker terminal 13 is used by the staff member 3. The worker terminal 13 may be a known computer having a communication function, such as a desktop personal computer (PC), a notebook PC, a tablet terminal, or a smartphone.

[0067] The dispatch server 12 is configured by a known computer with a communication function installed in a predetermined facility (server installation facility). The dispatch server 12 may be, for example, a desktop PC, a blade server, a rack-mounted server, a tower server, or other known computer.

[0068] When the dispatch server 12 acquires the request data from the reception terminal 11 via the communication network 15, it executes a dispatch planning process to select a combination of staff 3 and vehicle 4 to be dispatched. The dispatch server 12 then transmits a dispatch instruction to the worker terminal 13 of the staff 3 included in the selected combination. The dispatch instruction includes the request content, information related to the vehicle 4 to be used, the location of the requester 2, etc. The worker terminal 13 that receives the dispatch instruction displays the request content, information related to the vehicle 4 to be used, and the location of the requester 2 (i.e., the requested location) on a screen or outputs it by voice to notify the corresponding staff 3.

[0069] When the staff member 3 responds according to the screen display and voice of the worker terminal 13, the staff member 3 inputs the work results into the worker terminal 13. When the staff member 3 inputs the work results into the worker terminal 13, the worker terminal 13 transmits result data including information related to the work results to the dispatch server 12. When the dispatch server 12 receives the result data, it records it in the storage 23 as dispatch result information 45.

[0070] The management terminal 14 is used by an administrator 14A who manages and operates the dispatch system 1. As the management terminal 14, a known computer having a communication function, such as a desktop PC (Personal Computer) or a notebook PC, is used.

[0071] Based on input from the administrator 14A, the management terminal 14 transmits a performance request relating to the operational performance of the dispatch service to the dispatch server 12. When the dispatch server 12 receives the performance request from the management terminal 14, it executes a performance value calculation process to calculate a performance value for a target indicator (for example, the work time or cost until the request is completed). When the calculation of the performance value is completed, the dispatch server 12 transmits performance data including the performance value to the management terminal 14. The management terminal 14 notifies the administrator 14A of the performance value by voice, screen display, etc.

[0072] The management terminal 14 also acquires the target range of the performance value for each indicator (i.e., for each performance value) from the administrator 14A and transmits it to the dispatching server 12 as target data. The dispatching server 12 executes an update process every predetermined period (for example, one month) to update the dispatch process based on the target data so that the performance values ​​fall within the target range. The dispatching server 12 transmits the update results to the management terminal 14, and the management terminal 14 notifies the administrator 14A of the update results by voice, screen display, etc.

[0073] Here, the dispatching server 12 does not necessarily have to be configured as a single device. In other words, the dispatching server 12 may be configured as a plurality of devices (computers, etc.) that can respectively realize its plurality of functions (for example, dispatch processing and update processing).

[0074] In the dispatching system 1, the number and arrangement of the reception terminals 11, the dispatching servers 12, the worker terminals 13, and the management terminals 14 can be changed as appropriate. Furthermore, the dispatching server 12 does not necessarily have to be configured as a single device. In other words, the dispatching server 12 may be configured as a plurality of devices (computers, etc.) that can each realize a plurality of functions.

[0075] Next, the configuration of dispatch server 12, the dispatch process, the update process, and the like will be described in detail with reference to the drawings.

[0076] 5, the dispatching server 12 includes, as functional units, a memory unit 31, a request data acquisition unit 32, a dispatch planning unit 33, a notification unit 34, a dispatch result acquisition unit 35, a performance value calculation unit 36, a target range acquisition unit 37, and a coefficient update unit 38 (update unit). The memory unit 31 is configured by the storage 23 in the dispatching server 12, and at least some of the functions of the other functional units can be realized by one or more processors 21 of the dispatching server 12 executing a predetermined control program.

[0077] The memory unit 31 is composed of a memory 22 and a storage 23, and stores various information required for processes such as dispatching staff 3 and vehicles 4. Before the dispatch server 12 is put into operation, the memory unit 31 stores information related to staff 3 (hereinafter referred to as staff information 41), information related to vehicles 4 (hereinafter referred to as waiting vehicle information 42), and information related to dispatch sources 5 such as base 5A, waiting location 5B, and base 5C (hereinafter referred to as dispatch source information 43). In this embodiment, the memory unit 31 also stores information related to members of the dispatch service (member information).

[0078] The staff information 41 includes a staff ID, organization information 41A indicating whether the staff member is an operating staff member 3A or a contracted staff member 3B, a dispatch agency ID indicating the dispatch agency 5 where the corresponding staff member 3 is on standby, job title information 41B relating to the position, and availability information 41C indicating the types of work that the staff member can handle, etc. The availability information 41C may include the skills of the corresponding staff member 3 (for example, whether they can repair a flat tire or deal with a locked-out situation), etc.

[0079] The waiting vehicle information 42 stores the vehicle ID, a dispatch source ID indicating the dispatch source 5 where the corresponding vehicle 4 is located, and response availability information 42A indicating the types of work that can be performed, etc. The response availability information 42A may include, for example, information such as whether the vehicle 4 is capable of towing a broken-down vehicle.

[0080] In this embodiment, the availability information 42A includes power supply function information 42B indicating the power supply capability of the vehicle 4 to an electric vehicle. The power supply function information 42B includes classification information 42C indicating whether the corresponding vehicle 4 is an electric vehicle or not, and remaining battery capacity information 42D indicating an estimated remaining battery capacity of the vehicle 4. The remaining battery capacity information 42D may be acquired from a battery sensor that acquires the charge level of a battery mounted on the vehicle 4. The vehicle 4 may be provided with a control device or the like that transmits the remaining battery capacity acquired by the battery sensor to the dispatch server 12 by wireless signal. The remaining battery capacity information 42D may be acquired by the dispatch server 12 estimating the remaining battery capacity using a known method based on data transmitted from the vehicle 4.

[0081] The dispatch source information 43 includes a dispatch source ID, information indicating a location (latitude, longitude, etc.), and information indicating the coverage area 6 (coverage area information).

[0082] The request data acquisition unit 32 acquires the request data accepted by the acceptance terminal 11. The request data acquisition unit 32 stores the acquired request data in the storage unit 31 as request information 44.

[0083] The dispatch planning unit 33 executes the dispatch planning process and, based on the request information 44 acquired by the request data acquisition unit 32, selects a combination to be dispatched (hereinafter referred to as the optimal solution) from among combinations of staff 3 and vehicles 4 that can respond to the request, based on predetermined evaluation criteria.

[0084] In this embodiment, the dispatch planning unit 33 performs a dispatch planning process that includes an extraction process for extracting request content from the request information 44 and extracting all combinations that can meet the request, and an optimal solution acquisition process for acquiring the optimal solution from all combinations.

[0085] In the extraction process, the dispatch planning unit 33 extracts the request content from the request information 44, and extracts staff members 3 who can respond based on the staff information 41 including the response availability information 41C. Next, the dispatch planning unit 33 extracts the request content from the request information 44, and extracts vehicles 4 that can respond based on the standby vehicle information 42 including the response availability information 42A. For example, if the request content requires power supply to an electric vehicle, the dispatch planning unit 33 may extract electric vehicles based on the classification information 42C, and from among them, refer to the battery remaining amount information 42D to extract vehicles 4 with sufficient remaining battery amount as vehicles 4 that can respond.

[0086] Next, the dispatch planning unit 33 extracts combinations that can respond to the request from a set (candidate group) of combinations (candidates) of staff 3 and vehicles 4. Specifically, the dispatch planning unit 33 generates all combinations of staff 3 and vehicles 4 that can respond by combining staff 3 that can respond with vehicles 4 that can respond.

[0087] In this embodiment, when generating combinations, the dispatch planning unit 33 references the dispatch source ID and generates all combinations of available staff 3 and vehicles 4 so that staff 3 and vehicles 4 are dispatched from one dispatch source 5.

[0088] All combinations of available staff 3 and vehicles 4 will be explained using the example shown in Figure 2. Figure 2 shows an example in which staff 3a and 3b and vehicle 4a are waiting at base 5A, and staff 3c and vehicle 4b are waiting at base 5C.

[0089] Consider a case where staff members 3a, 3b, and 3c are all available to handle a request, and vehicles 4a and 4b are also available. In this case, the combinations of available staff members 3 and vehicles 4 are (3a, 4a), (3b, 4a), (3a, 3b, 4a), and (3c, 4b). Here, () indicates that they belong to the same group. For example, (3a, 4a) indicates the combination of staff member 3a and vehicle 4a, and (3a, 3b, 4a) indicates the combination of staff member 3a, staff member 3b, and vehicle 4a. Here, the dispatch planning unit 33 generates all combinations of available staff members 3 and vehicles 4, excluding combinations such as (3a, 4b) and (3a, 3c, 4a) that include staff members 3 and vehicles 4 with different dispatch sources 5.

[0090] The dispatch planning unit 33 calculates an evaluation value that serves as an evaluation criterion for each combination of available staff 3 and vehicles 4. Then, based on the evaluation value, the dispatch planning unit 33 selects an optimal solution (dispatch candidate), which is a combination to be dispatched, from the collection of all available combinations.

[0091] For example, the dispatch planning unit 33 may use a predetermined calculation formula to obtain an evaluation value for each combination of available staff 3 and vehicles 4, and obtain the combination of staff 3 and vehicles 4 with the smallest (or largest) evaluation value as the optimal solution. In this way, by using the evaluation value, the optimal solution can be easily selected.

[0092] In this embodiment, the dispatch planning unit 33 acquires a value (item value) corresponding to each item for each combination of staff member 3 and vehicle 4. Thereafter, the dispatch planning unit 33 multiplies the acquired item value by a coefficient and sums up the values ​​for each item to calculate an evaluation value.

[0093] Specifically, the dispatch planning unit 33 calculates an evaluation value for each combination using the following formula (1).

[0094]

number

[0095] In formula (1), i indicates the number (index) of the combination of staff 3 and vehicle 4, and j indicates the item number. i is the evaluation value for the combination of number i, and a j represents the coefficient for each item, and δ ji indicates the item value of the corresponding combination. Equation (1) indicates that the evaluation value is calculated by adding up the products of the coefficients set for each of multiple items and the corresponding item values.

[0096] The items may include the time and cost required to arrive at the requested location when the staff 3 and vehicle 4 are dispatched according to the corresponding combination. In this embodiment, the item values ​​and coefficients are set so that the evaluation value corresponding to a combination that is inappropriate for the operator, such as one that requires time or cost, is high. Therefore, the dispatch planning unit 33 acquires the combination with the smallest evaluation value as the optimal solution.

[0097] Examples of items according to this embodiment are shown in Table 1. The items may include items whose values ​​are set to values ​​indicating the degree or amount of the item, and items whose values ​​are set to 0 or 1 depending on whether a predetermined criterion is met.

[0098] [Table 1]

[0099] Some of the items in Table 1 will be explained below, but the items listed in Table 1 are merely examples. In other words, the items may include other items not shown in Table 1, and may not include the items shown in Table 1.

[0100] The item number 1 relates to the ratio of the contract staff 3B to the staff 3 included in the combination. In this embodiment, the item value δ 1j is set to the number of commissioned staff 3B in the combination divided by the total number of staff 3 in the combination.

[0101] In this embodiment, all combinations of available staff 3 and vehicles 4 include only combinations in which staff 3 are dispatched from one dispatch agency 5. Therefore, the item value δ of No. 1 1j is set to 0 (if dispatching agency 5 belongs to the operating organization) or 1 (if dispatching agency 5 belongs to the contracted organization).

[0102] Since the combination with the smallest evaluation value is the optimal solution, it is unlikely that staff 3 from the outsourced organization will be included in the combination. This makes it possible to keep the indirect ratio (the proportion of outsourced staff 3B) low. When outsourced staff 3B is dispatched, costs that must be paid to the outsourced organization are incurred, so by keeping the indirect ratio low, it is possible to keep the costs required to operate the dispatch system 1 down. Item value δ 1j is also called the direct / designated balance because it relates to the direct / indirect ratio. 1j is acquired using the affiliated organization information 41A.

[0103] The item number 2 relates to the ratio of managers among the staff members 3 included in the combination. In this embodiment, the item value δ 2j is set to the number of staff members in the combination divided by the number of executives in the combination.

[0104] Since the combination with the smallest evaluation value is the optimal solution, it is unlikely that a manager will be included in the combination. This prevents managers from leaving the dispatching agency 5, and prevents the number of staff 3 waiting at the dispatching agency 5 from becoming zero. Item value δ 2jis also called manager priority because it is an item value for preventing managers from being included in the optimal solution. 2j is acquired using the position information 41B.

[0105] The item numbered 3 relates to the priority of the requester 2. In this embodiment, when the requester 2 is not a member of the dispatch service, the item value δ of the item numbered 3 is 3j is set to 1, and in the case of a request from the preferred requester 2, the item value δ 2j is set to 0. Item value δ 3j is also called a requester (requester) priority because it is an item value set based on the priority of the requester 2. The dispatch planning unit 33 calculates the item value δ of the number 3. 3j is obtained using member information.

[0106] The item number 4 relates to the relationship between the requested location and the location of the dispatch source 5 of the staff 3 (or vehicle 4) included in the combination, and the corresponding item value δ 4j is obtained based on the positional relationship between the two. 4j is set based on the relationship between the requested location and the area of ​​responsibility 6 corresponding to the dispatching agency 5.

[0107] In this embodiment, the item value δ of the number 4 4j is set to 0 when the requested location is in the area 6 of the dispatching agency 5, and is set to 1 when the requested location is not in the area 6 of the dispatching agency 5.

[0108] Other, item value δ of number 4 4j may be determined based on the proximity (distance to the boundary, etc.) between the requested location and the coverage area 6. Also, the item value δ 4j may be set to a value obtained by dividing the number of staff members 3 included in the combination by the number of staff members 3 that do not have a requested position within the coverage area 6 of the corresponding dispatch agency 5. 4j may be set to the number of vehicles 4 included in the combination divided by the number of vehicles 4 that do not have a requested location within the coverage area 6 of the corresponding dispatch source 5.

[0109] The combination with the smallest evaluation value is the optimal solution, so that the staff 3 is more likely to be dispatched from the dispatching agency 5 corresponding to the area of ​​responsibility 6. 4j is also called a priority by area of ​​responsibility (area), because it is an item value for making it easier for the staff 3 and the vehicle 4 to be dispatched from the dispatching agency 5 corresponding to the area of ​​responsibility 6 when the requested location is within the area of ​​responsibility 6. The dispatch planning unit 33 calculates the item value δ 2j is obtained using the area of ​​responsibility information.

[0110] The item numbered 5 relates to the time required to arrive at the requested location. The dispatch planning unit 33 estimates the time required to dispatch the staff 3 and vehicle 4 included in the combination to the requested location, and sets the item value δ of the item numbered 5 to correspond to the estimated time. 5j The dispatch planning unit 33 sets the item value δ of the number 5. 5j It is recommended to set it proportional to the estimated time.

[0111] The item numbered 6 indicates the degree to which the staff 3 and vehicle 4 can respond to the request content (fault content) when dispatched, and relates to matching between the request content (fault content) and the staff 3 and vehicle 4. In this embodiment, the item numbered 6 evaluates the matching with the request content (fault content) based on the work time required to respond to the request after the staff 3 and vehicle 4 arrive at the requested location. That is, the dispatch planning unit 33 estimates the time required for the work when the staff 3 and vehicle 4 included in the combination are dispatched to the requested location based on the request content, and changes the item value δ of numbered 6 to correspond to the estimated time. 6j The dispatch planning unit 33 sets the item value δ of the number 6. 6j The dispatch planning unit 33 calculates the item value δ of the item number 6 based on a known machine learning method using the results of the dispatch work including the work report. 6j The item value δ may be obtained. 6j is also called the priority by fault type because it is an item value based on the work content.

[0112] As can be seen from the contents of items 1 to 6, depending on the item, the item value δ ji is determined based on the characteristics (location, etc.) of the dispatch source 5 of the staff 3 and vehicle 4 included in the combination.

[0113] Coefficient a j is determined for each item. Coefficient a j may be determined to depend on the time of the request or the time when the staff member 3 is dispatched. That is, the dispatch planning unit 33 may obtain an evaluation value for each combination using the following formula (2).

[0114]

number

[0115] In equation (2), t indicates the time when the request was made (hereinafter referred to as the request time), and the coefficient a j (t) is time-dependent. All coefficients a j (t) is stored in the storage unit 31 as coefficient information 48.

[0116] The fee (cost) to be paid to the outsourced organization may be set higher when the outsourced staff 3B is dispatched in the early morning, late night, etc. In that case, it is advisable to set the coefficient a1(t) corresponding to item 1 when the requested time is in the early morning or late night time period to be larger than when the requested time is in other time periods.

[0117] Coefficient a j (t) may be set for each time period obtained by dividing a day into a predetermined number of periods (for example, 48). When the time of the request corresponds to the kth time period, the dispatch planning unit 33 may obtain an evaluation value for each combination using the following formula (3).

[0118]

number

[0119] In equation (3), a jk is the coefficient a of item j corresponding to the kth time period j (t). At this time, the storage unit 31 stores the coefficient a jk It is preferable to store all the data (i.e., coefficient information 48) as a matrix of size (number of items) x (number of time periods). This allows the coefficients to be stored in the storage unit 31 with a simple configuration.

[0120] When all the coefficients are independent of time (i.e., when the number of time periods is 1), that is, when the evaluation value is calculated based on equation (1), the coefficient information 48 is represented by a matrix of size (number of items) × 1, that is, a vector. Therefore, it is preferable that the storage unit 31 stores the coefficient information 48 as a vector. This allows all the coefficients to be stored in the storage unit 31 with a simple configuration.

[0121] The dispatch planning unit 33 includes a planning means 33A that acquires an evaluation value for each combination of staff 3 and vehicles 4 that meets the request, and acquires the combination with the smallest evaluation value as the optimal solution. In this way, by using the evaluation value, it is possible to easily select the combination to be dispatched based on clear criteria. Furthermore, since the evaluation value can be calculated by adding up the products of the coefficients and the item values, the calculation method for the evaluation value is simple, and the evaluation value can be acquired based on multiple items.

[0122] The planning means 33A is configured by at least one learning model prepared in advance. The dispatch planning unit 33 may use the planning means 33A (learning model) to obtain an optimal solution. The planning means 33A can be generated by known machine learning. Known algorithms such as neural networks, support vector machines, logistic regression, random forests, and linear regression can be used for machine learning.

[0123] Based on the acquired optimal solution, the dispatch planning unit 33 creates a dispatch plan for the staff 3 and vehicles 4 included in the combination. The dispatch plan may include, for example, details of the staff 3 and vehicles 4 to be dispatched, the driving route of the vehicles 4, the requested location, the requested content, etc.

[0124] The notification unit 34 sends a dispatch instruction including the dispatch plan created by the dispatch planning unit 33 to the worker terminal 13 held by the staff member 3 to notify the staff member 3 who belongs to the combination corresponding to the optimal solution.

[0125] The dispatch result acquisition unit 35 acquires the dispatch result by dispatching the combination. The dispatch result acquisition unit 35 acquires the dispatch result including the work report etc. as result data from the worker terminal 13 held by the staff member 3 after dispatch.

[0126] The result data may include, for example, the time from receiving the request to arriving at the requested location (hereinafter referred to as arrival time), information on the affiliation of the dispatched staff 3, such as the operating organization, the contractor organization, etc. In addition, the result data may include the working time from arriving at the requested location to completing the work, the cost required to respond to the request, etc.

[0127] The dispatch result acquisition unit 35 records the acquired result data in the storage unit 31 as dispatch result information 45 .

[0128] The performance value calculation unit 36 ​​executes a performance value calculation process to calculate a performance value for at least one index based on the dispatch results for a predetermined period (hereinafter referred to as a performance calculation period).

[0129] In the performance value calculation process, the performance value calculation unit 36 ​​first acquires the dispatch result information 45 for the performance value calculation period from the storage unit 31. The performance value calculation period may be, for example, a period from the time when the performance value calculation process is executed to a predetermined time before (for example, about 3 to 6 hours before, or one month before).

[0130] Next, the actual value calculation unit 36 ​​uses the dispatch result information 45 to calculate an actual value for the target indicator. The target may include, for example, reducing the arrival time for each request or increasing the proportion of dispatches from the operating organization to a predetermined value or more. In this embodiment, the actual value calculation unit 36 ​​acquires the arrival time for each request and information related to the affiliation of the staff 3 from the dispatch result information 45. The actual value calculation unit 36 ​​then calculates the average arrival time and the direct ratio as the actual value. The direct ratio (also referred to as the direct-indirect ratio) here means the proportion (ratio) of the operating staff 3A among the staff 3 dispatched during the actual calculation period. The direct ratio may also be the proportion (ratio) of the vehicles 4 dispatched during the actual calculation period that are from the operating organization.

[0131] The actual value calculation unit 36 ​​may calculate, as actual values, the average value of the work time required to complete the work and the average value of the cost required to respond to the request, in addition to the average value of the arrival time and the direct ratio.

[0132] The performance value calculation unit 36 ​​stores the calculated performance value in the storage unit 31 as performance information 46, and also transmits it to the management terminal 14 as performance data.

[0133] The target range acquisition unit 37 acquires the target range corresponding to the performance value calculated by the performance value calculation unit 36. In this embodiment, the target range acquisition unit 37 acquires the target range from the management terminal 14 as target range data.

[0134] The target range of the average value of the current arrival time is included in the target range data acquired by the target range acquisition unit 37. Here, the target range acquisition unit 37 acquires the target range of the average value of the current arrival time by acquiring a lower limit target value (lower limit value of the target range) and an upper limit target value (upper limit value of the target range).

[0135] Alternatively, the target range acquisition unit 37 acquires the target value of the direct ratio by acquiring the lower limit and upper limit of the target range of the direct ratio. Alternatively, by acquiring the lower limit and upper limit of the target range, the target range acquisition unit 37 may acquire the target range of the average work time required to complete the work or the target range of the average cost required to respond to the request. The target range acquisition unit 37 stores data indicating the acquired target range in the memory unit 31 as target range information 47.

[0136] The coefficient update unit 38 changes the evaluation criteria so that the performance value falls within the target range. The coefficient update unit 38 changes the evaluation criteria by executing an update process that updates the coefficients. In this embodiment, the coefficient update unit 38 executes the update process at predetermined intervals (hereinafter, the coefficient update period).

[0137] Specifically, in the update process, the coefficient update unit 38 does not update the coefficients if all the actual values ​​are within the target actual range. In the update process, if any of the actual values ​​is not within the target range, the coefficient update unit 38 updates the coefficients and stores them in the storage unit 31 as coefficient information 48. The coefficient update unit 38 may determine whether the actual value is within the target range based on the difference between the actual value and the boundary value (upper or lower limit) of the target range (i.e., the margin).

[0138] The coefficient update unit 38 includes update means 38A for updating the coefficients. The update means 38A is configured with at least one learning model prepared in advance. When actual values ​​are input as input data, the update means 38A outputs appropriate coefficients as output data. The learning model is constructed in advance by performing machine learning using (past) actual values ​​as input data and coefficients as output data.

[0139] For machine learning to construct the update means 38A (learning model), known algorithms such as neural networks, support vector machines, logistic regression, random forests, and linear regression can be used.

[0140] The learning model may be updated for each update process by referring to the performance information 46 and the coefficient information 48, based on the performance value calculated by the performance value calculation unit 36 ​​and the coefficient that was set when the performance value was obtained.

[0141] The coefficient update unit 38 updates the coefficients using update means 38A (learning model). Specifically, if any performance value is not within the performance target range, the coefficient update unit 38 changes the performance value to a predetermined value within the performance target range (for example, the central value of the performance target range) and inputs the changed value to the update means 38A. Thereafter, the coefficient update unit 38 updates the coefficients using the output data output by the update means 38A.

[0142] Note that the update means 38A may be configured using other algorithms that update the coefficients by referencing the performance values. For example, the update means 38A may be configured using an algorithm (rule-based algorithm) based on a predetermined rule that changes the value of the coefficient when the performance values ​​satisfy a predetermined condition. The update means 38A may also be configured using a function that sets the amount or rate of change of the coefficient when the performance values ​​satisfy a predetermined condition. Configuring the update means 38A based on such rules and functions makes it easier to build than when a learning model is used, and the update means 38A can be configured simply.

[0143] The storage unit 31 stores request information 44, dispatch result information 45, performance information 46, target range information 47, and coefficient information 48. The storage unit 31 preferably stores each piece of information in a database.

[0144] Dispatch server 12 executes a dispatch process when it receives the request data from reception terminal 11. The dispatch process executed by dispatch server 12 will be described in detail below.

[0145] In the first step ST101 of the dispatch process, the dispatch server 12 (more specifically, the processor 21) records the request data in the storage 23 as request information 44. Thereafter, the dispatch server 12 extracts a combination to be dispatched from among the combinations of staff 3 and vehicles 4, based on the request content included in the request information 44 and an evaluation value calculated using the coefficient information 48.

[0146] In this embodiment, the dispatching server 12 extracts a combination of staff 3 and vehicles 4 that can respond to the request content and has the smallest evaluation value as the combination of staff 3 and vehicles 4 to be dispatched. The dispatching server 12 acquires the combination to be dispatched from the extracted combinations using a pre-constructed planning means 33A (learning model). Once the acquisition of the combination to be dispatched is completed, the dispatching server 12 executes step ST102.

[0147] The dispatch server 12 creates a dispatch plan based on the combination acquired in step ST102. The dispatch plan includes details of the staff 3 and vehicle 4 to be dispatched, the driving route of the vehicle 4, the requested location, the request content, etc. Once the dispatch server 12 has completed creating the dispatch plan, it transmits it to the worker terminal 13 corresponding to the staff 3 to be dispatched.

[0148] As a result, the request content, requested location, details of the vehicle 4, the travel route, etc. are displayed on the worker terminal 13. The staff member 3 follows the display and moves to the requested location to perform the work.

[0149] At this time, an input field for reporting the work results when the work is completed is displayed on the worker terminal 13. As soon as the worker completes the work, he or she enters the work results in the input field. After that, the worker sends the work results to the dispatch server 12 as result data, for example, by pressing a send button displayed on the worker terminal 13.

[0150] Upon receiving the result data, the dispatching server 12 executes step ST103. In step ST103, the dispatching server 12 stores the received result data in the storage 23 as dispatch result information 45, and ends the dispatching process.

[0151] The dispatching server 12, which is a computer, executes a dispatching program (more specifically, a procedure relating to updates included in the dispatching program) at predetermined intervals to implement a dispatching method (update method) and perform update processing. The update processing performed by the dispatching server 12 will be described in detail below.

[0152] In the first step ST201 of the update process, the dispatching server 12 (more specifically, the processor 21) acquires the dispatch result information 45 for the performance calculation period from the storage 23. Thereafter, the dispatching server 12 calculates a performance value using the acquired dispatch result information 45 for the performance calculation period, and stores the calculated performance value as performance value data in the storage 23. In this embodiment, the performance value includes the arrival time and the direct ratio.

[0153] In step ST202, the dispatching server 12 acquires the coefficient information 48 from the storage 23. Thereafter, the dispatching server 12 updates the update means 38A, which is the learning model, using the performance information 46 and the coefficient information 48. When the update is completed, the dispatching server 12 executes step ST203.

[0154] When the calculation of the performance values ​​is completed, the dispatching server 12 executes step ST203. In step ST203, the dispatching server 12 determines whether all the performance values ​​are within the target range. If all the performance values ​​are within the target range, the dispatching server 12 ends the update process without updating the coefficients (coefficient information 48). If at least one performance value is not within the target range, the dispatching server 12 executes step ST204.

[0155] In step ST204, the dispatching server 12 sets a target performance value within the target range, inputs the target performance value to the update means 38A, and acquires a new coefficient. The dispatching server 12 updates the coefficient information 48 stored in the storage unit 31 with the acquired coefficient. When the update of the coefficient information 48 is completed, the dispatching server 12 ends the update process.

[0156] Next, the effects of the dispatch system 1 configured in this manner will be described.

[0157] When any one of the performance values ​​is outside the target range, the coefficient update unit 38 updates the coefficient information 48, thereby changing the evaluation criteria for calculating the evaluation value. In detail, the coefficient information 48 is updated by the update means 38A (learning model), which has learned the relationship between the coefficients and the performance values, so that the performance values ​​fall within the target range. This makes it possible to automatically change the selection criteria for selecting a combination (optimal solution) to be dispatched from combinations that can meet individual requests, so that the target can be achieved.

[0158] The dispatching system 1 selects the optimal solution using an evaluation value that serves as the evaluation criterion. As shown in formulas (1) to (3), the evaluation value is calculated by adding up the product of the coefficient corresponding to each item and the item value, which is the value obtained by evaluating each combination for each item. Therefore, the dispatching system 1 can set evaluation criteria based on multiple items.

[0159] Specifically, for example, by reducing the coefficient of item 4, the combination of staff 3 and vehicle 4 dispatched from the area of ​​responsibility 6 becomes more likely to be selected.

[0160] As a result, for example, if a mountain area is set as the area of ​​responsibility 6 corresponding to the base 5C of the outsourced organization, it becomes easier for the outsourced organization to dispatch staff 3 and vehicles 4 to the mountain area. Also, if an urban area is set as the area of ​​responsibility 6 corresponding to the base 5A or waiting place 5B of the operating organization, it becomes easier for the operating organization to dispatch staff 3 and vehicles 4 to the urban area.

[0161] As shown in equations (2) and (3), the coefficients can be set to depend on the time of the request, which allows for the evaluation criteria to be set according to the time, making it possible to respond to costs set according to the time, and demand and conditions that change depending on the time.

[0162] In the above embodiment, the coefficient update unit 38 is configured to update the coefficients and change the evaluation criteria when any one of the performance values ​​is outside the target range, but this is not limited to this. Any configuration is possible as long as the coefficient update unit 38 automatically changes the evaluation criteria so that the performance value falls within a desired value or a desired range. This makes it possible to automatically change the evaluation criteria when the desired performance is not obtained.

[0163] In the above embodiment, the dispatching system 1 is configured to change the evaluation criteria by changing the coefficients, but the method for changing the evaluation criteria is not limited to changing the coefficients. For example, if the evaluation value is calculated by substituting the item values ​​into an arithmetic expression including a predetermined parameter, the evaluation criteria may be changed by changing the parameter.

[0164] In the above embodiment, the dispatching system 1 is configured to select one combination to be dispatched based on an evaluation criterion from among all combinations that include staff 3 and vehicles 4 and that can respond to the request content, but is not limited to this embodiment. The dispatching system 1 may also be configured to select a combination to be dispatched as an optimal solution (dispatch candidate) from a portion (subset) of all combinations that include staff 3 and vehicles 4 and that can respond to the request content, based on an evaluation criterion. The dispatching system 1 may also select multiple combinations (dispatch candidates) as the optimal solution.

[0165] The dispatch system 1 may also be configured to select a combination to be dispatched (dispatch candidate) based on evaluation criteria from combinations (a collection of candidates) in which the candidates do not include vehicles 4 and include one or more staff members 3. The dispatch system 1 may also be configured to select a combination to be dispatched (dispatch candidate) based on evaluation criteria from combinations (a collection of candidates) in which the candidates do not include staff members 3 and include one or more vehicles 4.

[0166] In the above embodiment, the dispatch system 1 is applied to a dispatch system 1 that dispatches staff 3 and vehicles 4 when trouble occurs with an automobile or the like, but is not limited to this aspect. The dispatch system 1 can be applied to any dispatch system 1 that dispatches staff 3 and / or vehicles 4. The dispatch system 1 according to the present invention can also be applied to a dispatch system 1 that dispatches staff 3 and / or vehicles 4 when trouble occurs with facilities such as electricity, gas, water, roads, etc. Furthermore, the dispatch system 1 according to the present invention can also be applied to a dispatch system 1 that dispatches staff 3 (personnel) and / or vehicles 4 in firefighting, emergency medical care, etc.

[0167] As described above, the embodiments have been described as examples of the technology disclosed in this application. However, the technology in this disclosure is not limited to these, and can be applied to embodiments in which modifications, substitutions, additions, omissions, etc. are made. Furthermore, it is also possible to combine the components described in the above embodiments to create new embodiments. [Industrial Applicability]

[0168] The dispatch system 1, dispatch method, and dispatch program disclosed herein have the effect of being able to appropriately select staff 3 in accordance with individual requests while automatically changing the selection criteria to achieve set goals, and are useful as a dispatch system 1, dispatch method, and dispatch program that extracts one combination to be dispatched from multiple combinations of staff 3 and vehicles 4 and dispatches it. [Explanation of symbols]

[0169] 1: Dispatch system 2: Requester 3: Staff 3A: Management staff 3B: Contract staff 4: Vehicle 5: Dispatch company 6: Area of ​​responsibility 12: Dispatch server (computer) 31: Storage section 32: Request data acquisition unit 33: Dispatch Planning Department 34:Notification section 35: Dispatch result acquisition department 36: Actual value calculation section 37: Target range acquisition unit 38: Coefficient update unit (update unit) 38A: Update method (learning model) 41: Staff Information 41A:Available information 42: Waiting vehicle information 42A:Available information 43: Dispatch information 45: Dispatch result information 47: Target range information 48: Coefficient information

Claims

1. A dispatch system that selects a candidate to be dispatched based on a request from a candidate group including at least one of staff and vehicles, and dispatches the candidate, a computer having a processor and a memory unit; By running the corresponding program, the processor a dispatch planning unit that selects the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; a dispatch result acquisition unit that acquires the dispatch result of dispatching the selected candidate; a performance value calculation unit that calculates a performance value for at least one index based on the dispatch results for a predetermined period; a target range acquisition unit that acquires a target range for the actual value; The dispatch system functions as an update unit that changes the evaluation criteria so that the future performance values ​​fall within the target range.

2. A dispatch system as described in claim 1, wherein the update unit changes the evaluation criteria when the actual performance value is outside the target range.

3. 2. The dispatch system according to claim 1, wherein the dispatch planning unit calculates an evaluation value serving as the evaluation criterion for each of the candidates, and selects one to be dispatched based on the evaluation value.

4. The dispatch system according to claim 3, wherein the dispatch planning unit obtains item values ​​corresponding to each of a plurality of items for the candidate, and calculates the evaluation value by summing the products of the coefficients set for each of the items and the corresponding item values.

5. The dispatch system according to claim 4, wherein the coefficient is configured to be settable depending on the time when the request is made.

6. The candidates include the staff member; The storage unit stores staff information relating to the staff, The staff are classified into management staff belonging to the management organization and contracted staff belonging to the contracted organization, The staff information includes organization information relating to the organization to which each of the staff members belongs, The dispatch system described in claim 4, wherein the dispatch planning unit acquires as the item value at least one of the ratio of the operating staff to the total number of staff to be dispatched calculated for each of the candidates based on the affiliation organization information, or the ratio of the contracted staff.

7. The candidates include the staff member; The storage unit stores staff information relating to the staff, The staff information includes dispatch source information, which is information relating to the dispatch source of each of the staff members, The dispatch system according to claim 4 , wherein the dispatch planning unit acquires the item value based on the location of the dispatch source and the location of the request.

8. Each of the dispatching agencies is assigned a corresponding area of ​​responsibility, The dispatch system according to claim 7 , wherein the dispatch planning unit acquires the item value based on the area of ​​responsibility and the location of the request.

9. The candidates include the staff member; The storage unit stores staff information relating to the staff, The staff information includes job title information relating to the job title of the staff member, The dispatch system according to claim 4 , wherein the dispatch planning unit acquires the item value based on the job title information.

10. The candidates include the staff member; The storage unit stores staff information relating to the staff, The staff information includes availability information indicating the types of work that the staff can handle, The dispatch system according to claim 1 , wherein the dispatch planning unit selects the candidates to be dispatched based on the availability information.

11. the candidates include the vehicle; the storage unit stores waiting vehicle information related to the vehicle; The waiting vehicle information includes availability information that associates the vehicle with the type of work that the vehicle can handle, The dispatch system according to claim 1 , wherein the dispatch planning unit selects the candidates to be dispatched based on the availability information.

12. the waiting vehicle information includes power supply function information that associates the vehicle with a power supply capability from the vehicle to an electric vehicle; The dispatch system according to claim 11 , wherein the dispatch planning unit selects the candidate to be dispatched based on the power supply function information.

13. the waiting vehicle information includes the vehicle and remaining battery capacity information indicating an estimated remaining battery capacity of the vehicle; The dispatch system according to claim 11 , wherein the dispatch planning unit selects the candidate to be dispatched based on the remaining battery charge information.

14. A dispatch system as described in claim 4, wherein the memory unit stores the coefficients as vectors.

15. A dispatch system as described in claim 5, wherein the memory unit stores the coefficients as a matrix.

16. A dispatch method for selecting a candidate to be dispatched based on a request from a candidate group including at least one of staff and vehicles, and dispatching the candidate, A computer including a processor and a storage unit, the processor: selecting the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; Obtaining a dispatch result by dispatching the selected candidate; calculating a performance value for at least one index based on the dispatch results for a predetermined period; obtaining a target range for the actual performance value; and changing the evaluation criteria so that the future performance values ​​fall within the target range.

17. A dispatch program that selects a candidate to be dispatched from a group of candidates including at least one of staff and vehicles based on a request from a requester and dispatches the candidate, A computer includes a processor and a storage unit, and the processor selecting the candidate to be dispatched from the group of candidates who can respond to the request based on predetermined evaluation criteria; Obtaining a dispatch result by dispatching the selected candidate; calculating a performance value for at least one index based on the dispatch results for a predetermined period; obtaining a target range for the actual performance value; and changing the evaluation criteria so that the future performance values ​​fall within the target range.

Images