JP2017167757A - Delivery scheduling system, delivery scheduling method and program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a delivery scheduling system for planning a distribution schedule for picking up delivery objects existing in a variety of places, and delivering them to proper delivery destinations.SOLUTION: A delivery scheduling system calculates: a demand amount and a supply amount of delivery objects at each delivery base being a place in which any of the delivery objects, delivery main bodies and delivery means for moving the delivery objects or the delivery main bodies stays; the information of one or plurality of start bases indicating initial positions of the delivery main bodies and the delivery means; the information of the delivery means and the delivery main bodies which are usable in the start bases; point information in which inputs of the above information and the information of a delivery deadline are accepted, and the delivery bases and a time in which the start bases and a delivery start are set as references are paired; and branch information indicating a flow rate of the delivery objects, the delivery main bodies and the delivery means between two pieces of the point information related to the delivery of the delivery objects out of the point information. The delivery scheduling system creates at least one aggregate of the branch information in the case that the delivery objects satisfying the demand amount are delivered to the delivery bases which are set in the demand amounts within a delivery deadline.SELECTED DRAWING: Figure 1

Description

  The present invention relates to a delivery planning system, a delivery planning method, and a program.

  There is a growing need for car sharing. Car sharing is a system in which, for example, a vehicle is shared between members, a fee is paid according to the boarding time, and the vehicle is used at any time. As one form of car sharing, there is a use form called a drop-off type (one-way type). In the drop-off type car sharing, the user can use the common vehicle to a predetermined parking lot near the destination and leave the car as it is in the parking lot. In such a form of car sharing, it is necessary to deliver a vehicle that has been used by a user to another parking lot that has new usage needs.

  Also, in the case of so-called after-service patrols where service personnel visit customers to provide after-sales service for products purchased by customers, there are similar circumstances regarding the movement of service personnel and parts necessary for providing services. Arise. For example, products that are subject to after-sales service are installed at each of multiple customers, and service personnel procure parts to be used for after-sales service of the products at a certain location and carry them to customers. Efficient in situations where a service person who performs various types of after-sales service moves from one customer to another customer who needs the same parts to provide the service, and then returns the used parts to the original It is necessary to select a patrol method.

  Patent Document 1 discloses a technique for creating a transportation plan for transporting a package from a plurality of delivery bases at a date and time designated as a plurality of delivery destinations using a plurality of transportation means.

JP2013-136421A

By the way, even in the case of vehicle delivery in car sharing, there is a possibility that the technique disclosed in Patent Document 1 or the like can be applied as long as the vehicle is loaded on a truck and delivered. However, when a vehicle is delivered by car sharing, there is a method in which a delivery staff gets on the delivery target vehicle and drives to a target parking lot. This method of boarding and delivering on the delivery itself is called boarding transportation. Conventionally, a delivery route optimization method based on a mathematical model has been provided as a delivery method for loading and delivering packages and the like on a vehicle. However, a technique for performing an optimal delivery plan in delivery including boarding transportation is not provided.
Similarly, when parts used for service are delivered to customers in the after-service patrol, if only parts are delivered from the service center to each customer, a patrol plan can be made by a conventional method. As with boarding transportation, when a person moves with a part, delivers a part from one customer to another, or takes a surplus part to the next customer, etc. In addition, there is no provision of a technique for making an optimal patrol plan for service personnel.

In general, the combinatorial optimization problem of discrete values often uses a technique called linear relaxation, that is, a technique of solving a problem once by replacing it with a continuous value problem and obtaining an optimal solution from the obtained relaxation solution. If there are a lot of complicated restrictions like a problem, it will take too much calculation time as it is, so a device for solving in a practical time is required.

  Therefore, an object of the present invention is to provide a delivery planning system, a delivery planning method and a program that can solve the above-mentioned problems, and to increase the calculation time.

  According to the first aspect of the present invention, the delivery planning system includes a delivery item, a delivery subject, the delivery item, or a delivery means that moves the delivery subject. Information on demand quantity and supply quantity, information on one or a plurality of departure points indicating the initial positions of the delivery subject and the delivery means, information on available delivery means and delivery subjects at the departure point, and delivery deadline information An initial condition setting unit that sets initial conditions in a delivery plan, point information that is a combination of the delivery base and the departure base, and a time based on the delivery start, and the point information Branch information indicating flow rates of the delivery item, the delivery subject, and the delivery means for the delivery between two pieces of point information relating to delivery of the delivery item is calculated, and the demand quantity is within the delivery deadline. The delivery article satisfying comprising a delivery plan generator, for generating at least one set of the branch information when delivered to the delivery site where the demand quantity is set.

  The delivery plan generation unit according to the second aspect of the present invention may calculate an evaluation value for the generated set of branch information and determine an optimal set of branch information based on the evaluation value.

  The delivery plan generation unit according to the third aspect of the present invention includes branch information indicating the flow rate between the different delivery bases, and branch information indicating the flow rate within the same delivery base and the departure base. It may be generated.

  The delivery plan generation unit according to the fourth aspect of the present invention includes, for one delivery base, point information relating to an entrance that is a set of the entrance and time of the delivery base, and an exit and time of the delivery base. Point information relating to the set exit and point information relating to the place of the deliverable with the time set for each deliverable relating to the delivery base are generated, and the point information relating to the entrance and the delivery are generated You may set the value of the flow volume of the delivery subject and the delivery goods to 0 or 1 between the point information concerning the goods and between the point information concerning the exit and the point information concerning the delivery goods.

  The delivery plan generation unit according to a fifth aspect of the present invention sets an objective function that minimizes a cost based on a flow rate and a travel time of the delivery subject, the delivery means, and the delivery, and the delivery, the delivery For each of the means and the delivery main body, the difference between the flow rate entering and exiting the delivery base is 0, the flow rate of the delivery item, the flow rate of the delivery means, and the flow rate of the delivery main body are each 0 or more. If the flow rate of the delivery item in the delivery base and the flow rate of the delivery subject are each 1 or less, and the flow rate of the delivery item in the delivery base is 1, the flow rate of the delivery item is The flow rate of the delivery subject is 1, the delivery subject always boarding the delivery means when moving from the delivery location to another delivery location, and from the delivery location to another delivery location. The total number of delivery subjects boarding the delivery means when moving is equal to or less than the number of boardable persons, and the total of delivery items and delivery means loaded on the delivery means when moving from the delivery base to another delivery base Is less than or equal to the amount that can be loaded on the delivery means related to the movement, if the staying in the delivery base, the delivery subject is on the delivery means, and if staying in the delivery base, board the delivery means The set of branch information may be determined by solving an integer programming problem including a constraint that the number of the delivery subject is equal to or less than the number of passengers.

  The delivery plan generation unit according to the sixth aspect of the present invention sets an objective function for minimizing the movement time of the delivery subject, the delivery means, and the delivery item, instead of the objective function for minimizing the cost. The set of branch information may be determined by solving the integer programming problem.

  In the seventh aspect of the present invention, the delivery plan generation unit may determine a set of the branch information by adding a constraint on the delivery means that leaves the delivery base that supplies the delivery.

  The delivery plan generation unit according to an eighth aspect of the present invention may determine the set of branch information by adding a constraint condition related to the delivery means entering the delivery base where there is a demand for the delivery.

  The delivery plan generation unit according to the ninth aspect of the present invention adds a restriction condition regarding a relationship between an increase / decrease of the delivery in the delivery place in the delivery base and the number of delivery subjects entering the place. The branch information set may be determined.

  The delivery plan generation unit according to the tenth aspect of the present invention may determine the set of branch information by adding a constraint on the increase or decrease of the delivery in the delivery place in the delivery base. .

  In the eleventh aspect of the present invention, when there are a plurality of places for the delivery items in the delivery base, the delivery plan generation unit adds a restriction condition regarding the order of addition and extraction of the delivery items to and from the plurality of places. A set of branch information may be determined.

  The delivery plan generation unit according to the twelfth aspect of the present invention may determine a set of the branch information by adding a constraint on the number of delivery means.

  According to a thirteenth aspect of the present invention, the delivery object can be moved by the delivery subject, and the branch information calculated by the delivery plan generation unit includes the delivery means by the delivery means. In addition to branch information indicating movement of a delivery item, branch information indicating that the delivery subject boarded the delivery item and moved the delivery item may be included.

  According to the fourteenth aspect of the present invention, the delivery planning method is provided for each delivery base where the delivery planning device is a place where the delivery item, the delivery subject, the delivery item or the delivery means that moves the delivery subject remains. Demand quantity and supply quantity of the delivery item, information on one or a plurality of departure points indicating the initial positions of the delivery subject and the delivery means, and information on available delivery means and delivery subjects at the departure point; Receiving the delivery deadline information, setting initial conditions in the delivery plan, and combining the delivery base and the departure base with time based on the delivery start, and the point information Branch information indicating the flow rate of the delivery item, the delivery subject, and the delivery means between the two pieces of point information relating to delivery of the delivery item is calculated, and the demand quantity is calculated within the delivery deadline. Plus delivery was generating at least one set of the branch information when delivered to the delivery site where the demand quantity is set.

  According to the fifteenth aspect of the present invention, the program causes the computer of the delivery planning apparatus to send a delivery item, a delivery subject, a delivery unit that moves the delivery subject or a delivery means that moves the delivery subject to each delivery base. Demand quantity and supply quantity of the delivery item, information on one or a plurality of departure points indicating the initial positions of the delivery subject and the delivery means, and information on available delivery means and delivery subjects at the departure point; Means for accepting input of delivery deadline information and setting initial conditions in a delivery plan, point information that is a combination of the delivery base and the departure base and time based on delivery start, and the point information Among the two pieces of point information relating to delivery of the delivery item, branch information indicating the flow rate of the delivery item, the delivery subject, and the delivery means relating to the delivery is calculated, and within the delivery deadline At least one generated means a set of the branch information when delivering delivery items satisfying the demand quantity delivery locations to which the demand quantity is set, to function as a.

  According to the present invention, it is possible to devise a delivery plan that minimizes cost and travel time when a delivery staff picks up a delivery item present in various places and delivers it to an appropriate delivery destination.

