Transport plan support device, transport plan support method and computer program

Abstract

To provide a transport plan support device capable of satisfying all prescribed labor constraint conditions to a vehicle driver engaged in transport business, and satisfying transport demand.SOLUTION: A transport plan support device comprises: a reception part for receiving a transport condition including, a drive time between first and second footholds, a labor time except for the drive time and a rest time, and transport demand which includes the number of transit for one day and the number of days of transport per a constant period for one vehicle driver; a maximum drive time calculation part for calculating a maximum drive time for one day which is allowed for one vehicle driver, using the transport condition and transport demand for a predetermined labor constraint condition; and a relay foothold number calculation part for calculating the number of relay footholds which are required between the first and second footholds, on the basis of the smallest maximum drive time out of the maximum drive time, and a drive time in the transport condition.SELECTED DRAWING: Figure 1

Description

[Technical field]

[0001] The present invention relates to a transportation planning support device, a transportation planning support method, and a computer program. [Background technology]

[0002] In recent years, truck (freight vehicle) transportation accounts for 90% of Japan's transportation on a weight basis, and is an important infrastructure that supports economic activity. However, a shortage of truck drivers has become an issue, and it is urgent to improve the long working hours of truck drivers, which is considered to be one of the causes. As one of the measures to improve the long working hours of truck drivers, relay transportation, which divides transportation into parts, is being considered (for example, see Patent Document 1). Patent Document 1 describes a relay transportation planning device that can reduce the length of time that vehicle drivers who perform relay transportation are required to be on duty. [Prior art documents] [Patent documents]

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

[0004] In accordance with the Labor Standards Act and standards for improving the working hours of drivers (Improvement Standards Notification), truck drivers are subject to detailed work constraints, such as on-duty hours, driving hours, and continuous driving hours, in units of one day, one month, one year, one day average, and one week average. However, the relay transportation planning device described in Patent Document 1 does not take into consideration the satisfaction of all work constraints.

[0005] The present invention has been made in consideration of the above circumstances, and its purpose is to provide a transportation planning support device, a transportation planning support method, and a computer program that can contribute to vehicle drivers involved in the transportation industry satisfying all specified work constraint conditions and meeting transportation demand. [Means for solving the problem]

[0006] One aspect of the present invention is a transportation planning support device that includes a reception unit that receives transportation demands that indicate the driving time between a first base station and a second base station, working hours and rest times excluding the driving time, as well as the number of trips per day and the number of transportation days per certain period of time, which are required of a vehicle driver engaged in the transportation industry; a maximum driving time calculation unit that calculates the maximum daily driving time allowable for the vehicle driver using the transportation conditions and the transportation demand for each specified work constraint condition for the vehicle driver; and a number of relay points calculation unit that calculates the number of relay points required between the first base station and the second base based on the smallest maximum driving time among the maximum driving times calculated for each specified work constraint condition and the driving time under the transportation conditions. One aspect of the present invention is a transportation planning support device that, in the above-mentioned transportation planning support device, further includes a base-to-base minimum driving time calculation unit that calculates the minimum driving time between all bases, targeting the first base, the second base, and the relay base, based on the calculated number of relay bases and the minimum maximum driving time.

[0007] One aspect of the present invention is a transportation planning support method executed by an information processing device, which includes a reception step for receiving transportation conditions indicating the driving time between a first base station and a second base station, working hours and rest times excluding the driving time, and transportation demand indicating the number of trips per day and the number of transportation days per certain period, which are required of a vehicle driver engaged in the transportation industry; a maximum driving time calculation step for calculating the maximum daily driving time allowable for the vehicle driver using the transportation conditions and the transportation demand for each specified work constraint condition for the vehicle driver; and a number of relay bases calculation step for calculating the number of relay bases required between the first base station and the second base based on the smallest maximum driving time calculated for each specified work constraint condition and the driving time under the transportation conditions.

