Visiting task sharing system and program

Abstract

To reduce input work in comparison with a case in which an ability for each worker is input, and to calculate a visiting sequence.SOLUTION: A visiting task sharing system creates a visiting sequence to allow a plurality of visiting workers to share a visiting task, and includes one or more processors. The one or more processors obtain information on visiting destinations and information on the number of workers per ability, and calculate a visiting sequence in accordance with an evaluation of the goodness of a visiting sequence created based on the information on the visiting destinations and the number of workers per ability.SELECTED DRAWING: Figure 1

Description

Technical Field

[0001] The present invention relates to a route work sharing system and a program.

Background Art

[0002] Patent Document 1 describes a route work sharing system that calculates the route order for each route worker that minimizes the objective function according to the route destination information and the route worker constraint information, with the weighted sum value of the evaluation items as the objective function, and outputs the calculated route order, so that the route work can be efficiently shared.

Prior Art Documents

Patent Documents

[0003]

Patent Document 1

Summary of the Invention

Problems to be Solved by the Invention

[0004] For example, in a gas company or the like, a route work of visiting each customer within the promised time is carried out. In such a route work, it is preferable to create a route order for efficiently sharing the route work by the system. In the conventional route work sharing system, it is necessary to individually input the ability of each worker in order to create a route order considering the ability of the workers in charge of the work. Inputting all the ability information of each worker requires a great deal of labor, and the ability information of each worker also varies over time, which is also a problem. An object of the present invention is to reduce the input work and calculate the route order as compared with the case of inputting the ability for each worker.

Means for Solving the Problems

[0005] The invention according to claim 1 is a patrol work sharing system for creating a patrol order for a plurality of patrol workers to share patrol work, comprising one or more processors, wherein the one or more processors acquire information on the patrol destinations and the number of workers by ability, and calculate the patrol order based on an evaluation of the goodness of the patrol order created based on the information on the patrol destinations and the number of workers by ability. It is a patrol work sharing system characterized by this. The invention according to claim 2 is the patrol work sharing system according to claim 1, characterized in that the evaluation of the goodness of the patrol order minimizes the total value obtained by assigning a weight predetermined for each evaluation item to the amount of violation, which is the degree of compliance of the evaluation of the predetermined evaluation items. The invention according to claim 3 is the patrol work sharing system according to claim 2, characterized in that the predetermined evaluation items include items related to the number of people in charge of tasks that require ability. The invention according to claim 4 is the patrol work sharing system according to claim 1, characterized in that the number of workers by ability is the number of workers in charge of only simple tasks. The invention according to claim 5 is the patrol work sharing system according to claim 4, characterized in that the workers in charge of only simple tasks include workers who can also perform other tasks and workers who cannot perform other tasks, and the goodness of the patrol order is evaluated by different weightings for the number of each of these workers. The invention according to claim 6 is the patrol work sharing system according to claim 1, characterized in that the number of workers by ability is the number of workers who can perform tasks that require specific ability. The invention according to claim 7 is the patrol work sharing system according to claim 6, characterized in that the patrol order is calculated so as to minimize the number of workers who perform tasks that require specific ability. The invention according to claim 8 is the patrol work sharing system according to claim 1, characterized in that the evaluation of the goodness of the patrol order minimizes the number of workers who perform tasks. The invention according to claim 9 is a program that realizes, in a computer that creates a tour order for a plurality of patrol workers to share patrol duties, a function of acquiring information regarding the destinations of the tour and the number of workers by ability, and a function of calculating a tour order based on an evaluation of the quality of the tour order created based on the information regarding the destinations of the tour and the number of workers by ability.

Advantages of the Invention

[0006] According to the inventions of claims 1 and 9, compared with the case where the ability is input for each worker, the input work can be reduced and the tour order can be calculated. According to the invention of claim 2, a tour order considering the degree of importance for each evaluation item can be calculated. According to the invention of claim 3, a tour order considering the number of workers by ability can be calculated. According to the invention of claim 4, a tour order considering the number of workers who can only perform simple tasks can be calculated. According to the invention of claim 5, among the workers who can only perform simple tasks, different weightings can be given according to their abilities. According to the invention of claim 6, a tour order considering the number of workers having specific abilities required for the work can be calculated. According to the invention of claim 7, the number of people performing tasks that require specific abilities can be minimized. According to the invention of claim 8, a tour order can be created without inputting the number of workers.

Brief Description of the Drawings