It is a functional block diagram which shows an example of the delivery plan system in 1st embodiment of this invention. It is a figure explaining an example of the delivery plan in 1st embodiment of this invention. It is an example of the space-time network model which concerns on the delivery plan in 1st embodiment of this invention. It is a flowchart which shows an example of the production | generation process of the delivery plan in 1st embodiment of this invention. It is a functional block diagram which shows an example of the delivery plan system in 2nd embodiment of this invention. It is a 1st figure explaining the space-time network model which concerns on the delivery plan in 2nd embodiment of this invention. It is a 2nd figure explaining the space-time network model which concerns on the delivery plan in 2nd embodiment of this invention. It is a 3rd figure explaining the space-time network model which concerns on the delivery plan in 2nd embodiment of this invention. It is a 4th figure explaining the space-time network model which concerns on the delivery plan in 2nd embodiment of this invention. It is a 5th figure explaining the space-time network model which concerns on the delivery plan in 2nd embodiment of this invention. It is a 1st figure explaining an example of the cut in 2nd embodiment of this invention. It is a 2nd figure explaining an example of the cut in 2nd embodiment of this invention. It is a 3rd figure explaining an example of the cut in 2nd embodiment of this invention. It is a 4th figure explaining an example of the cut in 2nd embodiment of this invention. It is a 5th figure explaining an example of the cut in 2nd embodiment of this invention. It is a 6th figure explaining an example of the cut in a second embodiment of the present invention. It is a 7th figure explaining an example of the cut in 2nd embodiment of this invention. It is the 8th figure explaining an example of the cut in 2nd embodiment of the present invention. It is a 9th figure explaining an example of the cut in 2nd embodiment of this invention. It is a 10th figure explaining an example of the cut in 2nd embodiment of this invention. It is an 11th figure explaining an example of the cut in 2nd embodiment of this invention. It is the 12th figure explaining an example of the cut in 2nd embodiment of this invention. It is a figure explaining an example of restrictions in a second embodiment of the present invention. It is a figure which shows the example of a problem of the delivery plan in 2nd embodiment of this invention. It is a 1st figure which shows the example of the planning result of the delivery plan in 2nd embodiment of this invention. It is a 2nd figure which shows the example of the plan result of the delivery plan in 2nd embodiment of this invention.

<First embodiment>
Hereinafter, a delivery planning system according to an embodiment of the present invention will be described with reference to FIGS.
FIG. 1 is a functional block diagram showing an example of a delivery planning system in the first embodiment of the present invention. In the present embodiment, the delivery planning system is configured by a computer device such as a single PC or a server device, for example. The computer device includes a calculation unit such as a CPU (Central Processing Unit), a storage unit such as a ROM (Read Only Memory), a RAM (Random Access Memory), and an HDD (Hard Disk Drive), and other hardware such as a network interface. It is comprised including the wear.

  The delivery planning device 10 in FIG. 1 is an example of a delivery planning system. The delivery planning device 10 is a device that calculates a delivery means, a delivery route, and the like that minimize the cost with respect to a delivery plan including boarding transportation. In the present embodiment, a method of planning an optimal delivery plan that realizes delivery in a scene where a user jointly uses a vehicle that is used jointly in a drop-off type car sharing is delivered to a place where the user starts using the vehicle. When delivering a delivery item, for example, it is required to select a delivery means and delivery route that minimize the cost. Various methods have been provided in the past for planning delivery plans that minimize costs. However, the delivery of vehicles in car sharing is different from the case where packages are delivered by, for example, a home delivery service. That is, when a vehicle is delivered, a person can get on the vehicle and move. For example, it is assumed that there is a state where the vehicle is left or short at each of the base A, the base B, the base C, the base D, and the base E. In such a state, for example, the following method is conceivable in order to move the vehicle from the base where the vehicle is surplus to the base where the vehicle is insufficient to meet the needs of the user. (1) One delivery staff travels to each site with a truck on which vehicles can be loaded, and the surplus vehicles are loaded onto the truck and delivered to a location where there is a shortage. (2) A plurality of delivery staff board the delivery vehicle and move from one location to another. When a part of the delivery staff boarding the delivery vehicle arrives at the base where the vehicle is surplus, the delivery staff changes over to the surplus vehicle and drives and delivers the vehicle to the base where the vehicle is insufficient (boarding transport). In such a case, it is not easy to know which delivery means should be used for delivery and what route should be used for delivery to minimize the cost. The delivery planning apparatus 10 of the present embodiment introduces a mathematical model and constraints based on mathematical knowledge to a delivery plan when boarding transportation is possible, thereby minimizing cost, for example, at high speed. Provide a way to determine a delivery plan.

As shown in FIG. 1, the delivery planning apparatus 10 includes an initial condition setting unit 11, a delivery plan generation unit 12, an input / output unit 13, and a storage unit 14.
The initial condition setting unit 11 sets a delivery item for each delivery base where a delivery subject that the delivery subject can board and move, a delivery subject, a delivery matter, or a delivery means that moves the delivery subject remains. Demand quantity and supply quantity, information on one or more departure bases that indicate the initial location of the delivery subject and delivery means, information on available delivery means and delivery subjects at the departure base, delivery deadline information, etc. Information is set as an initial condition for calculating a delivery plan. These parameters will be described in detail later.
The delivery plan generation unit 12 includes a delivery item and a delivery item between the point information obtained by combining the delivery base and the departure base and the time based on the delivery start, and the two pieces of point information relating to the delivery of the point information, and Branch information indicating the flow rate of the delivery subject and the delivery means is calculated, and at least one set of branch information is generated when delivering a delivery satisfying the demand quantity to the delivery base where the demand quantity is set within the delivery deadline. . The departure base and delivery base are collectively referred to as a base.
The input / output unit 13 receives an input operation by the user. The input / output unit 13 outputs information on a delivery plan based on the set of branch information generated by the delivery plan generation unit 12 to a display or the like.
The storage unit 14 stores various pieces of information necessary for generating a delivery plan.
The delivery plan generating unit 12 is realized by, for example, a CPU (Central Processing Unit) provided in the delivery planning device 10 reading out a program from the storage unit 14 and executing it.

