TWI739193B - Route evaluation device, route evaluation system, route evaluation method and route evaluation program - Google Patents

Abstract

A path evaluation device (5) that evaluates the movement path of a mover passing through a plurality of areas on the map is provided with a memory unit (21), which memorizes each of the plurality of areas corresponding to the entrance and the exit The location is the position information of the plural elements on the map defined by crossing the moving path; and the information obtaining unit (202) obtains the position information of the mover and the time information corresponding to the position information ; And the passing judgment unit (208), based on the position information obtained by the information obtaining unit (202) and the position information of the plural elements stored in the memory unit (201), to determine whether the mover has passed the plural Each of the elements.

Description

Route evaluation device, route evaluation system, route evaluation method and route evaluation program

The present invention relates to a route evaluation device, a route evaluation system, a route evaluation method, and a route evaluation program that evaluate travel routes and actual performance.

As this kind of technology, in the prior art, it is known that it is constructed based on the position information obtained from the GPS signal received by the GPS receiver of the user terminal to determine whether the user has arrived on the moving path. A device for grasping everything at the designated plural locations (for example, refer to Japanese Patent Application Laid-Open No. 2008-242556 (JP2008-242556A)). In the device described in JP2008-242556A, the passing of the reference point is used as an opportunity, and the measurement of the time is started. Compare between them to determine whether the user has arrived at various points as planned. However, when evaluating the moving route, it is ideal to have a grasp of whether or not it has actually passed through a plurality of points on the planned route. However, in the device described in JP2008-242556A, it is only for determining whether the user has reached each point as planned, and not for determining the passage of plural points on a predetermined route.

One aspect of the present invention is a path evaluation device that evaluates the movement path of a mover passing through a plurality of areas on a map, and is provided with a memory unit that memorizes the entries and entries of each of the plurality of areas And the position information of the plural elements on the map defined by the position corresponding to the exit to cross the moving path; and the information acquisition part is to obtain the position information of the mover and the time corresponding to the position information Information; and the passing determination unit, based on the position information obtained by the information acquisition unit and the position information of the plural elements stored in the memory unit, to determine whether the mover has passed each of the plural elements. The path evaluation system, which is another aspect of the present invention, is provided with: a path evaluation device; and a mobile terminal, which moves together with the operator, and sends the position information of the mover and the time information corresponding to the position information To the path evaluation device. Yet another aspect of the present invention is a path evaluation method for evaluating the movement path of a mover passing through a plurality of areas on a map, and includes the following steps: obtaining the location information of the mover, and the location Information corresponding to the time information; based on the obtained position information, and the position corresponding to the entrance and exit of each of the plural areas, and the plural elements on the map defined in a way that intersects the movement path Location information to determine whether the mover has passed each of the plural elements. Yet another aspect of the present invention is a path evaluation program that evaluates the movement path of a mover passing through a plurality of areas on the map, and causes the computer to execute the following procedure: obtain the location information of the mover, and The procedure of the time information corresponding to the position information; the plural number on the map defined by the way of crossing the moving path based on the obtained position information and the position corresponding to the entrance and exit of each of the plural areas The location information of the element of the mobile phone, and the process of judging whether the mover has passed each of the elements of the plural number. Yet another aspect of the present invention is a path evaluation device that evaluates the movement path of a mover who passes through plural areas on the map in a specific order, and is provided with a memory unit, which is memorized in the plural areas The position information of the plural elements on the map defined by the position corresponding to the entrance and the exit by intersecting the moving path; and the information acquisition part is to acquire the position information of the mover and The time information corresponding to the location information; and the path calculation unit, based on the location information and time information obtained by the information acquisition unit, to calculate the actual path of the move actually made by the mover; and the intersection calculation unit, which calculates the loan The intersection of the plural number between the actual performance path calculated by the path calculation unit and the plural elements memorized in the memory unit; and the judging unit is based on the way that the actual performance path passes through the plural areas in a specific order The predetermined passing sequence is determined in order to determine whether the intersection of the plural numbers calculated by the intersection calculation unit is valid or invalid; and the required time calculation unit is based on the intersections determined to be valid by the determination unit The position information and time information obtained by the information obtaining section are used to calculate the time required for the mover to pass through each of the plural areas. Yet another aspect of the present invention is a path evaluation method for evaluating the movement path of a mover passing through a plurality of areas on the map in a specific order, and includes the following steps: obtaining location information of the mover , And the time information corresponding to the location information; based on the obtained location information and time information, calculate the actual path of the move actually made by the mover; calculate the calculated actual path and each of the areas in the plural The plural elements on the map defined by the positions corresponding to the entrance and exit by intersecting the movement path, the intersection of the plural numbers between these; based on the fact that the path will pass through the plural numbers in a specific order To determine whether the calculated intersection point of the plural number is valid or invalid according to the pre-established rules of the area method; based on the position information and time information obtained for the intersection point determined as valid, it is calculated that the mover will pass the plural number The time required by each area. Yet another aspect of the present invention is a path evaluation program that evaluates the movement path of a mover who passes through plural areas on the map in a specific order, and makes the computer execute the following procedure: Get the mover's position Information, and the procedure of the time information corresponding to the position information; based on the obtained position information and time information, the procedure of calculating the actual performance path of the move actually made by the mover; calculating the calculated actual performance path and the plural number The multiple elements on the map defined by the location corresponding to the entrance and exit of each of the regions in a way that intersects the moving path, and the program of the multiple intersection points between these; based on the actual performance path will be A procedure to determine whether the calculated intersection point of the plural number is valid or invalid in a specific order through the pre-established rules of the plural area; based on the position information and time information obtained for the intersection point judged to be valid , To calculate the time required for the mover to pass through each of the plural areas.

Hereinafter, one embodiment of the present invention will be described with reference to FIGS. 1-9. The path evaluation device of the embodiment of the present invention can be used in management systems in various industries that manage operators who move and perform work in a plurality of work areas and the travel paths during work. In the following, an example of a management system suitable for delivery of mail items such as goods, leaflets, letters, postcards, etc., or delivery of letter delivery and delivery services will be described in particular. In other words, the description will be given for an example of managing a delivery person who performs mailing or delivery operations at a delivery location such as a delivery company or a post office, and the movement path during delivery. In this kind of mailing or delivery service, in order to distribute the work of mailing or delivery with a good balance for each delivery person, the work area is set in such a way that the time required in each work area becomes equal. However, in reality, due to the increase or decrease in the number of delivery targets in the operation area or changes in the surrounding traffic conditions, etc., the time required for the originally planned route to be cut short or become impassable, etc. It is longer or shorter than expected. In the present embodiment, the route evaluation device is constructed as follows in order to be able to evaluate the travel route during the work of mailing or delivery from the viewpoint of the time required for each of the work areas. [Functional composition of management system 100] First, the functional configuration of the management system 100 according to the embodiment of the present invention will be described. FIG. 1 is a diagram showing an example of the system configuration of the management system 100. As shown in Fig. 1, the management system 100 includes a plurality of (two in the figure) delivery terminal 1A, 1B by including the Internet or mobile phone network, etc. The network 4, which is a representative public wireless communication network, is connected; with the management server 2; and the administrator terminal 3, which constitute it. In such a management system 100, the management server 2 and the manager terminal 3 as a whole constitute the route evaluation device 5 of the embodiment of the present invention. In addition, the management server 2 and the administrator terminal 3 may constitute the route evaluation device 5 separately. In addition, the network 4 also includes closed communication networks set up in each specific management area, such as wireless LAN, Wi-Fi (Wireless Fidelity) (registered trademark), and so on. The courier terminals 1A and 1B are capable of storing couriers A and B who carry out mail posting or delivery operations in pockets of clothes, backpacks, hand-held bags, etc. The brackets of vehicles 6A and 6B in operation are used. In this embodiment, smart phones or tablet terminals, mobile phones, PDAs (Personal Digital Assistant), and various wearable terminals that can be connected to the public by wireless communication are collectively referred to as dispatcher terminals 1A and 1B. The delivery person terminals 1A and 1B have a common structure. In addition, there may be three or more delivery person terminals 1A and 1B. Vehicles 6A and 6B are four-wheeled vehicles, motorcycles, bicycles, trolleys, etc. In Fig. 1, as an example, they display mail items that are widely used in goods, leaflets, letters, postcards, etc. Letters or collections, light vehicles 6A in delivery and bicycles 6B with prime movers. The delivery personnel A and B can also do the mailing or delivery operations on foot without using the vehicles 6A and 6B. Next, each configuration of the distributor terminal 1A, 1B, the management server 2 and the manager terminal 3 will be described. ＜Dealer terminal 1A, 1B＞ First, the delivery person terminals 1A and 1B will be described. Various application software can be installed in the dispatcher terminals 1A and 1B. The dispatcher terminals 1A and 1B of this embodiment constitute a management system by the application software installed in a smartphone. By using smart phones sold in the market, the cost in the construction of the system can be suppressed.

Fig. 2 is a block diagram showing the schematic configuration of the distributor terminals 1A and 1B. As shown in FIG. 2, the delivery person terminal 1A includes a control unit 10, a storage unit 11, a wireless unit 12, a sensor unit 13, a display unit 14, and an input unit 15.

The memory portion 11 is composed of semiconductor memory or hard disk. In the memory unit 11, there are stored operating system (OS), software including application programs to support mailing or delivery, map information such as road maps or residential maps, and customer information of delivery destinations. Various information. In the customer information, in addition to the address and phone number of the delivery destination, it also contains information that is attached to the customer, such as the presence or absence of a residential container. In addition, the software, map information, customer information, etc. can be separately stored in the memory unit 11 in advance, or can also be obtained from the management server 2.