[0007] [Figure 1] It is a diagram showing a configuration example of a patrol duty sharing system according to the present embodiment. [Diagram 2] It is a diagram showing a hardware configuration example of a management server and a terminal according to the present embodiment. [Figure 3] It is a diagram showing a functional configuration example of a management server according to the present embodiment. [Figure 4] It is a diagram showing an example of reception information according to the present embodiment. [Figure 5] It is a diagram showing an example of master information according to this embodiment. (a) is a diagram showing an example of master information regarding work, and (b) is a diagram showing an example of master information regarding working hours. [Figure 6] It is a diagram showing an example of case information created by the case information creation unit according to this embodiment. [Figure 7] It is a flowchart showing an example of processing performed when calculating the tour order according to this embodiment. [Figure 8] It is a diagram showing the evaluation criteria according to this embodiment. [Figure 9] It is a flowchart showing the processing performed in step S9 of FIG. 7. [Figure 10] It is a diagram showing an example of a tour order plan created by the tour order calculation unit according to this embodiment. [Figure 11] It is a diagram showing a calculation example of the amount of weight violation for items regarding the visit time desired by the tour destination in the tour order plan shown in FIG. 10. [Figure 12] It is a diagram showing a calculation example of the amount of weight violation for items regarding the capabilities required for the work, the number of workers in charge of the tour work, and the movement time in the tour order plan shown in FIG. 10. (a) is a diagram showing the elements necessary for calculating the amount of weight violation, and (b) is a diagram showing the amount of weight violation for each evaluation item. [Figure 13] It is a diagram showing an example of weighting for each evaluation item according to a modification example. [Figure 14] It is a diagram showing a calculation example according to a modification example of the amount of weight violation for items regarding the capabilities required for the work, the number of workers in charge of the tour work, and the movement time in the tour order plan shown in FIG. 10.

Embodiments for Carrying Out the Invention

[0008] Hereinafter, embodiments of the present invention will be described in detail with reference to the accompanying drawings. <Configuration of the Tour Work Allocation System> FIG. 1 is a diagram showing a configuration example of a circuit operation sharing system 1 according to the present embodiment. The circuit operation sharing system 1 is a system for calculating a circuit order for a plurality of circuit workers to share circuit operations. The circuit operation sharing system 1 includes a management server 10 and a terminal 30. The management server 10 and the terminal 30 are connected via a network 40.

[0009] The management server 10 acquires information regarding the circuit destinations and the number of workers by ability from the terminal 30, and calculates the circuit order based on an evaluation of the goodness of the circuit order created based on the information regarding the circuit destinations and the number of workers by ability. The management server 10 is realized by, for example, a computer. The management server 10 may be configured by a single computer or may be realized by distributed processing by a plurality of computers.

[0010] The terminal 30 is an information processing device used by a user to utilize the circuit operation sharing system 1. The terminal 30 accepts input of information regarding the circuit destinations and the number of workers by ability. The terminal 30 may acquire information regarding the circuit destinations and the number of workers by ability from other information processing devices. The terminal 30 transmits the acquired information to the management server 10 via the network 40. Then, the terminal 30 receives the circuit order calculated by the management server 10 via the network 40 and displays it on the display screen. The terminal 30 is realized by, for example, a computer, a tablet-type information terminal, or other information processing devices.

[0011] The network 40 is an information communication network responsible for communication between the management server 10 and the terminal 30. The type of the network 40 is not particularly limited as long as data can be transmitted and received, and may be, for example, the Internet, a LAN (Local Area Network), a WAN (Wide Area Network), etc. The communication line used for data communication may be wired or wireless. Also, a configuration in which each device is connected via a plurality of networks or communication lines may be adopted.

[0012] <Hardware Configuration of Management Server 10 and Terminal 30> FIG. 2 is a diagram showing a hardware configuration example of the management server 10 and the terminal 30 according to the present embodiment. The management server 10 and the terminal 30 include a processor 51, a ROM (Read Only Memory) 52, and a RAM (Random Access Memory) 53. The processor 51 is, for example, a CPU (Central Processing Unit), uses the RAM 53 as a working area, and executes a program read from the ROM 52. Further, the management server 10 and the terminal 30 include a communication interface 54 for connecting to a network and a display mechanism 55 for performing display output on a display. Further, the management server 10 and the terminal 30 include an input device 56 for performing an input operation by an operator. Note that the configurations of the management server 10 and the terminal 30 shown in FIG. 2 are merely examples, and the computers used in the present embodiment are not limited to the configuration example of FIG. 2.

[0013] <Functional Configuration of Management Server 10> Next, the functional configuration of the management server 10 will be described. FIG. 3 is a diagram showing a functional configuration example of the management server 10 according to the present embodiment. As shown in FIG. 3, the management server 10 includes a worker information acquisition unit 11, a worker information storage unit 12, a reception information acquisition unit 13, a reception information storage unit 14, a master information acquisition unit 15, a master information storage unit 16, a project information creation unit 17, a project information storage unit 18, a patrol order calculation unit 19, and an evaluation item storage unit 20.