FIG. 2 is a diagram illustrating an example of a delivery plan in the first embodiment of the present invention.
A delivery example of a delivery item (vehicle) in a drop-off type car sharing will be described with reference to FIG. In FIG. 2, the center is a base where a delivery staff of delivery goods exists and starts delivery of the delivery goods (departure base). Further, the parking lot A, the parking lot B, and the parking lot C are bases (delivery bases) that serve as delivery sources or delivery destinations of deliveries. The user of the delivery item reserves the delivery item using a predetermined reservation system or the like. The user inputs information such as the number of deliverables to be used and the use start location (for example, parking lot B) from the reservation system. When the user wants to use a delivery item from the parking lot B, if the delivery item already exists in the parking lot B, the user can use the delivery item. However, if no delivery item exists in the parking lot B, the delivery staff needs to move the delivery item from another parking lot to the parking lot B. In drop-off type car sharing, for example, when a user uses a delivery item from the parking lot B to the parking lot A, the user drops the delivery item into the parking lot A as it is. Then, a situation where many users use, for example, delivery items are ubiquitous in the parking lot A may occur. The center delivery staff delivers ubiquitous deliveries to the parking lots A to C where the user needs. In the case of the example in FIG. 2, there are more than two deliverables in the parking lot A, and there are insufficient deliveries in the parking lots B and C one by one. The delivery staff of the center delivers the two surplus deliveries in the parking lot A to the parking lot B and the parking lot C, respectively, so that the user can use the deliveries as desired. FIG. 2 shows an implementation example of delivery satisfying this condition.

  First, two delivery staff (k, l) from the center board a single delivery vehicle 1 (delivery means) and move to the parking lot A (1). In the parking lot A, the delivery staff k gets on one delivery item out of the two remaining and moves to the parking lot B. Further, the other delivery staff l also board the delivery car 1 as it is and move to the parking lot B (2). In the parking lot B, the delivery staff k parks the delivery items in the parking lot B, and gets on the delivery vehicle 1 driven by the delivery staff l. The delivery staffs k and l return from the parking lot B to the parking lot A (3). When returning to the parking lot A, the delivery staff k moves to the parking lot C after boarding the remaining delivery item. Further, the delivery staff l gets on the delivery car 1 as it is and moves to the parking lot C (4). In the parking lot C, the delivery staff k parks the delivery item in the parking lot C, and gets on the delivery vehicle 1 driven by the delivery staff l. The delivery staffs k and l return from the parking lot B to the parking lot A (5). When delivery is performed in such a procedure, the user's request can be satisfied. In the present embodiment, the delivery method in such a situation is formulated as a minimum cost flow problem of the spatio-temporal network model, and a method that minimizes the cost among the feasible delivery methods is obtained.

FIG. 3 is an example of a spatiotemporal network model according to the delivery plan in the first embodiment of the present invention.
FIG. 3 is a diagram in which the delivery example described in FIG. 2 is modeled as a spatio-temporal network. The vertical axis in FIG. 3 indicates the passage of time, and the horizontal axis indicates the location of each base. In the figure, the points on the spatiotemporal represent each base at each time. In the figure, an arrow connecting two points indicates movement of a delivery item, a delivery vehicle (delivery means), and a delivery staff (person) in time and space. Each arrow represents a movement source base, a movement destination base, and a time required for movement. A solid line arrow indicates movement between bases, and a double line arrow indicates a delivery, a delivery vehicle, and a delivery staff who stay at the same base (moving time). In addition, each element of the matrix displayed along with each arrow indicates the quantity of deliveries, delivery vehicles, and delivery staff moved by the delivery indicated by the arrow, and the quantity of deliveries moved in order from the top. Indicates the number of delivery vehicles and the number of delivery staff moved. For example, the solid line arrow 31 indicates that there are 0 deliveries, 1 delivery vehicle, 2 delivery staff members, and a move from time t = 0 to t = 1 from the center to parking lot A. Yes. The double line arrow 32 indicates that in the parking lot A, there were 2 deliveries, 0 delivery vehicles, 0 delivery staff, and stayed from time t = 0 to t = 1. . Also, in the case of the solid line arrow 33, the fact that one piece of delivery, one piece of delivery car, two delivery staff members, and movement from time t = 1 to t = 2 from the parking lot A to the parking lot B Show. The double line arrow 34 indicates that in the parking lot A, one delivery item, zero delivery vehicle, zero delivery staff, and time t = 1 to t = 2. . The reason that the delivery items in the parking lot A have changed from two to one is that the delivery staff boarded one of the two deliveries and moved to the parking lot B. The same applies to the other arrows. One arrow is called a branch. The set of branches in FIG. 3 corresponds to the delivery plan described in FIG. When delivering a delivery item, there may be a time-related action such as waiting for a delivery staff member or delivery means at some parking lot. In existing mathematical models related to delivery planning, models are often modeled with bases as points and the movement of delivery vehicles between bases as branches. In this embodiment, modeling is performed using a two-dimensional next space network. Thereby, not only the spatial movement between bases but the movement of a vehicle or a person who intervenes time can be expressed.

In this embodiment, a delivery plan that minimizes the cost of delivery in a delivery plan delivery that satisfies the demand within the time limit described with reference to FIGS. 2 and 3 is obtained. This problem can be formulated as an integer programming problem shown below.
[Objective function]
Minimize the total cost of deliverables, delivery methods, and delivery staff [Restrictions]
(1) The flow rate at each site satisfies the flow rate conservation law.
(2) The number of vehicles in the parking lot does not exceed the parking space of the parking lot.
(3) A delivery staff is always on the delivery means except at the departure base.
(4) A delivery staff always rides on a delivery or delivery means when moving, and the number of people at the time of movement is less than or equal to the total number of people who can board the delivery and delivery means.

  In order to solve the integer programming problem, the delivery plan generation unit 12 generates branches between points related to delivery as illustrated in FIG. 3 based on the initial condition information received by the initial condition setting unit 11. Then, a plurality of sets of branch information that can deliver the delivery to the base where the demand quantity is set are generated so as to satisfy the demand quantity of each base within the delivery deadline. Then, the delivery plan generation unit 12 selects a set of branch information that minimizes the cost from a set of multiple branch information. Note that more specific contents of the objective function and the constraint conditions are exemplified in the second embodiment.

