Computer system and method for generating delivery plans

Abstract

To generate a delivery plan that satisfies requirements of three parties including passengers, cargo transport requesters, and transportation operators as much as possible.SOLUTION: A computer system: receives a transportation reservation for a cargo, including a departure and a destination; searches for a route, which is a combination of paths from the departure to the destination; generates a route graph composed of point nodes corresponding to waypoints of the route, and of path edges connecting between the waypoints that can be traveled by using the paths; generates a search graph from the route graph; and generates a delivery plan including via points, paths, and operation schedules by using the search graph. A cost representing the degree of satisfaction of each request of requesters, business operators, and passengers is set for edges of the search graph.SELECTED DRAWING: Figure 7

Description

[Technical Field]

[0001] The present invention relates to a system for supporting the generation of delivery plans for mixed cargo and passenger loads. [Background technology]

[0002] While labor shortages among delivery companies have become a social issue, public transportation businesses are experiencing declining revenues due to a decline in passenger numbers, making maintaining local transportation a challenge. Therefore, mixed freight and passenger transport using public transportation has attracted attention as an approach to addressing the decline in passenger numbers and reducing carbon dioxide emissions, and there is a demand for delivery planning technology that supports vehicle operations that meet the needs of all parties: transportation businesses, passengers, and cargo transport clients.

[0003] In response to this, a technology for formulating a delivery plan for mixed passenger and cargo transport is known. In Patent Document 1, in an on-demand mixed passenger and cargo transport system, a delivery plan is formulated that gives priority to either passengers or cargo transport requesters. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] Japanese Patent Application Laid-Open No. 2017-220090 Summary of the Invention [Problem to be solved by the invention]

[0005] The delivery plan proposed in the above-mentioned Patent Document 1 operates vehicles that are biased toward either passengers or cargo transport requesters. Furthermore, the requests of transportation operators and transportation by multiple transportation operators are not taken into consideration.

[0006] The present invention aims to provide a system that quantitatively evaluates the degree of fulfillment of the requirements of three parties: passengers, cargo transport requesters, and multiple transportation operators, and supports the generation of cargo delivery plans that satisfy the requirements of all three parties as much as possible. [Means for solving the problem]

[0007] A representative example of the invention disclosed in the present application is as follows: That is, a computer system for generating a cargo delivery plan using vehicles for transporting passengers and cargo, comprising at least one computer having a processor, a storage device connected to the processor, and a network interface connected to the processor, and communicably connected to a first terminal operated by a client who requests cargo transportation and a second terminal operated by a provider who provides a vehicle-based transportation service, and holding route information regarding the routes of the vehicles operated by the provider, and accepting cargo transportation reservations including a departure point and a destination, a second process for searching for a route that is a combination of the routes from the departure point to the destination based on the route information, and generating a route graph consisting of point nodes corresponding to stopover points on the route and route edges connecting the stopover points that can be reached using the route, a third process for generating a search graph from the route graph, and a search graph for generating a search graph for generating a search graph. and a fourth process of generating a delivery plan including waypoints, routes, and operation schedules using the route graph and the route information, wherein in the third process, the computer system generates the search graph based on the route graph and the route information, which is composed of nodes and edges corresponding to the operation schedules of the routes and transfers on the routes, and in which a first cost representing the degree of satisfaction of the requester's requirements, a second cost representing the degree of satisfaction of the business operator's requirements, and a third cost representing the degree of satisfaction of the passenger's requirements are set on the edges, and in the fourth process, the computer system searches for a route from the search graph based on an evaluation index representing the overall degree of satisfaction of the passenger, the requester, and the business operator, which is calculated using the first cost, the second cost, and the third cost set on the edges, generates the delivery plan using the searched route, and transmits the delivery plan to the second terminal. [Effects of the Invention]

[0008] According to the present invention, it is possible to quantitatively evaluate the degree of fulfillment of the requirements of the passenger, the cargo transport requester, and the transportation company, and to support the generation of a cargo delivery plan that satisfies the requirements of the three parties as much as possible. Problems, configurations, and effects other than those described above will become clear from the description of the following embodiments. [Brief explanation of the drawings]