[0014] The worker information acquisition unit 11 acquires the number of workers, the number of workers in charge of only one predetermined operation, and the number of workers capable of performing an operation that requires specific capabilities. The number of workers in charge of only one predetermined operation and the number of workers capable of performing an operation that requires specific capabilities are examples of the number of workers by ability. The predetermined single task is an easy task that does not require a specific qualification held by relatively few qualified personnel for its implementation, such as a closing operation. A worker who is in charge of only the predetermined single task is, for example, a worker who cannot perform difficult tasks and can only perform the closing operation. In the following, an easy task that does not require a specific qualification held by relatively few qualified personnel for its implementation may be described as the "first grouping target". A task that requires specific capabilities is a task that requires a highly difficult qualification held by particularly few qualified personnel for its implementation, such as a case targeting gas equipment that takes a long time to work. In the following, a task that requires specific capabilities may be described as the "second grouping target". The worker information storage unit 12 stores information on the number of workers acquired by the worker information acquisition unit 11, the number of workers in charge of only the predetermined single task, and the number of workers capable of performing tasks that require specific capabilities.

[0015] The reception information acquisition unit 13 acquires reception information. The reception information is information regarding the content of the request received from the visit destination. An example of the reception information acquired by the reception information acquisition unit 13 will be described with reference to FIG. 4. FIG. 4 is a diagram showing an example of the reception information according to the present embodiment. The reception information includes a case number 101, a visit time zone start 102, a visit time zone end 103, a visit designated start time 104, and a classification 105. The case number 101 is a number for identifying a case. The visit time zone start 102 and the visit time zone end 103 represent the start time and the end time of the visit time desired by the visit destination, respectively. In the example shown in FIG. 4, the case of "case number 1" needs to start the visit after "9:00" and end by "19:00". The visit designated start time 104 is the time desired by the visit destination for the visit. The visit designated start time 104 is input when the visit destination desires to visit the visit destination at the designated time without having a width in the visit time. The classification 105 is a classification of the business content to be carried out at the visit destination. The reception information storage unit 14 stores the reception information acquired by the reception information acquisition unit 13.

[0016] The master information acquisition unit 15 acquires master information. The master information is preset information regarding, for example, the work to be performed at the visit destination, the location of the visit destination, the working hours of the visit worker, and the like. The master information can be changed by the user. An example of the master information acquired by the master information acquisition unit 15 will be described with reference to FIG. 5. FIG. 5 is a diagram showing an example of the master information according to the present embodiment, (a) is a diagram showing an example of the master information regarding work, and (b) is a diagram showing an example of the master information regarding working hours. The master information regarding work includes a classification 111, a first summarization target 112, a second summarization target 113, and a working time 114. The master information regarding working hours includes a starting time 115, a break start time 116, a break end time 117, and a return time 118.

[0017] The classification 111 is the content of the work to be performed at the visit destination. The first summarization target 112 and the second summarization target 113 indicate whether the work content is the first summarization target and the second summarization target, respectively. The example shown in FIG. 5(a) shows that "closing the valve" is the first summarization target and "time-consuming gas equipment" is the second summarization target. The working time 114 is the time required for the implementation of the work. The starting time 115, the break start time 116, the break end time 117, and the return time 118 are information regarding the working hours of the worker. The master information storage unit 16 stores the master information acquired by the master information acquisition unit 15.

[0018] The case information creation unit 17 creates case information based on the reception information stored in the reception information storage unit 14 and the master information stored in the master information storage unit 16. An example of the created case information will be described with reference to FIG. 6. FIG. 6 is a diagram showing an example of the case information created by the case information creation unit 17 according to the present embodiment. Here, an example in which case information is created based on the reception information shown in FIG. 4 and the master information shown in FIG. 5 will be described. The case information includes case number 131, start time of the visit period 132, end time of the visit period 133, specified start time of the visit 134, first summarization target 135, second summarization target 136, and total stay time 137.

[0019] Case number 131, start time of the visit period 132, end time of the visit period 133, and specified start time of the visit 134 are the same as the reception information shown in FIG. 4. The first summarization target 135 and the second summarization target 136 are the numbers of the first summarization target operations and the second summarization target operations included in each case, respectively. The numbers of the first summarization target operations and the second summarization target operations included in each case are calculated by referring to the classification 105 shown in FIG. 4 and the master information regarding the operations shown in FIG. 5(a). For example, in the example shown in FIG. 6, since "case number 1" includes the closing operation which is the first summarization target operation, the first summarization target 135 is "1". The total stay time 137 is the working time at the visit destination. The total stay time 137 is calculated by referring to the classification 105 shown in FIG. 4 and the working time 114 shown in FIG. 5(a). For example, in the example shown in FIG. 6, since "case number 1" is the closing operation, referring to the working time 114, the total stay time 137 is 5 minutes. In addition, the case information creation unit 17 calculates the time required for moving between cases from the addresses of each case. The case information storage unit 18 stores the case information created by the case information creation unit 17 and the time required for moving between cases.