[0008] One aspect of the present invention is a computer program for causing a computer to execute the following steps: a reception step for receiving transportation conditions indicating the driving time between a first location and a second location, working hours excluding the driving time, and rest times, as well as transportation demand indicating the number of trips per day and the number of transportation days per certain period, which are required of a vehicle driver engaged in the transportation industry; a maximum driving time calculation step for calculating the maximum daily driving time allowable for the vehicle driver using the transportation conditions and the transportation demand for each specified work constraint condition for the vehicle driver; and a number of relay points calculation step for calculating the number of relay points required between the first location and the second location based on the smallest maximum driving time among the maximum driving times calculated for each specified work constraint condition and the driving time under the transportation conditions. Effect of the Invention

[0009] According to the present invention, it is possible to design relay bases that can provide an appropriate working environment for vehicle drivers involved in the transportation industry and to evaluate the validity of relay transportation plans, thereby achieving the effect of contributing to meeting all of the specified work constraints of vehicle drivers and satisfying transportation demand. [Brief description of the drawings]

[0010] [Figure 1] 1 is a block diagram showing a configuration example of a transportation plan assistance device according to an embodiment; [Diagram 2] FIG. 1 is a diagram showing an overview of cargo transportation according to an embodiment. [Diagram 3] 1 is a flowchart illustrating an example of a procedure of a transportation plan support method according to an embodiment. [Figure 4] FIG. 2 illustrates an example of a relay point according to an embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0011] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, an embodiment of the present invention will be described with reference to the drawings. In this embodiment, a case where transportation planning support is provided to a transport company that transports freight by truck (freight vehicle) will be described as an example.

[0012] 1 is a block diagram showing an example of the configuration of a transportation planning support device according to an embodiment. In FIG. 1, the transportation planning support device 1 includes a control unit 10, a display unit 12, an operation unit 13, a communication unit 14, and a storage unit 15.

[0013] The control unit 10 is a CPU (Central Processing Unit), and executes various functions by calling up and executing programs stored in the storage unit 15 .

[0014] The control unit 10 includes, as its functions, a reception unit 101, a maximum driving time calculation unit 102, a relay base number calculation unit 103, a base-to-base minimum driving time calculation unit 104, and an output unit 105. These functions of the control unit 10 are realized by the CPU executing a transportation plan support program 151 stored in the storage unit 15.

[0015] The display unit 12 includes a display element such as a liquid crystal display or an organic EL (Electro Luminescence) display, and displays various information. The operation unit 13 is composed of an input device such as a numeric keypad, and inputs data according to a user's operation. Alternatively, the transportation planning support device 1 may include a touch panel that allows both data input and data display.

[0016] The communication unit 14 communicates with devices external to the device itself via a communication network such as the Internet.

[0017] The storage unit 15 stores various data such as programs executed by the control unit 10 and data used by the control unit 10. The storage unit 15 is configured from a hard disk device, a magneto-optical disk device, a non-volatile memory such as a flash memory, a read-only recording medium such as a CD-ROM, a volatile memory such as a dynamic random access memory (DRAM), or a combination of these.

[0018] The memory unit 15 stores a transportation planning support program 151, labor constraint condition data 152, and base data 153.

[0019] The work constraint condition data 152 is data indicating a predetermined work constraint condition. The work constraint condition according to this embodiment is a work constraint condition for a truck driver (vehicle driver). The truck driver according to this embodiment is a person who is involved in the transportation business of transporting cargo by truck.

[0020] In this embodiment, as an example of the labor constraint conditions, the labor constraint conditions stipulated in the Labor Standards Act and the Standards for Improvement of Working Hours of Automobile Drivers (Improvement Standards Notification) are used. Therefore, the labor constraint condition data 152 is data indicating the labor constraint conditions stipulated in the Labor Standards Act and the Improvement Standards Notification.

[0021] The base data 153 is data indicating the location of a base for transporting cargo by truck. The base includes a base at the departure point (starting point) of the cargo transport and a base at the destination (ending point). Therefore, the base data 153 has data indicating the location of the departure base and data indicating the location of the destination base. The base data 153 may further have data indicating the locations of candidate relay bases that can be installed between the departure base and the destination base. At the relay base, truck drivers are changed and cargo is transferred between trucks.