[0009] [Figure 1] FIG. 1 illustrates an example of the configuration of a system according to a first embodiment. [Figure 2] FIG. 2 is a diagram illustrating an example of a hardware configuration of a computer that configures the delivery plan generation support system according to the first embodiment. [Figure 3A] FIG. 10 is a diagram illustrating an example of information stored in control information according to the first embodiment. [Figure 3B] FIG. 10 is a diagram illustrating an example of information stored in control information according to the first embodiment. [Figure 4] FIG. 3 is a sequence diagram illustrating a processing flow in the system according to the first embodiment. [Figure 5] FIG. 10 is a diagram illustrating an example of a reservation screen displayed on the terminal according to the first embodiment. [Figure 6] FIG. 10 is a diagram showing an example of a delivery plan selection screen displayed on the terminal of the first embodiment. [Figure 7] 10 is a flowchart illustrating an example of a candidate delivery plan generation process executed by the delivery plan generation support system according to the first embodiment. [Figure 8] FIG. 2 is a diagram showing a specific example of a method for generating a delivery plan by the delivery plan generation support system of the first embodiment. [Figure 9A] FIG. 2 is a diagram showing a specific example of a method for generating a delivery plan by the delivery plan generation support system of the first embodiment. [Figure 9B] FIG. 2 is a diagram showing a specific example of a method for generating a delivery plan by the delivery plan generation support system of the first embodiment. [Figure 9C] FIG. 2 is a diagram showing a specific example of a method for generating a delivery plan by the delivery plan generation support system of the first embodiment. [Figure 9D] FIG. 2 is a diagram showing a specific example of a method for generating a delivery plan by the delivery plan generation support system of the first embodiment. [Figure 9E] FIG. 2 is a diagram showing a specific example of a method for generating a delivery plan by the delivery plan generation support system of the first embodiment. [Figure 9F] FIG. 2 is a diagram showing a specific example of a method for generating a delivery plan by the delivery plan generation support system of the first embodiment. [Figure 9G] FIG. 2 is a diagram showing a specific example of a method for generating a delivery plan by the delivery plan generation support system of the first embodiment. [Figure 10] FIG. 10 is a diagram illustrating an example of the configuration of a system according to a second embodiment. [Figure 11] FIG. 10 is a sequence diagram illustrating a processing flow in the system according to the second embodiment. DETAILED DESCRIPTION OF THE INVENTION

[0010] Hereinafter, embodiments will be described with reference to the drawings. In the drawings, the same reference numerals indicate the same or corresponding parts. Furthermore, the present invention is not limited to the illustrated examples. Those skilled in the art will easily understand that the specific configuration can be changed within the scope of the idea or purpose of the present invention. [Example]

[0011] A first embodiment of the present invention will be described with reference to FIGS. 1 to 9. FIG.

[0012] Fig. 1 is a diagram illustrating an example of the configuration of a system according to Example 1. Fig. 2 is a diagram illustrating an example of the hardware configuration of a computer that constitutes the delivery plan generation support system according to Example 1.

[0013] The system comprises a delivery plan generation support system 100 and a plurality of terminals 101. The delivery plan generation support system 100 is connected to each terminal 101 via a network such as a LAN (Local Area Network) or a WAN (Wide Area Network). The network connection format may be either wired or wireless.

[0014] In Example 1, it is assumed that a transportation business operator provides transportation services using vehicles such as route buses and trains. The vehicles travel along fixed routes according to an operation schedule. It is also assumed that the transportation business operator provides transportation services for collecting and delivering cargo at stations and bus stops.

[0015] The terminal 101 is a terminal operated by a user who uses the delivery plan generation support system 100, and includes a processor, a storage device, a network interface, an input device, and an output device, all of which are not shown. In this embodiment, there is a terminal 101-1 operated by a transportation company, and a terminal 101-2 operated by a shipper. Note that a shipper is an example of a party requesting the transportation of cargo, and is not limited to this. For example, a delivery company may also be used. It is also assumed that there are multiple transportation companies and shippers.

[0016] The delivery plan generation support system 100 of the first embodiment supports the generation of a cargo delivery plan using vehicles operated by a transportation company that provides transportation services. Note that the transportation company that is the system operator is merely an example and is not limited to this. For example, the operator may be multiple transportation companies, a delivery company, or an independent operator. Here, the delivery plan is information including the delivery route, cargo collection and delivery locations, and a delivery schedule. The delivery plan generation support system 100 is configured with at least one computer 200. The computer 200 has a processor 201, a main memory device 202, a secondary memory device 203, and a network interface 204. The hardware elements are connected to each other via a bus. Note that the computer 200 may have input devices such as a keyboard, a mouse, and a touch panel, and may have output devices such as a display and a printer.

[0017] The processor 201 executes a program stored in the main memory device 202. The processor 201 executes processing in accordance with the program, thereby operating as a functional unit (module) that realizes a specific function. In the following description, when a processing is described using a functional unit as the subject, it indicates that the processor 201 is executing a program that realizes the functional unit.

[0018] The main memory device 202 is a storage device such as a DRAM (Dynamic Random Access Memory) and stores programs executed by the processor 201 and data used by the programs. The main memory device 202 is also used as a work area. The secondary memory device 203 is a storage device such as an HDD (Hard Disk Drive) or SSD (Solid State Drive) and permanently stores data.

[0019] The programs and data stored in the main memory device 202 may be stored in the secondary memory device 203. In this case, the processor 201 reads the programs and data from the secondary memory device 203 and loads them into the main memory device 202.

[0020] The delivery plan generation support system 100 holds control information 110, and also has a request receiving unit 120, a delivery plan generating unit 121, an evaluation unit 122, and a notification unit 123. The control information 110 is information used to generate a delivery plan.

[0021] Control information 110 stores route information 300 (see FIG. 3A) for managing bus and train routes, congestion level information 310 (see FIG. 3B) for managing the congestion level of the routes, and control parameters.