FIG. 4 is an example of a flowchart of a delivery plan generation process in the first embodiment of the present invention.
First, the delivery staff who performs the delivery plan inputs the initial conditions of the delivery plan to the delivery plan device 10. The input / output unit 13 receives the input, and outputs the received information to the initial condition setting unit 11. The initial condition setting unit 11 acquires information on initial conditions input by the delivery staff (step S11). The initial condition setting unit 11 sets the acquired initial condition information as the initial condition of the delivery plan. The initial conditions are, for example, the supply quantity (remaining quantity) at each base, demand quantity (shortage quantity), the number of delivery vehicles at the departure base, the number of delivery staff, and between each base. The travel time, delivery deadline, etc.
Next, the delivery plan generating unit 12 generates branch information so as to satisfy the above constraint conditions on the spatio-temporal network model illustrated in FIG. A plurality of sets of branch information for performing is generated (step S12).
Next, the delivery plan production | generation part 12 calculates cost for every set of the produced | generated branch information (step S13). For example, the unit cost generated per unit time for each delivery vehicle, delivery staff, and delivery item is recorded in the storage unit 14 in advance, and the delivery plan generation unit 12 determines the unit cost of the delivery vehicle, delivery staff, and delivery item. Multiply the time indicated by each branch to calculate the cost for each branch (sum of costs for delivery vehicles, delivery staff, and delivery items). The delivery plan generation unit 12 calculates the cost for each branch included in the set of branch information and totals them. The total cost is the cost for one set of branch information. The delivery plan generation unit 12 calculates the cost for each set of all branch information.
Next, the delivery plan generation unit 12 compares the calculated costs for each calculated set, and selects a set of branch information that minimizes the cost (step S14). The set of selected branch information represents the movement of delivery items, delivery means, and delivery staff over time from the state of the departure location and each delivery location indicated by the initial conditions (FIG. 3). Therefore, if delivery is executed based on a set of branch information, delivery according to demand from the user becomes possible. That is, this set of branch information is a delivery plan to be obtained.

  Mathematical models and programs for delivery plans that have existed so far are limited to loading and delivering deliveries on transportation means such as trucks and railroads. For cases involving onboard transportation such as vehicle delivery, existing technology may be solved by adding constraints, but the constraints are complicated and the number of means and route combinations It is considered impractical to increase exponentially. According to the present embodiment, when calculating a delivery plan for a deliverable that can be boarded and transported, the cost is minimized among feasible delivery methods by formulating it as a minimum cost flow problem of a spatio-temporal network model. A delivery plan can be requested.

<Second embodiment>
Hereinafter, a delivery planning system according to a second embodiment of the present invention will be described with reference to FIGS.
In the second embodiment, a graph within the delivery base (point information and branch information representing movement of delivery staff, delivery items, delivery means) is further added to the spatiotemporal network model of the first embodiment. As a result, the delivery base can be handled as a 0-1 integer programming problem. Since the variable width of the 0-1 integer programming problem is more limited than that of the integer programming problem, the number of combinations is reduced, and the calculation time can be increased. Furthermore, in the second embodiment, a cut is added to further speed up the calculation. In the second embodiment, it is possible to insert a more effective cut by subdividing the movement in the delivery base.

FIG. 5 is a functional block diagram showing an example of a delivery plan system in the second embodiment of the present invention.
Of the configurations according to the second embodiment of the present invention, the same components as those constituting the delivery planning device 10 according to the first embodiment of the present invention are denoted by the same reference numerals, and description thereof is omitted.
The delivery plan apparatus 10a according to the second embodiment includes a delivery plan generation unit 12a instead of the delivery plan generation unit 12 in the configuration of the first embodiment.
In addition to the functions of the delivery plan generation unit 12, the delivery plan generation unit 12a sets point information that combines the entrance and time of the delivery base for each delivery base, and sets the exit and time of the delivery base. Point information and point information in which time is set for each delivery item related to the delivery base are generated, and the flow rate of the delivery staff and the delivery item between the point information related to the entrance and the point information related to the delivery item Is set to 0 or 1. Further, the delivery plan generating unit 12a sets the value of the flow rate of the delivery staff and the delivery item between the point information related to the exit and the point information related to the delivery item to 0 or 1.

Here, parameters input by the delivery planner to the delivery planning apparatus 10a will be described. Input parameters include the following items.
That is, a set of departure bases (Depot), a set of delivery bases (W), a delivery deadline (dl), a time of one section (h), a set of delivery item types (P), and a set of delivery vehicle types (D ), Loading capacity (cp) of the delivery means, cost cx (yen / min) of the delivery item, cost cy (yen / min) of the delivery vehicle, cost cz (yen / min) of the delivery staff, travel time matrix M (for example, , The moving time from the delivery base w1 to w2 by the delivery means d is m [d] [w1] [w2]), the supply quantity supply at each base (for example, the supply quantity of d at the delivery base w is supply [w] , D]), the demand quantity demand of each delivery base (for example, the demand quantity of d at the delivery base w is demand [w, d]). The initial condition setting unit 11 acquires these parameters and sets them as initial conditions for the delivery plan.

  As output items, the delivery plan generation unit 12a outputs the flow rate x ((v, s), (w, t)) of the delivery items flowing through the spatiotemporal network in the optimized delivery plan, and the flow rate y ( (V, s), (w, t)) and delivery staff flow rate z ((v, s), (w, t)) are output to the input / output unit 13. Note that a branch that departs the delivery base v at time s and arrives at the delivery base w at time t is represented by ((v, s), (w, t)). The output items include other costs for delivery.

FIG. 6 is a first diagram for explaining a spatio-temporal network model according to a delivery plan in the second embodiment of the present invention.
A space-time network used in the second embodiment will be described with reference to FIG. Hereinafter, the place set is N, the time set is T, and the spatiotemporal network graph G = (V, E). V is a point set and E is a branch set. The point set V is defined as follows.
V = {(w, d, p, t) | wεW, dε {0} ∪P, pεS _wd , tεT}
Here, S _wd = {0, 1} (d = 0), S _wd = {0, 1,. . . , M} (d ≠ 0). d = 0 indicates the way of the entrance / exit of the delivery base. When d = 0, S _wd takes a value of 0 or 1, but S _wd = 0 indicates an entrance and S _wd = 1 indicates an exit. In addition, in the case of d ≠ 0, d indicates the type of delivery _{products, S wd} takes the value of 0~m. m is the supply quantity-1 or the demand quantity-1 with respect to the delivery d of the delivery base w. For example, when there are three delivery items a at the delivery base w (supply quantity = 3), S _wd takes values of 0, 1, and 2. Further, for example, when there are not four deliverables a at the delivery base w (demand quantity = 4), _Swd takes values of 0, 1, 2, and 3. For a certain delivery base w, a point where d = 0 is also called a road, and a point where d ≠ 0 is also called a port. The port indicates a place where one delivery item d is placed.