[0022] The reception unit 101 displays an input screen on the display unit 12. A user inputs input information on the input screen using the operation unit 13. The reception unit 101 receives, via the input screen, transport conditions and transport demands requested of one truck driver.

[0023] The transportation conditions include the driving time between the first and second locations, as well as the working hours and rest times excluding the driving time.

[0024] Fig. 2 is a diagram showing an overview of cargo transportation according to this embodiment. For example, as illustrated in Fig. 2, when a first base is a departure point of cargo transportation and a second base is a destination point of cargo transportation, the driving time required from the departure point of cargo transportation to the destination point (one-way driving time) is the driving time between the first base and the second base.

[0025] The working time for transporting cargo between the first and second bases consists of work time and rest time (base rest time, etc.). The working time consists of driving time between the first and second bases, the pre-boarding roll call time of the truck driver at the base, post-boarding roll call time, and base working time. Pre-boarding roll call time is the time required for the pre-boarding roll call. Post-boarding roll call time is the time required for the post-boarding roll call. Base working time is the time required for the truck driver to work at the base, and consists of the time actually spent performing work such as loading and unloading at the base (base working time) and work-related waiting time such as waiting for loading and unloading to begin (base work waiting time).

[0026] The base rest time is the truck driver's rest time at the base.

[0027] Transportation demand includes the number of trips per day and the number of transportation days per period (e.g., one week).

[0028] The input screen displayed on the display unit 12 has input fields for each input item of the transport conditions and transport demand. The user inputs each piece of input information into the input field for each input item of the transport conditions and transport demand on the input screen displayed on the display unit 12 using the operation unit 13. The reception unit 101 receives the input information for each input item of the transport conditions and transport demand input by the user. The reception unit 101 stores the received input information for each input item of the transport conditions and transport demand in a specified area of ​​the memory unit 15.

[0029] The maximum driving time calculation unit 102 calculates the maximum driving time per day allowed for one truck driver for each predetermined labor constraint condition for the truck driver, using the transportation conditions and transportation demands accepted by the acceptance unit 101. The predetermined labor constraint conditions are labor constraint conditions indicated in the labor constraint condition data 152. The maximum driving time calculation unit 102 stores the maximum driving time calculated for each labor constraint condition in a predetermined area of ​​the storage unit 15.

[0030] The number of relay points calculation unit 103 calculates the number of relay points required between the first base and the second base (required number of relay points) based on the minimum maximum driving time among the maximum driving times calculated by the maximum driving time calculation unit 102 for each predetermined labor constraint condition and the driving time (driving time between the first base and the second base) in the transportation conditions accepted by the acceptance unit 101. The number of relay points calculation unit 103 stores the calculated required number of relay points in a predetermined area of ​​the storage unit 15.

[0031] The inter-location minimum driving time calculation unit 104 calculates the minimum driving time between all locations (minimum inter-location driving time) for the first location, the second location, and the relay location, based on the required number of relay locations calculated by the relay location number calculation unit 103 and the minimum maximum driving time among the maximum driving times calculated for each predetermined labor constraint condition by the maximum driving time calculation unit 102. The inter-location minimum driving time calculation unit 104 stores the calculated minimum inter-location driving time in a predetermined area of ​​the storage unit 15.

[0032] The output unit 105 outputs output data such as the required number of relay points, the minimum driving time between points, etc. For example, the output unit 105 displays the output data on the display screen of the display unit 12. For example, the output unit 105 transmits the output data by e-mail or the like to a destination designated by the user via the communication unit 14.

[0033] Next, the operation of the transportation plan support device 1 according to this embodiment will be described with reference to Fig. 3. Fig. 3 is a flowchart showing an example of the procedure of the transportation plan support method according to this embodiment.

[0034] A user operates an information processing device such as a personal computer to start the transportation plan support program 151. In this way, the information processing device is configured as a transportation plan support device 1.