[0022] A transportation business operator uses a terminal 101-1 to register control information 110 in the delivery plan generation support system 100. The control parameters include weights and thresholds, which will be described later.

[0023] The request receiving unit 120 receives a request to transport cargo. The delivery plan generating unit 121 generates delivery plan candidates (candidate delivery plans). The evaluation unit 122 calculates evaluation indices that indicate the degree to which the candidate delivery plans fulfill the requirements of transportation companies, passengers, and shippers, and narrows down the candidate delivery plans using the evaluation indices. The notification unit 123 sends information to the terminal 101 and receives responses to the presented information.

[0024] It should be noted that with regard to each functional unit of the delivery plan generation support system 100, multiple functional units may be combined into one functional unit, or one functional unit may be divided into multiple functional units for each function.

[0025] 3A and 3B are diagrams illustrating an example of information stored in the control information 110 according to the first embodiment.

[0026] 3A is information showing an example of route information 300. FIG. 3B is a diagram showing an example of congestion degree information 310.

[0027] The route information 300 stores data including a route ID 301, a vehicle type 302, a route 303, and an operation schedule 304. One piece of data exists for one route.

[0028] Route ID 301 is a field that stores identification information for uniquely identifying a route. Vehicle type 302 is a field that stores the type of vehicle. Route 303 is a field that stores the departure point and destination of the route. Operation schedule 304 is a field that stores the operation schedule of the route connecting the departure point and destination. The operation schedule 304 stores the departure time from the departure point and the arrival time at the intermediate points and the destination.

[0029] The congestion level information 310 stores data including a route ID 311, a departure time 312, and a congestion level 313. One piece of data exists for each combination of route and departure time (operation schedule).

[0030] The route ID 311 is the same field as the route ID 301. The departure time 312 is a field for storing the departure time from the departure point. The congestion level 313 is a field for storing the congestion level indicating the degree of availability of seats in the vehicle when operating according to the operating schedule. In this embodiment, one congestion level is stored for each vehicle, but it is also possible to store the congestion level for each stopover point of each vehicle and the congestion level for each vehicle.

[0031] Furthermore, the delivery plan generation support system 100 may hold information on an inference model that outputs a congestion degree instead of the congestion degree information 310. The inference model receives, for example, route, departure time, weather, season, etc. as input, and outputs a congestion degree.

[0032] The control information also includes route information for creating a route map. The data may be in any format as long as it indicates the connections between points.

[0033] Fig. 4 is a sequence diagram illustrating a processing flow in the system of Example 1. Fig. 5 is a diagram illustrating an example of a reservation screen displayed on the terminal 101 of Example 1. Fig. 6 is a diagram illustrating an example of a delivery plan selection screen displayed on the terminal 101 of Example 1.

[0034] The delivery plan generation support system 100 provides an interface for registering control information. A transportation business operator uses a terminal 101-1 to register control information in the delivery plan generation support system 100 (step S101).

[0035] The shipper makes a cargo transportation reservation using the terminal 101-2 (step S102). For example, the delivery plan generation support system 100 displays a reservation screen 500 as shown in Fig. 5 on the terminal 101-2. The reservation screen 500 includes input fields 501, 502, 503, 504, and a reservation button 505.

[0036] Input field 501 is a field for inputting the loading location. Input field 502 is a field for inputting the unloading location. Input field 503 is a field for inputting the departure time. Input field 504 is a field for inputting the identification information of the shipper. Identification information issued by the transportation business operator is stored here. Reservation button 505 is an operation button for sending reservation information including the values ​​entered in input fields 501, 502, 503, and 504. In this embodiment, a transportation reservation is made by specifying the departure time of the cargo, but other reservation formats such as specifying the arrival time or time zone may also be used. A stopover may also be specified.

[0037] The delivery plan generation support system 100 executes candidate delivery plan generation processing (step S103). Details of the candidate delivery plan generation processing will be explained using FIG.

[0038] The delivery plan generation support system 100 transmits the display information output as a processing result of the candidate delivery plan generation process to the terminal 101-1 operated by the transportation business operator (step S104).

[0039] A delivery plan selection screen 600 such as that shown in Fig. 6 is displayed on the terminal 101-1. The delivery plan selection screen 600 includes a table 610 and an adopt button 620. The table 610 displays candidate delivery plans that have been generated and narrowed down by the delivery plan generation support system 100, and stores data including a selection 611, a number 612, a delivery plan 613, and an evaluation index 614. One piece of data exists for one candidate delivery plan.

[0040] Selection 611 is a field that displays radio buttons for selecting a candidate delivery plan to adopt. NO 612 is a field that stores the identification number of the candidate delivery plan. Delivery plan 613 is a field that stores specific details of the candidate delivery plan. In Example 1, the delivery plan 613 stores the delivery route, departure time from the departure point, and arrival time at the final destination. Evaluation index 614 is a group of fields that store evaluation indexes. As will be described later, evaluation indexes are calculated for each of the passenger, shipper, and transportation company, and an overall evaluation index is calculated based on the evaluation indexes of the three parties. Adopt button 620 is an operation button for notifying adoption of the candidate delivery plan selected in selection 611.