The wireless unit 12 is equipped with DSP (Digital Signal Processor), etc., and is configured to communicate with the management server via a wireless communication network represented by mobile phone networks such as 3G, Long-Range Evolution (LTE), 4G, and 5G. 2 Conduct wireless communication. The wireless unit 12, for example, can also be constructed in a manner that includes a proximity wireless communication unit (not shown) applicable to proximity wireless communication technologies such as Wi-Fi (registered trademark), Bluetooth (registered trademark), etc. . The wireless unit 12 is capable of identifying the log-in ID (also referred to as the "delivery person ID") for the courier A and B, the current position information and speed information of the courier A, B or the vehicles 6A, 6B, etc., for management Server 2 sends the message.

The sensor unit 13 is a GPS sensor 13a that receives positioning signals from a plurality of GPS satellites and determines the absolute positions (latitude, longitude) of the corresponding delivery personnel A and B, and a GPS sensor 13a that detects the angular velocity The gyro sensor 13b and the like are constituted. When it is impossible to receive positioning signals from GPS satellites, AGPS (Assisted Global Positioning System) communication can also be used to calculate by using the base station information of the wireless communication network obtained from the wireless unit 12 The current position of delivery person A, B or vehicle 6A, 6B.

The display unit 14 is constituted by a display device such as a liquid crystal display or an organic EL panel. The display unit 14 is capable of receiving instructions from the control unit 10, and can display maps and icons of operation keys for the touch panel, etc., and can display the current position and current position of the delivery personnel A and B or vehicles 6A and 6B. Various information such as the surrounding area and the map near the delivery destination.

The input unit 15 is an input device (not shown) such as a numeric keyboard operated by the delivery personnel A and B, or an input device (not shown) such as a touch panel superimposed on the display surface of the display unit 14, and Constitute it. Signals based on input operations from the input unit 15, for example, based on the depression of the numeric keyboard and the depression of the touch panel caused by the delivery personnel A and B, are output to the control unit 10, by Here, the delivery personnel A and B can perform operations such as switching the screen display of the display unit 14.

In addition, although illustration is omitted, the delivery terminal 1A, 1B may be further equipped with a speaker, a vibrator, a light, a microphone, etc. in addition to this. Loudspeakers, vibrators, and lights are used to report various information to the delivery staff through sound, vibration, and light. Also, the speakers are for distribution The clerk outputs the sound, and the microphone is used to pick up the sound generated by the delivery clerk. With this, various information can be output by sound from the speaker, and various commands by the delivery person that have been voice input via a microphone can be input into the control unit 10 using voice recognition technology.

The control unit 10 is constituted by including a microprocessor including a CPU, RAM, ROM, I/O, etc. The CPU executes a previously memorized program, and transmits and receives signals with the memory unit 11, the wireless unit 12, the sensor unit 13, the display unit 14, and the input unit 15. The control unit 10 includes a display control unit 101, a connection processing unit 102, and a position information notification unit 103 as a functional configuration.

The display control unit 101 generates an image signal in response to the operation of the input unit 15 or in response to the reception of various information caused by the wireless unit 12 and sends the image signal to the display unit 14 to communicate with the display unit 14 caused by the screen display for control. The screen display displayed on the display unit 14 by the display control unit 101 includes a login screen for logging in to the management system 100 and the like.

The connection processing unit 102 sends the log-in ID and password input by the delivery personnel A and B via the input unit 15 in the log-in screen displayed on the display unit 14 to the management server 2 via the wireless unit 12 . As a result, the dispatcher terminals 1A and 1B are connected to the management server 2 in a communicable state. The log-in input caused by the delivery person is executed when the delivery person starts the operation, that is, when the delivery person starts from the delivery base. In addition, if the connection processing unit 102 is input via the input unit 15 Logout is sent to the management server 2 via the wireless unit 12 to log out. With this, the communication connection between the delivery terminal 1A, 1B and the management server 2 is ended. This logout input caused by the delivery person is executed when the delivery person finishes the operation, that is, when the delivery person returns to the delivery location. In addition, logout can also be performed automatically based on time or location information when the delivery person returns to the delivery location.

The position information notification unit 103 is calculated based on the GPS signal received by the sensor unit 13 (GPS sensor 13a) for the delivery staff A, B or the vehicle 6A moving together with the delivery terminal 1A, 1B The current position information of 6B and the current time information obtained from the clock unit (not shown) are sent in a specific time interval (for example, 1 second interval) in correspondence with the delivery person ID via the wireless unit 12 Message to the management server 2. In addition, in the time information, the system is not only the time, but also includes information such as year, month, and day.

另外，實績路徑RT和各作業區域之出入口之間的交點CP之通過時刻t，係亦能夠以交點CP所鄰接的描繪點P1、P2之其中一者的通過時刻t1、t2來作代表。或者是，係亦可作為交點CP所鄰接之2個的描繪點P1、P2之通過時刻t1、t2之相加平均來算出之。 在圖4B之例中，係藉由交點算出部204而算出有11個的交點CP1~CP11。另一方面，在圖4C之例中，係例如由於道路工程或塞車等之交通情況而導致配送員A之實績路徑RT迂迴過預先所設定的作業區域BL1之出口#1Exit、作業區域BL4之出口#4Exit、作業區域BL5之入口#5Enter，因此圖4B之交點CP3、CP8、CP9係並未被算出。 構成通過判定部208之交點算出部204，係進而將被判定為配送員A、B或車輛6A、6B係作了通過的線段、亦即是被算出有1個以上的交點CP之線段的比例，作為實績路徑RT之通過成功率SR而算出之。通過成功率SR，係使用被算出有1個以上的交點CP之線段的根數Ncut、和所有的線段之根數Nall，來藉由下式(ii)而算出之。