[0020] The tour order calculation unit 19 calculates a tour order for a plurality of tour workers to share the tour operations based on the worker information stored in the worker information storage unit 12 and the case information stored in the case information storage unit 18. The tour order calculation unit 19 calculates a tour order that minimizes the total value of the values obtained by assigning a predetermined weight to each evaluation item for the degree of non-compliance, which is the degree of compliance with the evaluation of the predetermined evaluation items. Examples of the evaluation items include (1) an item regarding the visit time desired by the visit destination, (2) an item regarding the capabilities required for the operations, and (3) an item regarding the number of workers assigned to the tour operations and the moving time. The tour order calculation unit 19 calculates a tour order that minimizes the total value of the weighted violation amounts by repeatedly performing two processes: a tour order creation process and a tour order evaluation process. The evaluation item storage unit 20 stores the evaluation items used when the tour order calculation unit 19 calculates a tour order and the weights assigned to each evaluation item.

[0021] Note that each function of the tour operation sharing system 1 according to the present embodiment is executed by one or more processors. For example, it may be executed by a single processor included in the management server 10, or may be configured to execute each function by a plurality of computer devices (e.g., servers, etc.). Further, for example, the management server 10 may be provided only with a function of storing the input information, and the tour order may be calculated at the terminal 30. Further, it may be configured to be executed by a single processor included in the terminal 30.

[0022] <Calculation of tour order> An example of the process performed when the tour operation sharing system 1 according to the present embodiment calculates a tour order will be described with reference to FIGS. 7 to 13. FIG. 7 is a flowchart showing an example of the flow of the process performed when calculating the tour order according to the present embodiment. In FIG. 7, first, the worker information acquisition unit 11 acquires worker information (step S1). Examples of this worker information include the number of workers, the number of workers in charge of only simple tasks, and the number of workers capable of performing tasks that require specific abilities. The worker information acquisition unit 11 acquires this input worker information from, for example, the input device 56 of the terminal 30. Next, the worker information storage unit 12 stores the worker information (step S2). In step S2, the worker information storage unit 12 stores, as this worker information, for example, the number of workers, the number of workers in charge of only simple tasks, and the number of workers capable of performing tasks that require specific abilities.

[0023] Next, the reception information acquisition unit 13 acquires reception information (step S3). Here, for example, the reception information input by the user who received the request from the visit destination via the input device 56 of the terminal 30 is acquired. Next, the reception information storage unit 14 stores the reception information (step S4). Next, the master information acquisition unit 15 acquires master information (step S5). Here, the master information acquisition unit 15 acquires, for example, master information regarding work and master information regarding working hours as shown in FIG. 5. Next, the master information storage unit 16 stores the master information (step S6).

[0024] Next, the case information creation unit 17 creates case information based on the reception information stored in the reception information storage unit 14 and the master information stored in the master information storage unit 16 (step S7). The case information is created for each case as, for example, the visit time desired by the visit destination, whether the first summary or the second summary target business is included, information regarding the time related to the business, any of these, or information combining some of these. An example thereof is shown in FIG. 6. The case information storage unit 18 stores the created case information (step S8).

[0025] Next, the tour order calculation unit 19 of the management server 10 calculates a tour order for the tour workers to share the tour operations (step S9). In step S9, the tour order calculation unit 19 calculates a tour order that minimizes the total value obtained by weighting the violation amount, which is the degree of compliance with the evaluation of the predetermined evaluation items, for each evaluation item by the predetermined weight. Hereinafter, the value obtained by assigning a predetermined weight to the violation amount of the predetermined evaluation item for each evaluation item (the value obtained by multiplying the violation amount by the weight count) may be referred to as the "weighted violation amount". The tour order calculation unit 19 calculates a tour order that minimizes the total value of the weighted violation amounts.

[0026] An example of the weighting for each evaluation item will be described with reference to FIG. 8. FIG. 8 is a diagram showing the evaluation criteria according to the present embodiment, and shows an example of the weighting for each evaluation item according to the present embodiment. The weight number 141 is a number that identifies the evaluation item. The constraint condition name 142 indicates the evaluation content corresponding to each weight number 141. The weight 143 indicates the weight assigned to each evaluation item. The weight can be set by the user, and a large weight is assigned to important evaluation items. For example, the evaluation content of "weight number 1" is "work start < desired time zone end", and the weight 143 is "100". If this condition is violated, the value obtained by multiplying the violation amount by the weight "100" is calculated as the weight violation amount for "weight number 1". Also, for example, for a condition where no threshold is defined, such as "minimization of the number of people" for "weight number 2", the value obtained by multiplying the number of people by the weight "10" is calculated as the weight violation amount. For example, when a tour order is created to divide the circuit operation among 10 people, the weight violation amount for "weight number 2" is calculated as "100". Similarly, for "minimization of travel time" for "weight number 3", the value obtained by multiplying the total travel time by the weight "1" is calculated as the weight violation amount. Thus, for a condition where no threshold is defined, the value obtained by multiplying the parameter related to this condition by the weight is calculated as the weight violation amount. Note that for such a condition, it is also possible to set a threshold in advance and calculate the weight violation amount based on the difference from the threshold, or to calculate the weight violation amount based on the difference from the input number of people.