[0041] When the transportation business operator operates the adopt button 620, the terminal 101-1 transmits to the delivery plan generation support system 100 an adoption notification including the identification number of the candidate delivery plan selected by the transportation business operator (step S105).

[0042] The delivery plan generation support system 100 transmits the transport information including the departure time from the loading location and the arrival time at the unloading location to the terminal 101-2 (step S106).

[0043] The shipper checks the contents of the transportation information and operates terminal 101-2 to send a response to delivery plan generation support system 100 (step S107). If the shipper agrees with the contents of the transportation presented, the shipper sends a response to confirm the reservation, and if the shipper does not agree with the contents of the transportation presented, the shipper sends a response to cancel the reservation. If the cancellation of the reservation is accepted, delivery plan generation support system 100 may delete the delivery of the cargo.

[0044] The delivery plan generation support system 100 manages the upper limit of cargo capacity for each transport service and performs control so as not to accept requests when the upper limit is reached. Furthermore, if the transport service desired by the user is not available, the delivery plan generation support system 100 may recommend the use of a transport service in another time slot and generate a candidate delivery plan for that transport service.

[0045] Fig. 7 is a flowchart illustrating an example of a candidate delivery plan generation process executed by the delivery plan generation support system 100 of the embodiment 1. Fig. 8, Fig. 9A, Fig. 9B, Fig. 9C, Fig. 9D, Fig. 9E, Fig. 9F, and Fig. 9G are diagrams illustrating specific examples of a method for generating a delivery plan by the delivery plan generation support system 100 of the embodiment 1.

[0046] The delivery plan generating unit 121 selects one piece of reservation information from the reservation information for cargo accepted by the request accepting unit 120 (step S201). Hereinafter, the cargo of the selected reservation information will be referred to as a target cargo.

[0047] The delivery plan generating unit 121 refers to the route information 300, searches for a route (combination of routes) for transporting the target cargo from the departure point to the destination, and generates a route graph representing the searched route (step S202).

[0048] For example, when transporting a target cargo from station A, which is the departure point, to station C, which is the destination, the delivery plan generation unit 121 generates a route graph 800 as shown in Fig. 8. The nodes of the route graph represent points such as stations and stops, and the edges represent routes connecting the points. In this embodiment, the edges representing routes are referred to as travel edges.

[0049] In this embodiment, a route graph consisting of routes going only in one direction is generated, but a route graph consisting of routes going in both directions may also be generated. If a route point is specified, a route that passes through the route point is searched for.

[0050] The delivery plan generating unit 121 generates pairs of nodes connected via edges (step S203). In the case of the route graph 800, a pair of node 801 and node 802 connected via route 1, a pair of node 801 and node 802 connected via route 2, and a pair of node 802 and node 803 connected via route 3 are generated.

[0051] The delivery plan generating unit 121 references the route information 300 for each node pair and generates search pairs equal to the number of operation schedules (step S204). At this time, the delivery plan generating unit 121 sets a travel edge between the node of the departure point and the node of the arrival point of the route that constitutes the search pair. As will be described later, a cost associated with using the route is set in the travel edge. Note that the delivery plan generating unit 121 may target operation schedules after the departure time, taking into account the departure time.

[0052] For example, if the departure time of a cargo is 1:00 PM and there is a service schedule for Route 1 with departures at 1:00 PM and 1:30 PM, search pairs 901 and 902 as shown in Fig. 9A are generated from the pair of node 801 and node 802 connected via Route 1. Also, if there is a service schedule for Route 2 with departures at 1:30 PM and 2:30 PM, search pairs 903 and 904 as shown in Fig. 9B are generated from the pair of node 801 and node 802 connected via Route 2. Similar processing is performed for the pair of node 802 and node 803 connected via Route 3, generating search pairs 911, 912, and 913 as shown in Fig. 9C.

[0053] In the following, the node at the departure point of the search pair is referred to as the start node, and the node at the destination point of the route is referred to as the end node.

[0054] The delivery plan generation unit 121 searches for a set of connectable search pairs and sets an edge between the search pairs (step S205). This corresponds to a route change. Hereinafter, the edge between the search pairs will be referred to as a transfer edge. As will be described later, a cost associated with a route change is set in the transfer edge.

[0055] Specifically, the delivery plan generating unit 121 searches for a search pair in which the end node and the start node match and the arrival time at the end node is before the departure time of the start node.

[0056] 9D, search pairs 911, 912, and 913 are each searched for as connectable search pairs for the search pair 901. Also, as shown in FIG. 9E, search pairs 912 and 913 are each searched for as connectable search pairs for the search pair 902.

[0057] The delivery plan generating unit 121 generates a search graph based on the search pairs and the transfer edges (step S206). For example, a search graph 900 as shown in FIG. 9F is generated from the route graph 800.