在圖4A~4C之例中，係被設定有代表各作業區域BL1~BL5之出入口#1Enter、#1Exit、#2Enter、#2Exit/ #3Enter、#3Exit/#4Enter、#4Exit、#5Enter、#5Exit之合計8根的線段(Nall＝8)。相對於此，在圖4B之例中，對於全部之8根的線段係均被算出有1點以上的交點CP(Ncut＝8)，於此情況時之實績路徑RT之通過成功率SR係成為100％。 另一方面，在圖4C之例中，代表作業區域BL1之出口#1Exit、作業區域BL4之出口#4Exit、作業區域BL5之入口#5Enter之3根的線段係被迂迴，對於作業區域BL1之入口#1Enter、作業區域BL2之入口#1Enter、作業區域BL2、BL3之間之共通之出入口#2Exit/#3Enter、作業區域BL3、BL4之間之共通之出入口#3Exit/#4Enter、作業區域BL5之出口#5Exit之5根的線段，係被算出有1點以上之交點CP(Ncut＝5)，於此情況之實績路徑RT之通過成功率SR係成為62.5％。藉由交點算出部204所算出的實績路徑RT之通過成功率SR，係作為用以對於實績路徑RT進行評價之路徑評價資訊而被送訊至配送據點之管理者終端3處。配送據點之管理者，係藉由透過管理者終端3來對於實績路徑RT之通過成功率SR作確認，而能夠對於配送員A、B是否如同預定般地而通過了複數之作業區域之出入口一事作定量性的掌握。 構成通過判定部208之判定部205，係基於根據被記憶在管理資訊區域215中之作業區域之配送順序所得到的各交點CP之預定之通過順序、和基於藉由交點算出部204所算出的交點CP之位置以及通過時刻t之資訊所得到的各交點CP之實際之通過順序，而判定各交點CP係為有效或者是無效。 藉由判定部205而被判定為有效之交點CP，係被使用在後述之各作業區域BL1~BL5之所需時間的算出中。另一方面，藉由判定部205而被判定為無效之交點CP，係從被使用在各作業區域BL1~BL5之所需時間的算出中的對象而被去除。 圖6A，係為對於由判定部205所致之判定作說明之圖，在橫軸處，係對於基於藉由交點算出部204所算出的交點CP1~CP11(圖4B)之通過時刻t而得到的各交點CP1~CP11之實際之通過順序作展示，在縱軸處，係對於基於被記憶在管理資訊區域215處之作業區域BL1~BL5之配送順序所得到的各交點CP1~CP11之預定之通過順序作展示。亦即是，各交點之座標，係藉由該交點之實際之通過順序和預定之通過順序而被作表現，例如交點CP1之座標係被表現為(1，1)。 判定部205，係如同圖6A中所示一般，抽出「將相鄰接之交點CP1~CP11彼此作連結的直線CL係成為負的斜率之交點之對」，在圖之例中，係抽出交點CP2、CP3之對、交點CP6、CP7之對以及交點CP10、CP11之對。接著，以使直線CL不會成為負的斜率的方式，亦即是以使直線CL之斜率會成為0以上的方式，來針對被抽出的各個交點之對，而判定何者之交點係為無效，並作刪除。例如，在交點CP2、CP3之對的情況時，若是將交點CP2刪除，則將作了刪除的交點CP2之前後之交點CP1、CP3作連結的直線CL，係成為正的斜率，若是將交點CP3刪除，則將作了刪除的交點CP3之前後之交點CP2、CP4作連結的直線CL，係成為負的斜率。 故而，針對交點CP2、CP3之對，係將交點CP2判定為無效。同樣的，針對交點CP10、CP11之對，係將交點CP11判定為無效。藉由此，各作業區域BL1~BL5之通過的有無，亦即是是否如同預定般地而通過了各作業區域BL1~BL5一事的判定結果係被確定。 在確定了各作業區域BL1~BL5之通過的有無之後，在對於預定之通過順序為相同之出入口而連續地進行複數次通過的情況時，當連續通過相同之入口時，係將實際之通過順序為最先的交點CP判定為有效，當連續通過相同之出口時，係將實際之通過順序為最後的交點CP判定為有效。 圖4D，係為對於在連續通過相同之出入口時的藉由路徑算出部203所算出之實績路徑RT之其中一例作說明之圖。在圖4D之例中，實績路徑RT係對於作業區域BL2之入口#2Enter以及出口#2Exit而連續作複數次通過。於此情況，連續通過作業區域BL2之入口#2Enter的交點CP41~CP43中之實際之通過順序為最先的交點CP41，係被判定為有效。又，連續通過作業區域BL2之出口#2Exit的交點CP51~CP53中之實際之通過順序為最後的交點CP53，係被判定為有效。 另外，在圖6A中，針對直線CL係成為負的斜率的交點CP6、CP7之對，係作為預定之通過順序為第6個、亦即是作為對於第3個的作業區域BL3之出口#3Exit而連續地作了2次通過時的交點，來進行由判定部205所致之判定。於此情況，係將實際之通過順序為較後的交點CP7判定為有效，並將實際之通過順序為較先之交點CP6判定為無效並作刪除。 判定部205，係亦可依循於預定之通過順序，而依序將實際之通過順序為最先的交點判定為有效。於此情況，亦同樣的，在對於預定之通過順序為相同之出入口而連續地進行複數次通過的情況時，當連續通過相同之入口時，係將實際之通過順序為最先的交點CP判定為有效，當連續通過相同之出口時，係將實際之通過順序為最後的交點CP判定為有效。亦即是，如同在圖6A中所示一般，首先，係針對預定之通過順序為第1個、亦即是針對第1個的作業區域BL1之入口#1Enter和實績路徑RT之間之交點CP1、CP11而進行判定。判定部205，係將預定之通過順序為第1個的交點CP1、CP11中之實際之通過順序為最先的交點CP1判定為有效，並將剩餘之交點CP11判定為無效。進而，判定部205，係將實際之通過順序為較判定為有效的交點CP1而更之前的預定之通過順序為第2個以後之交點CP亦判定為無效。例如，係將實際之通過順序為較「預定之通過順序為第2個、亦即是第1個的作業區域BL1之出口#1Exit與實績路徑RT之間之交點CP3」而更之前的「預定之通過順序為第10個、亦即是第5個的作業區域BL1之出口#5Exit與實績路徑RT之間之交點CP2」，判定為無效。 針對相鄰接之作業區域之間的共通之出入口與實績路徑RT之間之交點CP，係依循於預定之通過順序，而首先作為緊接於前之作業區域之出口與實績路徑路RT之間之交點CP來進行由判定部205所致之判定。若是緊接於前之作業區域之出口與實績路徑RT之間之交點CP被判定為有效，則緊接於後之作業區域之入口與實績路徑RT之間之交點CP亦係被判定為有效。另一方面，若是緊接於前之作業區域之出口與實績路徑RT之間之交點CP被判定為無效，則緊接於後之作業區域之入口與實績路徑RT之間之交點CP亦係被判定為無效並被刪除。例如，針對兼作為作業區域BL2之出口#2Exit和作業區域BL3之入口#3Enter的共通之出入口#2Exit/#3Enter與實績路徑RT之間之交點CP5，係依循於預定之通過順序，而首先作為預定之通過順序為第4個、亦即是第2個的作業區域BL2之出口#2Exit與實績路徑RT之間之交點CP5，來進行由判定部205所致之判定。若是預定之通過順序為第4個的交點CP5係被判定為有效，則作為通過共通之出入口#2Exit/#3Enter的預定之通過順序為第5個、亦即是第3個的作業區域BL3之入口#3Enter與實績路徑RT之間之交點CP5，亦係被判定為有效。 針對預定之通過順序為第6個、亦即是針對第3個的作業區域BL3之出口#3Exit與實績路徑RT之間之交點CP6、CP7，係作為對於相同之出口而連續地作了2次通過時的交點，來進行由判定部205所致之判定。於此情況，係將實際之通過順序為較後的交點CP7判定為有效，並將實際之通過順序為較先之交點CP6判定為無效並作刪除。 藉由判定部205而被判定為有效之交點CP1、CP3~CP5、CP7~CP10，係被使用在後述之所需時間的算出中。另一方面，藉由判定部205而被判定為無效之交點CP2、CP6、CP11，係從被使用在所需時間的算出中之對象而被去除。 圖6B，係為對於由判定部205所致之判定結果的其中一例作展示之圖，並僅對於藉由判定部205而被判定為有效的交點CP1、CP3~CP5、CP7~CP10作展示。所需時間算出部206，係基於藉由判定部205而被判定為有效的交點CP1、CP3~CP5、CP7~CP10之通過時刻t，來算出為了通過各作業區域BL1~BL5所需要的所需時間TP。亦即是，係根據各作業區域BL1~BL5之入口的交點CP之通過時刻t以及出口的交點CP之通過時刻t之間之差，來算出為了通過各作業區域BL1~BL5所需要的所需時間TP1~TP5。另外，針對實績路徑RT並未通過代表出口或入口之線段的作業區域，係並不算出所需時間TP。例如，在圖4C之例中，由於作業區域BL1之出口#1Exit、作業區域BL4之出口#4Exit、作業區域BL5之入口#5Enter係被迂迴，因此作業區域BL1、BL4、BL5之所需時間TP1、TP4、TP5係並未被算出。 藉由所需時間算出部206所算出的各作業區域之各者之所需時間TP，係作為用以對於實績路徑RT進行評價之路徑評價資訊而被送訊至配送據點之管理者終端3處。配送據點之管理者，係藉由透過管理者終端3來對於各作業區域之各者的所需時間TP作確認，而能夠對於配送員A、B之配送時的實績路徑RT進行評價。 資訊輸出部207，係藉由經由通訊部22來從管理伺服器2而對於管理者終端3送訊資料，來輸出各種資訊。在資訊輸出部207所輸出之資訊中，係包含有被送訊至管理者終端3處的實績路徑RT之通過成功率SR和各作業區域之各者的所需時間TP等。 圖7A、7B，係為對於依循預先所記憶的程式而藉由管理伺服器2之CPU所實行的處理之其中一例作展示之流程圖。在此流程圖中所示之處理，係若是從管理者終端3而受訊路徑評價資訊之輸出要求則會被開始。 在圖7A之處理中，首先，在步驟S1中，藉由在資訊取得部202處之處理，係經由通訊部22而讀入從管理者終端3所受訊的路徑評價資訊之輸出要求，並將關於在被指定的配送期間中之被指定的配送員A、B之時間序列之位置資訊讀入。又，係將被記憶在管理資訊區域215中的作業區域之配送順序以及各作業區域之入口和出口的位置資訊讀入。接著，在步驟S2中，藉由在路徑算出部203處之處理，係基於在步驟S1處所取得之時間序列的位置資訊，來算出被指定的配送員A、B所實際作了移動的從起點PS起直到終點PE為止之實績路徑RT。接著，在步驟S3中，藉由交點算出部204之處理，係算出「在步驟S2中所算出的實績路徑RT」和「各作業區域之入口以及出口」之間的複數之交點CP之位置以及通過時刻t。接著，在步驟S4中，係將在步驟S3中的被算出有1個以上的交點CP之線段的比例，作為實績路徑RT之通過成功率SR而算出之。 The position of the delivery person A, B or the vehicle 6A, 6B is changed from time to time. Therefore, when the current position information is obtained at a specific time interval, the position obtained based on the last current position information, and Strictly speaking, the actual position may be inconsistent. However, since the error is small, the position obtained based on the current position information acquired at a specific time interval can be regarded as the current position. In addition, the system can also send multiple batches of messages at a time (the so-called batch transmission) of the current position information and current time information of the courier A, B or vehicles 6A, 6B obtained at a specific time interval. . The time interval (for example, 1 second interval) for obtaining the current position information of the courier or the vehicle, and the number of messages sent at a time when the batch is sent in multiple batches at a time, etc., can be done in advance. set up. <Management Server 2> Next, the management server 2 will be described. In this embodiment, the management server 2 is described as a server with various functions. However, it can also be a distributed system in which each function is composed of different servers. The server can also be realized by a cloud server (virtual server). FIG. 3 is a block diagram showing the schematic structure of the management server 2. As shown in FIG. 3, the management server 2 includes a control unit 20, a storage unit 21, a communication unit 22, a display unit 24, and an input unit 25. In addition, the display unit 24 and the input unit 25 may be omitted. In addition, the display unit 24 and the input unit 25 may also be constituted by other information terminals (not shown) connected to the management server 2. The memory portion 21 is composed of semiconductor memory or hard disk. In the storage unit 21, an operating system (OS), software called application programs, and various other information are stored. Therefore, in the memory section 21, there are such things as "delivery person information area 211", "vehicle information area 212", "posting destination or delivery destination information area 213", "map information area 214", "management information area"215" and various memory areas. In addition, the so-called information area is, for example, a table in the database management system. In the dispatcher information area 211, each of the practitioner IDs (also referred to as "distributor IDs") who are the identification information of the dispatchers are memorized, and the basic information related to the dispatcher is respectively memorized. Information, for example, memorizes the information of the dispatcher that manages the name of the dispatcher, the ID of the affiliated site, etc. In addition, in the delivery person information area 211, the vehicle used by the delivery person is memorized, that is, the vehicle ID, which is the identification information of the vehicles 6A, 6B, is added to the corresponding address for the delivery person ID. Regarding the additional correspondence to the vehicle ID of the delivery person ID, for example, it is pre-set by the manager of the delivery site before the start of the day's mailing or delivery operation. In the vehicle information area 212, for each of the vehicle IDs, the information related to the vehicle is stored separately, such as the type of vehicle, the size of the warehouse, etc. of cars, motorcycles, bicycles, etc. . In the mailing target or delivery target information area 213, there is a memory that contains "the address (latitude, longitude) and telephone number of the delivery target, the operation area included in the delivery target, and the delivery person who serves as the operation area included in the delivery target." A, B, etc." information about the delivery target. In addition, the operating area is an area pre-set by the manager of the delivery site in order to facilitate the distribution of letters or delivery to each delivery person. For example, it is an area that is equivalent to 1 or more blocks of 10~30. The distribution target of the user. Delivery personnel A and B are respectively responsible for the delivery or delivery operations in the responsible area formed by the plural operation areas. In the map information area 214, map information such as a road map or a house map is stored in advance. The map information includes display map data etc. which are useful for displaying the background of road link information, roads and road maps. The map information is updated regularly. In the management information area 215, "the delivery sequence of the work area set in advance by the manager of the delivery site", "the position information of the entrance and exit of each work area", and "from the delivery person terminal 1A , 1B obtains the location information of courier A, B or vehicles 6A, 6B in time series". FIG. 4A is a diagram for explaining the delivery sequence of the work areas stored in the management information area 215 and the position information of the entrance and exit of each work area. The manager of the distribution point is to divide all the distribution targets under the jurisdiction of the distribution point in advance, for example, into a block, a block, or a large-scale residential complex as a unit of plural operation areas, and for each operation Area, and assign the couriers A and B for the letter posting or delivery operations in each operation area. Specifically, through the manager terminal 3, the work area and the delivery personnel A and B are set as the information related to each other with the address (latitude, longitude) of the delivery destination. In the example of FIG. 4A, five work areas BL1 to BL5 are allocated to one delivery person, for example, to delivery person A. In addition, it is to set the delivery order of the plural work areas (in the example of the figure, it is BL1→BL2→BL3→BL4→BL5) and the delivery order of the delivery targets in each work area. Furthermore, it is to set the exit #0Exit~#5Exit and entrance #1Enter~#6Enter of the delivery base on the map and each work area BL1~BL5. As shown in Fig. 4A, the exit #0Exit~#5Exit and entrance #1Enter~#6Enter of the delivery base and each work area BL1~BL5 are set as line segments. The line segments #1Enter~#5Enter representing the entrances of each operation area BL1~BL5 are located on the road near the initial delivery target in the order of delivery in each operation area. The length of the road width and length is configured. Similarly, the exit #1Exit~#5Exit line segment representing each operation area BL1~BL5 is on the road near the final delivery destination in the delivery order in each operation area, and intersects the movement path during delivery. The ground is arranged according to the length of the width of the road. At the entrance and exit between the delivery base and the adjacent work area, a common line segment is set (in the figure, it is #0Exit/#6Enter, #2Exit/#3Enter, #3Exit/#4Enter). Each line segment is defined by the positions (latitude, longitude) of the two ends on the map, for example. The information set by the administrator terminal 3 is sent to the management server 2 and stored in the management information area 215. When the communication unit 22 performs transmission and reception with the delivery terminal 1A, 1B, for example, a communication protocol capable of wireless communication such as 3G, LTE, 4G, and 5G is installed. On the other hand, when the communication unit 22 performs transmission and reception with the manager terminal 3, a communication protocol capable of wired communication (for example, Internet line, etc.) or wireless communication is installed. The control unit 20 is constituted by including a processor including a CPU, RAM, ROM, I/O, etc. The control unit 20 has, as a functional configuration, a connection processing unit 201, an information acquisition unit 202, a path calculation unit 203, an intersection calculation unit 204, a determination unit 205, and a required time calculation unit 206, and Information output unit 207. Among them, the path calculation unit 203, the intersection calculation unit 204, and the determination unit 205 constitute the passage determination unit 208. The connection processing unit 201 executes log-in processing from the delivery terminal 1A, 1B, and performs connection processing with the delivery terminal 1A, 1B. In addition, the connection processing unit 201 executes logout processing from the dispatcher terminals 1A and 1B, and terminates the connection with the dispatcher terminals 1A and 1B. Furthermore, the connection processing unit 201 executes the log-in processing from the administrator terminal 3, performs the connection processing with the administrator terminal 3, executes the log-out processing from the administrator terminal 3, and ends the connection with the administrator terminal 3. The connection between 3. The information acquisition unit 202 receives the data sent from the delivery terminal 1A, 1B to the management server 2 and the data sent from the manager terminal 3 to the management server 2 through the communication unit 22 To get all kinds of information. The information obtained by the information obtaining unit 202 includes the position information of the couriers A and B or the vehicles 6A and 6B sent from the position information notification unit 103 of each courier terminal 1A, 1B, and corresponding information. The time information, the delivery sequence of the work area sent from the manager terminal 3, and the location information of the entrance and exit of each work area, etc. The location information is specifically expressed by latitude and longitude. The information sent from the delivery terminal 1A, 1B and the manager terminal 3 is stored in the management information area 215. The determination unit 208 determines the delivery person A based on the time series position information of the delivery personnel A and B or the vehicles 6A, 6B stored in the management information area 215, and the position information of the entrance and exit of each work area. , B or whether vehicles 6A and 6B have passed the entrance and exit of each work area. The route calculation unit 203 that constitutes the passing judgment unit 208 is based on the time-series position information of the couriers A and B or the vehicles 6A and 6B stored in the management information area 215 to calculate the actual work performed by the couriers A and B. The actual performance path RT of the movement from the start point PS to the end point PE. 4B and 4C are diagrams for explaining one example of the actual route RT calculated by the route calculation unit 203, and each of the delivery personnel A, B (or vehicles 6A, 6B), such as the delivery personnel A, is specified The position of time is shown as a drawing point. As shown in Figs. 4B and 4C, the actual performance path RT of the delivery person A is a linker that connects the drawing points corresponding to the position of the delivery person A from the starting point PS to the ending point PE in a time series. , And figure it out. The intersection point calculating unit 204 that passes through the judging unit 208 is configured to calculate the "actual path RT from the starting point PS to the end point PE calculated by the path calculating unit 203" and "Entrance #1Enter~ # of each work area BL1~BL5 5Enter and exit #1Exit~#5Exit" the intersection of plural numbers CP. That is, it is to determine whether the delivery personnel A, B or vehicles 6A, 6B have passed the entrance #1Enter~#5Enter and exit #1Exit~#5Exit of each work area BL1~BL5. In addition, the starting point PS and the ending point PE of the actual performance route RT are drawn points on #0Exit/#6Enter which are the exits and exits of the delivery base. Specifically, the intersection calculation unit 204 calculates the position (latitude x, longitude y) of each intersection CP, and calculates the passing time t of each intersection. When there is a drawing point corresponding to the intersection point CP, the passing time t of the intersection point CP is calculated (determined) based on the time information of the drawing point corresponding to the intersection point CP. On the other hand, when there is no drawing point corresponding to the intersection point CP, the intersection point CP is calculated based on the time information of the drawing points immediately before and immediately after the intersection point CP on the actual performance path RT. It passes time t. FIG. 5 is a diagram for explaining the calculation method of the passing time t of the intersection CP between the actual path RT and the entrance and exit of each work area. As shown in Fig. 5, when the intersection point CP corresponds to the division point within m:n of the adjacent drawing points P1 and P2, the passing time t of the intersection point CP is the tightness on the actual path RT. The latitude x1, longitude y1, passing time t1, and the latitude x2, longitude y2, passing time t2 of the drawing point P1 immediately before, are calculated by the following formula (i) .