[0035] (Step S1) The reception unit 101 displays an input screen on the display unit 12. The user inputs each piece of input information into the input fields for each input item of the transportation conditions and the transportation demand on the input screen displayed on the display unit 12 using the operation unit 13. The reception unit 101 accepts the input information for each input item of the transportation conditions and the transportation demand input by the user. The transport conditions and transport demands may be stored in advance in a predetermined area of ​​the storage unit 15 as input information for each input item that is predetermined for each truck driver and each transport route. In this case, the reception unit 101 acquires input information for each input item corresponding to the target truck driver and the target transport route from a predetermined area of ​​the storage unit 15. The reception unit 101 may also automatically display the acquired input information for each input item in an input field for each input item of the transport conditions and transport demands on the input screen displayed on the display unit 12. The user checks the input information for each input item that is automatically displayed, and corrects the input information for each input item if necessary. This saves the user the trouble of inputting similar transport conditions and transport demands every time they use the service.

[0036] (Step S2) The maximum driving time calculation unit 102 calculates the maximum driving time per day allowed for one truck driver for each predetermined work constraint condition for the truck driver, using the transportation conditions and transportation demands accepted by the acceptance unit 101. The maximum driving time calculation unit 102 identifies the work constraint condition by the work constraint condition data 152 in the memory unit 15.

[0037] (Step S3) The number of relay points calculation unit 103 calculates the number of relay points required between the first base and the second base (required number of relay points) based on the smallest maximum driving time among the maximum driving times calculated by the maximum driving time calculation unit 102 for each specified labor constraint condition and the driving time (driving time between the first base and the second base) under the transportation conditions accepted by the acceptance unit 101.

[0038] (Step S4) The minimum driving time between bases calculation unit 104 calculates the minimum driving time between all bases (minimum driving time between bases) for the first base, the second base, and the relay base, based on the required number of relay bases calculated by the relay base number calculation unit 103 and the minimum maximum driving time among the maximum driving times calculated by the maximum driving time calculation unit 102 for each specified work constraint condition.

[0039] (Step S5) The output unit 105 outputs output data such as the required number of relay points and the minimum driving time between points.

[0040] Next, a specific example will be given to explain a method for calculating the required number of relay points and the minimum driving time between points according to this embodiment. As an example according to this embodiment, in the case where one truck driver departs from a first base (starting point) and returns to the first base (starting point) in one day, the required number of relay points is calculated by calculating the driving time in one day that can satisfy the transportation demand.

[0041] (1) Receiving input of transportation conditions and transportation demand (input information); Step S1 (1-1) Transportation conditions The transport conditions to be entered are shown below. a. Pre-boarding roll call time RCB, post-boarding roll call time RCA b. Base working hours DWA, DWB, DWC, DWD c. Base break time HTA, HTB, HTC, HTD In this example, one base work time is set with one base break time. Therefore, there is one set of base work time DWA and base break time HTA, one set of base work time DWB and base break time HTB, one set of base work time DWC and base break time HTC, and one set of base work time DWD and base break time HTD, for a total of four sets. d. Driving time between the first and second locations H12

[0042] (1-2) Transportation demand The transport demand input items are shown below. e. Number of transport days per week H3 f. Number of operations per day H4

[0043] From the above input information on transportation conditions and transportation demand, the working time H9 excluding driving time is calculated using the following formula. H9=RCB+RCA+(DWA+DWB+DWC+DWD)×H4

[0044] In addition, the break time H10 is "H10 = HTA + HTB + HTC + HTD", but the lower limit is set to 1 hour. Therefore, if "HTA + HTB + HTC + HTD" is less than 1 hour, "H10 = 1 hour" is set.

[0045] (2) Calculation of maximum daily operating time for each work constraint; Step S2 The maximum daily operating times A1, A2, B1, B2, and B3 are calculated for the five work constraint conditions A-1, A-2, B-1, B-2, and B-3 shown below, respectively.

[0046] (2-1) Operating time constraints A-1. Calculate the maximum daily operating time A1 that satisfies the daily average of 9 hours (L4=9) using the following formula. A1=L4÷H4÷2