[0058] The delivery plan generation unit 121 adds nodes of the delivery origin and destination to the search graph and sets edges (step S207). As shown in FIG. 9G, for example, nodes 951 and 952 are set in the search graph 900, an edge is set between node 951 and a node at the same location, and an edge is set between node 952 and a node at the same location. In the following explanation, edges connecting the origin and destination nodes are referred to as waiting edges. As will be described later, costs are set in the waiting edges taking into account the waiting time until the cargo is picked up and the waiting time until the cargo is delivered. Note that if the waiting time is not taken into account, the processing of step S207 can be omitted.

[0059] The delivery plan generating unit 121 optimizes the search graph (step S208).

[0060] For example, if the size of the search graph is large, the delivery plan generation unit 121 deletes routes with more than a predetermined number of stopover points, routes with arrival times greater than a predetermined time, and routes with transfer times greater than a predetermined time. The delivery plan generation unit 121 may also delete edges in the reverse direction. Routes may also be narrowed down based on distance or arrival time.

[0061] Next, the evaluation unit 122 sets costs for the edges of the search graph (step S209). The cost of an edge is set from different perspectives for each of a moving edge, a transition edge, and a waiting edge. The method of setting the cost for an edge will be described below.

[0062] First, we will explain how to set the cost of a travel edge. The costs of the transportation company, the shipper, and the passenger are set for the travel edge.

[0063] The cost to the transport operator is the satisfaction x the increase in revenue from transporting freight. 11 It is calculated using the function y1 with the explanatory variable x 11 is calculated using, for example, equation (1), where S is a constant, I represents the revenue per route, and ΔI represents the increase in revenue due to cargo transportation.

[0064]

number

[0065] Passenger costs are calculated by multiplying the vehicle congestion tolerance by 21 and tolerance for not being able to sit due to cargo transport x 22 It is calculated using the function y2 with the explanatory variable x 21 is calculated using, for example, equation (2), and the tolerance x 22 is calculated using, for example, equation (3), where A is a constant and R represents the congestion degree. sit and S stand is a constant, and r sit represents the percentage of passengers who can be seated. sit is a function that depends on the degree of vehicle congestion. Note that A may be changed depending on the weather.

[0066]

number

[0067]

number

[0068] The shipper's cost is the satisfaction with the transport time x 31 and satisfaction with environmental friendliness during transportation x 32 It is calculated using the function y3 with the explanatory variable x 31 is calculated using, for example, equation (4), where Δt represents the difference between the desired departure time and the actual departure time. 32 is calculated using, for example, equation (5), where U actual is the CO2 emissions emitted during transportation, and U worst represents the maximum CO2 emissions.

[0069]

number

[0070]

number

[0071] A total cost may be set for each moving edge. The total cost Y is calculated using equation (6), where B1, B2, and B3 are constants representing weights.

[0072]

number

[0073] In this embodiment, the total cost Y is calculated as the sum of the costs, but the total cost may be calculated in any manner, such as by using the maximum value or average value of the costs assigned to the edges. Note that the cost calculation method described above is an example and is not limited to this.

[0074] Next, we will explain how to set the cost of a transfer edge. The costs of the transportation company, the shipper, and the passenger are set for a transfer edge. Since the movement of freight that involves changing routes does not affect passenger satisfaction, the cost for passengers is set to 0.

[0075] The cost of transportation operators is determined by their tolerance for increased labor costs associated with transporting cargo. 11 It is calculated using the function y1 with the explanatory variable x 11 is calculated using, for example, formula (7). Here, C represents the labor cost when no cargo is transported, and ΔC represents the increase in labor cost due to cargo transportation. In this example, it is assumed that the transportation business operator is responsible for the work of transferring cargo when transferring, and labor costs increase for the transfer work.

[0076]

number

[0077] The shipper's cost is the satisfaction with the time it takes to transfer x 31 It is calculated using the function y3 with the explanatory variable x 31 is calculated using, for example, equation (8). Here, T represents the waiting time for transfers, and B is a constant representing the weight. The weight is set according to the characteristics of the cargo. For example, if the cargo is perishable food, the cargo will deteriorate over time, so the weight value will be large, and if the cargo is parts, the cargo will not deteriorate over time, so the weight will be 0. In this example, the equation is such that satisfaction decreases linearly with the passage of time, but the equation may be switched depending on the characteristics of the deterioration, such as when noticeable deterioration occurs after a certain time has passed.

[0078]

number

[0079] A total cost may be set for the transition edge. The total cost Y is calculated using equation (9), where B1 and B3 are constants representing weights.

[0080]

number

[0081] In this embodiment, the total cost Y is calculated as the sum of the individual costs, but the total cost may be calculated in any manner, such as by using the maximum value or average value of the individual costs assigned to the edges. Note that the cost calculation method described above is an example and is not limited to this.

[0082] Next, we will explain how to set the cost of a waiting edge. The costs of the transportation company, the shipper, and the passenger are set for the waiting edge. Since the waiting time for receiving and delivering the cargo only affects the satisfaction of the shipper, the costs of the transportation company and the passenger are set to 0.