In addition, the passing time t of the intersection CP between the actual path RT and the entrance and exit of each work area can also be represented by the passing time t1 and t2 of one of the drawing points P1 and P2 adjacent to the intersection CP. Alternatively, it can also be calculated as the average of the two drawing points P1 and P2 adjacent to the intersection point CP by the addition of the times t1 and t2. In the example of FIG. 4B, 11 intersection points CP1 to CP11 are calculated by the intersection point calculation unit 204. On the other hand, in the example of FIG. 4C, the actual performance route RT of the delivery person A detours through the preset work area BL1 exit #1Exit and the work area BL4 exit due to, for example, road construction or traffic congestion. #4Exit, the entry #5Enter of the work area BL5, so the intersection points CP3, CP8, and CP9 in Figure 4B have not been calculated. It constitutes the intersection point calculation unit 204 of the passing determination unit 208, and further determines the line segment that is determined to be the delivery person A, B or the vehicle 6A, 6B that has passed, that is, the proportion of the line segment that has more than one intersection point CP calculated , Is calculated as the passing success rate SR of the actual performance path RT. The success rate SR is calculated by the following formula (ii) using the number Ncut of line segments calculated to have one or more intersection points CP and the number Nall of all line segments.

In the example of Fig. 4A~4C, the entrances and exits #1Enter, #1Exit, #2Enter, #2Exit/ #3Enter, #3Exit/#4Enter, #4Exit, #5Enter, #5Enter, # are set to represent the entrances and exits of each work area BL1~BL5. A total of 8 line segments of 5Exit (Nall=8). On the other hand, in the example of FIG. 4B, for all 8 line segment systems, one or more intersection CP (Ncut=8) is calculated. In this case, the passing success rate SR system of the actual path RT becomes 100%. On the other hand, in the example of FIG. 4C, the three line segments representing exit #1Exit of work area BL1, exit #4Exit of work area BL4, and entry #5Enter of work area BL5 are detoured. For the entrance of work area BL1 #1Enter, the entrance of the work area BL2 #1Enter, the common entrance between the work areas BL2 and BL3 #2Exit/#3Enter, the common entrance between the work areas BL3 and BL4 #3Exit/#4Enter, the exit of the work area BL5 The 5 line segments of #5Exit are calculated to have one or more intersection CP (Ncut=5). In this case, the passing success rate SR of the actual path RT becomes 62.5%. The passing success rate SR of the actual route RT calculated by the intersection calculation unit 204 is sent to the manager terminal 3 of the delivery base as route evaluation information for evaluating the actual route RT. The manager of the delivery site confirms the passing success rate SR of the actual route RT through the manager terminal 3, and can check whether the delivery personnel A and B have passed the entrances and exits of the plural work areas as scheduled Make quantitative mastery. The judging unit 205, which constitutes the passing judging unit 208, is based on the predetermined passing order of each intersection CP obtained from the delivery order of the work area stored in the management information area 215, and based on the predetermined passing order calculated by the intersection calculating unit 204 The position of the intersection CP and the actual passing sequence of each intersection CP obtained by passing the information at time t, determine whether each intersection CP is valid or invalid. The intersection point CP judged to be valid by the judging unit 205 is used in the calculation of the required time for each work area BL1 to BL5 described later. On the other hand, the intersection point CP judged to be invalid by the judging unit 205 is removed from the object used in the calculation of the required time for each of the work areas BL1 to BL5. Fig. 6A is a diagram for explaining the judgment made by the judgment unit 205. On the horizontal axis, it is obtained based on the passing time t of the intersection points CP1~CP11 (Fig. 4B) calculated by the intersection point calculation unit 204 The actual passing sequence of the intersections CP1~CP11 of each intersection CP1~CP11 is displayed. On the vertical axis, it is the predetermined order of the intersections CP1~CP11 based on the delivery sequence of the operation areas BL1~BL5 memorized in the management information area 215. Demonstrate through order. That is, the coordinates of each intersection point are expressed by the actual passing order and the predetermined passing order of the intersection point. For example, the coordinates of the intersection point CP1 are expressed as (1, 1). The judging unit 205, as shown in FIG. 6A, extracts "the straight line CL connecting the adjacent intersections CP1 to CP11 is a pair of intersections with negative slopes." In the example of the figure, the intersection is extracted The pair of CP2, CP3, the pair of intersection CP6, CP7, and the pair of intersection CP10, CP11. Then, in a way that the straight line CL does not have a negative slope, that is, the slope of the straight line CL becomes 0 or more, for each pair of intersection points that are extracted, it is determined which intersection system is invalid, And delete it. For example, in the case of the pair of intersection points CP2 and CP3, if the intersection point CP2 is deleted, then the intersection points CP1 and CP3 before and after the deleted intersection point CP2 are connected as the straight line CL, which becomes a positive slope. If the intersection point CP3 is deleted If deleted, the straight line CL connecting the intersection points CP2 and CP4 before and after the intersection point CP3 that has been deleted becomes a negative slope. Therefore, for the pair of intersection points CP2 and CP3, the intersection point CP2 is judged to be invalid. Similarly, for the pair of intersection points CP10 and CP11, the intersection point CP11 is judged to be invalid. By this, the presence or absence of passage of each work area BL1 to BL5, that is, whether or not it passes through each work area BL1 to BL5 as scheduled is determined. After determining the presence or absence of the passage of each work area BL1~BL5, when the predetermined passage sequence is the same entrance and exit and multiple passages are continuously performed, when the same entrance is continuously passed, the actual passage sequence is changed The first intersection CP is judged to be valid. When passing through the same exit continuously, the intersection CP whose actual passing sequence is the last is judged to be effective. FIG. 4D is a diagram for explaining one example of the actual path RT calculated by the path calculation unit 203 when passing through the same entrance and exit continuously. In the example of FIG. 4D, the actual performance path RT is to pass through the entry #2Enter and the exit #2Exit of the work area BL2 consecutively a plurality of times. In this case, the actual passing order of the intersection CP41~CP43 of the entry #2Enter of the work area BL2 is the first intersection CP41, and it is judged to be valid. In addition, the actual passing sequence among the intersection points CP51~CP53 of exit #2Exit of the work area BL2 is the last intersection point CP53, which is judged to be valid. In addition, in FIG. 6A, the pair of intersections CP6 and CP7 where the straight line CL has a negative slope is regarded as the sixth in the predetermined passing order, that is, as the exit #3Exit for the third work area BL3 On the other hand, the intersection point at the time of passing twice is made consecutively, and the judgment by the judging unit 205 is performed. In this case, the crossing point CP7 whose actual passing sequence is the lower is judged to be valid, and the crossing point CP6 whose actual passing sequence is the earlier is judged to be invalid and deleted. The judging unit 205 can also follow the predetermined passing order, and sequentially judge the intersection point with the first actual passing order as valid. In this case, the same is true. When the predetermined passage sequence is the same entrance and exit and multiple passes are made consecutively, when the same entrance is passed continuously, the actual passage sequence is judged as the first intersection CP. To be effective, when passing through the same exit continuously, the intersection point CP whose actual passing sequence is the last is judged to be effective. That is, as shown in FIG. 6A, firstly, it is for the intersection point CP1 between the entry #1Enter of the work area BL1 and the actual performance path RT that the predetermined passing order is the first, that is, the first. , CP11 and make a judgment. The judging unit 205 judges the first intersection CP1 and the first intersection CP1 in the predetermined passing order as valid, and judges the remaining intersection CP11 as invalid. Furthermore, the judging unit 205 judges that the actual passing order is the intersection CP1 that is judged to be valid, and the predetermined passing order that is earlier than the second and subsequent intersection CP is also judged to be invalid. For example, the actual passing order is set to the “predetermined passing order is the second, that is, the first, the intersection point CP3 between exit #1Exit of the work area BL1 and the actual performance path RT”. The passing order is the 10th, that is, the 5th, the intersection point CP2 between exit #5Exit of the work area BL1 and the actual performance path RT", and it is judged as invalid. For the intersection point CP between the common entrance and exit between adjacent work areas and the actual performance path RT, it follows the predetermined passing sequence, and is first used as the exit between the immediately preceding work area and the actual performance path RT. The decision made by the decision unit 205 is performed at the intersection point CP. If the intersection CP between the exit of the immediately preceding work area and the actual performance path RT is determined to be valid, the intersection CP between the entry of the immediately following work area and the actual performance path RT is also determined to be valid. On the other hand, if the intersection CP between the exit of the immediately preceding work area and the actual performance path RT is determined to be invalid, the intersection CP between the entry of the immediately following work area and the actual performance path RT is also determined It was judged to be invalid and deleted. For example, for the intersection point CP5 between the exit #2Exit of the work area BL2 and the entry #3Enter of the work area BL3, #2Exit/#3Enter and the actual performance path RT, the intersection point CP5 follows the predetermined passing sequence, and the first is The predetermined passing order is the fourth, that is, the second, the intersection point CP5 between exit #2Exit of the work area BL2 and the actual performance path RT, and the determination by the determination unit 205 is performed. If the planned crossing point CP5 with the 4th order of passing is judged to be valid, then the planned passing order as the common entrance #2Exit/#3Enter is the 5th, that is, the 3rd working area BL3. The intersection point CP5 between the entry #3Enter and the actual performance path RT is also judged to be valid. The intersection point CP6, CP7 between the exit #3Exit and the actual path RT of the work area BL3 where the scheduled pass sequence is the sixth, that is, the third, is the same exit twice consecutively. The determination by the determination unit 205 is performed at the intersection point when passing. In this case, the intersection point CP7 whose actual passing order is lower is judged to be valid, and the intersection point CP6 whose actual passing order is earlier is judged as invalid and deleted. The intersection points CP1, CP3 to CP5, and CP7 to CP10 judged to be valid by the judging unit 205 are used in the calculation of the required time described later. On the other hand, the intersection points CP2, CP6, and CP11 judged to be invalid by the judging unit 205 are removed from the objects used in the calculation of the required time. FIG. 6B is a diagram showing an example of the judgment result caused by the judgment unit 205, and only shows the intersection points CP1, CP3~CP5, CP7~CP10 judged to be valid by the judgment unit 205. The required time calculation unit 206 is based on the passing time t of the intersection points CP1, CP3~CP5, CP7~CP10 judged to be valid by the judging unit 205 to calculate the required time to pass through each work area BL1~BL5 Time TP. That is, based on the difference between the passing time t of the intersection CP at the entrance of each work area BL1~BL5 and the passing time t of the intersection CP at the exit, the necessary requirements for passing through each work area BL1~BL5 are calculated. Time TP1~TP5. In addition, for the work area where the actual path RT does not pass through the line segment representing the exit or entrance, the required time TP is not calculated. For example, in the example of Fig. 4C, because the exit #1Exit of the work area BL1, the exit #4Exit of the work area BL4, and the entry #5Enter of the work area BL5 are bypassed, the time required for the work areas BL1, BL4, and BL5 is TP1 , TP4, TP5 series have not been calculated. The required time TP for each work area calculated by the required time calculation unit 206 is sent to the manager terminal 3 of the delivery site as route evaluation information for evaluating the actual route RT . The manager of the delivery base can check the required time TP of each work area through the manager terminal 3, thereby being able to evaluate the actual route RT of the delivery personnel A and B at the time of delivery. The information output unit 207 outputs various information by sending data from the management server 2 to the manager terminal 3 via the communication unit 22. The information output by the information output unit 207 includes the passing success rate SR of the actual path RT sent to the manager terminal 3 and the required time TP for each operation area. FIGS. 7A and 7B are flowcharts showing an example of the processing performed by the CPU of the management server 2 following a program memorized in advance. The processing shown in this flowchart will be started if the output request of the received path evaluation information is from the manager terminal 3. In the processing of FIG. 7A, first, in step S1, through the processing at the information acquisition unit 202, the output request of the route evaluation information received from the manager terminal 3 is read through the communication unit 22, and Read in the time series position information about the designated delivery personnel A and B during the designated delivery period. In addition, the delivery sequence of the work area and the position information of the entrance and exit of each work area that are memorized in the management information area 215 are read. Next, in step S2, through the processing at the route calculation unit 203, based on the time-series position information obtained in step S1, the actual movement from the starting point of the designated delivery personnel A and B is calculated The actual performance path RT from PS to end PE. Next, in step S3, through the processing of the intersection calculation unit 204, the position of the complex intersection CP between the "actual path RT calculated in step S2" and the "entrance and exit of each work area" is calculated, and Pass time t. Next, in step S4, the ratio of the line segments calculated in step S3 with one or more intersections CP is calculated as the passing success rate SR of the actual path RT.