[0027] Note that the weighting is not limited to that shown in FIG. 8. For example, the items that each user values may be different, and the assigned weight can be changed as appropriate, such as increasing the weight assigned to the items that the user values. Also, evaluation items other than those shown in FIG. 8 may be added, or it may be applied only to some of the items shown in FIG. 8.

[0028] In the example shown in FIG. 8, the weight number 1 is an item related to the visit time desired by the tour destination. The weight numbers 4 and 5 are items related to the capabilities required for the operation. The weight numbers 2 and 3 are items related to the number of workers and the travel time for the circuit operation. For each case, the amount of weight violation is calculated for the item related to the visiting time desired by the visit order. For the items related to the capabilities required for the work, the number of workers involved in the patrol work, and the item related to the travel time, the amount of weight violation is calculated for the entire visit order.

[0029] Next, the process performed in step S9 of FIG. 7 will be described with reference to FIG. 9. FIG. 9 is a flowchart showing the process performed in step S9 of FIG. 7. In FIG. 9, the visit order calculation unit 19 first creates a provisional visit order plan based on the number of workers and the case information (step S901). The method for creating the provisional visit order is not particularly limited and may be created by any known method. The provisional visit order is created, for example, in a form of randomly allocating cases to workers. Here, the case where the visit order plan shown in FIG. 10 is created as the provisional visit order plan will be described.

[0030] FIG. 10 is a diagram showing an example of the visit order plan created by the visit order calculation unit 19 according to the present embodiment. In the example shown in FIG. 10, the visit order calculation unit 19 creates a visit order for distributing cases to three workers. The visit order includes a worker 151, a case number 152, a work schedule 153, the travel time to the next case 154, the desired time 155, the first summary target 156, and the second summary target 157. The worker 151 indicates the worker in charge of the case. Here, the worker 151 does not necessarily have to be associated with the actual worker performing the work. In the example shown in FIG. 10, the cases are distributed to workers A, B, and C, but A, B, and C are not associated with the actual workers performing the work. The user distributes each share to individual workers based on the created visit order. "A-1" and "A-2" correspond to the first case and the second case respectively that A is in charge of.

[0031] The case number 152 is a number for identifying the case. Also, elements such as "departure from the base", "break", and "arrival at the base" where time management is performed other than the case are also shown as the case number 152. The operation schedule 153 is a time schedule for each project. In the example shown in FIG. 10, for example, "Project No. 311426" is scheduled to be carried out from "11:30 to 12:30". The moving time 154 to the next project is the time required for moving between projects. In the example shown in FIG. 10, for example, the moving time from when operator A departs from the base to arriving at the visit destination where "Project No. 311426" is carried out is "30 minutes". The desired time 155 is the visit time desired by the visit destination. In the example shown in FIG. 10, for example, the visit destination hopes to visit "Project No. 311426" between "9:00 and 12:00".

[0032] The first summarization target 156 and the second summarization target 157 are the numbers of the first summarization target operations and the second summarization target operations included in each project, respectively. In the example shown in FIG. 10, for example, "Project No. 311426" includes one first summarization target operation.

[0033] Next, in FIG. 9, the tour order calculation unit 19 calculates the weighted violation amount of the items related to the visit time desired by the visit destination for each project (step S902). An example of calculating the weighted violation amount of the items related to the visit time desired by the visit destination for each project will be described with reference to FIG. 11. FIG. 11 is a diagram showing an example of calculating the weighted violation amount of the items related to the visit time desired by the visit destination in the tour order plan shown in FIG. 10. The operator 161, project number 162, operation schedule 163, and desired time 164 are the same as the operator 151, project number 152, operation schedule 153, and desired time 155 shown in FIG. 10, and the parts corresponding to the projects are shown.

[0034] The violation amount 165 indicates for each project which of the evaluation items shown in FIG. 8 is violated, and shows the weighted violation amount calculated for each evaluation item according to the weighting shown in FIG. 8. In FIG. 11, the items related to the visit time desired by the visit destination are the evaluation targets, and the weight number 1 shown in FIG. 8 is the evaluation target. In the tour schedule shown in FIG. 10, for example, for "Case No. 311417", the work schedule is "15:30 - 16:00" for the desired time "13:00 - 15:00". This violates the "work start < end of desired time zone" by 30 minutes for the weight number 1 shown in FIG. 8. By multiplying this violated fraction by the weights assigned to each weight number shown in FIG. 8, the weighted violation amount is calculated.

[0035] The total violation amount 166 for each case is the total value of the weighted violation amounts for the items related to the visit time desired by the tour destination for each case. In the example shown in FIG. 11, for example, for "Case No. 311417", the total violation amount 166 for each case is "3000".