[0083] The shipper's cost is the satisfaction with the time it takes to depart and arrive x 31 It is calculated using the function y3 with the explanatory variable x 31 is calculated using, for example, equation (10). Here, T represents the waiting time from arrival at the departure station until actual departure, or the waiting time from arrival at the station until the recipient receives the item. B is a constant representing the weight. The weight is set according to the characteristics of the cargo. For example, if the cargo is fresh food, the cargo will deteriorate over time, so the weight value will be large, and if the cargo is parts, the cargo will not deteriorate over time, so the weight will be 0. In this example, the equation is such that satisfaction decreases linearly with the passage of time, but the equation may be switched depending on the characteristics of the deterioration, such as when noticeable deterioration occurs after a certain time has passed.

[0084]

number

[0085] A total cost may be set for the waiting edge. The total cost Y is calculated using equation (11), where B3 is a constant representing the weight.

[0086]

number

[0087] The above-described cost calculation method is an example and is not limiting.

[0088] The above-described method for setting the cost of each edge is an example and is not intended to be limiting. The satisfaction of all three parties may be taken into consideration, or only the satisfaction of one or two parties may be taken into consideration. The cost setting may be performed simultaneously with the edge setting.

[0089] The evaluation unit 122 executes a route search using the search graph to which costs have been assigned, and generates a delivery plan (candidate delivery plan) (step S210).

[0090] The evaluation unit 122 uses a known route search method, such as Dijkstra's algorithm, to search for a route that maximizes or minimizes the evaluation index calculated using the three costs assigned to the edges. Nodes and edges included in the route of the search graph correspond to locations and operation schedules, so a delivery plan can be generated from the route. The evaluation index is, for example, the total cost of the edges included in the route. The evaluation unit 122 may search for a route by focusing only on the costs of the transportation company, passengers, or shippers.

[0091] The evaluation unit 122 may select a predetermined number of routes based on the evaluation index. The transportation business operator sets a threshold value of the evaluation index as a control parameter in the control information 110, and also sets a constraint condition of the evaluation index using the threshold value in the control information 110.

[0092] The evaluation unit 122 determines whether or not the processing has been completed for all the reservation information of the cargo (step S211). If the processing has not been completed for all the reservation information of the cargo, the evaluation unit 122 returns to step S201 and executes the same processing.

[0093] When the processing for all the reservation information of cargoes is completed, the evaluation unit 122 generates display information (step S212) and outputs it to the notification unit 123 (step S213).

[0094] For example, when multiple delivery plans are selected, the evaluation unit 122 generates display information including delivery plans sorted based on the evaluation index. For example, the delivery plans are sorted in descending order of the evaluation index. The notification unit 123 transmits the display information to the terminal 101-1 operated by the transportation business operator.

[0095] By adjusting the weights and thresholds, it is possible to generate a delivery plan that prioritizes passengers, shippers, or transportation companies. Also, when calculating evaluation indices, it is possible to calculate evaluation indices that prioritize one of the explanatory variables by adjusting the weights. For example, when a shipper makes a cargo reservation, the shipper is asked to select which of "transportation time" or "environmental considerations" they prioritize, and when setting the shipper's costs, the evaluation indices may be calculated by weighting the selected explanatory variable.

[0096] Alternatively, a cost may be set for each transportation operator, and the cost of the transportation operator used for evaluation may be calculated based on the cost of each transportation operator. For example, the sum, average, maximum, minimum, etc. of the costs of each transportation operator may be used as the cost of the transportation operator used for evaluation.

[0097] According to the first embodiment, the delivery plan generation support system 100 can quantitatively evaluate the degree of fulfillment of the requirements of the passenger, the cargo transport requester, and the transportation company using explanatory variables that represent the satisfaction or discomfort of the passenger, the shipper, and the transportation company with respect to travel, transfers, and waiting during cargo transportation, and generate a delivery plan. In addition, the delivery plan generation support system 100 can support the generation of a delivery plan that satisfies the requirements of the three parties as much as possible by presenting a delivery plan selected based on the evaluation index. [Example]

[0098] In the second embodiment, the work of transferring cargo during transfers is carried out by a dedicated transfer company, rather than by a transportation business operator, which is different from the first embodiment. Hereinafter, the second embodiment will be described, focusing on the differences from the first embodiment.

[0099] FIG. 10 is a diagram illustrating an example of a system configuration of a second embodiment. In the second embodiment, a terminal 101-3 operated by a transfer agent is added to the system configuration of the first embodiment. It is assumed that there are multiple transfer agents. The hardware configuration is the same as that of the first embodiment.

[0100] FIG. 11 is a sequence diagram illustrating the processing flow in the system of the second embodiment. The difference from the first embodiment is that after the transportation business operator refers to a candidate delivery plan and transmits an adoption notice including the identification number of the selected candidate delivery plan to the delivery plan generation support system 100 (step S105), the delivery plan generation support system 100 transmits request information for the transfer work to the transfer company's terminal 101-3 (step S151). The request information for the transfer work includes the location where the transfer will occur, the vehicle information and arrival time of the source vehicle, the vehicle information and departure time of the destination vehicle, and the cargo details. The transfer company checks the request information, and if it accepts the request, transmits an acceptance notice to the delivery plan generation support system 100 (step S152). If no transfer company is willing to accept the request, the delivery plan generation support system 100 transmits a notice to the shipper that the cargo transportation will not be completed.