FIG. 6 shows Depot = {0}, W = {1,2}, P = {a}, T = {0,1,2}, S _1a = {0} (Supply to delivery a at delivery base 1 1 is a spatio-temporal network in the case of S _2a = {0} (1 demand quantity for delivery item a at delivery base 2). Next, the branch set E will be described with reference to FIG.

FIG. 7 is a second diagram illustrating the spatiotemporal network model according to the delivery plan in the second embodiment of the present invention.
Hereinafter, the branch set E is defined as E = E _x ∪E _y ∪E _z . E _x is a branch set of delivery items, E _y is a branch set of delivery means, and E _z is a branch set of delivery staff.
The branch set Ex of the _deliverable is defined as follows.
_{E x = E wwx ∪E wx ∪E} wpx ∪E pwx ∪E px
E _wwx is a set of branches indicating the movement of the delivery item between the bases, E _wx is a set of branches (such as waiting) remaining on the road of the delivery _point of the delivery item, and E _wpx is a movement of the delivery item from the road to the port A set of branches, E _pwx, is a set of branches indicating movement of the delivery from the port to the road, and E _px is a set of branches where the delivery remains at the port.

The branch set E _y of the delivery means is defined as follows.
E _y = E _wwy ∪E _wy ∪E _wpy ∪E _pwy
E wwy shows a set of branches showing the movement between the base of the delivery means, the set of E _wy branches that remain in the way of delivery base of the delivery means (such as waiting), the movement of the _E wpy is to port from the way of the delivery means A set of branches, E _pwy, is a set of branches indicating movement from the port of the delivery means to the road.

The branch set E _z of the delivery staff is defined as follows.
_{E z = E wwz ∪E wz ∪E} wpz ∪E pwz
E _wwz is a set of branches indicating movement between delivery staff bases, E _wz is a set of branches (such as waiting) remaining on the delivery staff delivery base road, and E _wpz is movement from the delivery staff road to the port. A set of branches, E _pwz, is a set of branches indicating the movement of the delivery staff from the port to the road.

FIG. 7 shows a display example of the branch set defined above. Diagonal solid arrows indicate branches corresponding to the respective sets of _{Ewx, Ewwy, and Ewwz} . A vertical double line arrow indicates a branch corresponding to each set of E _wx, E _{wy, and} E _wz . The two-dot chain arrows in the horizontal direction indicate branches corresponding to the respective sets of E _wpx, E _{wpy, and} E _wpz . The one-dot chain line arrows in the oblique direction indicate branches corresponding to the respective sets of E _pwx, E _{pwy, and} E _pwz . A vertical dashed arrow indicates a branch corresponding to a set of _Epx .
In this embodiment, the inside of the delivery base is treated as a 0-1 integer problem. However, a horizontal two-dot chain arrow, a diagonal one-dot chain arrow, and a vertical broken arrow branch are related to the 0-1 integer problem. The branches are added in the present embodiment.

FIG. 8 is a third diagram illustrating the spatiotemporal network model according to the delivery plan in the second embodiment of the present invention.
The flow vector set for each branch will be described with reference to FIG. As shown in FIG. 8A, each branch e has a flow vector.

Is set. Of these flow vectors, x [d, e] (dεP, eεE _x ) is the flow rate of the delivery, y [d, e] (dεD, eεE _y ) is the flow rate of the delivery vehicle, z [e] (eεE _z ) indicates the flow rate of the delivery staff. Here are some examples: When P = {a} and D = {car}, the flow vector is

It becomes. The branch e shown in FIG. 8B shows the movement of one a, one delivery vehicle, and two delivery staff (persons). When P = {a, b} and D = {car, bike}, the flow vector is

It becomes. The branch e shown in FIG. 8C indicates the movement of one a, one b, one delivery vehicle, one motorcycle, and two delivery staff (persons).

FIG. 9 is a fourth diagram illustrating the spatiotemporal network model according to the delivery plan in the second embodiment of the present invention.
FIG. 9 shows that the flow vector is

This is a spatio-temporal network model when one delivery item a is moved from the delivery base 1 to the delivery base 2. First, two delivery staff and one delivery vehicle move from the Depot exit to the delivery base 1 (solid arrow 91). At the delivery base 1, one delivery staff moves to the place (port 0) for the delivery item a (two-dot chain arrow 92). In addition, at port 0 of delivery item a, delivery item a exists from time 0 to time 1 (broken line arrow 93). Subsequently, one delivery staff and one delivery item a move to the exit of the delivery base 1 (one-dot chain arrow 94). Next, one delivery item a, one delivery vehicle, and two delivery staff move from the exit of the delivery base 1 to the entrance of the delivery base 2 (solid arrow 95). Next, one delivery staff and one delivery item a move to port 0 of the delivery base 2 (two-dot chain arrow 96). Subsequently, one delivery staff moves from port 0 to the exit of delivery base 2 (one-dot chain arrow 97). Next, two delivery staff and one delivery vehicle move from the exit of the delivery base 2 to the Depot entrance (solid arrow 98). At port 0 of the delivery base 2, a delivery item a exists from time 2 to time 3 (broken line arrow 100). As shown in FIG. 9, in the present embodiment, at the delivery base 1 and the delivery base 2, points are assigned to each delivery item a1 and points are assigned to the entrance and the exit of the delivery base. Therefore, the value of each element of the flow vector in the delivery base 1 and the delivery base 2 is 0 or 1. As a result, the inside of the delivery base can be handled as a 0-1 integer programming problem, and the calculation time can be increased.

FIG. 10 is a fifth diagram illustrating the spatiotemporal network model according to the delivery plan in the second embodiment of the present invention.
FIG. 10 is a space-time network model in which the space-time network model illustrated in FIG. 3 of the first embodiment is represented by the method of the second embodiment. In the present embodiment, the point set represented by the parking lot A column in FIG. 3 is further subdivided into (1, 0, 0, 0), (1, a, 0, 0), (1, a, 1). , 0) is represented by a point set in each column. The same applies to parking lot B and parking lot C. In addition, a point set corresponding to the entrance / exit is given to each of the center and the parking lots A to C.

  Next, a description will be given of a cut that further increases the calculation time. In an integer programming problem, an inequality that can be satisfied by a feasible region point is called a valid inequality. Since the integer programming problem is difficult to solve, it is often handled as a linear relaxation problem excluding the integer condition. Adding a reasonable inequality that reduces the solution space of a linear relaxation problem is called adding a cut. By adding a cut, the linear relaxation solution approaches an integer optimal solution, which has a powerful effect on speeding up the calculation. Further, since the feasible area is not cut by adding the cut, the optimality of the solution is guaranteed.

FIG. 11 is a first diagram illustrating an example of a cut in the second embodiment of the present invention.
FIG. 11 is a diagram illustrating a cut relating to the number of delivery vehicles leaving a road with a supply.
E ₁ indicates a set of branches entering the road, and E ₂ indicates a set of branches exiting the road. From constraint conditions 5 and 6 to be described later, the following expression (A) is established.

Formula (A) is a cut with respect to the number of delivery vehicles leaving the road with supplies. The right side of the formula (A) indicates that the value after α is divided by β−1 is rounded up. The following formula is the same.
Here, α represents the maximum number of people that can be boarded in all deliverables. β represents the maximum possible number of passengers in all delivery vehicles.

FIG. 12 is a second diagram illustrating an example of a cut in the second embodiment of the present invention.
FIG. 12 is a diagram illustrating a cut relating to the number of delivery vehicles that enter a road with a demand item.
E ₁ indicates a set of branches entering the road, and E ₂ indicates a set of branches exiting the road. From the constraint conditions 5 and 6 described later, the following expression (B) is established.

Formula (B) is a cut relating to the number of delivery vehicles entering the road where there is a demand item.
Here, α represents the maximum number of people that can be boarded in all deliverables. β represents the maximum possible number of passengers in all delivery vehicles.

FIG. 13 is a third diagram illustrating an example of a cut according to the second embodiment of the present invention.
FIG. 13 is a diagram illustrating a cut relating to the number of delivery vehicles that are to be delivered from a road with supplies until time t. Note that exiting before time t means exiting before time t-1.
E ₁ is a set of branches that enter the road by time t, E ₂ is a set of branches that leave the road by time t, and E ₃ is a set of vertical branches of the ports that exit at time t. From constraint conditions 5 and 6 to be described later, the following expression (C) is established.

  Formula (C) is a cut relating to the number of delivery vehicles coming out from a road with supplies until time t.

FIG. 14 is a fourth diagram illustrating an example of a cut according to the second embodiment of the present invention.
FIG. 14 is a diagram for explaining a cut relating to the number of delivery vehicles coming after time t from a road with a demand item.
E ₁ is a set of branches that enter the road by time t, E ₂ is a set of branches that leave the road by time t, and E ₃ is a set of vertical branches of the ports that enter at time t. From constraints 5 and 6 described later, the following expression (D) is established.

  Formula (D) is a cut relating to the number of delivery vehicles coming out from a road with a demand item until time t.

FIG. 15 is a fifth diagram illustrating an example of a cut according to the second embodiment of the present invention.
FIG. 15 is a diagram illustrating a cut obtained by extending the cut described in FIGS. 11 and 13.
E ₁ is a set of branches that exit from the road by time t, E ₂ is a set of branches that enter the road by time t, and E ₃ is a set of vertical branches of the ports that exit at time t. e ₄ shows a set of branches of the vertical of the road entering in the time t. The following inequalities (cuts) (E) are derived by mathematical operation of constraint equations similar to those described in FIGS. On the road with supply quantity a,

  Is established.