[0036] Next, in FIG. 9, the tour sequence calculation unit 19 calculates the weighted violation amounts for the items related to the capabilities required for the operations in the entire tour schedule, the number of workers assigned to the tour operations, and the items related to the travel time (step S903). An example of calculating the weighted violation amounts for the items related to the capabilities required for the operations in the entire tour schedule, the number of workers assigned to the tour operations, and the items related to the travel time will be described with reference to FIG. 12. FIG. 12 is a diagram showing an example of calculating the weighted violation amounts for the items related to the capabilities required for the operations and the items related to the number of workers assigned to the tour operations and the travel time in the tour schedule shown in FIG. 10. (a) is a diagram showing the elements required for calculating the weighted violation amount, and (b) is a diagram showing the weighted violation amount for each evaluation item. Worker 181 indicates the worker in charge of the case. Travel time 182 is the travel time of each worker. In the tour schedule shown in FIG. 10, for example, the travel time of worker A is 30 + 90 + 30, which is "150 minutes". The total travel time of all workers is calculated as "390 minutes", and this value is used for calculating the weighted violation amount.

[0037] Whether only the first grouping target <183> indicates whether the cases assigned to each worker are only those of the first grouping target business, and the number of workers responsible only for the first grouping target business. Whether the second grouping target is included <184> indicates whether the cases assigned to each worker include the business of the second grouping target, and the number of workers responsible for the business of the second grouping target. In the tour order shown in Fig. 10, the cases assigned to workers A and C both include the business of the second grouping target, while the cases assigned to worker B are all those of the first grouping target business. The only worker responsible for the first grouping target business is "one worker", and the two workers responsible for the second grouping target business are "two workers". The number of workers <185> is the number of workers responsible for the cases. In the tour order shown in Fig. 10, the number of workers responsible for the cases is "three".

[0038] Whether there is any violation in the whole tour order <186> indicates which of the elements shown in Fig. 12(a) violates which of the evaluation items shown in Fig. 8, and the amount of weight violation for each evaluation item is shown according to the weighting shown in Fig. 8. In Fig. 12, the items related to the capabilities required for the business in the whole tour order, the number of workers involved in the tour business, and the items related to the moving time are the evaluation targets, and the weight numbers 2 to 5 shown in Fig. 8 are the evaluation targets.

[0039] The amount of weight violation related to weight number 2 is calculated by multiplying the number of workers (three) by the weight (10) shown in Fig. 8. The amount of weight violation related to weight number 3 is calculated by multiplying the total moving time of each worker (390 minutes) by the weight (1) shown in Fig. 8. The amount of weight violation related to weight number 5 is calculated by multiplying the number of workers responsible for the business of the second grouping target (two) by the weight (1000) shown in Fig. 8.

[0040] In calculating the amount of weight violation for weight number 4, the tour order calculation unit 19 compares the number of workers in charge of only the simple tasks input by the user with the number of workers in charge of only the tasks to be grouped first in the created tour order. In FIG. 12, the case where the number of workers in charge of only simple tasks is input as 1 person will be described. The value obtained by multiplying the difference between the number of workers in charge of only one predetermined task input by the user and the number of workers in charge of only the tasks to be grouped first in the created tour order by the weight shown in FIG. 8 is calculated as the amount of weight violation. As shown in FIG. 12(a), in the tour order shown in FIG. 10, the number of workers in charge of only the tasks to be grouped first is 1 person. When the number of workers in charge of only simple tasks input by the user is 1 person, the amount of weight violation for weight number 4 is calculated as 0 by (1 - 1)×1000. The total violation amount 187 is the total value of the amount of weight violation for the items related to the capabilities required for the tasks in the entire tour order, the number of workers involved in the tour tasks, and the items related to the movement time. In the example shown in FIG. 12, the total violation amount 187 is calculated as "2420".

[0041] Next, in FIG. 9, the tour order calculation unit 19 calculates the total value of the amount of weight violation for each evaluation item of the tour order plan by adding up the calculated amounts of weight violation (step S904). In the tour order plan shown in FIG. 10, the total value of the values obtained by assigning the predetermined weights to the violation amounts of the predetermined evaluation items for each evaluation item is calculated by summing up the amounts of weight violation calculated in FIGS. 11 and 12, and is calculated as "17420". This value becomes the evaluation value indicating the goodness of the tour order plan shown in FIG. 10. The tour order plan with a lower evaluation value is a tour order plan with a higher degree of compliance with the evaluation items to which a larger weight is assigned.