Next, in steps S5 and S6, through the processing at the determining unit 205, it is determined whether each intersection CP calculated at step S3 is valid or invalid. That is, in step S5, "a pair of intersection points where the straight line CL connecting adjacent intersection points CP is a negative slope" is extracted. Next, in step S6, for each pair of intersection points extracted in step S5, it is determined which intersection point is invalid and deleted. Next, in step S7, the processing at the required time calculation unit 206 is based on the passing time t of the remaining intersection point CP that was not determined as invalid and deleted in step S6, that is, it is determined For the passing time t of the effective junction CP, the required time TP of each work area is calculated. Next, in step S8, through the processing at the information output unit 207, the passing success rate SR of the actual path RT calculated in step S4 and each work area calculated in step S7 are included The path evaluation information of the required time TP is sent to the manager terminal 3.

On the other hand, in the processing of FIG. 7B, instead of steps S5 and S6 of FIG. 7A, in steps S9 to S13, the processing at the determination unit 205 is followed based on the operation obtained in step S1. The predetermined passing order of each intersection CP obtained from the delivery order of the area is to sequentially determine whether each intersection CP calculated at step S3 is valid or invalid. That is, in step S9, it is assumed that n=1, and in step S10, it is determined whether the intersection point CP of the complex number calculated in step S3 includes the n-th intersection point CP in the predetermined passing order. If it is affirmative at step S10, then proceed to step S11, if it is negative, then skip step S11 and proceed to step S12. In step S11, the first intersection CP in the nth intersection CP determined in step S10 based on the passing time t calculated in step S3 is determined to be valid , And judge the remaining intersection CP as invalid. Next, in step S12, it is determined whether the n-th intersection point CP is the last intersection point CP in the predetermined passing order. If it is negative at step S12, then at step S13, n is incremented by 1, and the process returns to step S10. On the other hand, if it is affirmative in step S12, the system proceeds to step S7.