FIG. 16 is a sixth diagram illustrating an example of a cut according to the second embodiment of the present invention.
FIG. 16 is a diagram illustrating a cut obtained by extending the cut described with reference to FIGS. 12 and 14.
E ₁ is a set of branches entering the road after time t, E ₂ is a set of branches leaving the road at time t, and E ₃ is a set of vertical branches of the ports entering at time t. e ₄ represents a set of vertical branches of the road exiting at time t. The following inequalities (cuts) (F) are derived by the mathematical operations of the constraint equations similar to those described with reference to FIGS. On the road with supply quantity a,

  Is established.

FIG. 17 is a seventh diagram illustrating an example of a cut according to the second embodiment of the present invention.
FIG. 18 is an eighth diagram illustrating an example of a cut according to the second embodiment of the present invention.
The cut which works between a road and a port is demonstrated using FIG.
x (e) indicates the number of deliveries on the branch e, and z (e) indicates the number of persons on the branch e. FIG. 18 is a table summarizing the relationships among z (e ₁ ), x (e ₂ ), x (e ₃ ), and x (e ₄ ). For example, if the delivery staff does not enter the port from the road, there is no change in the number of deliveries at the port. In addition, when the delivery staff enters the port from the road, the number of deliveries at the port always changes. For example, if x (e ₂ ) is 1, it means that the delivery item has been taken out. Further, for example, if x (e ₄ ) is 1, it indicates that a delivery item has been brought. The following formula is obtained from the table of FIG.
_{z (e 1) -x (e} 2) + x (e 3) -x (e 4) = 0
This is the cut that works between the road and the port. By adding this cut, there is no need to perform calculations when the delivery staff enters and leaves the port without meaning.

  Also, monotonically increasing cuts can be added to ports with demand. The monotonous increase cut defines that the number of deliveries only increases from 0 to 1 at a port in demand, and does not increase from 0 to 1 and then return to 0 again.

  Also, a monotonically decreasing cut can be added to a port with supply. A monotonically decreasing cut specifies that the number of deliverables only decreases from 1 to 0 at a port where there is a supply, and does not increase from 1 again to 1 after decreasing from 1 to 0. .

  In addition, it is possible to add a cut that determines the order in which the request is satisfied at the port in demand. Specifically, a condition is added that the branch from the road to the port in demand is brought in ascending order of the port number.

  In addition, it is possible to add a cut that determines the order in which a request is satisfied at a port with a supply. Specifically, a condition is added in which branches from a port with a supply to a road are taken in ascending order of port numbers.

FIG. 19 is a ninth diagram illustrating an example of a cut according to the second embodiment of the present invention.
FIG. 20 is a tenth diagram illustrating an example of a cut according to the second embodiment of the present invention.
The cut of the number of delivery vehicles will be described with reference to FIGS.
E ₁ is a set of branches entering the road at time t, e ₂ is a branch entering the port from the road at time t, and e ₃ is a branch entering the road from the demanded port at time t−1. FIG. 19 is a table summarizing the relationship between z (e ₁ ), z (e ₂ ), and y (E ₁ ). y (E) indicates the total number of delivery vehicles of each branch of the branch set E, and z (e) indicates the number of persons on the branch e. The following formula is obtained from the table of FIG.
z (e ₁ ) ≦ z (e ₂ ) + y (E ₁ )
This formula is a cut of the number of delivery vehicles.

FIG. 21 is an eleventh view illustrating an example of a cut according to the second embodiment of the present invention.
FIG. 21 shows an example of the result when the linear relaxation problem is solved without cutting the number of delivery vehicles described in FIGS. As shown in the figure, when the cut of the number of delivery vehicles is not applied, there is a possibility of coming with 3/4 delivery vehicles. However, in reality, more than one delivery vehicle should come.

FIG. 22 is a twelfth diagram illustrating an example of a cut according to the second embodiment of the present invention.
FIG. 22 shows an example of the result when the linear relaxation problem is solved by adding the cut of the number of delivery vehicles described in FIGS. As shown in the figure, when the number of delivery vehicles is cut, one or more delivery vehicles must come. 21 and 22, it can be seen that by adding a cut, an unrealistic case where the deliverer comes in 3/4 units can be excluded from the calculation target.

  By adding a cut in this way, the range of the solution is limited, and the calculation is speeded up. Specifically, for an integer programming problem that took several hours or more when no cut was added to solve the problem, it became possible to solve in a matter of minutes when adding a cut including those exemplified above. .

  As described above, as a countermeasure against the speeding up of the process in the second embodiment, the delivery base is set as a 0-1 integer programming problem and the addition of a cut has been described. Next, the objective function and constraints of the integer programming problem will be described in detail from the first embodiment. Further, as a delivery means, a case where delivery is performed by a delivery vehicle and a bicycle (including a case where delivery is performed only by a delivery vehicle) and a case where delivery is performed by a truck will be described. In addition, the delivery staff bicycle rides on the bicycle and moves to the delivery base where the supply is supplied, where the surplus vehicles are loaded on the bicycle, and the delivery staff drives the surplus vehicles and moves to the delivery base in demand. To be used.

First, the objective function will be described. In the first embodiment, the case where cost is minimized has been described as an example. In the present embodiment, description will be given including the case where the travel time required for delivery is minimized.
(When delivering by delivery car and bicycle)
1. The objective function in the case of minimizing the cost for delivery is assumed to be the cost per hour for each of the deliverables, delivery vehicles, and delivery staff multiplied by the travel time.
2. It is assumed that the objective function for minimizing the travel time required for delivery is the sum of the travel times of deliveries, delivery vehicles, and delivery staff.

(When delivering by truck)
1. Assume that the objective function for minimizing the cost for delivery is the cost per hour for each of the delivery truck and delivery staff multiplied by the travel time.
2. It is assumed that the objective function for minimizing the travel time for delivery is the sum of the travel times of the delivery truck and delivery staff.

Next, restrictions will be described.
(Common for delivery by delivery car and bicycle and delivery by truck)
1. Flow Conservation Law (1) About Flow Rate of Deliverables At the start of delivery, the flow rate exiting from the port where the supply exists is 1. At the time of delivery completion, the flow rate entering the port where demand exists is 1. In other respects, the outgoing flow rate and the incoming flow rate are equal.

(2) Flow rate of delivery vehicles At the time of delivery start, the flow rate from the road where delivery vehicles exist is equal to the number of delivery vehicles. At the time of completion of delivery, the flow rate entering the road where the delivery vehicle exists is equal to the number of delivery vehicles. In other respects, the outgoing flow rate and the incoming flow rate are equal.
(3) Flow rate of delivery staff At the start of delivery, the flow rate from the road where the delivery staff exists is equal to the number of delivery staff members. At the time of completion of delivery, the flow rate entering the road where the delivery staff exists is equal to the number of delivery staff. In other respects, the outgoing flow rate and the incoming flow rate are equal.
2. The amount of movement of goods and people in the capacity-constrained delivery base is 1 or less.

3. Restriction 1 in delivery base
∀e∈E _wp (E _wp is illustrated in FIG. 23)
(1) When the destination of e is the supply point of d The delivery does not enter the port from the road.
(2) When the destination of e is the demand point of d The flow rate of the delivery item and the delivery staff takes the same value (0 or 1).
(3) In both cases, the number of bicycles is less than the number of delivery staff.

4). Restriction 2 in delivery base
∀e∈E _pw (E _pw is illustrated in FIG. 23)
(1) When the starting point of e is the supply point of d The flow rate of the delivery item and the delivery staff takes the same value (0 or 1).
(2) When the starting point of e is the demand point of d The delivery does not go out from the port on the road.
(3) In both cases, the number of bicycles is less than the number of delivery staff.

