Information processing device, information processing method, and program

Abstract

The present invention comprises: a determination means (21) that determines a delivery destination to negotiate with from among a plurality of delivery destinations by solving a delivery planning problem that includes one or more constraints pertaining to at least any among capacity and time windows, the constraints being expressed by using an operation variable prescribed for each delivery destination; and an output means (22) that outputs information that includes negotiation details for the delivery destination determined by the determination means.

Description

[Technical field]

[0001] The present invention relates to an information processing device, an information processing method, and a program that can create a more efficient delivery plan by carrying out flexible negotiations. [Background technology]

[0002] The Vehicle Routing Problem (VRP) is known as an optimization technique for finding the least costly route to visit all customers using multiple vehicles.

[0003] The delivery plan created by solving the VRP takes into account the time windows and cargo capacity specified by the customer as constants, but it is possible to create a more efficient delivery plan by considering the time windows and cargo capacity as variables and relaxing the constraints.

[0004] However, in order to change the time window or cargo capacity specified by the customer, negotiations with the customer are naturally required. There was a need for technology that could easily show which customers to negotiate with and how to create a more efficient delivery plan.

[0005] Patent Document 1 proposes a technique for determining candidate change conditions, which are candidates for conditions to be changed, from among selling conditions and buying conditions. [Prior art documents] [Patent documents]

[0006] [Patent Document 1] International patent application WO2021 / 001978A1 Summary of the Invention [Problem to be solved by the invention]

[0007] However, in Patent Document 1, the same negotiation conditions are presented regardless of the negotiating party, and for example, when negotiating to change the time window, there is a high possibility that the negotiation will not be successful. Therefore, there is a demand for a technology that can perform more flexible negotiations and create a more efficient delivery plan.

[0008] One aspect of the present invention has been made in consideration of the above problems, and one example of an objective thereof is to provide a technique that enables flexible negotiation to be performed to create a more efficient delivery plan. [Means for solving the problem]

[0009] An information processing device according to one aspect of the present invention includes a determination means for determining a delivery destination to be negotiated from a plurality of delivery destinations by solving a delivery planning problem including one or more constraints related to at least one of capacity and time window, the constraints being expressed using operational variables defined for each delivery destination, and an output means for outputting information including the content of negotiation for the delivery destination determined by the determination means.

[0010] An information processing method according to one aspect of the present invention includes determining a delivery destination to be negotiated from a plurality of delivery destinations by solving a delivery planning problem including one or more constraint conditions related to at least one of capacity and time window, the constraint conditions being expressed using operational variables defined for each delivery destination, and outputting information including the content of negotiation for the determined delivery destination.

[0011] A program according to one aspect of the present invention causes a computer to function as an information processing device having a determination means for determining a delivery destination to be negotiated from a plurality of delivery destinations by solving a delivery planning problem including one or more constraints related to at least one of capacity and time window, the constraints being expressed using operational variables defined for each delivery destination, and an output means for outputting information including the content of negotiation for the delivery destination determined by the determination means. Effect of the Invention

[0012] According to one aspect of the present invention, flexible negotiations can be carried out to create a more efficient delivery plan. [Brief description of the drawings]

[0013] [Figure 1] 1 is a block diagram showing an example of the configuration of an information processing device according to a first exemplary embodiment of the present invention. [Diagram 2] 1 is a flowchart showing a flow of an information processing method according to a first exemplary embodiment of the present invention. [Diagram 3] FIG. 2 is a block diagram showing an example of the configuration of a delivery plan creation device 40 according to an exemplary embodiment 2 of the present invention. [Figure 4] FIG. 1 is a diagram illustrating an example of a delivery plan. [Diagram 5] FIG. 13 is a diagram illustrating an example of a delivery plan created by relaxing constraints on a specified time window of the delivery plan. [Figure 6] FIG. 13 is a diagram illustrating an example of a delivery plan created by reflecting a result of negotiation. [Figure 7] FIG. 13 is a diagram illustrating an example of another delivery plan created by relaxing the constraint conditions of the specified time window of the delivery plan. [Figure 8] FIG. 13 is a diagram illustrating an example of a delivery plan created by reflecting a result of negotiation. [Figure 9] FIG. 13 is a diagram illustrating an example of a delivery plan before being updated. [Figure 10] 10 is a diagram showing an example of a delivery plan obtained by updating the delivery plan of FIG. 9. FIG. [Figure 11] FIG. 13 is a diagram showing another example of a delivery plan before being updated. [Figure 12] FIG. 12 is a diagram showing an example of a delivery plan obtained by updating the delivery plan of FIG. 11. [Figure 13] FIG. 13 is a diagram showing yet another example of a delivery plan before being updated. [Figure 14] FIG. 14 is a diagram showing an example of a delivery plan obtained by updating the delivery plan of FIG. 13. [Figure 15] FIG. 14 is a diagram showing another example of a delivery plan obtained by updating the delivery plan of FIG. 13. [Figure 16]FIG. 14 is a diagram showing yet another example of a delivery plan obtained by updating the delivery plan of FIG. 13. [Figure 17] FIG. 13 is a diagram showing yet another example of a delivery plan before being updated. [Figure 18] FIG. 18 is a diagram showing an example of a delivery plan obtained by updating the delivery plan of FIG. 17. [Figure 19] 11A and 11B are diagrams illustrating an example of a method for identifying and presenting a new specified time window. [Figure 20] 11A and 11B are diagrams illustrating an example of a method for identifying and presenting a new specified time window. [Figure 21] 11 is a diagram illustrating an example of a method for allowing a negotiating partner to select a new designated time window. FIG. [Figure 22] 11 is a diagram illustrating an example of a method for allowing a negotiating partner to select a new designated time window. FIG. [Diagram 23] 13 is a flowchart illustrating the flow of a delivery plan creation process. [Figure 24] FIG. 1 is a diagram illustrating an example of the configuration of a computer that executes instructions of a program, which is software that realizes each function. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0014] Example Embodiment 1 A first exemplary embodiment of the present invention will be described in detail with reference to the drawings. This exemplary embodiment is a basic form of the exemplary embodiments described later.

[0015] <Overview of information processing device 20> The information processing device 20 according to this exemplary embodiment is, broadly speaking, a device that determines a delivery destination for which negotiations should be conducted and outputs the delivery destination for which negotiations should be conducted and the negotiation contents in order to make a delivery plan more efficient.

[0016] More specifically, the information processing device 20, for example, A determination means for determining a delivery destination to be negotiated from among the delivery destinations by solving a delivery plan problem including a plurality of delivery destinations, the delivery plan problem being accompanied by a relaxed constraint condition obtained by relaxing one or more constraint conditions related to at least one of capacity and time window using a parameter specified for each delivery destination; and an output means for outputting information including the content of negotiations with the delivery destination determined by the determination means.

[0017] <Configuration of information processing device 20> The configuration of an information processing device 20 according to this exemplary embodiment will be described with reference to Fig. 1. Fig. 1 is a block diagram showing an example of the configuration of the information processing device 20.

[0018] 1, the information processing device 20 includes a determination unit 21 and an output unit 22. The determination unit 21 is configured to realize a determination means in this exemplary embodiment. The output unit 22 is configured to realize an output means in this exemplary embodiment.

[0019] The determination unit 21 determines a delivery destination to be negotiated from among a plurality of delivery destinations by solving a delivery planning problem including one or more constraint conditions related to at least one of capacity and time window, the constraint conditions being expressed using operational variables defined for each delivery destination.