[0101] The delivery plan generation process executed by the delivery plan generation support system 100 of the second embodiment is the same as that of the first embodiment. However, the method of setting the cost of the candidate delivery plan is partially different. The method of setting the costs of the moving edges and waiting edges is the same as that of the first embodiment, but the method of setting the cost of the transfer edges is different.

[0102] The cost assigned to the transfer edge is set to the costs of both the transfer company and the shipper. The occurrence of transfers when freight moves does not affect the satisfaction of passengers or transport operators, so the costs of both parties are taken into consideration.

[0103] The evaluation index for transshipment companies is the tolerance for increased labor costs associated with cargo transportation x 11 It is calculated using the function y4 with the explanatory variable x 41 For example, if the work can be performed consecutively with other reloading work that has already been requested, the value is set to 1, and decreases according to the length of the free time from other reloading work.

[0104] The evaluation index of the shipper is the same as that of Example 1. Satisfaction with the time required for transfer x 31 It is calculated using the function y3 with the explanatory variable x 31 is calculated using, for example, equation (8).

[0105] A total cost may be set for the waiting edge. The total cost Y is calculated using equation (12), where B4 and B3 are constants representing weights.

[0106]

number

[0107] In this embodiment, the total cost Y is calculated as a total value, but the total evaluation index may be calculated in any manner, such as by using the maximum or average value of the cost.

[0108] The above-described method for calculating the evaluation index is an example and is not limiting.

[0109] The present invention is not limited to the above-described embodiments, but includes various modifications. For example, the above-described embodiments are provided to explain the present invention in detail, and the present invention is not necessarily limited to those including all of the described configurations. Furthermore, some of the configurations of each embodiment can be added to, deleted from, or replaced with other configurations.

[0110] Furthermore, the above-described configurations, functions, processing units, processing means, etc. may be partially or entirely implemented in hardware, for example, by designing them as integrated circuits. The present invention can also be realized by software program code that implements the functions of the embodiments. In this case, a storage medium on which the program code is recorded is provided to a computer, and a processor included in the computer reads the program code stored in the storage medium. In this case, the program code itself read from the storage medium implements the functions of the above-described embodiments, and the program code itself and the storage medium on which it is stored constitute the present invention. Examples of storage media for providing such program code include flexible disks, CD-ROMs, DVD-ROMs, hard disks, solid-state drives (SSDs), optical disks, magneto-optical disks, CD-Rs, magnetic tapes, non-volatile memory cards, and ROMs.

[0111] Furthermore, the program code that realizes the functions described in this embodiment can be implemented in a wide range of program or script languages, such as assembler, C / C++, perl, Shell, PHP, Python, and Java (registered trademark).

[0112] Furthermore, the program code of the software that realizes the functions of the embodiments may be distributed via a network and stored in a storage means such as a computer's hard disk or memory, or in a storage medium such as a CD-RW or CD-R, and the processor of the computer may read and execute the program code stored in the storage means or storage medium.

[0113] In the above-described embodiment, the control lines and information lines are those that are considered necessary for the explanation, and not all control lines and information lines are necessarily shown in the product. All components may be interconnected. [Explanation of symbols]

[0114] 100 Delivery plan generation support system 101 terminals 110 Control Information 120 Request Reception Department 121 Delivery plan generation unit 122 Evaluation Department 123 Notification Department 200 calculator 201 processor 202 Main storage 203 Secondary storage device 204 Network Interface 300 Route Information 310 Congestion Information 500 Reservation screen 600 Delivery plan selection screen 800 Route Graph 900 Search Graph

Claims

1. A computer system for generating a cargo delivery plan using vehicles for transporting passengers and cargo, comprising: at least one computer having a processor, a storage device connected to the processor, and a network interface connected to the processor; A first terminal is operated by a requester who requests the transportation of cargo, and a second terminal is operated by a business that provides transportation services using vehicles, and the first terminal is communicably connected to the second terminal; Maintaining route information relating to the routes of vehicles operated by the operator; A first process for accepting a cargo transportation reservation including a departure point and a destination point; a second process of searching for a route that is a combination of the routes from the departure point to the destination based on the route information, and generating a route graph that is configured from point nodes corresponding to intermediate points on the route and route edges that connect the intermediate points that can be reached using the routes; a third process of generating a search graph from the route graph; a fourth process of generating a delivery plan including waypoints, routes, and operation schedules using the search graph; In the third process, the computer system generating the search graph based on the route graph and the route information, the search graph being composed of nodes and edges corresponding to the route schedule and transfers on the route, and in which a first cost representing the degree of satisfaction of the requester's request, a second cost representing the degree of satisfaction of the business operator's request, and a third cost representing the degree of satisfaction of the passenger's request are set to the edges; In the fourth process, the computer system searching for a route from the search graph based on an evaluation index that represents a degree of overall satisfaction of the passenger, the requester, and the business operator, the evaluation index being calculated using the first cost, the second cost, and the third cost set for the edge; generating the delivery plan using the searched route; a computer system that transmits the delivery plan to the second terminal;