[0042] Next, the tour order calculation unit 19 determines whether or not the processes of steps S901 to S904 have been performed a specified number of times or more (step S905). The specified number of times is a preset number of times and can be set by the user. If it has not been performed a specified number of times or more (NO in step S905), the process returns to step S901 to create a new tour order plan. On the other hand, if it has been performed a specified number of times or more (YES in step S905), the tour order calculation unit 19 calculates a tour order that minimizes the total value of the weighting violation amounts (step S906). In step S906, the tour order calculation unit 19 calculates, as the tour order, the one with the minimum total value of the weighting violation amounts among the created tour order plans. Note that, in step S905, it is determined whether or not to repeat the processes of steps S901 to S904 based on the number of times of processing, but the present invention is not limited to this. For example, it may be configured such that the time for executing the process is predetermined, and the process proceeds to step S906 when the predetermined time has elapsed. Further, for example, in creating a tour order plan for the second and subsequent times, an algorithm may be used in which a change is made to the previously created tour order plan so that the total value of the weighting violation amounts becomes smaller to create a tour order plan. In this case, when the total value of the weighting violation amounts of the subsequently created tour order plan cannot be made smaller than that of the previously created tour order plan, the processes of steps S901 to S904 end and the process proceeds to the process of step S906.

[0043] In this way, the tour order calculation unit 19 repeatedly performs the tour order creation process (step S901) and the tour order evaluation process (steps S902 to S904) to search for a tour order that minimizes this evaluation value and calculates the tour order. Based on the created tour order, the user can allocate the shared cases to individual workers. The processes shown in FIGS. 7 and 9 according to this embodiment are each implemented by a program executed by the management server 10. However, the embodiment is not limited to this mode, and may be implemented in a form in which it is distributed and executed by a plurality of devices, or in a form in which a program is installed on the terminal 30 and executed.

[0044] In this embodiment, as workers by ability, workers who perform only the operations of the first grouping target and workers who can perform the operations of the second grouping target are cited, but it is not limited to this. For example, the qualifications required for implementation may be further classified in more detail according to the difficulty of obtaining them, and different weights may be assigned. Also, in step S1 of FIG. 7, the worker information acquisition unit 11 may be configured not to acquire the number of workers. In this case, the tour order calculation unit 19 calculates a tour order that minimizes the number of workers performing the operations based on the evaluation item regarding "minimization of the number of people" shown in FIG. 8. Further, the tour order calculation unit 19 can calculate a tour order that minimizes the number of workers performing operations that require a specific ability based on the evaluation item regarding "second grouping of skills and qualification target cases" shown in FIG. 8.

[0045] <Modification Example> The tour operation sharing system 2 according to the modification example includes the management server 10 and the terminal 30, similarly to the tour operation sharing system 1. The management server 10 and the terminal 30 are connected via the network 40, and they each have the same configuration as the tour operation sharing system 1. The tour operation sharing system 2 calculates the tour order by repeatedly performing the tour order creation process and the tour order evaluation process, similarly to the tour operation sharing system 1. The tour operation sharing system 2 according to the modification example is different from the tour operation sharing system 1 in the evaluation item regarding "the first grouping target", which is a simple operation that does not require a specific qualification with relatively few holders. In the modification example, the number of workers who can perform other operations and the number of workers who cannot perform other operations among the workers who are in charge of only simple operations are acquired, and the goodness of the tour order is evaluated by different weightings for the number of each of these workers.

[0046] An example of weighting for each evaluation item according to a modification example will be described with reference to FIGS. 13 and 14. FIG. 13 is a diagram showing an example of weighting for each evaluation item according to a modification example. Weight number 191 is a number for identifying an evaluation item. Constraint condition name 192 indicates the evaluation content corresponding to each weight number 191. Weight 193 indicates the weight assigned to each evaluation item. In the modification example, as evaluation items related to the first summarization target, weight number 4 "First summarization of cases subject to skills and qualifications" and weight number 4' "First summarization of cases subject to skills and qualifications (desired)" are set. Other evaluation items are the same as the example of weighting shown in FIG. 8.

[0047] Weight number 4 "First summarization of cases subject to skills and qualifications" is an evaluation item regarding the number of workers who can only perform other operations among the workers in charge of only simple operations input by the user. Weight number 4' "First summarization of cases subject to skills and qualifications (desired)" is an evaluation item regarding the number of workers who can also perform other operations among the workers in charge of only simple operations input by the user. An example of evaluating the tour plan shown in FIG. 10 based on these evaluation items will be described with reference to FIG. 14. FIG. 14 is a diagram showing a calculation example according to a modification example of the amount of weight violation regarding items related to the abilities required for operations and the number of workers and travel time involved in tour operations in the tour plan shown in FIG. 10.

[0048] The elements necessary for calculating the amount of weight violation in the tour plan shown in FIG. 10 are as shown in FIG. 12(a). In FIG. 14, the amount of weight violation is calculated based on FIGS. 12(a) and 13. Violation 201 in the entire tour sequence shows which elements shown in Fig. 12(a) violate any of the evaluation items shown in Fig. 13, and the amount of weight violation for each evaluation item is shown according to the weighting shown in Fig. 13. In Fig. 14, items related to the capabilities required for the operations in the entire tour sequence, the number of workers involved in the tour operations, and the moving time are the evaluation targets, and the weight numbers 2, 3, 4, 4´, 5 shown in Fig. 13 are the evaluation targets.