[0020] The determination unit 21 may be configured to relax at least a part of one or a plurality of constraints related to at least any of the capacity and the time window, using an operation variable defined for each delivery destination, for a delivery plan problem including a plurality of delivery destinations. In this configuration, the determination unit 21 determines a delivery destination to be negotiated from among a plurality of delivery destinations by solving the delivery plan problem to which the constraints are attached. Here, a configuration may be adopted in which some of these constraints include the relaxed constraints as described above.

[0021] Here, the delivery planning problem is a problem to be solved to realize efficient delivery based on given constraints. Note that although the term "delivery" is used here, it is not necessarily limited to the delivery of parcels, etc. The delivery planning problem refers to a general optimization problem involving one or more constraints on at least one of capacity and time window, and involving multiple target points (locations, customers, negotiation partners, etc.).

[0022] In an actual delivery plan, each of the multiple target points may be a delivery destination or a collection point for a package, but for simplicity, they will be collectively referred to as a "delivery destination."

[0023] Moreover, the manipulated variables refer to variables that are manipulated when solving a delivery planning problem.

[0024] The delivery plan, for example, is a route for visiting all delivery destinations using a plurality of vehicles, and indicates the time or time period when each vehicle will arrive at each delivery destination along with the route. The delivery plan is created, for example, by a delivery company.

[0025] As an example, the vehicle routing problem is a VRP (Vehicle Routing Problem), which is a problem of finding a route that minimizes an evaluation function under given constraints. However, the evaluation function itself can include constraints so that the constraints can be taken into account.

[0026] When solving a VRP, the delivery time slot and cargo capacity specified by the delivery destination are considered as parameters that cannot be specified by the delivery planner and are given as constants in the constraint conditions. Such parameters are referred to as specified parameters. The delivery time slot is also referred to as a time window. The delivery time slot and cargo capacity specified by the delivery destination are referred to as the specified time window and specified capacity, respectively.

[0027] For example, by minimizing the number of vehicles required for delivering packages and the like, a delivery company can obtain an efficient delivery plan.

[0028] The determination unit 21 relaxes the constraints on at least one of the capacity and the time window by using an operational variable defined for each delivery destination. For example, the constraints are relaxed by changing the designated time window and the designated capacity.

[0029] Then, the determination unit 21 identifies which delivery destinations should have their designated time windows and / or designated capacities changed and how they should be changed in order to reduce the number of vehicles by solving the delivery plan problem with the relaxed constraints. Here, the delivery destinations whose designated time windows or designated capacities should be changed are determined as the negotiation targets.

[0030] The output unit 22 outputs information including the details of negotiation with the delivery destination determined by the determination unit 21.

[0031] That is, information including the delivery destination to be negotiated and how the designated time window or the designated capacity of the delivery destination should be changed is output by the output unit 22. The output unit 22 may present the information to the delivery destination to be negotiated.

[0032] <Effects of the information processing device 20> According to the information processing device 20 of this exemplary embodiment, by solving a delivery plan problem including multiple delivery destinations and accompanied by relaxed constraint conditions obtained by relaxing one or more constraint conditions related to at least one of capacity and time window using parameters specified for each delivery destination, a delivery destination to be negotiated is determined from the multiple delivery destinations, and information including the content of negotiation for the determined delivery destination is output. In this way, a more efficient delivery plan can be created by conducting flexible negotiations.

[0033] <Flow of information processing method by information processing device 20> The flow of the information processing method executed by the information processing device 20 configured as above will be described with reference to Fig. 2. Fig. 2 is a flowchart showing the flow of the information processing method. As shown in the figure, the information processing includes steps S11 and S12.

[0034] In step S11, the determination unit 21 determines a delivery destination to be negotiated from among a plurality of delivery destinations by solving a delivery planning problem including one or more constraint conditions related to at least one of capacity and time window, the constraint conditions being expressed using operational variables defined for each delivery destination.

[0035] In step S11, the determination unit 21 may be configured to relax at least a part of one or a plurality of constraints related to at least any of the capacity and the time window, using an operation variable defined for each delivery destination, in a delivery plan problem including a plurality of delivery destinations. In this case, the determination unit 21 determines a delivery destination to be negotiated from among the plurality of delivery destinations by solving the delivery plan problem to which the constraints are attached. Here, a configuration may be adopted in which some of these constraints include the relaxed constraints as described above.

[0036] In step S12, the output unit 22 outputs information including the details of negotiations with the determined delivery destination.

[0037] <Effects of information processing methods> According to the information processing method of this exemplary embodiment, a delivery plan problem including multiple delivery destinations is solved, and the delivery plan problem is accompanied by a relaxed constraint condition obtained by relaxing one or more constraint conditions related to at least one of capacity and time window using an operation variable specified for each delivery destination, whereby a delivery destination to be negotiated is determined from the multiple delivery destinations, and information including the content of negotiation for the determined delivery destination is output. In this way, a more efficient delivery plan can be created by conducting flexible negotiations.

[0038] Exemplary embodiment 2 A second exemplary embodiment of the present invention will now be described in detail with reference to the drawings.

[0039] <Distribution plan creation device 40> The configuration of the delivery plan creation device 40 according to this exemplary embodiment will be described with reference to Fig. 3. Fig. 3 is a block diagram showing an example of the configuration of the delivery plan creation device 40.

[0040] 3, the delivery plan creation device 40 has a control unit 50. The control unit 50 includes a negotiation management unit 51, a time window negotiation partner determination unit 52, a capacity negotiation partner determination unit 53, and a negotiation information generation unit .

[0041] The negotiation management unit 51, the time window negotiation partner determination unit 52, and the capacity negotiation partner determination unit 53 are functional blocks corresponding to the determination means in exemplary embodiment 1. The negotiation information generation unit 54 is a functional block corresponding to the output means in exemplary embodiment 1.

[0042] The delivery plan creation device 40 also has a delivery information DB 71, a delivery plan DB 72, and a communication unit 73, each of which is connected to the control unit 50.

[0043] The delivery information DB 71 and the delivery plan DB 72 are configured, for example, by a semiconductor memory device or the like, and store data.

[0044] The communication unit 73 is an interface for connecting the delivery plan creation device 40 to a network. Although the specific configuration of the network does not limit the present exemplary embodiment, as an example, a wireless LAN (Local Area Network), a wired LAN, a WAN (Wide Area Network), a public line network, a mobile data communication network, or a combination of these networks can be used.

[0045] (Delivery information DB, delivery plan DB) 3, the delivery information DB 71 stores delivery information such as the delivery address, the designated time window, the designated volume, the sender, the recipient, etc. The delivery information is stored in correspondence with a delivery plan within the same region in the same time period, for example.

[0046] Furthermore, the delivery information DB 71 stores information related to negotiations with each delivery destination.

[0047] For example, delivery information is stored as follows: delivery information for creating a delivery plan for X district on December 1st, delivery information for creating a delivery plan for Y district on December 1st, delivery information for creating a delivery plan for X district on December 2nd, delivery information for creating a delivery plan for Y district on December 2nd.

[0048] A delivery plan corresponding to the delivery information is stored in the delivery plan DB 72. For example, delivery plans such as a delivery plan for X district on December 1, a delivery plan for Y district on December 1, a delivery plan for X district on December 2, and a delivery plan for Y district on December 2 are stored.

[0049] The delivery plan is created by solving the VRP with reference to the delivery information stored in the delivery information DB 71. The delivery plan may be created by the delivery plan creation device 40, or a delivery plan created in advance may be used. When the delivery plan is created by the delivery plan creation device 40, for example, a VRP solution unit may be provided.