[0047] A-2.1 Calculate the maximum daily driving time A2 that satisfies the weekly average of 44 hours (L5=44) using the following formula. A2=L5÷H3÷H4÷2

[0048] (2-2) Time constraints B-1. Calculate the maximum daily operating time B1 that satisfies 13 hours per day (L7=13) using the following formula. B1=(L7-H9-H10)÷H4÷2

[0049] B-2. Calculate the maximum daily operating time B2 that satisfies 284 hours per month (L8 = 284) using the following formula. B2=((L8÷(4×H3+MIN(3,H3))-H9-H10)÷H4÷2 Here, MIN(x1, x2) is a function that compares x1 and x2 to find the smaller value.

[0050] B-3. ​​Calculate the maximum daily operating time B3 that satisfies 3300 hours per year (L9 = 3300) using the following formula. Note that the following formula is for a year with 365 days. If a year has 366 days, simply change "365" in the formula to "366". B3=((L9÷(52×H3+MIN(365-364,H3))-H9-H10)÷H4÷2

[0051] (3) Calculation of the required number of relay points; Step S3 From the maximum daily driving times A1, A2, B1, B2, and B3 calculated for the five work constraint conditions A-1, A-2, B-1, B-2, and B-3, respectively, the minimum maximum driving time N10 is selected. This minimum maximum driving time N10 is the maximum daily driving time that satisfies all five work constraint conditions A-1, A-2, B-1, B-2, and B-3.

[0052] Next, calculate the required number of relay points L12 using the following formula. If the remainder when you divide H12 by N10 is not 0, then L12 = INT (H12 ÷ N10), If the remainder when you divide H12 by N10 is 0, then L12 = INT(H12÷N10) - 1 Here, INT(x) is a function that rounds down the decimal point of x and finds the largest integer not exceeding x.

[0053] (4) Calculation of the minimum driving time between bases; Step S4 The minimum operation time between bases, L16, is calculated using the following formula. L16=H12-L12×N10

[0054] (5) Output of required number of relay stations and minimum operation time between stations; Step S5 The required number of relay bases L12 and the minimum driving time between bases L16 are output. This allows the user to recognize the required number of relay bases L12 and the minimum driving time between bases L16. The user determines the number of relay bases and their installation locations based on the required number of relay bases L12 and the minimum driving time between bases L16.

[0055] Fig. 4 is a diagram showing an example of relay points according to the present embodiment. In Fig. 4(a), when the required number of relay points L12 is 1, one relay point (O) is provided between the first point (start point) and the second point (destination). In Fig. 4(b), when the required number of relay points L12 is 2, two relay points (O) and (P) are provided between the first point (start point) and the second point (destination). In Fig. 4(c), when the required number of relay points L12 is 3, three relay points (O), (P), and (Q) are provided between the first point (start point) and the second point (destination).

[0056] In the above-mentioned method for calculating the required number of relay points and the minimum operation time between points, the constraint condition of overtime work hours (so-called overtime work hours) is not included as a labor constraint condition, but the constraint condition of overtime work hours may be included as necessary. For example, a selection menu may be provided for the user to select whether or not to include the constraint condition of overtime work hours.

[0057] According to the above-described embodiment, it is possible to provide truck drivers involved in the transportation industry that transports cargo by truck with an appropriate working environment that meets all of the specified work constraints, and to contribute to meeting transportation demand.

[0058] In the above embodiment, the present invention is applied to a truck driver as an example of a vehicle driver engaged in the transportation industry, but is not limited thereto. For example, the present invention may be applied to a driver of a long-distance bus that transports passengers.

[0059] The transportation planning support device 1 may be configured using a general-purpose computer device such as a personal computer, or may be configured as a dedicated hardware device. For example, the transportation planning support device 1 may be configured using a server computer connected to a communication network such as the Internet. Each function of the transportation planning support device 1 may be realized by cloud computing. The transportation planning support device 1 may be realized by a single computer, or may be realized by distributing the functions of the transportation planning support device 1 among multiple computers. The transportation planning support device 1 may be configured to open a website using, for example, a WWW system.

[0060] Although an embodiment of the present invention has been described in detail above with reference to the drawings, the specific configuration is not limited to this embodiment, and design changes and the like that do not deviate from the gist of the present invention are also included.

[0061] In addition, a computer program for implementing the functions of each of the above-mentioned devices may be recorded on a computer-readable recording medium, and the program recorded on the recording medium may be read into a computer system and executed. Note that the "computer system" referred to here may include hardware such as an OS and peripheral devices. In addition, the term "computer-readable recording medium" refers to writable non-volatile memory such as a flexible disk, an optical magnetic disk, a ROM, or a flash memory, a portable medium such as a DVD (Digital Versatile Disc), or a storage device such as a hard disk built into a computer system.

[0062] Furthermore, the term "computer-readable recording medium" includes devices that retain a program for a certain period of time, such as volatile memory (e.g., DRAM (Dynamic Random Access Memory)) within a computer system that serves as a server or client when a program is transmitted via a network such as the Internet or a communication line such as a telephone line. The program may be transmitted from a computer system in which the program is stored in a storage device or the like to another computer system via a transmission medium, or by a transmission wave in the transmission medium. Here, the "transmission medium" that transmits the program refers to a medium that has a function of transmitting information, such as a network (communication network) such as the Internet or a communication line (communication line) such as a telephone line. The program may be for implementing some of the functions described above, or may be a so-called differential file (differential program) that can implement the functions described above in combination with a program already recorded in the computer system. [Explanation of symbols]

[0063] 1... transportation planning support device, 10... control unit, 12... display unit, 13... operation unit, 14... communication unit, 15... memory unit, 101... reception unit, 102... maximum driving time calculation unit, 103... relay point number calculation unit, 104... inter-point minimum driving time calculation unit, 105... output unit

Claims

1. A reception unit that receives transportation demands that indicate a driving time between a first base station and a second base station, work hours and rest times excluding the driving time, as well as the number of trips per day and the number of transportation days per certain period, which are required of a vehicle driver engaged in the transportation business; a maximum driving time calculation unit that calculates a maximum driving time per day allowed for the vehicle driver by using the transportation conditions and the transportation demand for each predetermined work constraint condition for the vehicle driver; a number of relay points calculation unit that calculates the number of relay points required between the first base and the second base based on a minimum maximum driving time among the maximum driving times calculated for each predetermined labor constraint condition and the driving time under the transportation conditions; A transportation planning support device comprising:

2. a base-to-base minimum driving time calculation unit that calculates a minimum driving time between all bases, targeting the first base, the second base, and the relay base, based on the calculated number of relay bases and the minimum maximum driving time; The transportation planning support device according to claim 1 , further comprising:

3. A transportation planning support method executed by an information processing device, A receiving step of receiving a transportation demand indicating a driving time between a first base station and a second base station, a working time and a rest time excluding the driving time, and a number of trips per day and a number of transportation days per certain period, which are required of a vehicle driver engaged in a transportation business; a maximum driving time calculation step of calculating a maximum driving time per day allowed for the vehicle driver using the transportation conditions and the transportation demand for each predetermined work constraint condition for the vehicle driver; a number of relay points calculation step of calculating the number of relay points required between the first base and the second base based on a minimum maximum driving time among the maximum driving times calculated for each predetermined labor constraint condition and the driving time under the transportation condition; A transportation planning support method including:

4. On the computer, A receiving step of receiving a transportation demand indicating a driving time between a first base station and a second base station, a working time and a rest time excluding the driving time, and a number of trips per day and a number of transportation days per certain period, which are required of a vehicle driver engaged in a transportation business; a maximum driving time calculation step of calculating a maximum driving time per day allowed for the vehicle driver using the transportation conditions and the transportation demand for each predetermined work constraint condition for the vehicle driver; a number of relay points calculation step of calculating the number of relay points required between the first base and the second base based on a minimum maximum driving time among the maximum driving times calculated for each predetermined labor constraint condition and the driving time under the transportation condition; A computer program for executing the above.

Images