The manager of the delivery site can confirm the route evaluation information including the passing success rate SR of the actual route RT and the required time TP of each operation area through the manager terminal 3, and can respond to the letter of submission or delivery. The actual performance path RT of the homework is evaluated. That is, since the actual performance path RT is evaluated as the required time TP of each work area, for example, it is possible to periodically re-evaluate the work load of each work area. As a result, it is possible to perform the distribution of the mailing or delivery work to each of the couriers A and B with good balance. In addition, since the actual performance route RT is evaluated as the passing success rate SR, for example, it is possible to re-evaluate the route (delivery order) that is frequently detoured, thereby enabling the evaluation of the actual performance route RT Increased accuracy. In addition, for example, although the grid-like regions AR1~AR25 corresponding to the latitude and longitude as shown in FIG. 8 can also be considered to divide the actual performance path RT, this method is not The actual performance path RT is divided into specific sections according to the passage sequence of the time series, so it is difficult to evaluate the actual performance path RT as the required time TP for each work area. <Administrator Terminal 3> Next, the manager terminal 3 will be described. The manager terminal 3 is a user for the manager of the delivery base to set and evaluate the movement paths of the dispatchers A and B who perform the mailing or delivery operations. The manager terminal 3 includes various computers such as personal computers, tablet terminals, smart phones, etc. installed at the delivery site, and transmits and receives information to and from the management server 2 via the network 4 . FIG. 9 is a block diagram showing the schematic structure of the manager terminal 3. As shown in FIG. 9, the manager terminal 3 includes a control unit 30, a storage unit 31, a communication unit 32, a display unit 34, and an input unit 35. The memory portion 31 is composed of semiconductor memory or hard disk. In the memory portion 31, an operating system (OS), software called application programs, and various other information are stored. The communication unit 32 is installed with a communication protocol capable of wired communication (for example, Internet lines, etc.) or wireless communication such as 3G, LTE, 4G, 5G, etc., and is connected to the management server 2 for transmission and reception. The display unit 34 is composed of a display device such as a liquid crystal display or an organic EL panel, and receives instructions from the control unit 30, and displays a map, icons of operation keys for the touch panel, and the like. In addition, the display unit 34 displays the route evaluation information sent from the information output unit 207 of the management server 2 and the like. The input unit 35 is constituted by a physical switch such as a numeric keyboard operated by a manager or an input device (not shown) such as a touch panel superimposed on the display surface of the display unit 34. Via the input unit 35, a command for switching the display screen of the display unit 34 is input. The setting of work area (distribution target assignment), the assignment of dispatchers A and B to each work area, the delivery order of the work area, and the setting of the delivery order of the delivery target in each work area can be set through the input unit 35 To implement. The control unit 30 is constituted by including a processor including a CPU, RAM, ROM, I/O, etc. The control unit 30 includes a display control unit 301, a connection processing unit 302, an evaluation information request unit 303, and a server information acquisition unit 304 as a functional configuration. The display control unit 301 controls the screen display caused by the display unit 34 by generating an image signal in response to the operation of the input unit 35 and sending it to the display unit 34. The screen displayed by the display unit 34 by the display control unit 301 includes a login screen useful for logging in to the management system 100, the work area, the delivery personnel A, B, and the delivery order of the work area. And the setting screen for setting the delivery order of the delivery target in each operation area, the route evaluation screen for displaying route evaluation information, etc. The connection processing unit 302 uses, for example, an identification number (site manager ID) and a password for identifying the manager or person in charge of the delivery site to perform login management on the management server 2. The evaluation information request unit 303 specifies the delivery person and the delivery period in response to the operation of the input unit 35 by the manager, and sends the output request of the route evaluation information to the management server 2. The server information acquisition unit 304 acquires route evaluation information and the like sent from the management server 2 (information output unit 207). If the path evaluation information is obtained by the server information obtaining unit 304, the path evaluation information is displayed on the display unit 34. [Actions of the management system 100] Next, an example of the operation of the management system 100 will be described. The delivery person A who drives the vehicle 6A inputs via the input unit 15 on the login screen displayed on the display unit 14 of the delivery person terminal 1A, for example, when departing from the delivery base, that is, when starting work. Your own login ID and password. If this input is performed, the management server 2 performs connection processing with the delivery person terminal 1A. After that, the dispatcher terminal 1A communicates with the management server 2 at a specific time interval (for example, one second interval), and sends the position information of the dispatcher A or the vehicle 6A to the management server 2. The communication between the dispatcher terminal 1A and the management server 2 continues until the dispatcher terminal 1A performs a logout operation. On the other hand, the manager of the delivery site inputs the site manager ID and password via the input unit 35 on the login screen displayed on the display unit 34 of the manager terminal 3. If this input is made, the management server 2 performs connection processing with the manager terminal 3. If the manager specifies the delivery person A and the delivery period via the input unit 35 (touch panel) and inputs the output request of the route evaluation information, the output request of the route evaluation information is sent to the management server 2. In response to this input, the management server 2 calculates the actual performance of the delivery person A who passed the multiple work areas BL1~BL5 during the delivery period specified in the route evaluation information. Route RT (FIG. 4B, 4C), and extract the intersections CP1~CP11 between the actual route RT and the entrances and exits of each work area BL1~BL5 (steps S1~S3). In addition, the ratio of the line segments that have been calculated to have one or more intersections CP and that the delivery person A has passed is calculated as the passing success rate SR of the actual route RT (step S4). Furthermore, it is determined whether each intersection point CP1~CP11 is valid or invalid (steps S5, S6 or S9~S13), and based on the passing time t of the intersection points CP1, CP3~CP5, CP7~CP10 judged to be valid, each is calculated. The required time TP for each of the work areas (step S7). Information about the passing success rate SR of the actual path RT calculated at the management server 2 and the required time TP of each work area is sent to the manager terminal 3 as path evaluation information and displayed on the display At section 34 (step S8). The manager of the delivery site can confirm the route evaluation information including the passing success rate SR of the actual route RT and the required time TP of each operation area through the manager terminal 3, and can respond to the letter of submission or delivery. The actual performance path RT of the homework is evaluated. With this, it is possible to re-evaluate the work load of each work area in response to needs, and it is possible to carry out the distribution of the mailing or delivery work to each courier with a good balance. For example, it is estimated that the actual required time TP will be longer than the predetermined time due to the increase or decrease in the number of delivery targets contained in each operation area or the changes in the surrounding traffic conditions. Or in shorter cases, the department can re-evaluate the scope of the work area. In addition, the system can re-evaluate the delivery sequence according to needs and improve the accuracy of route evaluation. According to this embodiment, the following general functions and effects can be obtained. (1) The route evaluation device 5 evaluates the travel routes of the delivery personnel A and B or the vehicles 6A and 6B passing through plural work areas on the map. The path evaluation device 5 is provided with: a memory 21, which stores the positions corresponding to the entrance #1Enter~#5Enter and the exit #1Exit~#5Exit in each of the plural work areas BL1~BL5 to correspond to the movement path The position information of the plural line segments on the map defined by the way of intersecting; and the information obtaining unit 202 obtains the position information of the courier A, B or the vehicles 6A, 6B, and the time information corresponding to the position information; The sum passing determination unit 208 determines whether the delivery person A, B or the vehicle 6A, 6B has passed based on the position information acquired by the information acquisition unit 202 and the position information of the plural line segments memorized in the memory 21 Each of the plural line segments (Figure 3). By judging whether or not each line segment has passed, it is possible to grasp the extent to which the delivery personnel A and B or the vehicles 6A and 6B have passed as scheduled for a plurality of locations. (2) The passing judgment unit 208 further calculates the proportion of the line segments judged to have passed by the delivery personnel A and B or the vehicles 6A and 6B as the passing success rate SR of the actual route RT. By this, it is possible to quantitatively grasp whether the delivery personnel A, B or the vehicles 6A, 6B have passed the plural places as scheduled. (3) The route evaluation device 5 is further provided with: a required time calculation unit 206 based on and determined by the passing determination unit 208 that the delivery personnel A, B or the vehicles 6A, 6B have passed multiple times The earliest passing time t of the line segment corresponding to the entry #1Enter ~#5Enter is calculated to calculate what the delivery staff A, B or vehicles 6A, 6B need in order to pass through each of the plural work areas BL1~BL5 The required time TP is based on the passing time t of the line segment corresponding to the exit #1Exit~#5Exit determined by the passing determination unit 208 that the delivery personnel A, B or the vehicles 6A, 6B have passed multiple times The last passing time t is used to calculate the required time TP for the delivery personnel A, B or vehicles 6A, 6B to pass through each of the plural work areas BL1 to BL5 (Figure 3). With this, even when moving back and forth near the entrance and exit of the work area, it is possible to perform the evaluation of the movement path such as the calculation of the required time TP of each work area with good accuracy. (4) The route evaluation device 5 evaluates the movement routes of the delivery personnel A and B or the vehicles 6A and 6B passing through the plural work areas on the map in a specific order. The path evaluation device 5 is provided with: a memory 21, which stores the positions corresponding to the entrance #1Enter~#5Enter and the exit #1Exit~#5Exit in each of the plural work areas BL1~BL5 to correspond to the movement path The position information of the plural line segments on the map defined by the way of intersecting; and the information obtaining unit 202 obtains the position information of the courier A, B or the vehicles 6A, 6B, and the time information corresponding to the position information; The sum route calculation unit 203 calculates the actual route RT that the delivery personnel A, B or vehicles 6A, 6B actually moved based on the position information and time information obtained by the information acquisition unit 202; and the intersection calculation unit 204 , Is to calculate the complex number intersection CP between the actual performance path RT calculated by the path calculation unit 203 and the plurality of line segments memorized in the memory 21; and the determination unit 205 follows so that the actual performance path RT is specified The order of passing through the plural work areas BL1~BL5 is the predetermined passing order established in advance, to determine in order whether the plural intersection points CP calculated by the intersection calculation unit 204 are valid or invalid; and the required time The calculation unit 206 is based on the location information and time information acquired by the information acquisition unit 202 of the intersection CP determined to be valid by the determination unit 205, and calculates that the delivery personnel A, B or the vehicles 6A, 6B pass the plural number. The required time TP1~TP5 for each of the work areas BL1~BL5 (Figure 3). By this, it is possible to distinguish the actual path RT when passing through a plurality of work areas in a specific order according to the time series, and calculate the required time TP for each work area. (5) The judgment unit 205 judges the intersection point CP of the complex number calculated by the intersection calculation unit 204 based on the time information acquired by the information acquisition unit 202 in such a way that the predetermined passage sequence becomes the time sequence Department is valid or invalid. With this, even when it moves away from the predetermined moving path due to traffic conditions, etc., it is possible to follow the actual path RT when passing through a plurality of work areas in a specific order. The sequence is divided, and the required time TP for each work area is calculated. (6) The judging unit 205 is based on the time information obtained by the information obtaining unit 202 for the predetermined passing sequence among the intersection points CP of the plural numbers judged to be valid and corresponding to the same entrance. The actual passing order is the first intersection CP as valid, and the remaining intersections CP as invalid, and for the predetermined passing order as the intersection CP corresponding to the same exit, the actual passing order is the last intersection. The CP is judged to be valid, and the remaining intersection point CP is judged to be invalid. With this, even when moving back and forth near the entrance and exit of the work area, the actual path RT when passing through a plurality of work areas in a specific order can be distinguished according to the time series. And calculate the required time TP for each work area. In addition, the above-mentioned embodiment can be modified into various forms. Hereinafter, a modification example will be described. In the above-mentioned embodiment, although the example in which the route evaluation device 5 evaluates the travel route of the delivery person performing the mailing or delivery work has been described, the route evaluation device should only be specific If the order is evaluated based on the movement path of the mover in the plural areas, it does not matter what kind of structure it is. For example, it is also possible to evaluate the movement path when performing work such as equipment inspections that are patrolled for each house. It is also possible to evaluate the movement paths of visitors in facilities with multiple areas such as amusement parks and zoos.