[0050] The VRP solution finding unit creates a delivery plan by solving the VRP with reference to delivery information stored in the delivery information DB 71. That is, the VRP solution finding unit creates an evaluation function and constraint conditions using the information stored in the delivery information DB 71, and creates a delivery plan by deriving a route that minimizes the evaluation function through calculations. The VRP solution finding unit stores the created delivery plan in the delivery plan DB 72.

[0051] In addition, the delivery plan may be prepared separately, for example, by the delivery company using a calculation formula.

[0052] It should be noted that VRP is just an example of a delivery planning problem, and does not limit the delivery planning problem that is addressed in this exemplary embodiment.

[0053] (Negotiations Management Department) As described later, the negotiation management unit 51 controls the time window negotiation partner determination unit 52, the capacity negotiation partner determination unit 53, and the negotiation information generation unit 54 to cause each functional block to execute a predetermined process. Also, as described later, the negotiation management unit 51 supplies the negotiation partner and the new delivery plan supplied from the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53 to the negotiation information generation unit 54. Furthermore, the negotiation management unit 51 receives the negotiation result via the communication unit 73 and updates the delivery information based on the negotiation result.

[0054] (Negotiation information generation unit) The negotiation information generating unit 54 generates, as negotiation information, a time window or a cargo capacity to be presented to a negotiation partner. As an example, the negotiation information is generated as a GUI to be displayed on a display of a personal computer or a smartphone.

[0055] (Time window negotiation partner determination unit and capacity negotiation partner determination unit) The time window negotiation partner determination unit 52 and the capacity negotiation partner determination unit 53, like the VRP solution-finding unit, generate an evaluation function by referring to the delivery information, and create a delivery plan by deriving a route that minimizes the evaluation function through calculation. However, the time window negotiation partner determination unit 52 and the capacity negotiation partner determination unit 53 relax the constraint conditions using the operation variables, and derive a route that minimizes the evaluation function under the relaxed constraint conditions through calculation.

[0056] Here, the constraints are relaxed in order to improve the efficiency of the delivery plan, for example, by reducing the number of vehicles required in the delivery plan.

[0057] The negotiation management unit 51 determines the delivery schedule stored in the delivery plan DB 72. Sending billThe image and the delivery information stored in the delivery information DB 71 are provided to the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53.

[0058] (Processing of time window negotiation partner determination unit) The time window negotiation partner determination unit 52 generates an evaluation function and constraint conditions by referring to the delivery plan and delivery information. Then, the time window negotiation partner determination unit 52 relaxes the constraint conditions by using the operation variables related to the change of the time window, derives by calculation a route that minimizes the evaluation function under the relaxed constraint conditions, and creates a new delivery plan.

[0059] At this time, the time window negotiation partner determination unit 52 determines, as the negotiation partner, a delivery destination whose time window should be changed in order to relax the constraint conditions.

[0060] As an example, the time window negotiation partner determination unit 52 selects, from among multiple delivery destinations, a delivery destination that is associated with at least one of the constraint conditions expressed using operational variables specified for each delivery destination, and determines the selected delivery destination as the delivery destination to be negotiated.

[0061] In other words, the time window negotiation partner determination unit 52 determines, from among a plurality of delivery destinations, a delivery destination associated with at least any of the relaxed constraint conditions as a delivery destination to be negotiated.

[0062] The negotiation partner determined by the time window negotiation partner determination unit 52 is supplied to the negotiation management unit 51 together with the new delivery plan.

[0063] (Processing of capacity negotiation partner determination unit) The capacity negotiation partner determination unit 53 generates an evaluation function and constraint conditions by referring to the delivery plan and delivery information. Then, the capacity negotiation partner determination unit 53 relaxes the constraint conditions by using the operation variables related to the change of the cargo capacity, derives by calculation a route that minimizes the evaluation function under the relaxed constraint conditions, and creates a new delivery plan.

[0064] At this time, the capacity negotiation partner determination unit 53 determines, as a negotiation partner, a delivery destination whose cargo capacity should be changed in order to relax the constraint conditions.

[0065] As an example, the capacity negotiation partner determination unit 53 selects, from among multiple delivery destinations, a delivery destination associated with at least any of the constraint conditions expressed using operational variables specified for each delivery destination, and determines the selected delivery destination as the delivery destination to be negotiated.

[0066] In other words, the capacity negotiation partner determination unit 53 determines, from among a plurality of delivery destinations, a delivery destination associated with at least any of the relaxed constraint conditions as a delivery destination to be negotiated.

[0067] The negotiation partner determined by the capacity negotiation partner determination unit 53 is provided to the negotiation management unit 51 together with the new delivery plan.

[0068] (Negotiation information) The negotiation management unit 51 supplies the negotiation partner and the new delivery plan supplied from the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53 to the negotiation information generation unit 54. The negotiation information generation unit 54 generates the time window or cargo capacity to be presented to the negotiation partner as negotiation information.

[0069] When there are a plurality of negotiation partners determined by the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53, the time window or cargo capacity to be presented to each of the negotiation partners is generated as negotiation information.

[0070] The negotiation information generated by the negotiation information generation unit 54 is transmitted to a negotiator of the delivery company via the communication unit 73, for example. Alternatively, the negotiation information may be directly transmitted to the negotiating partner via the communication unit 73 as a GUI.

[0071] (Reflection of negotiation results) Negotiations with the delivery destination are performed based on the negotiation information generated by the negotiation information generation unit 54. For example, if the delivery destination responds that it accepts the time window or cargo capacity presented by the negotiation information, the negotiation is considered successful, and if the delivery destination responds that it does not accept, the negotiation is considered unsuccessful. Such negotiation results are received by the negotiation management unit 51 via the communication unit 73.

[0072] The negotiation management unit 51 updates the delivery information based on the received negotiation results.

[0073] For example, when the time window presented by the negotiation information is accepted by the delivery destination, the negotiation management unit 51 updates the designated time window stored in the delivery information DB 71 to the time window accepted by the delivery destination. More specifically, for example, the delivery information for creating a delivery plan for X district on December 1st is updated to change the designated time window for delivery destination A1 from "10:00-11:00" to "12:00-13:00."

[0074] Moreover, the VRP solution unit creates a delivery plan by solving the VRP with reference to the latest updated delivery information, and updates the delivery plan stored in the delivery plan DB 72. Note that the delivery plan stored in the delivery plan DB 72 may be updated by the delivery plan generated by the time window negotiation partner determination unit 52.

[0075] On the other hand, if the received negotiation result indicates a failure of the negotiation, the negotiation management unit 51 Shipping Not updating information and delivery plans.

[0076] When the specified time window is updated, the constraints are also updated accordingly.

[0077] In addition, when there are multiple negotiating parties, for example, if negotiations with all negotiating parties are successful, the delivery information and delivery plan may be updated, and if negotiations with some negotiating parties fail, the delivery information and delivery plan may not be updated.

[0078] Alternatively, in a case where there are multiple negotiation partners, if negotiations with some of the negotiation partners are successful, the delivery information may be updated so that only the designated time window of those negotiation partners is updated, and the delivery plan may be updated based on the updated delivery information.

[0079] Furthermore, when there are multiple negotiation partners, the delivery information and the delivery plan may be updated, for example, each time negotiation with one of the negotiation partners is successful.

[0080] That is, the negotiation management unit 51 acquires the results of negotiation with the delivery destination that is the subject of negotiation, and updates the constraint conditions corresponding to the negotiation results by referring to the negotiation results.

[0081] The negotiation management unit 51 further refers to the negotiation results and stores, for example, negotiation success / failure information indicating the success or failure of the negotiation for each delivery destination in the delivery information DB 71. More specifically, for example, the negotiation success / failure information for delivery destination A1 is stored as the negotiation success / failure information for the delivery plan for X district on December 1. Similarly, the negotiation success / failure information for other delivery destinations A2, A3, ... is also stored.