2. 2. The computer system of claim 1, In the third process, the computer system generating, from the route graph, pairs each composed of a start node and an end node corresponding to the point node connected via the route edge; For each pair, generate search pairs each consisting of the start node and the end node, the number of which corresponds to the number of operation schedules of the route used for traveling from the start node to the end node; setting a moving edge connecting the start node and the end node that constitute the search pair; For the movement edge, the first cost, the second cost, and the third cost are set, which represent the degree of satisfaction of the requests of the requester, the business operator, and the passenger, respectively, associated with the movement; searching for a combination of the search pairs in which the end node of one of the search pairs matches the start node of another of the search pairs, and setting a transfer edge connecting the end node of one of the search pairs and the start node of one of the search pairs; A computer system characterized by setting the first cost, the second cost, and the third cost for the transfer edge, which represent the degree of satisfaction of the requests of the requester, the operator, and the passenger associated with the transfer.

3. 3. The computer system according to claim 2, In the third process, the computer system Add the node of the origin; setting a first waiting edge connecting the node of the origin and the search pair including the starting node corresponding to the origin; For the first waiting edge, the first cost, the second cost, and the third cost are set, which represent the degree of satisfaction of the requests of the requester, the business operator, and the passenger, respectively, associated with the waiting time until the pickup of the cargo; Add the destination node; setting a second waiting edge connecting the destination node and the search pair including the end node corresponding to the destination; A computer system characterized in that, for the second waiting edge, the first cost, the second cost, and the third cost are set which represent the degree of satisfaction of the requests of the requester, the business operator, and the passenger associated with the waiting time until delivery of the cargo.

4. A method for generating a freight dispatch plan using vehicles that transport passengers and freight, executed by a computer system, comprising: The computer system at least one computer having a processor, a storage device connected to the processor, and a network interface connected to the processor; A first terminal is operated by a requester who requests the transportation of cargo, and a second terminal is operated by a business that provides transportation services using vehicles, and the first terminal is communicably connected to the second terminal; Maintaining route information relating to the routes of vehicles operated by the operator; The method for generating a delivery plan includes: a first step in which the computer system accepts a cargo transportation reservation including a departure point and a destination point; a second step in which the computer system searches for a route that is a combination of the routes from the departure point to the destination based on the route information, and generates a route graph that is composed of point nodes corresponding to intermediate points on the route and route edges that connect the intermediate points that can be reached using the routes; a third step in which the computer system generates a search graph from the path graph; a fourth step in which the computer system generates a delivery plan including waypoints, routes, and operation schedules using the search graph; the third step includes a step in which the computer system generates the search graph based on the route graph and the route information, the search graph being composed of nodes and edges corresponding to the route schedules and transfers on the routes, and a first cost representing the degree of satisfaction of the requester's requirements, a second cost representing the degree of satisfaction of the business operator's requirements, and a third cost representing the degree of satisfaction of the passenger's requirements being set to the edges; The fourth step includes: a step in which the computer system searches for a route from the search graph based on an evaluation index that represents a degree of overall satisfaction of the passenger, the requester, and the business operator, the evaluation index being calculated using the first cost, the second cost, and the third cost set for the edge; a step of the computer system generating the delivery plan using the searched route; a step of the computer system transmitting the delivery plan to the second terminal.

5. 5. The method for generating a delivery plan according to claim 4, The third step includes: generating, from the route graph, pairs each composed of a start node and an end node corresponding to the point node connected via the route edge, by the computer system; the computer system generates, for each pair, search pairs each consisting of the start node and the end node, the number of which corresponds to the number of operation schedules of the route used for traveling from the start node to the end node; the computer system setting a moving edge connecting the start node and the end node that make up the search pair; a step in which the computer system sets, for the movement edge, the first cost, the second cost, and the third cost representing the degree of satisfaction of the requests of the requester, the business operator, and the passenger, respectively, accompanying the movement; the computer system searches for a combination of the search pairs in which the end node of one of the search pairs matches the start node of another of the search pairs, and sets a transfer edge connecting the end node of one of the search pairs and the start node of one of the search pairs; a step in which the computer system sets the first cost, the second cost, and the third cost for the transfer edge, which represent the degree of satisfaction of the requests of the requester, the business operator, and the passenger associated with the transfer.

6. 6. The method for generating a delivery plan according to claim 5, The third step includes: adding a node of the origin by the computer system; the computer system setting a first waiting edge connecting the node of the origin and the search pair including the source node corresponding to the origin; a step in which the computer system sets, for the first waiting edge, the first cost, the second cost, and the third cost representing the degree of satisfaction of the requests of the requester, the business operator, and the passenger, respectively, associated with the waiting time until the cargo is picked up; adding the destination node by the computer system; the computer system setting a second waiting edge connecting the destination node and the search pair including the end node corresponding to the destination; and a step in which the computer system sets, for the second waiting edge, the first cost, the second cost, and the third cost representing the degree of satisfaction of the requests of the requester, the business operator, and the passenger associated with the waiting time until delivery of the cargo.

Images