[0049] In Fig. 14, the case where, among the workers in charge of only simple operations, 2 workers can perform other operations and 1 worker cannot perform other operations is described. When calculating the amount of weight violation related to weight number 4, the tour sequence calculation unit 19 compares the number of workers who can only perform simple operations input by the user and cannot perform other operations with the number of workers who are only in charge of the operations to be grouped for the first time in the created tour sequence. As shown in Fig. 12(a), in the tour sequence shown in Fig. 10, there is 1 worker who is only in charge of the operations to be grouped for the first time. When the number of workers who can only perform simple operations input by the user and cannot perform other operations is 1, the amount of weight violation related to weight number 4 is calculated as (1 - 1) × 1000 = 0.

[0050] When calculating the amount of weight violation related to weight number 4´, the tour sequence calculation unit 19 compares the number of workers who can perform other operations among the workers who can only perform simple operations input by the user with the number of workers who are only in charge of the operations to be grouped for the first time in the created tour sequence. As shown in Fig. 12(a), in the tour sequence shown in Fig. 10, there is 1 worker who is only in charge of the operations to be grouped for the first time. When the number of workers who can perform other operations among the workers who can only perform simple operations input by the user is 2, the amount of weight violation related to weight number 4´ is calculated as (2 - 1) × 10 = 10. The amounts of weight violation related to weight numbers 2, 3, and 5 are calculated in the same manner as the example shown in Fig. 12(b). The total violation amount 202 is the total value of the weighted violation amounts for items related to the capabilities required for the work in the entire tour sequence, the number of workers involved in the tour work, and items related to the travel time. In the example shown in FIG. 14, the total violation amount 202 is calculated as "2430".

[0051] The tour sequence calculation unit 19 according to the modification example calculates the weighted violation amount for the item related to the visit time desired by the tour destination in the same manner as the example shown in FIG. 11. Then, it calculates the total value of the values obtained by assigning predetermined weights to the violation amounts of the predetermined evaluation items for each evaluation item. The tour sequence calculation unit 19 repeatedly performs two processes, namely, the process of creating the tour sequence and the process of evaluating the tour sequence, to search for a tour sequence that minimizes the total value of the weighted violation amounts and calculates the tour sequence. In the modification example, even among the workers who are only in charge of simple tasks, different weightings can be given depending on whether they have the ability to perform other tasks. Thereby, for example, it is possible to calculate a tour sequence considering the number of users who desire to have the ability to perform other tasks but are only in charge of simple tasks.

Explanation of Signs

[0052] 1, 2... Tour work sharing system, 10... Management server, 11... Worker information acquisition unit, 12... Worker information storage unit, 13... Reception information acquisition unit, 14... Reception information storage unit, 15... Master information acquisition unit, 16... Master information storage unit, 17... Project information creation unit, 18... Project information storage unit, 19... Tour sequence calculation unit, 20... Evaluation item storage unit, 30... Terminal, 40... Network

Claims

1. A patrol work allocation system that creates a patrol order for multiple patrol workers to share patrol work, one or more processors; the one or more processors: Obtain information about the destination and the number of workers by ability, The patrol order is calculated based on an evaluation of the quality of the patrol order created based on the information about the patrol destinations and the number of workers by ability. A patrol work sharing system characterized by:

2. The evaluation of the quality of the tour order is performed by minimizing the total value of the violation amount, which is the degree of compliance with the evaluation of predetermined evaluation items, and the weights predetermined for each evaluation item.

2. The mobile task sharing system according to claim 1.

3. The predetermined evaluation items include an item regarding the number of people in charge of work requiring skills.

3. The mobile task sharing system according to claim 2.

4. The number of workers by ability is the number of workers who are only responsible for simple tasks.

2. The mobile task sharing system according to claim 1.

5. The workers who are only in charge of simple tasks include workers who can do other tasks and workers who cannot do other tasks, and the quality of the patrol order is evaluated by assigning different weights to the number of these workers.

5. The mobile task sharing system according to claim 4.

6. The number of workers by ability is the number of workers who can perform work that requires a specific ability.

2. The mobile task sharing system according to claim 1.

7. Calculate the tour order so as to minimize the number of workers performing the work that requires the specific ability 7. The mobile task sharing system according to claim 6.

8. The evaluation of the patrol order is based on minimizing the number of workers involved in the work.

2. The mobile task sharing system according to claim 1, wherein:

9. A computer that creates a patrol order for multiple patrol workers to share patrol work, A function to acquire information about the destination and the number of workers by ability; a function of calculating a patrol order based on an evaluation of the quality of the patrol order created based on the information about the patrol destination and the number of workers by ability; A program to make this happen.

Images