[0082] The negotiation success / failure information may include not only the success or failure of the negotiation but also the time required for the negotiation. Furthermore, the negotiation success / failure information may include information such as the compensation paid to the negotiating party, which is the price required for the negotiation.

[0083] When the delivery information in the delivery information DB 71 is updated as a result of successful negotiation, the negotiation management unit 51 provides the updated delivery information to the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53 .

[0084] The time window negotiation partner determination unit 52 generates an evaluation function and constraint conditions by referring to the updated delivery information. Then, the time window negotiation partner determination unit 52 further relaxes the constraint conditions using the operation variables related to the change of the time window, derives by calculation a route that minimizes the evaluation function under the relaxed constraint conditions, creates a new delivery plan, and determines a new negotiation partner.

[0085] At this time, the negotiation management unit 51 refers to information related to negotiation with the delivery destination in the delivery information DB 71 and controls the time window negotiation partner determination unit 52 so that a delivery destination with which negotiation has already failed is not set as a new negotiation partner. Note that even a delivery destination with which negotiation has already failed may be set as a new negotiation partner. In this case, for example, in the new negotiation, a time window different from the time window presented in the negotiation that has already failed is presented.

[0086] Similarly, the capacity negotiation partner determination unit 53 creates a new delivery plan and determines a new negotiation partner. At this time, the capacity negotiation partner determination unit 53 determines a delivery destination whose cargo capacity should be changed in order to relax the constraint conditions as a new negotiation partner.

[0087] At this time, the negotiation management unit 51 refers to information related to negotiation with the delivery destination in the delivery information DB 71 and controls the capacity negotiation partner determination unit 53 so that a delivery destination with which negotiation has already failed is not selected as a new negotiation partner. Note that even a delivery destination with which negotiation has already failed may be set as a new negotiation partner. In this case, for example, in a new negotiation, the capacity negotiation partner presented in the negotiation that has already failed may be set as a new negotiation partner. Cargo capacity A different cargo capacity is presented.

[0088] Based on the processing result of the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53, the negotiation information generation unit 54 generates, as negotiation information, a time window or a cargo capacity to be presented to a new negotiation partner.

[0089] The negotiation management unit 51 repeats the above-mentioned processing until the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53 determines that there is no negotiation partner.

[0090] Note that the negotiation management unit 51 may check the delivery start time. For example, the negotiation management unit 51 may forcibly end the process 30 minutes before the delivery start time.

[0091] The VRP solution unit creates a final delivery plan by solving the VRP with reference to the latest updated delivery information, and updates the delivery plan stored in the delivery plan DB 72. Note that the delivery plan stored in the delivery plan DB 72 may be updated by the delivery plan generated by the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53.

[0092] (Create a delivery plan) The delivery plan is Directed graph It can be expressed as an ordered selection of edges over G. Directed graph is expressed as G = (V, A).

[0093] V is expressed as V=P∪D∪{0,2n+1}, Directed graph The set of all vertices in G.

[0094] P = {1, ..., n}, where P is the set of vertices that collect packages.

[0095] D={n+1,…,2n}, where D is the set of vertices to which packages can be delivered.

[0096] Here, {0, 2n+1} are the start and end points of delivery, and correspond to, for example, a vehicle depot. Note that the delivery plan may include multiple vehicle depots (multi-depots).

[0097] A is expressed as A = {(i,j)∈V×V|i≠j}, Directed graph The set of edges on G.

[0098] In the following explanation, c ij ((i,j)∈A) means the cost of moving from vertex i to vertex j.

[0099] t ij ((i,j)∈A) means the travel time from vertex i to vertex j.

[0100] K = {1, , |K|}, where K denotes available vehicles.

[0101] Q k means the maximum load capacity (cargo capacity) of vehicle k, L k denotes the maximum restraint time of vehicle k.

[0102] q i ands i represents the designated parameters related to cargo capacity and service time.

[0103] q i is the distance from vertex i to vertex n+ i This means the cargo capacity to be delivered to

[0104] However, q n+1 =-q i ,i=1,···,n,q 0 =q 2n+1 =0 s i denotes the service time at vertex i.

[0105] However, s 0 =s 2n+1 =0 In addition, [a i ,b i ] represents a specified parameter related to the time window, and means the time window at vertex i.

[0106] (Formulation of the Vehicle Delivery Planning Problem) (When time window is the operating parameter) The evaluation function used for the calculation in the time window negotiation partner determination unit 52 is shown in Formula M1.

[0107]

number

[0108]

number

[0109]

number

[0110] In addition, under the above constraints

number

number

[0111] In addition, under the above constraints

number

[0112] Furthermore, under the above constraints

number

[0113] Here, among the left side, center side, and right side of the above constraint, "-w i a y i a The term "+w" on the right hand side further lowers the lower limit of the time window. i a y i a The specified time window is relaxed by further increasing the upper limit of the time window by the term ". Under this relaxed constraint, a calculation is performed to derive a path that minimizes the evaluation function.

[0114] Furthermore, the change range of the specified time window may be given as a variable in the above constraint conditions.

[0115] That is, the meaning of each variable in the constraints may be defined as follows.

[0116]

number

[0117] In addition, the evaluation function is y i In other words, the evaluation function itself may include a part of the constraint conditions, and the constraint conditions may be taken into consideration.

[0118] In this case, the evaluation function is expressed as formula M2.

[0119]

number

[0120]

number

[0121]

number

[0122]

number

[0123] In addition, under the above constraints

number

[0124] Furthermore, under the above constraints

number

[0125] In this way, the one or more constraints may include only the capacity-related constraint out of the capacity and the time window.

[0126] In addition, the evaluation function is y i In other words, the evaluation function itself may include a part of the constraint conditions, and the constraint conditions may be taken into consideration.

[0127] In this case, the evaluation function is expressed as formula M4.

[0128]

number

[0129] For example, the time window negotiation partner determination unit 52 and the capacity negotiation partner determination unit 53 may further perform a calculation to minimize the evaluation function by including in the constraints the probability that negotiation with the delivery destination will succeed (or fail).

[0130] For example, a constraint may be imposed that the probability of successful negotiation with a delivery destination must be equal to or greater than a threshold value M. This constraint sets the probability of successful negotiation with vertex i to p i Then, it can be expressed by the formula M5.

[0131]

number

[0132] In this way, the constraints may include a constraint on the probability of successful negotiation with the negotiation target. The evaluation function itself may include this constraint, and the constraint may be taken into consideration. In this case, by applying an appropriate weighting coefficient, a calculation is performed to find a negotiation partner with the highest possible success rate while minimizing the original evaluation function.

[0133] Alternatively, the time window negotiation partner determination unit 52 and the capacity negotiation partner determination unit 53 may perform a calculation to minimize the evaluation function by further including the time required for negotiation with the delivery destination in the constraint conditions.

[0134] For example, a constraint may be imposed that the time required for negotiation with the delivery destination must be less than or equal to a reference value M. This constraint is set by setting the time estimated to take until negotiation with vertex i is completed to u i Then, it can be expressed by the formula M6.

[0135]

number

[0136] In this way, the constraints may include a constraint on the time required for negotiation with the negotiation target. Also, the evaluation function itself may include this constraint so that the constraint is taken into consideration. In this case, by giving an appropriate weighting coefficient, a calculation is performed to find a negotiation partner that is estimated to require as little time as possible for negotiation while minimizing the original evaluation function.

[0137] Alternatively, the time window negotiation partner determination unit 52 and the capacity negotiation partner determination unit 53 may perform a calculation to minimize the evaluation function by further including the price required for negotiation with the delivery destination in the constraint conditions.