In the above embodiment, although the exit #0Exit~#5Exit and entrance #1Enter~#6Enter of the delivery base and each work area BL1~BL5 are set as straight line segments, the system is not limited to straight line segments, but also Can be a curved line segment. In addition, the system is not limited to a line segment, and can be set as an area such as a circle, an ellipse, and a polygon.

In the above-mentioned embodiment, although the information acquisition unit 202 is configured to acquire the position information calculated on the delivery person terminal 1A, 1B side, the structure of the information acquisition unit that acquires the position information of the operator is not limited to this. For example, the system may also be configured to calculate the position by the management server 2 based on GPS signals received at the delivery terminal 1A, 1B side.

In the above-mentioned embodiment, the route calculation unit 203 calculates the actual route RT as a linker by following the time series of the drawing points from the starting point to the ending point corresponding to the position of the delivery person. However, The path calculation unit may be of any configuration as long as it calculates the actual path of the movement actually performed by the operator. For example, it is also possible to calculate the actual performance path based on the moving average of the position drawing points.

In the foregoing, although the present invention has been described as the route evaluation device 5, the present invention can also be used as a route evaluation method for evaluating a moving route that passes through a plurality of work areas on a map in a specific order. Method to use. That is, the route evaluation method includes the following steps: obtain the location information of the courier A, B or the vehicles 6A, 6B, and the time information corresponding to the location information (step S1 in FIG. 7); Calculate the actual performance path RT that the delivery personnel A, B or vehicles 6A, 6B actually moved by using the acquired position information and time information (step S2); calculate the actual performance path RT and the operation area so that the moving path is in the plural The intersection point CP between the plural line segments on the map defined by the way that the entrance #1Enter~#5Enter and exit #1Exit~#5Exit of each of BL1~BL5 intersect (step S3) ; Following the predetermined passing sequence established in advance in such a way that the actual performance path RT passes through the plural work areas BL1~BL5 in a specific order, to sequentially determine whether the calculated plural intersection points CP are valid or invalid ( Steps S4~S8); Based on the acquired position information and time information of the intersection CP judged to be valid, calculate what the delivery personnel A, B or vehicles 6A, 6B need to pass through each of the plural work areas BL1~BL5 The required time TP1~TP5 (step S7).

In the above description, although the path evaluation program is stored in the memory 21 of the management server 2, it can also be stored in an external storage medium such as flash memory. It is also possible to obtain a path evaluation program from outside the management system 100 via the network 4.

One or a plurality of the above-mentioned embodiments and modification examples can be combined arbitrarily, and the modification examples can also be combined with each other.

According to the present invention, it is possible to grasp whether the movement path passes through a plurality of predetermined locations and the predetermined degree of coincidence of the movement history.

Although the above descriptions are related to the appropriate embodiments of the present invention, it should be understood by those who have general knowledge in the technical field that they do not deviate from the scope of the patent application described later. Under the premise of the scope of disclosure, various modifications and changes can be made.

1A: Delivery person terminal 1B: Delivery person terminal 2: Management server 3: Manager terminal 4: network 5: Path evaluation device 6A: Vehicle 6B: Vehicle 10: Control Department 11: Memory Department 12: Wireless Department 13: Sensor part 13a: GPS sensor 13b: Gyro sensor 14: Display 15: Input section 20: Control Department 21: Memory Department 22: Ministry of Communications 24: Display 25: Input section 30: Control Department 31: Memory Department 32: Ministry of Communications 34: Display 35: Input section 100: Management system 101: Display control unit 102: Connection Processing Department 103: Location Information Notification Department 201: Connection Processing Department 202: Information Acquisition Department 203: Path calculation section 204: Intersection calculation department 205: Judgment Department 206: Required time calculation department 207: Information Output Department 208: Passed the Judgment Department 211: Delivery person information area 212: Vehicle Information Area 213: Mailing target or delivery target information area 214: Map Information Area 215: Management Information Area 301: Display Control Unit 302: Connection Processing Department 303: Evaluation Information Request Department 304: Server Information Acquisition Department A: Delivery person AR1~AR25: area B: Delivery person BL1: Operating area BL2: Operating area BL3: Operating area BL4: Operating area BL5: Operating area CL: straight line CP: point of intersection CP1: point of intersection CP2: point of intersection CP3: Intersection CP4: Intersection CP5: Intersection CP6: Intersection CP7: Intersection CP8: Intersection CP9: Intersection CP10: Intersection CP11: Intersection CP41: Intersection CP42: Intersection CP43: Intersection CP51: Intersection CP52: Point of Intersection CP53: Intersection P1: Delineation point P2: Delineation point PS: starting point PE: the end RT: performance path t: passing time t1: passing time t2: passing time TI: Information of the moment x1: Latitude x2: Latitude y1: longitude y2: longitude #1Enter: Entry #2Enter: Entry #3Enter: Entry #4Enter: Entry #5Enter: Entry #6Enter: Entry #0Exit: Exit #1Exit: Exit #2Exit: Exit #3Exit: Exit #4Exit: Exit #5Exit: Exit