The following description is divided into a case of delivery by delivery vehicle and bicycle and a case of delivery by truck.
(When delivering by delivery car and bicycle)
5. Restrictions on branches when moving from one base to another base ∀e∈E _ww
(1) When e is a branch of a bicycle and a branch of a car There are cases where a delivery staff rides on each of the bicycle and the car, and there are cases where the bicycle is loaded on the car and moved. There are restrictions that the delivery staff must ride, that the number of delivery staff is less than the number of passengers that can be boarded, and that the number of bicycles that cannot be driven is less than or equal to the number that can be loaded in the car.
(2) When e is a bicycle branch but not a car branch (moving by bicycle)
The number of bicycles matches the number of people.

6). Restrictions on branches staying in the delivery base The restriction is that a person must be in the car, and that the person must be less than the number of passengers.

(When delivering by truck)
5. Restrictions on branches when moving from a delivery base to another delivery base The delivery staff must be on the truck, the number of delivery staff must be less than the number of passengers, and the total volume of deliveries must be less than the load capacity of the truck. It is a constraint.

6). Restrictions on branches remaining in the base Restrictions are that the number of delivery staff is less than the number of passengers that can be boarded, and that the total volume of deliveries is less than the load capacity of the truck.

  In step S12 of FIG. 4, the delivery plan generation unit 12a generates a spatiotemporal network model in which the delivery base is divided into roads (d = 0) and parking ports (d ≠ 0). The branch information is calculated using the added cut. According to this embodiment, since the inside of the delivery base can be modeled as a 0-1 integer planning problem, in addition to the effect of the first embodiment, the effect that the time required for calculating the delivery plan can be reduced is obtained. . Furthermore, the calculation time can be significantly shortened by adding a cut. Thereby, for example, it is possible to compare delivery plans calculated under various initial conditions, and to select a delivery plan at a lower cost, thereby improving the convenience of the planner.

Next, a case where a delivery plan is calculated by the delivery planning apparatus 10a of the present embodiment will be described.
FIG. 24 is a diagram showing a problem example of a delivery plan in the second embodiment of the present invention.
A point 0 (depot) in FIG. 24 is a starting point. Other points 1 to 9 are delivery bases. For example, “d1: 2” at point 7 indicates that there are two deliveries d1 remaining, and “d2: −1” at point 5 indicates that one delivery d2 is insufficient. It shows the state. In addition, “d1: −1, d2: 1” at point 2 indicates a state where one delivery item d1 is insufficient and one delivery item d2 is left. Consider the problem of delivering the deliverables d1 to d3 so that the delivery items d1 to d3 are not insufficient at each delivery base from the situation where the delivery items d1 to d3 shown in FIG. 24 are ubiquitous. Examples of delivery plans calculated by the delivery planning apparatus 10a for the cases of delivery by car and bicycle and delivery by truck are given below.

1. When delivering by car and bicycle (1) Input / depot includes 1 delivery vehicle, 3 bicycles, 3 delivery staff, delivery deadline: 120 minutes, delivery vehicle cost: 1.5 yen / minute, delivery staff Cost: 17 yen / min ・ d1, d2, d3 cost: 1.5 yen / min ・ Number of passengers in delivery vehicle: 4 people, Bicycle capacity: 1 vehicle ・ D1 passenger capacity: 1 person , Number of bicycles that can be loaded: 0 ・ Number of people that can be boarded in d2: 4 people, Number of people that can be loaded in bicycles: 1 ・ Number of people that can be boarded in d3: 2 people, Number of bicycles that can be loaded: 0

(2) Objective function Cost minimization (3) Delivery as shown in FIG. 25 with one output / delivery vehicle, one bicycle, and two delivery staff.
-Delivery cost: 2768 yen-Required time: 60 minutes In this way, a delivery plan that minimizes costs within the conditions of delivery means, delivery staff, and delivery deadline set in the initial conditions could be obtained.

FIG. 25 is a first diagram illustrating an example of a delivery plan planning result according to the second embodiment of the present invention.
FIG. 25 shows a delivery plan for delivery vehicles d1 to d3 that minimizes the cost. According to the delivery plan calculated by the delivery planning apparatus 10a, delivery is performed by being divided into two routes, that is, a delivery route 1 indicated by S1 to S7 and a delivery route 2 indicated by T1 to T9. The delivery staff in charge of the delivery route 1 moves in the order of S1 to S7 and performs delivery. The delivery staff in charge of the delivery route 2 moves in the order of T1 to T9 and performs delivery. Note that the delivery staff of the delivery route 1 and the delivery staff of the delivery route 2 meet at the delivery base 7 and move together from the delivery base 7 to the delivery base 2. Although not shown in FIG. 25, for example, for S1, the delivery flow rate x ((depot, departure time), (delivery base 3, arrival time)) = 0, delivery vehicle flow rate y ((Depot, departure time), (delivery base 3, arrival time)) = 1, delivery staff flow rate z ((depot, departure time), (delivery base 3, arrival time)) = 2 are output as output items. The Using these pieces of information, this delivery plan can be expressed by the spatio-temporal network model illustrated in FIGS.

2. When delivering by truck (1) Input / depot includes 1 truck, 2 delivery staff, delivery deadline: 120 minutes, truck cost: 25 yen / minute, delivery staff cost: 17 yen / minute, truck Loading capacity: 16
・ The volume of d1 is 2, the volume of d2 is 4, and the volume of d3 is 3.

(2) Objective function Cost minimization (3) Output and delivery by one truck and one delivery staff as shown in FIG.
・ Delivery cost: 3456 yen ・ Required time: 80 minutes

FIG. 26 is a second diagram illustrating an example of a delivery plan planning result according to the second embodiment of the present invention.
In FIG. 26, a delivery plan for delivery items d1 to d3 that minimizes the cost is displayed. In the case of the delivery plan of FIG. 26 calculated by the delivery plan device 10a, delivery is performed by the delivery routes indicated by 1 to 9. As in FIG. 25, the output items include departure and arrival time information relating to the movement of each delivery base, delivery items, delivery vehicles, and delivery staff flow rates.

  As illustrated in FIGS. 24 to 26, according to the present embodiment, a delivery plan for minimizing the cost is provided for each case where deliverable items can be delivered by delivery vehicle and bicycle, or delivered by truck. Can be calculated. In addition, the delivery planner considers what delivery means should be used for delivery by comparing delivery plans calculated by setting various initial conditions. be able to. In addition, although the example of the delivery cost minimization has been described, as described above, a delivery plan that minimizes the delivery time can be calculated by using the objective function to minimize the travel time required for delivery. In the above example, there is only one departure base, but it is also possible to calculate a delivery plan when there are a plurality of departure bases. Moreover, although 2nd embodiment is more preferable from a viewpoint of the time which calculation requires, for example, the problem handled by FIGS. 24-26 can be solved with the delivery planning apparatus 10 of 1st embodiment.

  Each process in the delivery planning apparatuses 10 and 10a described above is stored in a computer-readable recording medium in the form of a program, and the program is read and executed by the computer of the delivery planning system. Processing is performed. Here, the computer-readable recording medium means a magnetic disk, a magneto-optical disk, a CD-ROM, a DVD-ROM, a semiconductor memory, or the like. Alternatively, the computer program may be distributed to the computer via a communication line, and the computer that has received the distribution may execute the program.

The program may be for realizing a part of the functions described above. Furthermore, what can implement | achieve the function mentioned above in combination with the program already recorded on the computer system, what is called a difference file (difference program) may be sufficient.
Moreover, the delivery planning apparatuses 10 and 10a may be comprised by one computer, and may be comprised by the some computer connected so that communication was possible.

  In addition, it is possible to appropriately replace the components in the above-described embodiments with known components without departing from the spirit of the present invention. The technical scope of the present invention is not limited to the above-described embodiment, and various modifications can be made without departing from the spirit of the present invention. For example, the present invention can also be applied to delivery, procurement, and after-service patrol of deliverables that can be boarded and transported. It can also be used for delivery of deliveries that are not boarded and transported.