[0138] For example, a constraint may be imposed that the price required for negotiation with the delivery destination must be equal to or less than a reference value M. This constraint limits the price that the delivery company must pay when negotiation with the vertex i is successful to s i Then, it can be expressed by the formula M7.

[0139]

number

[0140] In this way, the constraints may include constraints on the price required for negotiation with the negotiation target. Also, the evaluation function itself may include this constraint so that the constraint is taken into consideration. In this case, by giving an appropriate weighting coefficient, a calculation is performed to find a negotiation partner that requires as little price as possible while minimizing the original evaluation function.

[0141] (Method of determining negotiating partner) Next, a method for determining a negotiation partner by the time window negotiation partner determination unit 52 and the capacity negotiation partner determination unit 53 will be described.

[0142] Fig. 4 is a diagram for explaining an example of a delivery plan. The delivery plan in Fig. 4 is, for example, a delivery plan created by a VRP solution-finding unit. In the figure, the numbers 0 to 9 surrounded by circles represent vertices, that is, delivery destinations.

[0143] Vertex "0", for example, corresponds to a vehicle depot and is the point from which each vehicle required for delivery departs. Vertex "9" is the final destination where each vehicle required for delivery must arrive. In this example, there are eight delivery destinations, vertices "1" through "8", on the route from vertex "0" to vertex "9".

[0144] In addition, in the figure, arrows connecting vertices represent routes that vehicles can take, where solid arrows represent routes that vehicles take in the delivery plan, and dotted arrows represent routes that vehicles do not take in the delivery plan.

[0145] In this example, four vehicles start at the same time from vertex "0". The first vehicle reaches vertex "9" via vertex "1" and vertex "5". The second vehicle reaches vertex "9" via vertex "2" and vertex "6". The third vehicle reaches vertex "9" via vertex "3" and vertex "7". The fourth vehicle reaches vertex "9" via vertex "4" and vertex "8".

[0146] The numerical values ​​attached to the arrows connecting the vertices indicate the time required from the start point to the end point of the path indicated by the arrow and the cost of the path.

[0147] In this example, time and cost are indicated only on the arrows between vertex "0" and vertex "1" to vertex "4", the arrow between vertex "1" and vertex "2", and the arrow between vertex "3" and vertex "4", and only the cost is indicated on the other arrows. For example, "50,1" added to the arrow between vertex "0" and vertex "1" indicates that the time required from the start point to the end point of this route is 50, and the cost of this route is 1.

[0148] The numbers in parentheses next to each of vertices "1" through "4" represent the time window specified for each vertex. For example, [150,200] next to vertex "1" represents that the lower limit of the specified time window is time 150 and the upper limit is time 200.

[0149] In this example, for ease of explanation, it is assumed that vertices "5" to "8" do not have designated time windows.

[0150] The VRP solver selects a route for the vehicle to take that minimizes the total cost of all routes while satisfying the constraints of a specified time window.

[0151] 5 is a diagram for explaining an example of a delivery plan created by relaxing the constraints of the specified time window of the delivery plan. Here, an example is explained in which the number of vehicles required for delivery is reduced through negotiation.

[0152] As described above, the time window negotiation partner determination unit 52 uses the operational variables to relax the constraint conditions of the specified time window of the delivery plan shown in Fig. 4. In addition, in order to reduce the number of vehicles, the time window negotiation partner determination unit 52 adds, for example, a virtual route that directly connects vertex "0" and vertex "9" to the delivery plan in Fig. 4, and sets the cost of the virtual route to 0, which is the smallest cost.

[0153] In this state, the time window negotiation partner determination unit 52 selects the route shown in FIG. 5 as the route for minimizing the evaluation function.

[0154] In the example of Figure 5, the first vehicle travels along a virtual route that directly connects vertex "0" to vertex "9". The second vehicle travels from vertex "0" to vertex "9" via vertex "1", vertex "2", vertex "6", and vertex "5". However, the lower limit of the specified time window of vertex "1" is changed, and the specified time window of vertex "1" is now [0,200]. The third vehicle travels from vertex "0" to vertex "9" via vertex "3" and vertex "7". The fourth vehicle travels from vertex "0" to vertex "9" via vertex "4" and vertex "8".

[0155] In this case, the time window negotiation partner determination unit 52 determines the delivery destination corresponding to vertex "1" as the negotiation partner.

[0156] Here, since the virtual route is a non-existent route, there is no need for vehicles to pass through the virtual route. In other words, if the lower limit of the specified time window of vertex "1" can be changed to time 0, it will be possible to reduce one vehicle from the delivery plan in Figure 4.

[0157] As a result, the negotiation information generating unit 54 generates the time window [0, 200] to be presented to the delivery destination corresponding to the vertex "1" as the negotiation information.

[0158] 6 is a diagram for explaining an example of a delivery plan created by reflecting the negotiation results. In the delivery plan shown in the figure, three vehicles are required for delivery.

[0159] Fig. 7 is a diagram for explaining an example of another delivery plan created by relaxing the constraints of the specified time window of the delivery plan. Here, an example is explained in which the number of vehicles required for delivery is further reduced through negotiation based on the delivery plan shown in Fig. 6.

[0160] The time window negotiation partner determination unit 52 uses the operational variables to relax the constraint conditions of the specified time window of the delivery plan shown in Fig. 6. Also, similar to the case described above with reference to Fig. 5, in order to reduce the number of vehicles, the time window negotiation partner determination unit 52 adds, for example, a virtual route that directly connects vertex "0" and vertex "9" to the delivery plan in Fig. 6, and sets the cost of the virtual route to 0, which is the smallest cost.

[0161] In this state, the time window negotiation partner determination unit 52 selects the route shown in FIG. 7 as the route for minimizing the evaluation function.

[0162] In the example of FIG. 7, the first vehicle travels from vertex "0" through vertex "1", vertex "2", vertex "6", and vertex "5" to reach vertex "9". The second vehicle travels from vertex "0" through vertex "3", vertex "4", vertex "7", and vertex "8" to reach vertex "9". However, if the lower limit of the specified time window for vertex "3" is changed, the vehicle will reach vertex "9". 3The specified time window for " is set to [0, 200]. In this case, too, there is no need for vehicles to pass through a virtual route (not shown).

[0163] In this case, the time window negotiation partner determination unit 52 determines the delivery destination corresponding to vertex "3" as the negotiation partner.

[0164] In other words, if the lower limit of the specified time window of vertex “3” can be changed to time 0, it will be possible to further reduce one vehicle from the delivery plan in FIG.

[0165] As a result, the negotiation information generating unit 54 generates the time window [0, 200] to be presented to the delivery destination corresponding to the vertex "3" as the negotiation information.

[0166] 8 is a diagram for explaining an example of a delivery plan created by reflecting the negotiation results. In the delivery plan shown in the figure, two vehicles are required for delivery.

[0167] Even if the constraint conditions of the specified time window of the delivery plan shown in Fig. 8 are relaxed, the number of vehicles cannot be reduced any further, so the time window negotiation partner determination unit 52 cannot determine a negotiation partner. Therefore, the delivery plan shown in Fig. 8 is made the final delivery plan.

[0168] (Shipping plan update) 9 to 18 are diagrams for explaining an example of updating a delivery plan.

[0169] 9 is a diagram showing an example of a delivery plan before updating. In this example, the driver of vehicle T1 visits delivery destinations A1 to A4 and returns to the vehicle depot S0. The driver of vehicle T2 visits delivery destinations B1 to B4 and returns to the vehicle depot S0. The driver of vehicle T3 visits delivery destinations C1 and C2 and returns to the vehicle depot S0.

