JPWO2018025387A1 - Specific program, specific method, and specific device - Google Patents

Abstract

The operation management device (100) receives information on a departure place and a destination, and identifies a plurality of route candidates connecting the departure place and the destination. The operation management device (100) refers to a storage unit that stores driving history information of a driver, identifies a driver who has traveled on any one of a plurality of route candidates, and selects the identified driver as a candidate. Output as.

Description

  The present invention relates to a specific program and the like.

  In recent years, demand for trucks and tour buses has increased, but on the other hand, it has become difficult to secure drivers who are accustomed to traveling on service routes due to problems with treatment. Therefore, when a transportation request is made, an inexperienced driver may be forced to drive, which may lead to an accident.

  For example, in order to prevent the occurrence of an accident, there is a technique that warns a driver who is driving an accident frequently on an operation route or instructs a resting place.

JP-A-8-201088 JP 2003-288516 A JP 2011-80919 A JP 2007-171126 A

  However, the above-described conventional technique has a problem that an appropriate driver cannot be specified for the operation route.

  Since trucks and tour buses often travel on a fixed route, it is costly to introduce a service that warns drivers who are driving accidents on the operating route and instructs resting places. There are many cases that do not meet the requirements. For this reason, it is required to specify an appropriate driver for the operation route.

  In one aspect, an object is to provide a specific program, a specific method, and a specific device that can specify an appropriate driver for an operation route.

  In the first plan, the computer executes the following processing. The computer receives information on the departure point and the destination, and identifies a plurality of route candidates connecting the departure point and the destination. The computer refers to the storage unit storing the driving history information of the driver, identifies a driver who has traveled on any one of the plurality of route candidates, and outputs the identified driver as a candidate.

  Appropriate drivers can be identified for the route.