For example, in the after-sales service, it is necessary to provide the service by procuring parts necessary for the after-sales service and then heading to the customer or traveling to a plurality of customers. Products that are used for after-sales service, such as parts that use the delivered goods for after-sales service, such as delivery vehicles necessary for transporting vehicles and parts that are used for transportation by the service person and the delivery means that the service person uses for transportation, etc. When the above mathematical model is applied as the installation location, the integer programming problem can be solved by the method described in the first embodiment to the second embodiment, and the service person performs after-sales service at a plurality of customers. Thus, it is possible to calculate a traveling method (a traveling means, a traveling route) that minimizes the traveling cost and the traveling time. Taking FIG. 2 as an example, parking lot A to parking lot C (delivery base), customer providing after-sales service, vehicle (delivery item) as parts, passenger car (delivery means) means for use by serviceman, A delivery person (delivery subject) may be a service person. In addition, in the case of after-sales service, not only patrols customers but also inspections and repairs at customers. According to the delivery planning apparatuses 10 and 10a using the spatio-temporal network model, the traveling behavior of the service person can be modeled in consideration of these work times.

Note that the cost for delivery and the travel time for delivery are examples of evaluation values. A delivery staff is an example of a delivery subject, a delivery car, a truck, and a bicycle are examples of delivery means, and a shared vehicle in car sharing is an example of delivery.

DESCRIPTION OF SYMBOLS 10, 10a ... Delivery plan apparatus 11 ... Initial condition setting part 12, 12a ... Delivery plan production | generation part 13 ... Input / output part 14 ... Memory | storage part

Claims (15)

Demand quantity and supply quantity of the delivery item for each delivery base where the delivery item, the delivery subject, the delivery item or the delivery means that moves the delivery subject remains, and the initial value of the delivery subject and the delivery means An initial stage for accepting input of information on one or a plurality of departure points indicating the position, information on delivery means and delivery subjects available at the departure point, and information on a delivery deadline, and setting initial conditions in the delivery plan A condition setting section;
The delivery related to the delivery between the point information that is a set of the delivery base and the departure base and the time based on the delivery start, and the two pieces of point information related to delivery of the delivery of the point information Branch information indicating the flow rate of the goods, the delivery subject and the delivery means, and the delivery information satisfying the demand quantity within the delivery deadline is delivered to the delivery base where the demand quantity is set. A delivery plan generator for generating at least one set;
A delivery planning system comprising: The delivery plan generation unit calculates an evaluation value for the generated set of branch information, and determines an optimal set of branch information based on the evaluation value.
The delivery planning system according to claim 1. The said delivery plan production | generation part produces | generates the branch information which shows the said flow volume between the said different delivery bases, and the branch information which shows the said flow volume in the same said delivery base and the said departure base. 2. The delivery plan system according to 2. The delivery plan generation unit includes, for each of the delivery bases, point information relating to an entrance in which the entrance and time of the delivery base are paired, and point information relating to an exit in which the exit and time of the delivery base are paired And point information related to the storage location of the delivery items with the time set for each delivery item related to the delivery base, and between the point information related to the entrance and the point information related to the delivery item The flow rate of the delivery subject and the delivery item between the point information relating to the exit and the point information relating to the delivery item is set to 0 or 1.
The delivery planning system according to any one of claims 1 to 3. The delivery plan generation unit
Setting an objective function that minimizes the cost based on the flow rate and travel time of the delivery subject and the delivery means and the delivery;
For each of the delivery item, the delivery means, and the delivery subject, the difference between the flow rate entering the delivery base and the flow rate exiting is 0.
Each of the flow rate of the delivery item, the flow rate of the delivery means, and the flow rate of the delivery subject is 0 or more;
Each of the flow rate of the deliverable in the delivery base and the flow rate of the delivery subject is 1 or less,
If the flow rate of the delivery item in the delivery base is 1, the flow rate of the delivery subject relating to the flow rate of the delivery item is 1,
The delivery subject always boarding the delivery means when moving from the delivery base to another delivery base;
The number of the delivery subject boarding the delivery means when moving from the delivery base to another delivery base is less than or equal to the number of boardable persons;
The total of the deliverables and delivery means loaded on the delivery means when moving from the delivery base to another delivery base is less than or equal to the amount that can be loaded on the delivery means related to the movement. The delivery subject rides on the delivery means;
When staying within the delivery base, the number of delivery bodies boarding the delivery means is less than or equal to the number of boardable persons;
Solve the integer programming problem that includes
The delivery planning system according to claim 4. The delivery plan generation unit
In place of the objective function for minimizing the cost, an objective function for minimizing the movement time of the delivery subject, the delivery means and the delivery is set.
Solving the integer programming problem to determine the set of branch information;
The delivery planning system according to claim 5. The delivery plan generation unit
A set of branch information is determined by adding a constraint on the delivery means exiting the delivery base that supplies the delivery;
The delivery planning system according to claim 5 or 6. The delivery plan generation unit
A set of branch information is determined by adding a constraint on the delivery means entering the delivery base where the delivery is in demand;
The delivery planning system according to any one of claims 5 to 7. The delivery plan generation unit
Determining the set of branch information by adding a constraint on the relationship between the increase / decrease of the deliverables in the delivery place in the delivery base and the number of delivery subjects entering the place;
The delivery planning system according to any one of claims 5 to 8. The delivery plan generation unit
Determining a set of the branch information by adding a constraint on the increase and decrease of the deliverables in the delivery place in the delivery base;
The delivery planning system according to any one of claims 5 to 9. The delivery plan generation unit
When there are a plurality of places for the delivery items in the delivery base, a set of the branch information is determined by adding constraints on the order of adding and taking out the delivery items for the plurality of places,
The delivery planning system according to any one of claims 5 to 10. The delivery plan generation unit
Adding a constraint on the number of delivery means entering the delivery base to determine the set of branch information;
The delivery planning system according to any one of claims 5 to 11. The delivery item can be moved by the delivery subject,
The branch information calculated by the delivery plan generator includes branch information indicating movement of the delivery by the delivery means, as well as a branch indicating that the delivery subject boarded the delivery and moved the delivery. Information included,
The delivery planning system according to any one of claims 1 to 12. The delivery planning device
Demand quantity and supply quantity of the delivery item for each delivery base where the delivery item, the delivery subject, the delivery item or the delivery means that moves the delivery subject remains, and the initial value of the delivery subject and the delivery means Accepting input of information on one or more departure bases indicating the position, information on delivery means and delivery subjects available at the departure base, and delivery deadline information, setting initial conditions in the delivery plan,
The delivery related to the delivery between the point information that is a set of the delivery base and the departure base and the time based on the delivery start, and the two pieces of point information related to delivery of the delivery of the point information Branch information indicating the flow rate of the goods, the delivery subject and the delivery means, and the delivery information satisfying the demand quantity within the delivery deadline is delivered to the delivery base where the demand quantity is set. Generate at least one set,
Delivery planning method. The computer of the delivery planning device,
Demand quantity and supply quantity of the delivery item for each delivery base where the delivery item, the delivery subject, the delivery item or the delivery means that moves the delivery subject remains, and the initial value of the delivery subject and the delivery means Means for accepting input of information on one or more departure bases indicating the position, information on delivery means and delivery subjects available at the departure base, and delivery deadline information, and setting initial conditions in the delivery plan ,
The delivery related to the delivery between the point information that is a set of the delivery base and the departure base and the time based on the delivery start, and the two pieces of point information related to delivery of the delivery of the point information Branch information indicating the flow rate of the goods, the delivery subject and the delivery means, and the delivery information satisfying the demand quantity within the delivery deadline is delivered to the delivery base where the demand quantity is set. Means for generating at least one set;
Program to function as.

Images