The purpose, features, and advantages of the present invention can be made clearer by the description of the following embodiments related to the attached drawings. In the attached drawings, Fig. 1 is a diagram showing an example of the system configuration of a management system including a route evaluation device according to an embodiment of the present invention. Fig. 2 is a block diagram showing the schematic structure of the distributor terminal in Fig. 1. Fig. 3 is a block diagram showing the schematic structure of the management server of Fig. 1. FIG. 4A is a diagram for explaining the delivery sequence of the work areas stored in the management information area of FIG. 3 and the position information of the entrance and exit of each work area. FIG. 4B is a diagram for explaining one example of the actual path calculated by the path calculation unit in FIG. 3. FIG. 4C is a diagram for explaining another example of the actual performance path calculated by the path calculation unit in FIG. 3. FIG. 4D is a diagram for explaining one example of the actual path calculated by the path calculation unit of FIG. 3 when passing through the same entrance and exit continuously. Fig. 5 is a diagram for explaining the calculation method of the passing time of the intersection between the actual performance path and the entrance and exit of each work area. Fig. 6A is a diagram for explaining the judgment made by the judging unit in Fig. 3. Fig. 6B is a diagram showing an example of the judgment result caused by the judgment unit of Fig. 3. FIG. 7A is a flowchart showing an example of the processing performed by the management server of FIG. 3. FIG. FIG. 7B is a flowchart showing another example of the processing performed by the management server of FIG. 3. Fig. 8 is a diagram for explaining a comparative example in which the actual performance path is divided using grid-like regions. Fig. 9 is a block diagram showing the schematic structure of the manager terminal of Fig. 1.

2: Management server

5: Path evaluation device

20: Control Department

21: Memory Department

22: Ministry of Communications

24: Display

25: Input section

201: Connection Processing Department

202: Information Acquisition Department

203: Path calculation section

204: Intersection calculation department

205: Judgment Department

206: Required time calculation department

207: Information Output Department

208: Passed the Judgment Department

211: Delivery person information area

212: Vehicle Information Area

213: Letter of submission target or delivery target area

214: Map Information Area

215: Management Information Area

Claims (10)

A path evaluation device (5) is a path evaluation device (5) that evaluates the movement path of a mover passing through a plurality of areas on a map, and is characterized in that it is provided with: The memory part (21) memorizes the position information of the plural elements on the aforementioned map defined by the positions corresponding to the entrances and exits of each of the aforementioned plural areas and intersecting the aforementioned moving paths; and The information obtaining unit (202) obtains the location information of the aforementioned mobile person and the time information corresponding to the location information; and The determination unit (208) determines whether the mover is based on the position information obtained by the information acquisition unit (202) and the position information of the plural elements stored in the memory unit (201) Pass each of the aforementioned plural elements; and The required time calculation unit (206) is based on the earliest passage time among the passage times of the element corresponding to the aforementioned entrance judged by the passage judgment unit (208) that the mover has passed through plural times , To calculate the time required for the mover to pass through each of the plurality of areas, and based on the corresponding exit that is determined by the passing determination unit that the mover has passed multiple times The last passing time among the passing times of the elements is used to calculate the time required for the mover to pass through each of the plural areas. Such as the path evaluation device described in item 1 of the scope of patent application, in which: The aforementioned passage determining unit (208) further calculates the ratio of the elements determined that the aforementioned mobile person passed to the aforementioned plural elements. A path evaluation system, which is characterized by: Such as the path evaluation device (5) described in item 1 or item 2 of the scope of patent application; and The mobile terminals (1A, 1B) move together with the mobile, and send the position information of the mobile and the time information corresponding to the position information to the path evaluation device (5). A path evaluation method is a path evaluation method that evaluates the movement path of a mover passing through a plurality of areas on the map, and is characterized in that it includes the following steps: Obtain the location information of the aforementioned mover and the time information corresponding to the location information; Based on the obtained position information and the position corresponding to the entrance and exit of each of the plurality of areas, the position information of the plural elements on the map defined in a way that intersects the movement path, And determine whether the aforementioned mover has passed each of the aforementioned plural elements; Based on the earliest passing time of the element corresponding to the aforementioned entrance through which it is judged that the aforementioned mobile person has passed through plural times, the requirements of the aforementioned mobile person to pass through each of the aforementioned plural areas are calculated. Time, and based on the last passing time of the element corresponding to the exit determined by the passing determination unit that the mover has passed through the plurality of times, the mover is calculated to pass the plural number The required time required by each of the regions. A path evaluation program is a path evaluation program that evaluates the movement path of a mover passing through a plurality of areas on the map, and is characterized in that it is used to make a computer execute the following program: The process of obtaining the location information of the aforementioned mobile person and the time information corresponding to the location information; Based on the obtained position information and the position corresponding to the entrance and exit of each of the plurality of areas, the position information of the plural elements on the map defined in a way that intersects the movement path, The procedure to determine whether the aforementioned mover has passed each of the aforementioned plural elements; Based on the earliest passing time of the element corresponding to the aforementioned entrance through which it is judged that the aforementioned mobile person has passed through plural times, the requirements of the aforementioned mobile person to pass through each of the aforementioned plural areas are calculated. Time, and based on the last passing time of the element corresponding to the exit determined by the passing determination unit that the mover has passed through the plurality of times, the mover is calculated to pass the plural number The procedure of the required time required by each of the regions. A path evaluation device (5) is a path evaluation device (5) that evaluates the movement path of a mover who passes through a plurality of areas on a map in a specific order, and is characterized in that it is provided with: The memory part (21) memorizes the position information of the plural elements on the aforementioned map defined by the positions corresponding to the entrances and exits of each of the aforementioned plural areas and intersecting the aforementioned moving paths; and The information obtaining unit (202) obtains the location information of the aforementioned mobile person and the time information corresponding to the location information; and A path calculation unit (203), based on the aforementioned position information and the aforementioned time information obtained by the aforementioned information acquisition unit (202), calculates the actual path of the movement actually made by the aforementioned mover; and The intersection calculation unit (204) calculates the complex number of intersections between the actual path calculated by the aforementioned path calculation unit (203) and the aforementioned plural elements stored in the aforementioned memory unit (201); and The judging unit (205) is based on the predetermined passing sequence that is pre-determined in such a way that the actual performance path passes through the plurality of areas in the aforementioned specific order, and then sequentially judges by the intersection point calculating unit (204) The calculated intersections of the aforementioned plural numbers are valid or invalid respectively; and The required time calculation unit (206) calculates the aforementioned movement based on the aforementioned position information and the aforementioned time information obtained by the aforementioned information obtaining unit (202) which are determined to be valid by the aforementioned judging unit (205) The time required to pass through each of the aforementioned plural areas. Such as the path evaluation device described in item 6 of the scope of patent application, in which: The aforementioned determination unit (205) is based on the time information acquired by the aforementioned information acquisition unit (202) to make the aforementioned predetermined passage sequence into a time sequence, and then determines by the aforementioned intersection calculation unit (204) The calculated intersection point of the plural number is valid or invalid. Such as the path evaluation device described in item 7 of the scope of patent application, in which: The aforementioned determination unit (205) is based on the time information acquired by the aforementioned information acquisition unit (202) for the predetermined passage sequence corresponding to the same entrance of the plurality of intersections determined to be valid. And the obtained actual passing sequence is the first intersection that is judged to be valid, and the remaining intersections are judged to be invalid, and for the aforementioned predetermined passing sequence to correspond to the same intersection of the aforementioned exits, the aforementioned actual passing sequence is determined as The last intersection is judged to be valid, and the remaining intersections are judged to be invalid. A path evaluation method is a path evaluation method that evaluates the movement path of a mover who passes through a plurality of areas on the map in a specific order, and is characterized in that it includes the following steps: Obtain the location information of the aforementioned mover and the time information corresponding to the location information; Based on the obtained position information and the aforementioned time information, calculate the actual path of the movement actually made by the aforementioned mover; Calculate the calculated actual path, and the position corresponding to the entrance and exit of each of the aforementioned plural areas, and define the plural elements on the aforementioned map so as to intersect the aforementioned movement path, between these The intersection of the plural; Determine whether the calculated intersection points of the plural numbers are valid or invalid based on the pre-established rules so that the aforementioned actual performance path will pass through the aforementioned plural areas in the aforementioned specific order; Based on the acquired position information and the time information for the intersection determined to be valid, the time required for the mover to pass through each of the plural areas is calculated. A path evaluation program is a path evaluation program that evaluates the movement path of a mover who passes through a plurality of areas on the map in a specific order. It is characterized in that it is used to make a computer execute the following procedures: The process of obtaining the location information of the aforementioned mobile person and the time information corresponding to the location information; Based on the obtained location information and the aforementioned time information, the process of calculating the actual path of the movement actually made by the aforementioned mover; Calculate the calculated actual path, and the position corresponding to the entrance and exit of each of the aforementioned plural areas, and define the plural elements on the aforementioned map so as to intersect the aforementioned movement path, between these The procedure at the intersection of the plural; A procedure for determining whether the calculated intersection point of the plural numbers is valid or invalid based on the rules formulated in advance so that the aforementioned actual performance path will pass through the aforementioned plural areas in the aforementioned specific order; Based on the acquired position information and the time information for the intersection determined to be valid, a procedure for calculating the time required for the mobile person to pass through each of the plural areas.

Images