[0170] Now, the designated time window for delivery destination B4 has a lower limit of 16:00 and an upper limit of 17:00. In this example, negotiations with delivery destination B4 are performed based on the negotiation information generated by the negotiation information generation unit 54 in order to reduce the number of vehicles.

[0171] Figure 10 is a diagram showing an example of a delivery plan obtained by updating the delivery plan in Figure 9. In this example, negotiation with delivery destination B4 is successful, and the specified time window for delivery destination B4 is changed to a lower limit of 10:00 and an upper limit of 11:00. As a result, the number of vehicles required for the delivery plan is reduced by one to two.

[0172] 11 is a diagram showing another example of a delivery plan before updating. In this example, the driver of vehicle T1 visits delivery destinations A1 to A4 and returns to the vehicle depot S0. The driver of vehicle T2 visits delivery destinations B1 to B6 and returns to the vehicle depot S0. Note that delivery destination B6 is a newly added delivery destination.

[0173] Normally, a delivery plan is created so that the driver of each vehicle is on duty for no more than 8 hours. However, in the example of Figure 11, because delivery destination B6 has been added, the driver of vehicle T2 is on duty for 9 hours.

[0174] Now, the designated time window of the delivery destination B5 has a lower limit of 16:00 and an upper limit of 17:00. In this example, in order to reduce the on-duty time of the driver of the vehicle T2, negotiations with the delivery destination B5 are performed based on the negotiation information generated by the negotiation information generating unit 54.

[0175] Figure 12 is a diagram showing an example of a delivery plan obtained by updating the delivery plan in Figure 11. In this example, negotiation with delivery destination B5 is successful, and the designated time window for delivery destination B5 is changed to a lower limit of 10:00 and an upper limit of 11:00. This reduces the commitment time of the driver of vehicle T2 to 8 hours.

[0176] 13 is a diagram showing yet another example of a delivery plan before updating. In this example, the driver of vehicle T1 visits delivery destinations A1 to A4 and returns to the vehicle depot S0. The driver of vehicle T2 visits delivery destinations B1 to B4 and returns to the vehicle depot S0. The driver of vehicle T3 visits delivery destinations C1 and C2 and returns to the vehicle depot S0.

[0177] Now, the designated time window for delivery destination B4 has a lower limit of 16:00 and an upper limit of 17:00. The designated time window for delivery destination C1 has a lower limit of 10:00 and an upper limit of 11:00. In this example, in order to reduce the number of vehicles, negotiations are performed with delivery destination B4 and delivery destination C1 based on the negotiation information generated by the negotiation information generation unit 54.

[0178] Fig. 14 is a diagram showing an example of a delivery plan obtained by updating the delivery plan of Fig. 13. In this example, negotiation with delivery destination B4 is successful, and the lower limit of the designated time window for delivery destination B4 is changed to 10:00 and the upper limit to 17:00. Furthermore, negotiation with delivery destination C1 is successful, and the lower limit of the designated time window for delivery destination C1 is changed to 10:00. As a result, the number of vehicles required for the delivery plan is reduced by one to two.

[0179] In this way, negotiations with multiple delivery destinations may be performed simultaneously, and if all of the negotiations are successful, the delivery plan may be updated.

[0180] In the example of FIG. 10, the original designated time window for delivery destination B4 is one hour, and the changed designated time window is also one hour. On the other hand, in the example of FIG. 14, the original designated time window for delivery destination B4 is one hour, but the changed designated time window is five hours. In this way, the designated time window presented to the delivery destination in negotiations may be a time window that expands the time period so as to always include the original designated time window. By doing so, it is expected that the possibility of successful negotiations with the delivery destination will be higher, compared to, for example, a case in which a completely different time window is presented.

[0181] Alternatively, the designated time window presented to the delivery destination in the negotiation may be a time window with a reduced time period so that it is always included in the original designated time window. For example, presenting a time window with a lower limit of 16:00 and an upper limit of 16:40 to delivery destination B4 corresponds to presenting a time window with a reduced time period so that it is always included in the original designated time window.

[0182] 10, 12, and 14, examples have been described in which negotiations are performed with the delivery destination by presenting a new time window in which the lower limit and / or upper limit of the original designated time window has been changed. However, negotiations may be performed by presenting multiple time windows to the delivery destination.

[0183] Figure 15 is a diagram showing another example of a delivery plan obtained by updating the delivery plan of Figure 13. In the case of Figure 15, unlike the example of Figure 14, the designated time window for delivery destination C1 is a time window with a lower limit of 8:00 and an upper limit of 9:00 or a time window with a lower limit of 10:00 and an upper limit of 11:00. This also reduces the number of vehicles required for the delivery plan by one to two.

[0184] FIG. 16 is a diagram showing yet another example of a delivery plan obtained by updating the delivery plan of FIG. 13. In the case of FIG. 16, unlike the example of FIG. 15, negotiation with delivery destination B4 has failed, and the designated time window for delivery destination B4 remains at a lower limit of 16:00 and an upper limit of 17:00. On the other hand, negotiation with delivery destination C1 has been successful, and the designated time window for delivery destination C1 remains at a lower limit of 17:00. 10:00 Upper limit at 11:00 The time window or lower limit of 11:00 The upper limit is 12:00 This is considered to be the time window.

[0185] In such a case, the delivery plan may be updated by changing only the designated time window of the delivery destination C1. In this case, the number of vehicles required for the delivery plan cannot be reduced, but the designated time window that was changed by the negotiation does not need to be further changed.

[0186] 17 is a diagram showing yet another example of a delivery plan before updating. In this example, vehicle T11 goes from vehicle depot S0 to delivery destination A11 to collect cargo, and vehicle T12 goes from vehicle depot S0 to delivery destination B11 to collect cargo. The maximum load capacity of vehicle T11 and vehicle T12 is assumed to be three pieces of luggage.

[0187] Now, delivery destination A11 has requested the collection of two cargoes, and the designated capacity of delivery destination A11 is 2. Delivery destination B11 has also requested the collection of two cargoes, and the designated capacity of delivery destination B11 is also 2.

[0188] In this example, negotiations are carried out with the delivery destination A11 based on the negotiation information generated by the negotiation information generating unit 54 in order to reduce the number of vehicles.

[0189] Figure 18 is a diagram showing an example of a delivery plan obtained by updating the delivery plan in Figure 17. In this example, negotiation with delivery destination A11 has been successful, and the designated capacity for delivery destination A11 has been changed to 1. As a result, the number of vehicles required for the delivery plan is reduced by one, to 1 vehicle.

[0190] Exemplary embodiment 3 Next, an example of a method for presenting bargaining information will be described.

[0191] 19 and 20 are diagrams for explaining an example of a method for identifying and presenting a new designated time window. Here, an example will be explained in which the negotiation information is generated as a GUI to be displayed on a display of a smartphone. In this case, the negotiation information generating unit 54 generates commands and the like for an application executed on the smartphone to display images such as those described later with reference to FIGS. 19 to 22. The generated commands and the like are transmitted to the smartphone of the negotiation partner via the communication unit 73.

[0192] Note that while the GUI displayed on the display of a smartphone is described as an example here, a similar GUI may also be displayed on a tablet terminal, a personal computer, or the like.

[0193] FIG. 19 is a diagram for explaining an example in which the time period of the designated time window presented in the negotiation information is limited to one-hour units.

[0194] FIG. 19 shows an example of negotiation information being displayed on the display 101 of the negotiation partner's smartphone. In this example, the negotiation message 102 displays the changed time window "12:00-14:00". If the changed time window is acceptable, the negotiation partner presses an OK button 103 to confirm that the changed time window is acceptable. No In this case, the user presses the NG button 104. This causes the negotiation result to be transmitted and received by the negotiation management unit 51 via the communication unit 73.