FIG. 1 is a diagram illustrating an example of the overall configuration of a system according to an embodiment. FIG. 2 is a functional block diagram illustrating the configuration of the operation management apparatus according to the present embodiment. FIG. 3 is a diagram illustrating an example of a data structure of the travel history table. FIG. 4 is a diagram illustrating an example of a data structure of travel section history information. FIG. 5 is a diagram illustrating an example of the data structure of the section information. FIG. 6 is a diagram illustrating an example of a data structure of the operation route table. FIG. 7 is a diagram (1) illustrating an example of the screen information generated by the display unit. FIG. 8 is a diagram (2) illustrating an example of the screen information generated by the display unit. FIG. 9 is a flowchart illustrating the processing procedure of the operation management apparatus according to the present embodiment. FIG. 10 is a diagram illustrating an example of a hardware configuration of a computer that realizes the same function as the operation management apparatus.

  Embodiments of a specific program, a specific method, and a specific device according to the present invention will be described below in detail with reference to the drawings. Note that the present invention is not limited to the embodiments.

  FIG. 1 is a diagram illustrating an example of the overall configuration of a system according to an embodiment. The operation management system shown in FIG. 1 includes an operation management device 100 and digital octopuses 1a, 1b, and 1c. The operation management device 100 is an example of a specific device.

  Each of the digital octopuses 1a, 1b, and 1c is mounted on a vehicle A, a vehicle B, and a vehicle C. The digital octopus 1a, 1b, 1c and the operation management apparatus 100 are connected to each other via a network N so as to communicate with each other. For such a network N, any kind of communication network such as the Internet (Internet), LAN (Local Area Network), VPN (Virtual Private Network), etc. can be adopted regardless of wired or wireless.

  Each digital octopus 1a, 1b, 1c is a kind of in-vehicle device mounted on a vehicle, and is also called a digital tachograph or an operation recorder. Hereinafter, when each of the digital tachometers 1a, 1b, and 1c is collectively referred to, it may be simply referred to as “digital tachometer”.

  Each digital octopus can acquire travel records such as speed and distance by being connected via a digital octopus connector (not shown) or an ECU (Electronic Control Unit). For example, each digital octopus starts time series changes in legal driving parameters such as speed and distance, and along with this, a time series of position information including latitude and longitude via a GPS (Global Positioning System) receiver (not shown). Data can also be acquired as travel data. For example, each digital octopus can acquire travel data at a predetermined sampling period, for example, at intervals of 0.5 seconds or less.

  More specifically, each digital octopus periodically transmits information that associates driver identification information that uniquely identifies the driver with various data described later to the operation management apparatus 100. For example, when driving a vehicle, the driver may input driver identification information using an input device set in the vehicle, or information on an IC (Integrated Circuit) card storing the driver identification information, It may be read by a digital octopus.

  For example, the digital octopus 1a transmits the driver identification information and the position coordinates of the driver of the vehicle A to the operation management apparatus 100 every second. The digital octopus 1a specifies the position coordinates based on 0.1 second unit data obtained from a GPS (Global Positioning System) receiver in which an external antenna of the vehicle is installed.

  In the following description, the driver identification information and the position coordinate information transmitted from the digital octopus 1a to 1c to the operation management apparatus 100 are collectively referred to as travel data.

  The operation management device 100 is a device that identifies a driver who travels on a route that connects a destination and a departure place when the designation of the destination and the departure point is received. For example, the operation management apparatus 100 identifies a plurality of route candidates that connect a departure point and a destination, and identifies a driver who has traveled any one of the plurality of route candidates as a candidate. By executing such processing, it is possible to preferentially select a driver who has traveled along the route of operation, so that an appropriate driver can be selected for the route of operation.

  FIG. 2 is a functional block diagram illustrating the configuration of the operation management apparatus according to the present embodiment. As illustrated in FIG. 2, the operation management apparatus 100 includes a communication unit 110, an input unit 120, a display unit 130, a storage unit 140, and a control unit 150.

  The communication unit 110 is a communication device that controls data communication with the digital octopuses 1a to 1c. A control unit 150 described later receives travel data from the digital octopus 1a to 1c via the communication unit 110. For example, the communication unit 110 corresponds to a communication device such as a NIC (Network Interface Card).

  The input unit 120 is an input device that inputs various types of information to the operation management device 100. The input unit 120 corresponds to, for example, a keyboard, a mouse, a touch panel, and the like. For example, the operator operates the input unit 120 to input information on the departure point and destination of the operation route.

  The display unit 130 is a display device that displays various types of information output from the control unit 150. For example, the display unit 130 displays information related to the driver of the operation route, and the operator refers to the information displayed on the display unit 130 and requests the driver from the shipping company. The display unit 130 corresponds to a liquid crystal display, a touch panel, or the like.

  The storage unit 140 includes a travel history table 141, section information 142, and an operation route table 143. The storage unit 140 corresponds to a semiconductor memory element such as a random access memory (RAM), a read only memory (ROM), and a flash memory, and a storage device such as a hard disk drive (HDD).

  The travel history table 141 is a table that holds information related to a driver's travel history. FIG. 3 is a diagram illustrating an example of a data structure of the travel history table. As shown in FIG. 3, the travel history table 141 associates driver identification information, shipping company identification information, and travel section history information.

  The driver identification information is information that uniquely identifies the driver. The shipping company identification information is information that uniquely identifies the shipping company where the driver works. The travel section history information is information indicating the history of the section in which the driver has traveled.

  FIG. 4 is a diagram illustrating an example of a data structure of travel section history information. FIG. 4 shows the travel section history information of the driver 10A as an example. As illustrated in FIG. 4, the travel section history information associates the section identification information with the number of travels. The section identification information is information that uniquely identifies a section on the road. The travel count is information indicating the number of times the driver has traveled in the corresponding section. For example, in the example illustrated in FIG. 4, it is indicated that the number of times that the driver 10A has traveled through the section of the section identification information “r11” is “100 times”.

  The section information 142 has information regarding the section. FIG. 5 is a diagram illustrating an example of the data structure of the section information. As shown in FIG. 5, the section information 142 associates section identification information with section coordinate information. The section identification information is information that uniquely identifies a section on the road. The section coordinate information is information corresponding to coordinates of two corners having a diagonal relationship among the four corners included in the quadrangle when the section is a quadrangular shape.

  The operation route table 143 is a table that holds information on a plurality of route candidates connecting a certain departure point and a certain destination. FIG. 6 is a diagram illustrating an example of a data structure of the operation route table. As illustrated in FIG. 6, the operation route table 143 associates a departure point, a destination, a route candidate, a section, an estimated time, an estimated cost, and a safety level.

  The departure place is information that uniquely indicates the departure place. The destination is information that uniquely indicates the destination. The route candidate is information that uniquely indicates a route candidate from the departure point to the destination. The section is information indicating a section constituting the corresponding route candidate. The estimated time is information indicating the time required when the corresponding route candidate travels with the vehicle. The expected cost is information obtained by quantifying a fee required for traveling the corresponding route candidate with a vehicle. It is assumed that the higher the expected cost, the higher the fee. The safety level indicates the safety level of the corresponding route candidate. The higher the safety level is, the safer the safety level is.

  For example, if the departure place is “St101” and the destination is “De101”, the route candidates are “R01, R02, R03”. The route candidate “R01” is composed of the sections “r11, r12, r13”, and has a predicted time “1 hour”, a predicted cost “50”, and a safety level “level 1”. The route candidate “R02” is composed of the sections “r21, r22, r23”, and has a predicted time “0.5 hours”, a predicted cost “60”, and a safety level “level 2”. The route candidate “R03” is composed of the sections “r31, r32, r33” and has the predicted time “1.5 hours”, the predicted cost “70”, and the safety level “level 1”.

  Returning to the description of FIG. The control unit 150 includes a travel data receiving unit 151, an updating unit 152, a route candidate specifying unit 153, and a driver specifying unit 154. The control unit 150 can be realized by a CPU (Central Processing Unit), an MPU (Micro Processing Unit), or the like. It can also be realized by hard wired logic such as ASIC (Application Specific Integrated Circuit) or FPGA (Field Programmable Gate Array).

  The travel data receiving unit 151 is a processing unit that receives travel data from each of the digital octopuses 1a to 1c. The travel data receiving unit 151 outputs the received travel data to the update unit 152. As described above, the driving data includes driver identification information and position coordinate information.

  The update unit 152 is a processing unit that compares the travel data with the section information 142 to identify the section in which the driver has traveled and updates the travel section history information in the travel history table 141.

  For example, the update unit 152 compares the position coordinate information of the travel data with the section coordinate information of the section information 142 to identify a section including a vehicle driven by the driver. The update unit 152 identifies the travel section history information in the travel history table 141 using the driver identification information as a key, and adds 1 to the number of travels corresponding to the section identified in the previous process in the identified travel section history information. .

  For example, when the driver identification information is “driver 10A” and the position coordinates are included in the section coordinate information (xA1, yA1) to (xA2, yA2) of the section r11, the update unit 152 sets “driver 10A” as “driver 10A”. It is determined that the vehicle travels in the section “r11”. The update unit 152 adds 1 to the number of times of travel corresponding to the section identification information “section r11” of the travel section history information corresponding to “driver 10A”.

  The update unit 152 updates the number of travels corresponding to the section identification information by repeatedly executing the above process every time the travel data is acquired. In addition, the update part 152 adds 1 to the frequency | count of driving | running | working of area identification information, when the area identification information specified last time and the area identification information specified this time are the same about the same driver identification information. Skip the process to do.

  The route candidate specifying unit 153 specifies a plurality of route candidates connecting the departure point and the destination based on the operation route table 143 when information on the departure point and the destination is received from the input unit 120 or the like. It is a processing unit. The route candidate specifying unit 153 outputs information on the specified route candidate to the driver specifying unit 154.

  For example, the route candidate specifying unit 153 compares the set of the departure point and the destination acquired from the input unit 120 with the operation route table 143 to specify the route candidate. For example, when obtaining the departure place “St101” and the destination “De101”, the route candidate specifying unit 153 obtains a plurality of route candidates “R01, R02, R03” based on the operation route table 143 shown in FIG. Identify. The route candidate specifying unit 153 outputs the specified route candidates “R01, R02, R03” to the driver specifying unit 154. In addition, the route candidate specifying unit 153 may specify a plurality of route candidates that connect the departure point and the destination based on another route search technique.

  Based on the travel history table 141 and the operation route table 143, the driver identifying unit 154 identifies a driver who has traveled for any one of a plurality of route candidates, and displays the identified driver as a candidate. It is a processing unit that outputs to the unit 130.

  For example, the driver specifying unit 154 specifies a section included in the route candidate with reference to the operation route table 143 using the route candidate acquired from the route candidate specifying unit 153 as a key. The driver identifying unit 154 compares the identified section with the section of the travel section history information in the travel history table 141, and for each section included in the route candidate, the driver identification information that satisfies the condition that the number of travels is equal to or greater than the threshold. Is identified.

  For example, an example of processing in which the driver identifying unit 154 identifies driver identification information that has traveled a route candidate “R01” among a plurality of route candidates will be described. The driver specifying unit 154 compares the route candidate “R01” with the operation route table 143 and specifies the section “r11, r12, r13” included in the route candidate “R01”.

  The driver specifying unit 154 scans the travel section history information in the travel history table 141 and specifies driver identification information in which the number of travels for the section “r11, r12, r13” is all equal to or greater than the threshold. For example, when the threshold is “10 times”, the number of times the driver identification information “driver 10A” is traveling for the section “r11, r12, r13” is equal to or greater than the threshold. Therefore, the driver specifying unit 154 specifies “driver 10A” as identification information of a driver who has traveled the route candidate “R01”.

  The driver specifying unit 154 specifies the driver identification information of the driver who has traveled the route candidate by repeatedly executing the above process for each route candidate. The driver identification unit 154 associates the route candidate, the identified driver identification information, and the shipping company information on which the driver of the driver identification information works, and outputs it to the display unit 130. The driver specifying unit 154 compares the driver identification information with the travel history table 141 to specify the shipping company information.

  The driver identification unit 154 generates screen information indicating the driver identification result and outputs the screen information to the display unit 130. FIG. 7 is a diagram (1) illustrating an example of the screen information generated by the display unit. As shown in FIG. 7, the screen information 60 includes an area 61 indicating a departure place, an area 62 indicating a destination, an area 63 indicating a plurality of route candidates, an area 64 indicating a driver of each route candidate, and the work of each driver. An area 65 indicating the shipping company to be included is included.

  Note that the driver specifying unit 154 executes the following processing when there is no driver who has traveled the route candidate for all of the plurality of route candidates acquired from the route candidate specifying unit 153.

  The driver specifying unit 154 divides the route candidate into a plurality of sections, and specifies driver identification information of drivers who have traveled through the divided sections. In this case, the driver specifying unit 154 proposes to the operator to drive an alternative route candidate to be replaced by a driver who has traveled for each section.

  For example, it is assumed that a plurality of route candidates specified by the route candidate specifying unit 153 is “R04, R05”, and there is no driver who has traveled the route candidate “R04, R05”. In this case, the driver identification unit 154 divides the route candidate “R04” into the sections “r41, r42”, and has experience of driving the section “r42” with the driver who has traveled the section “r41”. Identify the driver. Further, the driver identification unit 154 divides the route candidate “R05” into the sections “r51, r52”, and identifies the driver who has traveled the section “r51” and the driver who has traveled the section “r52”. To do.

  An example of processing for identifying a driver who has traveled in the section “r41” and a driver who has traveled in the section “r42” will be described. The driver identifying unit 154 scans the travel section history information in the travel history table 141, and identifies driver identification information in which the number of travels for the section “r41” is all equal to or greater than the threshold. The driver specifying unit 154 scans the travel section history information in the travel history table 141 and specifies driver identification information in which the number of travels for the section “r42” is all equal to or greater than the threshold.

  An example of processing for identifying a driver who has traveled in the section “r51” and a driver who has traveled in the section “r52” will be described. The driver specifying unit 154 scans the travel section history information in the travel history table 141 and specifies driver identification information in which the number of travels for the section “r51” is all equal to or greater than the threshold. The driver specifying unit 154 scans the travel section history information in the travel history table 141 and specifies driver identification information in which the number of travels for the section “r52” is all equal to or greater than the threshold.

  The driver identification unit 154 generates screen information indicating the driver identification result and outputs the screen information to the display unit 130. FIG. 8 is a diagram (2) illustrating an example of the screen information generated by the display unit. As shown in FIG. 8, the screen information 70 includes an area 71 indicating a departure place, an area 72 indicating a destination, and an area 73 indicating a plurality of route candidates. In addition, the screen information 70 includes an area 74 indicating a section, an area 75 indicating a driver who has traveled the section, and an area 76 indicating information on a shipping company where each driver works.

  In the example shown in FIG. 8, the driver who has traveled in the section “r41” is “driver 10D”, and the shipping company information of this driver is “transport company 20C”. The driver who has traveled in the section “r42” is “driver 10E”, and the transportation company information of this driver is “transportation company 20D”.

  In the example illustrated in FIG. 8, the driver who has traveled in the section “r51” is “driver 10F”, and the transportation company information of this driver is “transportation company 20E”. The driver who has traveled in the section “r52” is “driver 10G”, and the transportation company information of this driver is “transportation company 20A”.

  By the way, the driver specifying unit 154 specifies driver identification information of a driver who has traveled a route candidate, and when the number of times the driver has traveled for the route candidate is less than a threshold, the following processing may be further executed. good. It is assumed that the driver has traveled a plurality of route candidates that connect the same starting point and destination. In this case, the driver specifying unit 154 may preferentially notify the route candidate with the shortest prediction time among the plurality of route candidates, or give priority to the route candidate with the low estimated cost. Alternatively, the route candidate with the highest safety level may be preferentially notified.

  Further, when notifying the route candidate, the driver identifying unit 154 executes a process of displaying the location of the accident frequent occurrence point when the accident frequent occurrence point is included among the routes included in the route candidate. Also good.

  Next, an example of a processing procedure of the operation management apparatus 100 according to the present embodiment will be described. FIG. 9 is a flowchart illustrating the processing procedure of the operation management apparatus according to the present embodiment. As illustrated in FIG. 9, the route candidate specifying unit 153 of the operation management apparatus 100 receives information on the departure place and the destination (Step S <b> 101). The route candidate specifying unit 153 specifies a plurality of route candidates connecting the departure point and the destination (step S102).

  The driver specifying unit 154 of the operation management apparatus 100 compares the plurality of route candidates with the travel section history information of each driver, and determines whether there is a driver who has traveled any of the route candidates ( Step S103).

  If there is a driver (Yes in step S104), the driver specifying unit 154 displays the route candidate, the driver who has traveled the route candidate, and the shipping company information in association with each other (step S105). .

  If there is no driver (step S104, No), the driver specifying unit 154 proceeds to step S106. The driver specifying unit 154 divides each route candidate into a plurality of sections (step S106). The driver specifying unit 154 displays, for each section included in the route candidate, the driver who has traveled the section and the shipping company information in association with each other (step S107).

  Next, the effect of the operation management apparatus 100 according to the present embodiment will be described. The operation management apparatus 100 identifies a plurality of route candidates connecting the departure point and the destination, refers to the travel history table 141, and selects a driver who has traveled with respect to any one of the plurality of route candidates. Identify and output the identified driver as a candidate. For this reason, it is possible to preferentially select a driver who has traveled on the operation route, and to select an appropriate driver for the operation route. In addition, accidents can be prevented.

  If there is no driver who has traveled for a plurality of route candidates, the operation management device 100 divides the route candidate into a plurality of sections, and each driver who has traveled for each of the divided sections Identified as a section driver. Accordingly, it is possible to prevent the driver having no experience from driving and to propose to the operator to drive an alternative route candidate to be replaced by the driver who has traveled at least for each section.

  The operation management apparatus 100 divides route candidates into a plurality of sections in units of sections in which the driver has traveled. For this reason, even when there is no driver who has driven the route candidates in a row, a plurality of drivers who have traveled can be driven in place of each other.

  In addition, when dividing the route candidate into a plurality of sections, the driver specifying unit 154 of the operation management apparatus 100 may divide the route candidates into a plurality of sections while being included in the main city among all sections including the route candidates. Anyway. Since it is considered that there are a plurality of drivers who have travel experience in major cities, it is possible to efficiently identify drivers who have traveled in the section.

  Next, an example of a hardware configuration of a computer that realizes the same function as the operation management apparatus 100 shown in the above embodiment will be described. FIG. 10 is a diagram illustrating an example of a hardware configuration of a computer that realizes the same function as the operation management apparatus.

  As illustrated in FIG. 10, the computer 200 includes a CPU 201 that executes various arithmetic processes, an input device 202 that receives data input from a user, and a display 203. The computer 200 also includes a reading device 204 that reads programs and the like from a storage medium, and an interface device 205 that exchanges data with other computers via a network. The computer 200 also includes a RAM 206 that temporarily stores various information and a hard disk device 207. The devices 201 to 207 are connected to the bus 208.

  The hard disk device 207 includes a travel data receiving program 207a, an update program 207b, a route candidate specifying program 207c, and a driver specifying program 207d. The CPU 201 reads the travel data reception program 207 a, the update program 207 b, the route candidate identification program 207 c, and the driver identification program 207 d and develops them in the RAM 206.

  The travel data reception program 207a functions as a travel data reception process 206a. The update program 207b functions as the update process 206b. The route candidate specifying program 207c functions as a route candidate specifying process 206c. The driver identification program 207d functions as a driver identification process 206d.

  The process of the travel data receiving process 206a corresponds to the process of the travel data receiving unit 151. The process of the update process 206b corresponds to the process of the update unit 152. The process of the route candidate specifying process 206c corresponds to the process of the route candidate specifying unit 153. The process of the driver specifying process 206d corresponds to the process of the driver specifying unit 154.

  Note that the programs 207a to 207d are not necessarily stored in the hard disk device 207 from the beginning. For example, each program is stored in a “portable physical medium” such as a flexible disk (FD), a CD-ROM, a DVD disk, a magneto-optical disk, and an IC card inserted into the computer 200. Then, the computer 200 may read and execute each of the programs 207a to 207d.

DESCRIPTION OF SYMBOLS 100 Operation management apparatus 110 Communication part 120 Input part 130 Display part 140 Storage part 150 Control part

Claims (12)

On the computer,
Accepts information about origin and destination,
Identifying a plurality of route candidates connecting the starting point and the destination,
Referring to the storage unit that stores the driving history information of the driver, a driver who has traveled for any one of the plurality of route candidates is identified,
A specific program characterized by causing the specified driver to be output as a candidate.   The process of specifying the driver divides the route candidate into a plurality of sections when there is no driver who has traveled the entire route for any of the specified route candidates. The specifying program according to claim 1, wherein a driver who has traveled in each divided section is specified as a driver in each section.   The identification program according to claim 2, wherein the process of identifying the driver divides the route candidate into a plurality of sections in a section unit in which the driver has experienced driving.   The identification program according to claim 2 or 3, wherein the process of identifying the driver is divided into a plurality of sections while being included in a major city among the route candidates. A specific method performed by a computer,
Accepts information about origin and destination,
Identifying a plurality of route candidates connecting the starting point and the destination,
Referring to the storage unit that stores the driving history information of the driver, a driver who has traveled for any one of the plurality of route candidates is identified,
A specifying method characterized by executing a process of outputting the specified driver as a candidate.   The process of specifying the driver divides the route candidate into a plurality of sections when there is no driver who has traveled the entire route for any of the specified route candidates. 6. The specifying method according to claim 5, wherein a driver who has traveled in each divided section is specified as a driver in each section.   The identification method according to claim 6, wherein the process of identifying the driver divides the route candidate into a plurality of sections in a section unit in which the driver has experienced driving.   The identification method according to claim 6 or 7, wherein the process of identifying the driver is divided into a plurality of sections while being included in a major city among the route candidates. A route specifying unit that receives information of a departure place and a destination and specifies a plurality of route candidates that connect the departure place and the destination;
A driver identifying unit that refers to a storage unit that stores a driving history of the driver, identifies a driver who has traveled on any one of the plurality of route candidates, and outputs the identified driver as a candidate; A specific device comprising:   The driver specifying unit divides the route candidate into a plurality of sections when there is no driver who has traveled the entire route for any of the specified route candidates. The identifying device according to claim 9, wherein a driver who has traveled in each section is identified as a driver in each section.   The identification device according to claim 10, wherein the driver identification unit divides the route candidate into a plurality of sections for each section in which the driver has experienced driving.   The identification device according to claim 10 or 11, wherein the driver identification unit divides the route candidates into a plurality of sections while being included in a major city.

Images