[0195] In contrast to this, FIG. 20 is a diagram for explaining an example in which the time period of the designated time window presented in the negotiation information can also be changed for each negotiation partner.

[0196] In this example, the negotiation message 102 displays the revised time window "12:40-14:00".

[0197] As shown in the example of FIG. 19, the time period of the specified time window after the change may be determined. Figure 20 As in the example of (1), the time period of the specified time window after the change may be made changeable.

[0198] 21 and 22 are diagrams for explaining an example of a method for allowing a negotiating counterpart to select a new designated time window.

[0199] 21 shows an example of negotiation information being displayed on a display 101 of a smartphone of a negotiation partner. In this example, a plurality of time windows that can be selected as the time window desired by the negotiation partner are displayed in a negotiation message 102. Note that the time windows displayed are only the time windows that the delivery company wants the delivery destination to accept.

[0200] The negotiation partner checks the acceptable time windows and presses the OK button 103. On the other hand, if none of the time windows are acceptable, the negotiation partner presses the NG button 104. This causes the negotiation result to be transmitted and received by the negotiation management unit 51 via the communication unit 73. In this way, the negotiation information may present multiple time window or capacity candidates and prompt the delivery destination that is the subject of the negotiation to respond with an acceptable candidate.

[0201] In contrast, in FIG. 22, a negotiation message 102 displays a plurality of time windows that can be selected as time windows that the negotiation partner does not desire.

[0202] The negotiation partner checks the unacceptable time windows and presses the OK button 103. On the other hand, if all the time windows are acceptable, the negotiation partner presses the NG button 104. In this way, the negotiation information presents multiple time window or capacity candidates, and the delivery destination of the negotiation target is asked to decide whether or not to accept them. impossible The questionnaire may prompt the candidate to provide a suitable answer.

[0203] For example, for a delivery destination where the number of time windows selected as the desired time window is expected to be small, negotiation information may be presented as shown in Fig. 21. Also, for a delivery destination where the number of time windows selected as the desired time window is expected to be large, negotiation information may be presented as shown in Fig. 22.

[0204] As an example, the negotiation information generation unit 54 refers to past negotiation results and predicts the number of “time windows that will be selected” by the negotiation partner, and if the predicted number is less than a predetermined threshold, presents negotiation information as shown in FIG. 21, and if the predicted number is equal to or greater than the predetermined threshold, presents negotiation information as shown in FIG. 22.

[0205] <Flow of delivery plan creation process> Next, an example of a delivery plan creation process performed by the delivery plan creation device 40 will be described with reference to a flowchart of FIG.

[0206] In step S31, the negotiation management unit 51 executes the delivery plan DB 72. Sending bill The delivery plan and delivery information stored in the delivery information DB 71 are read out. The read out delivery plan and delivery information are provided to the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53.

[0207] In step S32, the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53 generates an evaluation function and constraint conditions by referring to the delivery plan and delivery information. Then, the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53 relaxes the constraint conditions by using the operation variables related to the change of the time window, derives by calculation a route that minimizes the evaluation function under the relaxed constraint conditions, and creates a new delivery plan.

[0208] In step S33, the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53 determines, as a negotiation partner, a delivery destination whose designated time window or designated capacity should be changed in order to relax the constraint conditions. The negotiation partner determined here is supplied to the negotiation management unit 51 together with the new delivery plan.

[0209] In step S34, the negotiation management unit 51 determines whether or not a negotiation partner exists, and if it is determined that a negotiation partner exists, the process proceeds to step S35. On the other hand, if it is determined that a negotiation partner does not exist, the process ends.

[0210] In step S35, the negotiation information generating unit 54 generates, as negotiation information, a time window or a cargo capacity to be presented to the negotiation partner by referring to the negotiation partner and the delivery plan provided by the negotiation management unit 51. As an example, the negotiation information is generated as a GUI to be displayed on a display of a personal computer or a smartphone. For example, the negotiation information is generated as the GUI described above with reference to Figs. 19 to 22.

[0211] When there are a plurality of negotiation partners determined by the time window negotiation partner determination unit 52 or the capacity negotiation partner determination unit 53, the time window or cargo capacity to be presented to each of the negotiation partners is generated as negotiation information.

[0212] In step S36, the negotiation management unit 51 acquires a negotiation result, which is a response from the negotiating party to the negotiation information generated in step S35. The negotiation result is received by the negotiation management unit 51 via the communication unit 73, for example.

[0213] In step S37, the negotiation management unit 51 refers to the negotiation result acquired in step S36 to determine whether the negotiation has been successful.

[0214] If it is determined in step S37 that the negotiation has been successful, the process proceeds to step S38, where the negotiation manager 51 and the VRP solution finder update the delivery information and the delivery plan.

[0215] On the other hand, if it is determined in step S37 that the negotiation has not been successful, the process of step S is skipped.

[0216] In step S39, the negotiation management unit 51 stores the negotiation success / failure information.

[0217] After the process of step S39, the process returns to step S31, and the subsequent processes are repeatedly executed, that is, until it is determined in step S that there is no negotiation partner.

[0218] If it is determined in step S34 that there is no negotiation partner, the constraints shown in formulas M5 and M6 may be relaxed and the process may return to step S31. In this case, for example, the value of "M" in formulas M5 to M6 may be changed to a larger or smaller value to relax the constraints.

[0219] When the negotiation management unit 51 checks the delivery start time, the process may be forcibly terminated, for example, 30 minutes before the delivery start time.

[0220] In this manner, the delivery plan creation process is carried out.

[0221] [Modifications] In the above, an example has been described in which the time window negotiation partner determination unit 52 and the capacity negotiation partner determination unit 53 each determine a negotiation partner separately. That is, an example has been described in which the time window negotiation partner determination unit 52 relaxes the constraint conditions by using the operation variable related to the change of the time window, and the capacity negotiation partner determination unit 53 relaxes the constraint conditions by using the operation variable related to the change of the cargo capacity.

[0222] However, the time window negotiation partner determination unit 52 and the capacity negotiation partner determination unit 53 may be combined into one negotiation partner determination unit. In this case, the single negotiation partner determination unit derives, by calculation, a route that minimizes the evaluation function under the relaxed constraint conditions using both the operation variables related to the change in the time window and the operation variables related to the change in the cargo capacity, and creates a new delivery plan.

[0223] In this manner, negotiations regarding changes to the designated time window and changes to the designated capacity may be performed simultaneously.

[0224] [Software implementation example] A part or all of the functions of the information processing device 20 and the delivery plan creation device 40 may be realized by hardware such as an integrated circuit (IC chip), or may be realized by software.

[0225] In the latter case, the information processing device 20 and the delivery plan creation device 40 are realized by, for example, a computer that executes instructions of a program, which is software that realizes each function. An example of such a computer (hereinafter, referred to as computer C) is shown in FIG.

[0226] The computer C includes at least one processor C101 and at least one memory C102. The memory C102 stores a program P for operating the computer C as the information processing device 20 or the delivery plan creation device 40. In the computer C, the processor C101 reads and executes the program P from the memory C102, thereby realizing each function of the information processing device 20 or the delivery plan creation device 40.

[0227] The processor C101 may be, for example, a central processing unit (CPU), a graphic processing unit (GPU), a digital signal processor (DSP), a micro processing unit (MPU), a floating point number processing unit (FPU), a physics processing unit (PPU), a microcontroller, or a combination of these. The memory C102 may be, for example, a flash memory, a hard disk drive (HDD), a solid state drive (SSD), or a combination of these.

[0228] The computer C may further include a RAM (Random Access Memory) for expanding the program P during execution and for temporarily storing various data. The computer C may further include a communication interface for transmitting and receiving data to and from other devices. The computer C may further include an input / output interface for connecting input / output devices such as a keyboard, a mouse, a display, and a printer.

[0229] Furthermore, the program P can be recorded on a non-transitory tangible recording medium M that can be read by the computer C. Such a recording medium M can be, for example, a tape, a disk, a card, a semiconductor memory, or a programmable logic circuit. The computer C can obtain the program P via such a recording medium M. Furthermore, the program P can be transmitted via a transmission medium. Such a transmission medium can be, for example, a communication network or broadcast waves. The computer C can also obtain the program P via such a transmission medium.

[0230] [Additional Note 1] The present invention is not limited to the above-described embodiment, and various modifications are possible within the scope of the claims. For example, embodiments obtained by appropriately combining the technical means disclosed in the above-described embodiment are also included in the technical scope of the present invention.

[0231] [Additional Note 2] Some or all of the above-described embodiments can be described as follows. However, the present invention is not limited to the following described aspects.

[0232] (Appendix 1) A determination means for determining a delivery destination to be negotiated from among a plurality of delivery destinations by solving a delivery planning problem including one or more constraints related to at least one of a capacity and a time window, the constraints being expressed using operation variables defined for each delivery destination; an output means for outputting information including the contents of negotiations with the delivery destination determined by said determination means; An information processing device comprising:

[0233] (Appendix 2) The determining means determines, from among the plurality of delivery destinations, a delivery destination associated with at least any of constraint conditions expressed using operation variables defined for each of the delivery destinations as the delivery destination to be negotiated. 2. An information processing device according to claim 1.

[0234] (Appendix 3) The delivery plan problem solved by the decision means includes an evaluation function or constraint conditions including information related to at least one of the plurality of delivery destinations, other than the capacity and the time window. 3. The information processing device according to claim 1 or 2.

[0235] (Appendix 4) The constraint condition or the evaluation function includes a constraint on the probability of successful negotiation with the negotiation target. 4. The information processing device according to claim 3.

[0236] (Appendix 5) The constraint condition or the evaluation function includes a constraint on the time required for negotiation with the negotiation target. 5. The information processing device according to claim 3 or 4.

[0237] (Appendix 6) The constraint condition or the evaluation function includes a constraint on the price required for negotiation with the negotiation target. 6. The information processing device according to any one of claims 3 to 5.

[0238] (Appendix 7) The one or more constraints include only a capacity constraint among a capacity and a time window. 7. The information processing device according to claim 1,

[0239] (Appendix 8) an acquisition unit for acquiring a result of negotiation with the delivery destination of the negotiation target, The determining means refers to the negotiation result and updates the constraint condition corresponding to the negotiation result. 8. The information processing device according to any one of claims 1 to 7.

[0240] (Appendix 9) The acquisition unit refers to the negotiation result and stores negotiation success / failure information representing success or failure of the negotiation for each negotiation target. 9. The information processing device according to claim 8.

[0241] (Appendix 10) The output means generates output data including the negotiation content for the delivery destination of the negotiation target, and presents the generated output data to the delivery destination of the negotiation target. 5. An information processing device according to any one of claims 1 to 4.

[0242] (Appendix 11) The negotiation content presents a plurality of time window or capacity options and prompts the delivery destination of the negotiation target to respond with an acceptable option. 11. The information processing device according to claim 10.

[0243] (Appendix 12) The negotiation content presents multiple time window or capacity options and prompts the delivery destination of the negotiation target to respond with options that are unacceptable. 11. The information processing device according to claim 10.

[0244] (Appendix 13) determining a delivery destination to be negotiated from among a plurality of delivery destinations by solving a delivery planning problem including one or more constraints related to at least one of capacity and time window, the constraints being expressed using manipulated variables defined for each delivery destination; Outputting information including the contents of negotiations with the determined delivery destination An information processing method comprising:

[0245] (Appendix 14) Computer, A determination means for determining a delivery destination to be negotiated from among a plurality of delivery destinations by solving a delivery planning problem including one or more constraints related to at least one of a capacity and a time window, the constraints being expressed using operation variables defined for each delivery destination; an information processing device comprising: an output means for outputting information including the content of negotiations with the delivery destination determined by the determination means; A program that functions as a

[0246] [Additional Note 3] A part or all of the above-described embodiments can be further expressed as follows.

[0247] At least one processor, the processor comprising: A delivery destination to be negotiated is determined from among a plurality of delivery destinations by solving a delivery planning problem including one or more constraints related to at least one of capacity and time window, the constraints being expressed using operational variables defined for each delivery destination. decision Processing and Said decision In processing and output processing for outputting information including the content of negotiations with the determined delivery destination. Information processing device.

[0248] The information processing device may further include a memory, decision Processing and force shop The program for causing the processor to execute the above-mentioned processing may be stored in the storage medium. The program may be recorded in a non-transitory computer-readable tangible recording medium. [Explanation of symbols]

[0249] 20 Information processing device 21 Decision Section 22 Output section 40 Delivery plan creation device 50 Control section 51 Negotiations Management Department 52 Time Window Negotiation Partner Determination Division 53 Capacity Negotiation Partner Determination Department 54 Negotiation information generation unit 71 Delivery information DB 72 Delivery plan DB 73 Communications Department

Claims

1. A determination means for determining a delivery destination to be negotiated from among a plurality of delivery destinations by solving a delivery planning problem including one or more constraints related to at least one of a capacity and a time window, the constraints being expressed using operation variables defined for each delivery destination; an output means for outputting information including the contents of negotiations with the delivery destination determined by said determination means; An information processing device comprising:

2. The determining means determines, from among the plurality of delivery destinations, a delivery destination associated with at least any of constraint conditions expressed using operation variables defined for each of the delivery destinations as the delivery destination to be negotiated. The information processing device according to claim 1 .

3. The delivery plan problem solved by the decision means includes an evaluation function or constraint conditions including information related to at least one of the plurality of delivery destinations, other than the capacity and the time window.

3. The information processing device according to claim 1 or 2.

4. The constraint condition or the evaluation function includes a constraint on the probability of successful negotiation with the negotiation target. The information processing device according to claim 3 .

5. The constraint condition or the evaluation function includes a constraint on the time required for negotiation with the negotiation target.

5. The information processing device according to claim 3.

6. The one or more constraints include only a capacity constraint among a capacity and a time window. The information processing device according to any one of claims 1 to 5.

7. an acquisition unit for acquiring a result of negotiation with the delivery destination of the negotiation target, 7. The information processing apparatus according to claim 1, wherein the determining means refers to the negotiation result and updates the constraint condition corresponding to the negotiation result.

8. The output means generates output data including the negotiation content for the delivery destination of the negotiation target, and presents the generated output data to the delivery destination of the negotiation target. The information processing device according to claim 1 .

9. determining a delivery destination to be negotiated from among a plurality of delivery destinations by one or more processors solving a delivery planning problem including one or more constraints related to at least one of capacity and time window, the constraints being expressed using manipulated variables defined for each delivery destination; One or more processors output information including the content of negotiations with the determined delivery destination. An information processing method comprising:

10. Computer, A determination means for determining a delivery destination to be negotiated from among a plurality of delivery destinations by solving a delivery planning problem including one or more constraints related to at least one of a capacity and a time window, the constraints being expressed using operation variables defined for each delivery destination; an information processing device comprising: an output means for outputting information including the content of negotiations with the delivery destination determined by the determination means; A program that functions as a

Images