TW201810175A - Delivery planning system, delivery planning method and program - Google Patents

Abstract

The delivery planning system acquires information on delivery items, information on delivery agents, information on demand quantity and supply quantity of deliverables for each delivery base which is the place where either delivery items or delivery means for moving the delivery agents stay, information on one or more departure bases indicating the initial position of the delivery agents and delivery means, information on available delivery means and delivery agents at the starting point, and information on the delivery deadline. The delivery planning system calculates point information in which a departure base and a time based on delivery start time as a reference are paired, point information in which a delivery base and a time based on delivery start time as a reference are paired, and branch information that indicates the flow of delivery items, delivery agents and delivery means relating to delivery between two point information relating to deliveries of delivered items. The delivery planning system generates at least one set of branch information for delivering delivery items satisfying the demand quantity within a delivery time limit to delivery bases with the demand quantity set.

Description

Distribution planning system, distribution planning method and program

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

This application claims priority based on Japanese Patent Application No. 2016-051550 filed in Japan on March 15, 2016, and uses the contents herein.

The demand for vehicle sharing is increasing. The so-called vehicle sharing is, for example, a system in which a vehicle is shared between members and the like, and the cost is borne in accordance with the boarding time, etc., and the vehicle is used at a time of your own preference. As one form of vehicle sharing, there is a use form called a one-ride type (one-way type). In one-ride type vehicle sharing, users use a common vehicle until they reach a specific parking lot near the destination, and can place the car directly in the parking lot. In this form of vehicle sharing, there will be new benefits in delivering vehicles that have been used by users to existing vehicles. Use other parking places as needed.

In addition, in the case of a so-called after-sales service tour in which a salesperson visits a customer in order to perform after-sales service for a product purchased by a customer, the movement of the salesperson and the parts and the like required for the provision of services may also The same thing will happen. For example, in each of a plurality of customers, products are provided as after-sales service objects, and the salesman transfers the parts used in the after-sales service of the product from a certain place and delivers them to the customer. In the course of one tour, a salesman who performs various types of after-sales service will move from a customer who will need the same parts in the provision of services to other customers, and Furthermore, the used parts will be returned to the original place. In this case, it will become necessary to choose an efficient tour method.

In addition, Patent Document 1 discloses a technique for creating a transportation plan for transporting goods to a plurality of delivery destinations at a specified date and time using a plurality of delivery means from a plurality of delivery bases.

[Previous Technical Literature] [Patent Literature]

[Patent Document 1] Japanese Patent Laid-Open No. 2013-136421

In addition, even if it is the distribution of vehicles sharing the vehicle In this case, similarly, if it is a general method such as placing a vehicle on a truck and distributing it, there is a possibility that the technique of Patent Document 1 and the like described above can be applied. However, when a vehicle is being delivered while the vehicle is being shared, there are also methods for causing a delivery person to board the delivery target vehicle and drive to the destination parking lot. This method of delivering goods by boarding the goods themselves is called boarding transportation. From the prior art, for general delivery methods that place goods on a vehicle and distribute them, an optimization method for the delivery route based on a mathematical model is provided. However, no technology has been provided to perform the most appropriate delivery plan for delivery including boarding and transportation.

Similarly, when the parts used in the service are distributed to the customer during the after-sales service tour, if the parts are distributed from the service center to each customer only, the previous technology can be used. Method to build a tour plan, but when the salesperson moves with the parts, or when the parts are delivered from one customer to other customers, or the salesperson takes the extra When the parts come to the next customer, etc., the technology is the same as that of the boarding and transportation, and the most appropriate tour plan for the salesman has not been provided.

In addition, in general, the combination optimization problem of discrete values mostly adopts a method called linear relaxation, that is, once the problem is replaced with a continuous value problem and solved, then the obtained relaxation value is used. It is necessary to find the most suitable solution. However, if there are many complicated restrictions like the distribution problem, it will take too much calculation time if it is directly solved. Therefore, it is necessary to solve the problem. Find the solution in a practical time and design it painstakingly.

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 speed up the calculation time.

According to the first aspect of the present invention, the distribution planning system includes an initial condition setting unit that accepts any one of a distribution means that is a distribution item and a distribution subject, and that moves the distribution item or the distribution subject. The demand quantity and supply quantity of each of the distribution bases of the place where the person stays, and the information of one or a plurality of departure bases representing the initial positions of the aforementioned distribution subject and the aforementioned distribution means, and the aforementioned departure bases Information about the delivery methods and delivery entities that can be used by the premises, as well as information on delivery deadlines. Enter these information and set the initial conditions in the delivery plan; and the delivery plan generation unit calculates the delivery The point information grouped with the starting point and the starting point and the point in time when the start of delivery is used as a basis, and the point information representing the two point information related to the delivery of the delivery item in the foregoing point information are related to the delivery of the delivery Information about the flow of goods and the aforementioned distribution subject and the aforementioned distribution means, and generate at least one A collection of the aforementioned branch information when the distribution items satisfying the aforementioned demand quantity are delivered to the distribution base where the demand quantity is set within the time limit.

In the second aspect of the present invention, the delivery plan generation unit may calculate an evaluation value for the generated branch information, and Based on the evaluation value, the most appropriate set of branch information is determined.

In the third aspect of the present invention, the aforementioned delivery plan generating unit may also generate branch information representing the aforementioned traffic between different aforementioned delivery sites, and represent the same aforementioned delivery site and the aforementioned departure site. Inside the aforementioned traffic branch information.

In the fourth aspect of the present invention, the aforementioned delivery plan generating unit may also generate, for one of the aforementioned delivery bases, the point information associated with the entrance that grouped the entrance and time of the delivery base, and Grouping the exit point and time of the distribution base with point information related to the exit, and point information grouped by time with respect to the distribution place of the distribution point, And the flow of the distribution subject and the distribution between the aforementioned point information related to the entrance and the aforementioned point information related to the distribution, between the aforementioned point information related to the exit and the aforementioned point information related to the distribution The value is set to 0 or 1.

In the fifth aspect of the present invention, the aforementioned delivery plan generating unit may also set an objective function for minimizing the cost based on the aforementioned delivery subject, the aforementioned delivery means, and the flow rate and moving time of the aforementioned delivery object, For each of the aforementioned distribution items, the aforementioned distribution methods, and the aforementioned distribution entities, the integer planning problem including the following restrictions is solved, and the collection of the aforementioned branch information is determined: the amount of incoming and outgoing traffic at the aforementioned distribution base The difference is 0; each of the flow of the distribution items, the flow of the distribution means, and the flow of the distribution subject is 0 or more; each of the flow of the distribution items in the distribution base and the flow of the distribution subject When the flow rate of the distribution item in the distribution point is 1, the flow rate of the distribution subject that is related to the flow rate of the distribution item is 1; move from the distribution point Among the aforementioned distribution means when arriving at other aforementioned distribution bases, the number of persons who have boarded the aforementioned distribution subject absolutely when riding on the aforementioned distribution subject; when moving from the aforementioned distribution base to other aforementioned distribution means , Is the number of passengers that can be carried; the total number of items and means of transportation carried by the means of delivery when moving from the aforementioned distribution point to another of the aforementioned distribution points is the ability of the distribution means related to the movement Below the amount of loading; when staying in the aforementioned distribution base, the aforementioned main distribution system rides on the aforementioned means of distribution; when staying in the aforementioned distribution base, boarding of the aforementioned distribution subject on the aforementioned means of distribution The number of passengers is less than the number of passengers.

In the sixth aspect of the present invention, the aforementioned delivery plan generation unit may also replace the aforementioned objective function of minimizing costs, and set a minimization of the movement time of the aforementioned delivery subject, the aforementioned delivery means, and the aforementioned delivery items. The objective function solves the integer programming problem and determines the set of branch information.

In the seventh aspect of the present invention, the aforementioned delivery plan generation unit may further be related to the restriction conditions of the aforementioned delivery means leaving from the aforementioned delivery base where the aforementioned delivery is provided, and determine the collection of the aforementioned branch information. .

The aforementioned delivery plan generating unit in the eighth aspect of the present invention can also be more related to the demand for entering the delivery items with the aforementioned delivery items. Restrictions on the aforementioned distribution means of the aforementioned distribution base determine the collection of the aforementioned branch information.

In the ninth aspect of the present invention, the aforementioned delivery plan generating unit may be further related to the increase or decrease of the aforementioned delivery at the place where the aforementioned delivery is located in the aforementioned delivery base, and the entry into the placed location. Restrictions on the relationship between the number of the aforementioned distribution entities determine the collection of the aforementioned branch information.

In the tenth aspect of the present invention, the aforementioned delivery plan generation unit may further be related to the restriction conditions for the increase or decrease of the aforementioned delivery items at the place where the aforementioned delivery items are located in the aforementioned delivery base, and Determine the collection of the aforementioned branch information.

In the eleventh aspect of the present invention, the aforementioned delivery plan generating unit may also be more relative to the plural places when there are plural places where the aforementioned delivery items are placed in the aforementioned delivery base. Restrictions on the order in which the distribution items are added and taken out determine the collection of the branch information.

In the twelfth aspect of the present invention, the aforementioned delivery plan generation unit may further determine the collection of the aforementioned branch information by further restricting the number of delivery means.

According to the thirteenth aspect of the present invention, it can also be constituted that the aforementioned distribution object can enable the aforementioned distribution subject to board and move, and in the branch information calculated by the aforementioned distribution plan generating section, the representative information is In addition to the information about the movement of the aforementioned distribution items caused by the aforementioned distribution means, it also includes representing the aforementioned distribution entity to board the aforementioned distribution item and move the distribution item. Information about moving things.

According to the fourteenth aspect of the present invention, the distribution planning method is to cause the distribution planning device to accept any of the distribution means and the distribution subject and the distribution means that moves the distribution subject or the distribution subject to stay The demand quantity and supply quantity of the distribution goods at each of the distribution bases of the site, and information representing one or a plurality of departure bases representing the initial positions of the distribution main body and the distribution means, and the information can be used at the departure base space. Information about the delivery method, the main body of the delivery, and the delivery deadline information, input these information, and set the initial conditions in the delivery plan, and calculate the delivery base and the departure base as well as the start of delivery as At the time of the reference, the grouped point information and the point information representing the two point information related to the distribution of the aforementioned distribution of the aforementioned point information are related to the aforementioned distribution of the aforementioned distribution, the aforementioned distribution subject, and the aforementioned distribution means. Traffic branch information, and at least one will meet the aforementioned demand when within the aforementioned delivery period The distribution of branches was distributed to the set of time positions is set for the case where the distribution of the number of information needs.

According to the fifteenth aspect of the present invention, the program causes the computer of the delivery planning device to function as a means for accepting a person who is a delivery object and a delivery subject and moves the delivery object or the delivery subject The demand quantity and supply quantity of each of the distribution bases of the place where any one of the distribution means stays, and information representing one or a plurality of starting points of the distribution main body and the initial position of the distribution means, And the delivery methods and delivery available at the aforementioned departure bases Main body information and delivery deadline information, input of such information, and means of setting initial conditions in the delivery plan; and calculating the time when the aforementioned distribution base and the aforementioned departure base and the start of distribution are used as a reference The relationship between the grouped point information and the point information representing the two point information related to the distribution of the distribution item mentioned above is related to the flow of the distribution item, the distribution subject, and the distribution means of the distribution item. Means to generate at least one piece of the aforementioned branch information when the distribution items satisfying the aforementioned demand quantity are delivered to the distribution base where the requested quantity is set within the aforementioned delivery period.

According to the above-mentioned distribution planning system, distribution planning method and program, it is possible to establish the situation when the distribution personnel pick up the distribution items existing in various places and deliver to the appropriate distribution destination. Cost or travel time becomes the smallest delivery plan.

10, 10a‧‧‧ distribution plan device

11‧‧‧Initial condition setting section

12, 12a‧‧‧ Delivery plan generation department

13‧‧‧I / O Department

14‧‧‧Memory Department

[Fig. 1] A functional block diagram showing an example of the distribution planning system in the first embodiment of the present invention.

[FIG. 2] It is a figure explaining an example of the delivery plan in the 1st Embodiment of this invention.

[Fig. 3] This is an example of a time-space network model related to the delivery plan in the first embodiment of the present invention.

[Fig. 4] A flowchart showing an example of the process of generating a delivery plan in the first embodiment of the present invention.

[Fig. 5] A functional block diagram showing an example of the distribution planning system in the second embodiment of the present invention.

[Fig. 6] Fig. 6 is a first diagram illustrating a time-space network mode related to a delivery plan in the second embodiment of the present invention.

[Fig. 7] Fig. 7 is a second diagram for explaining a time-space network mode related to a delivery plan in the second embodiment of the present invention.

[Fig. 8] Fig. 8 is a third diagram illustrating a time-space network mode related to a delivery plan in the second embodiment of the present invention.

[Fig. 9] Fig. 9 is a fourth diagram for explaining the time-space network mode of the delivery plan in the second embodiment of the present invention.

[Fig. 10] Fig. 10 is a fifth diagram illustrating a time-space network model related to the delivery plan in the second embodiment of the present invention.

[Fig. 11] Fig. 11 is a first diagram illustrating an example of a cut in the second embodiment of the present invention.

[Fig. 12] Fig. 12 is a second diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 13] Fig. 13 is a third diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 14] Fig. 14 is a fourth diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 15] Fig. 15 is a fifth diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 16] Fig. 16 is a sixth diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 17] Fig. 7 is a seventh diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 18] Fig. 18 is an eighth diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 19] Fig. 19 is a ninth diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 20] Fig. 20 is a tenth diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 21] Fig. 21 is an eleventh diagram illustrating an example of division in the second embodiment of the present invention.

[Fig. 22] Fig. 12 is a diagram showing an example of division in the second embodiment of the present invention.

[Fig. 23] Fig. 23 is a diagram for explaining an example of restrictions in the second embodiment of the present invention.

[Fig. 24] Fig. 24 is a diagram showing an example of a problem with a delivery plan in the second embodiment of the present invention.

[Fig. 25] Fig. 25 is a first diagram showing an example of the establishment result of a delivery plan in the second embodiment of the present invention.

[Fig. 26] Fig. 26 is a second diagram showing an example of the establishment result of the delivery plan in the second embodiment of the present invention.

<First Embodiment>

Hereinafter, a distribution planning system according to one embodiment of the present invention will be described with reference to FIGS. 1 to 4.

FIG. 1 is a functional block diagram showing an example of a distribution planning system in the first embodiment of the present invention. In this embodiment, the delivery planning system is configured by, for example, one PC and a computer device such as a server device. The computer device includes a computing unit such as a CPU (Central Processing Unit), a memory unit such as ROM (Read Only Memory), RAM (Random Access Memory), HDD (Hard Disk Drive), and other interfaces. The hardware, and it constitutes it.

The distribution planning device 10 in FIG. 1 is an example of a distribution planning system. The delivery planning device 10 is a device that calculates delivery methods, delivery routes, and the like that minimize costs for delivery plans that include boarding and transportation. In the present embodiment, as an example, a series is given to illustrate the case where a vehicle commonly used by a user is distributed to a place where the user starts to use the vehicle in a one-ride-type vehicle sharing, and is established to realize The most appropriate delivery method for this delivery. When a delivery item is to be delivered, for example, it is required to select a delivery method and a delivery route that minimize costs. Various methods have been provided so far for the establishment of distribution plans that minimize costs. However, there are some differences in the delivery of vehicles sharing a vehicle from the case where the goods are delivered to a house or the like. That is, in the case of delivery vehicles, Let people ride in the vehicle and move. For example, it is assumed that each of the bases A, B, C, D, and E has an excessive number of vehicles or an insufficient number of vehicles. In this state, in order to move the vehicle from an excessive number of vehicles to an insufficient point to meet the needs of the user, for example, the following general methods may be considered. (1) A delivery person is allowed to tour each base with a truck capable of stowage of vehicles, and the excess vehicles are loaded on the truck and delivered to the base where the vehicle is insufficient. (2) Have a number of delivery personnel board the delivery vehicle and move to each location. If a part of the delivery personnel who took the delivery vehicle arrives at a location where there are too many vehicles, they will transfer to an excess vehicle and drive the vehicle to a location where the vehicle is insufficient to deliver (boarding transportation). In this case, it is not easy to know which delivery method should be used for distribution or which route should be used to minimize the cost. The delivery planning device 10 of this embodiment is a delivery plan for a case where boarding and transportation is possible, and by introducing mathematical modes and restrictions based on mathematical knowledge, it can provide a high-speed and efficient Decide on a method of delivery plan that minimizes costs, for example.

As shown in FIG. 1, the delivery plan device 10 includes an initial condition setting unit 11, a delivery plan generation unit 12, an input / output unit 13, and a memory unit 14.

The initial condition setting unit 11 is used as an initial condition for calculating a distribution plan, and sets a distribution object and a distribution entity that the distribution entity can ride on and move, and a distribution that moves the distribution object or the distribution entity. The demand quantity and supply quantity of each of the distribution bases of the place where any one of the means stays, and the information of one or a plurality of departure bases representing the initial position of the distribution main body and the delivery means, and the departure bases Information about the delivery methods and information of the delivery subject, the delivery deadline information, etc. that the premises can use. These parameters will be described in detail later.

The distribution plan generation unit 12 calculates the point information grouped by the distribution base and the departure base and the time when the distribution start is used as a reference, and the two point information related to the distribution of the distribution item among the representative point information. It is related to the distribution information of the distribution items and the distribution subject and the flow information of the distribution means, and at least one distribution item that meets the demand quantity is distributed to the distribution base set with the demand quantity within the delivery period. A collection of information about the situation at the time. Departure bases and delivery bases are collectively referred to as bases.

The input / output unit 13 accepts an input operation by a user. The input / output unit 13 outputs information such as the distribution plan obtained based on the collection of branch information generated by the distribution plan generation unit 12 to a display or the like.

The storage unit 14 stores various information required in the generation of the distribution plan.

The delivery plan generating unit 12 is implemented by, for example, reading and executing a program from the memory unit 14 by using a CPU (Central Processing Unit, central processing unit) included in the delivery plan apparatus 10.

Fig. 2 is a diagram showing a configuration for the first embodiment of the present invention; Send an example of the plan for illustration.

A description will be given of a delivery example of a delivery item (vehicle) in a one-ride-type vehicle sharing ride using FIG. 2. In FIG. 2, the so-called center refers to a base (departure base) where a delivery person of the delivery exists and starts the delivery of the delivery. In addition, the parking lot A, the parking lot B, and the parking lot C are bases (delivery bases) that become a source of delivery or a destination of delivery. The users of the delivered goods make reservations for the delivered goods through a specific reservation system or the like. The user inputs information such as the number of vehicles to be used for delivery and the place to start use (for example, parking lot B) from the reservation system. When the user wants to use the delivered item from the parking lot B, if the delivered item already exists in the parking lot B, the user can use the delivered item. However, when there are no items to be delivered at the parking lot B, the delivery person needs to move the items from the other parking lot to the parking lot B. In the one-ride-type vehicle sharing, for example, if the user arrives at the parking lot A from the parking lot B by using the delivery, the delivery will be placed directly at the parking lot A. As a result, there may be a situation where there is a lot of distribution items in the parking lot A used by most users. The distribution staff of the center delivers the distributed goods from parking lot A to parking lot C where there is a demand from users. In the case of the example shown in FIG. 2, there are two additional deliveries in parking lot A, and there is a shortage of one delivery lot in parking lot B and parking lot C. The delivery staff of the center will distribute the extra two cars in parking lot A, one for each of parking lot B and parking lot C, and the users will be able to use the delivery as they wish. Figure 2. An example of the realization of distribution will be shown.

First, from the center, two delivery personnel (k, l) board a delivery vehicle 1 (delivery means) and move toward parking lot A (1). At the parking lot A, the delivery person k moves toward the parking lot B on the delivery of one of the two excess cars. In addition, the other delivery person 1 also directly takes the delivery vehicle 1 and moves toward the parking lot B (2). At the parking lot B, the delivery person k stops the delivery at the parking lot B and takes the delivery car 1 driven by the delivery person 1. The delivery personnel k and l return from parking lot B to parking lot A (3). When returning to the parking lot A, the delivery person k moves toward the parking lot C while boarding an extra delivery item. In addition, the delivery person 1 moves directly to the parking lot C by boarding the delivery vehicle 1 (4). At the parking lot C, the delivery person k stops the delivery at the parking lot C, and takes the delivery car 1 driven by the delivery person 1. The delivery personnel k, l return from parking lot B to parking lot A (5). If such a processing program is used for distribution, it can satisfy the requirements of users. In this embodiment, the distribution method of the distribution items in such a situation is formulated as the problem of the minimum cost flow of the time and space network model, and the cost of the feasible distribution method is determined to be the smallest .

FIG. 3 is an example of a time-space network model related to the delivery plan in the first embodiment of the present invention.

FIG. 3 is a diagram after the embodiment of the distribution illustrated in FIG. 2 is modeled as a time-space network.

The vertical axis in FIG. 3 represents the passage of time, and the horizontal axis represents the locations of the bases. In the figure, the points in time and space are Each stronghold. In the figure, the arrows connecting the two points represent the movement in time and space of the delivery object, the delivery vehicle (delivery means), and the delivery person (person). Each arrow represents the time required to move the source base and the target base. The solid line arrows represent movements between the bases, and the double line arrows represent distribution items, delivery vehicles, and delivery personnel (moving in time) staying at the same base. In addition, each element of the matrix additionally displayed at each arrow represents the number of goods, vehicles, and people who moved by the delivery indicated by the arrow, and sequentially represents the movement from the top. The number of items to be distributed, the number of distribution vehicles that have been moved, and the number of distribution personnel that have been moved. For example, in the case of the solid line arrow 31, the representative is from the center to the parking lot A, and during the period from time t = 0 to t = 1, the number of delivery items is 0, the number of delivery vehicles is 1, and the delivery staff Move for 2 people. In addition, the double-line arrow 32 represents a stop at the parking lot A. During the period from time t = 0 to t = 1, two delivery items, zero delivery vehicles, and zero delivery personnel were made. In the case of the solid arrow 33, the representative is from parking lot A to parking lot B. During the period from time t = 1 to t = 2, one delivery item, one delivery cart, and delivery Personnel move for 2 persons. In addition, the double-line arrow 34 represents a stop at the parking lot A during the period from time t = 1 to t = 2, with one delivery item, zero delivery vehicles, and zero delivery personnel. The reason why the number of deliveries in parking lot A changed from two to one is that the delivery staff moved on one of the two deliveries and moved toward parking lot B. The same applies to the other arrows. In addition, one arrow is called a branch. The set of branches in Figure 3 is The counterpart of the distribution plan illustrated in FIG. 2. In the case where a delivery item is delivered, there is a case where a delivery person or a delivery means waits for a time-related action accompanying a parking lot somewhere. In the existing mathematical and physical models related to the distribution plan, many systems are modeled by using the bases as points and the movement of the delivery vehicles between the bases as branches. In this embodiment, it is modeled by a two-dimensional time-space network. With this, not only the spatial movement between the bases, but also the movement of vehicles and people with time in the intermediary.

In this embodiment, it is required to take out the distribution that will minimize the cost of the distribution in the distribution plan that will meet the demand within a limited time, as explained with reference to FIGS. 2 and 3. plan. This problem can be formulated as the integer programming problem shown below.

〔Objective function〕

Minimize the total cost of the items, means, and personnel consumed during delivery

〔limitation factor〕

(1) The flow of each base is in accordance with the principle of flow conservation.

(2) The number of vehicles existing in the parking lot will not exceed the parking space of the parking lot.

(3) In the delivery method, there must be a delivery person at the place other than the departure base.

(4) When moving, there must be a delivery person at the delivery or the means of delivery, and the number of people when moving is to be able to ride on the delivery. And the total number of people in the distribution means.

In order to solve the above-mentioned integer planning problem, the delivery plan generation unit 12 generates information between the points related to delivery as illustrated in FIG. 3 based on the initial condition information accepted by the initial condition setting unit 11. In order to meet the required quantity of each base within the delivery period, a plurality of sets of branch information capable of delivering the delivery to the base where the required quantity is set is generated. Thereafter, the delivery plan generation unit 12 selects the set of branch information that minimizes the cost from the set of plural branch information. In addition, the more specific content of the objective function and the restriction conditions are exemplified in the second embodiment.

FIG. 4 is an example of a flowchart of a process for generating a delivery plan in the first embodiment of the present invention.

First, a delivery person who performs a delivery plan inputs initial conditions for 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 obtains information on the initial conditions input by the delivery person (step S11). The initial condition setting unit 11 sets the information of the acquired initial conditions as the initial conditions of the delivery plan. The initial conditions are, for example, the supply quantity (excess quantity), demand quantity (insufficient quantity) of the distribution items at each site, the number of delivery vehicles at the departure site, the number of delivery personnel, and each site Moving time, delivery deadline, etc.

Next, the delivery plan generation unit 12 is based on the time-space network model illustrated in FIG. 3 in such a manner that the above-mentioned restrictions are satisfied. Branch information is generated, and a plurality of sets of branch information capable of delivering the number of vehicles satisfying the demand of each base before the delivery deadline are generated (step S12).

Next, the delivery plan generation unit 12 calculates a cost for each of the generated sets of each piece of information (step S13). For example, the storage unit 14 records in advance the unit cost incurred per unit time of each of the delivery vehicle, delivery person, and delivery item, and the delivery plan generation portion 12 relates to the delivery vehicle, delivery person, Multiply the unit cost of the item by the time shown by each branch, and calculate the cost of each branch (the total cost of the delivery car, the delivery staff, and the delivery). The delivery plan generation unit 12 calculates the cost of each of the branches included in the branch information collection, and totals these. The total cost is the cost for a collection of branch information. The delivery plan generation unit 12 calculates the costs separately for each of the sets of all branch information.

Next, the delivery plan generation unit 12 compares the calculated costs for each set that has been calculated, and selects a set of branch information whose cost is the smallest (step S14). The selected collection of branch information represents the movement of the distribution goods, distribution means, and distribution personnel due to the passage of time from the state of the starting base and the status of each distribution base shown in the initial conditions (Figure 3). Therefore, if the distribution is performed based on the collection of branch information, the distribution can be performed in accordance with the needs of the user. That is to say, the collection of this branch information is the delivery plan to be retrieved.

Mathematical model and process of the distribution plan that existed so far The method is limited to the case where the delivered goods are stored on a transportation means such as a truck or a railway and delivered. In the case of vehicle-based transportation, as in the case of vehicle distribution, in the existing technology, although it is possible to solve the problem by adding constraints, the constraints are complicated, and the number of combinations of means and routes is complicated. Exponential function increases, so it can be assumed that the system is not practical. According to this embodiment, when calculating the delivery plan of the deliverables that can be transported on board, the minimum cost flow problem as a time-space network model is used to formulate the formula, so that the cost of the feasible delivery method can be obtained. Will be the smallest delivery plan.

<Second Embodiment>

Hereinafter, a delivery planning system according to the second embodiment of the present invention will be described with reference to FIGS. 5 to 26.

In the second embodiment, in addition to the time-space network mode of the first embodiment, charts (representative point information and information on the movement of delivery personnel, delivery items, and delivery means) in the delivery base are further added. As a result, it becomes possible to deal with the issue of the distribution base as a 0-1 integer plan. In the 0-1 integer planning problem, the range of variables is limited compared to the integer planning problem. Therefore, the number of combinations is reduced, and the calculation time can be increased. Furthermore, in the second embodiment, the calculation is further increased by adding a cut. In addition, in the second embodiment, the movement in the distribution base is subdivided, so that more efficient division and insertion can be performed.

FIG. 5 is a functional block diagram showing an example of the distribution planning system in the second embodiment of the present invention.

In the configuration of the second embodiment of the present invention, the same components as those of the functional units constituting the delivery planning device 10 of the first embodiment of the present invention are denoted by the same reference numerals, and the description of each is omitted.

The delivery plan generating device 10a of the second embodiment includes a delivery plan generating unit 12a instead of the delivery plan generating unit 12 in the configuration of the first embodiment.

In addition to the functions of the delivery plan generating unit 12, the delivery plan generating unit 12a generates point information that grouped the entrances and times of the delivery sites for one delivery site, and generated the delivery site. The point information grouped at the exit and time, and the point information grouped one by one for the distribution items related to the distribution base, and the point information related to the entrance and the point related to the distribution item. The value of the distribution personnel and the flow of goods between the information is set to 0 or 1. The delivery plan generation unit 12a sets the value of the flow rate of the delivery person 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, the parameters input by the creator of the delivery plan to the delivery plan device 10a will be described. Among the input parameters, the following items exist.

That is, there are a set of departure points (Depot), a set of distribution points (W), a delivery period (d1), a time interval (h), a set of types of delivery (P), and a delivery vehicle. Collection of species (D), stowage amount of delivery means (cp), cost of delivery cx (circle / minute), cost of delivery vehicle cy (circle / minute), cost of delivery personnel cz (circle / minute), moving time matrix M (For example, the moving time from the distribution site w1 to w2 caused by the distribution means d is set to m [d] [w1] [w2]), and the supply quantity of each site is supply (for example, at the distribution site w The supply quantity of d is set to supply [w, d]), and the demand quantity of each distribution base is demanded (for example, the demand quantity of d at the distribution base w is set to demand [w, d]). The initial condition setting unit 11 obtains these parameters and sets the initial conditions of the delivery plan.

In addition, as an output item, the delivery plan generating unit 12a is a flow x ((v, s), (w, t)), the flow y ((v, s), (w, t)) of the delivery vehicle, the flow z ((v, s), (w, t)) of the delivery person, and output to the input / output unit 13. In addition, it is assumed that the branch which starts from the distribution site v at time s and reaches the distribution site w at time t is represented as ((v, s), (w, t)). In addition, among the output items, there are costs and the like consumed in distribution.

FIG. 6 is a first diagram illustrating a time-space network mode related to a delivery plan in a second embodiment of the present invention.

The time-space network used in the second embodiment will be described using FIG. 6. In the following, the place set is set to N, the time set is set to T, and the graph of the space-time network is set to G = (V, E). V is the point Set, 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 is the road representing the entrance to the distribution base. When d = 0, S _wd takes the value of 0 or 1. However, S _wd = 0 represents the entrance and S _wd = 1 represents the exit. In the case of d ≠ 0, d represents the type of the delivery, and S _wd takes a value from 0 to m. m is the supply quantity -1 or the demand quantity -1 of the distribution item d relative to the distribution base w. For example, when there are three more deliveries a at the delivery site w (supply quantity = 3), S _wd takes values of 0, 1, and 2. In addition, for example, when there are less than four items a (amount of demand = 4) at the distribution site w, S _wd takes the values of 0, 1, 2, and 3. In addition, for a distribution base w, the point where d = 0 is also called a road, and the point where d ≠ 0 is called a port. The port is a place where one delivery item d is placed.

Figure 6 shows when Depot = {0}, W = {1,2}, P = {a}, T = {0,1,2}, S _1a = {0} (as opposed to The time and space network when the supply quantity of distribution item a is 1) and S _2a = {0} (the distribution quantity is 2 relative to the demand quantity of distribution item a). Next, the branch set E will be described using FIG. 7.

FIG. 7 is a second diagram illustrating a time-space network model related to a delivery plan in a second embodiment of the present invention.

Hereinafter, the branch set E is set to E = E _x ∪E _y ∪E _z . E _x is the set of branches of the distribution, E _y is the set of branches of the distribution means, and E _z is the set of branches of the distribution personnel.

The branch set E _{x of the} distribution object is defined as follows.

E _x = E _wwx ∪E _wx ∪E _wpx ∪E _pwx ∪E _px

E _wwx is a collection of branches representing the movement of the distribution bases, E _wx is a collection of branches (waiting, etc.) representing the distribution of goods staying on the road of the distribution base, and E _wpx is a representation of the _followers of the distribution E _pwx is the set of branches moving from the port to the road from the road, and E _px is the set of branches moving from the port to the road.

The branch set E _{y of the} distribution means is defined as follows.

E _y = E _wwy ∪E _wy ∪E _wpy ∪E _pwy

E _wwy is a collection of branches representing the distribution means. E _wy is a collection of branches (waiting, etc.) representing the distribution means staying on the road of the distribution base. E _wpy is a representation of the distribution means. A collection of branches moving from the road toward the port. _Epwy is a collection of branches moving from the port toward the road on behalf of the distribution means.

The branch set E _{z of the} delivery person is defined as follows.

E _z = E _wwz ∪E _wz ∪E _wpz ∪E _pwz

E _wwz is a collection of branches representing the distribution staff's movement between the bases, E _wz is a collection of branches (waiting, etc.) representing the distribution staff staying on the road of the distribution base, E _wpz is a collection representing the _followers of the distribution staff The collection of branches moving from the road toward the port. _Epwz represents the collection of branches moving from the port toward the road on behalf of the delivery staff.

In FIG. 7, a display example of a branch set defined by the above is shown. The solid line arrows in the oblique direction represent the branches corresponding to the respective sets of E _wwx , E _wwy , and E _wwz . The double-line arrows in the vertical direction represent branches corresponding to the respective sets of E _wx , E _wy , and E _wz . The two-point chain line arrow in the horizontal direction represents the branch corresponding to each set of E _wpx , E _wpy , and E _wpz . One point chain line arrow in the oblique direction represents the branch corresponding to each set of _Epwx , _Epwy , _Epwz . The dashed arrows in the vertical direction represent branches corresponding to the set of E _px .

In this embodiment, the distribution base is treated as an integer of 0-1. However, the branches of the two-point chain line arrow in the horizontal direction, the one-point chain line arrow in the oblique direction, and the dotted arrow in the vertical direction are related. Here, the 0-1 integer becomes a problem and is added in this embodiment.

FIG. 8 is a third diagram illustrating a time-space network model related to a delivery plan in the second embodiment of the present invention.

The flow vector set for each branch will be described using FIG. 8. As shown in FIG. 8 (a), at each branch e, a flow vector is set.

In this flow vector, x [d, e] (d P, e E _x ) is the flow rate of the distribution, y [d, e] (d D, e E _y ) represents the flow of the delivery vehicle, z [e] (e E _z ) is the flow representing the delivery staff. List several examples. When P = {a} and D = {car}, the flow vector system becomes

. The branch e shown in FIG. 8 (b) represents the movement of one a, one delivery car, and two delivery personnel (person). When P = {a, b} and D = {car, locomotive}, the flow vector system becomes

The branch e shown in FIG. 8 (c) represents the movement of one a, one b, one delivery car, one locomotive, and two delivery personnel (persons).

FIG. 9 is a diagram related to a second embodiment of the present invention Figure 4 illustrates the time and space network model of the distribution plan.

Figure 9 shows the flow vector when:

A time-space network mode when one delivery item a is moved from the delivery base 1 to the delivery base 2. First, two delivery personnel and one delivery vehicle are moved from the Depot exit toward the delivery base 1 (solid line arrow 91). At the delivery base 1, one delivery person moves toward the place (port 0) where the delivery item a is located (two-point chain line arrow 92). Moreover, at port 0 of the delivery object a, the delivery object a exists at time 0 to 1 (dashed arrow 93). Next, one delivery person and one delivery item a move toward the exit of delivery base 1 (one-point chain line arrow 94). Next, one delivery item a, one delivery car, and two delivery personnel are moved from the exit of the delivery base 1 toward the entrance of the delivery base 2 (solid line arrow 95). Next, one delivery person and one delivery item a move toward port 0 of the delivery base 2 (two-point chain line arrow 96). Next, one delivery person moves from port 0 toward the exit of delivery base 2 (one-point chain line arrow 97). Next, two delivery personnel and one delivery vehicle move toward the Depot entrance from the exit of delivery base 2 (solid line arrow 98). At port 0 of delivery base 2, delivery item a exists between time 2 and 3 (dashed arrow 100). As shown in Figure 9, in In this embodiment, points are assigned one by one to the distribution point a and two points at the distribution point a, and points are respectively assigned to the entrance and exit of the distribution point. Therefore, the value of each element of the flow vector in the distribution base 1 and the distribution base 2 becomes 0 or 1. As a result, the distribution base can be handled as a 0-1 integer planning problem, and the calculation time can be increased.

FIG. 10 is a fifth diagram illustrating a time-space network model related to a delivery plan in a second embodiment of the present invention.

FIG. 10 is a time-space network model in which the time-space network mode illustrated in FIG. 3 according to the first embodiment is represented by the method in the second embodiment. In this embodiment, the set of points represented by the parking lot A column in FIG. 3 is further divided into (1,0,0,0), (1, a, 0, The set of points in each column of 0) and (1, a, 1,0) is used for expression. The same applies to parking lot B and parking lot C.

In addition, for each of the center, parking lot A to parking lot C, a set of points corresponding to the entrance and exit is provided.

Next, a description will be given of division that further increases the calculation time. In the integer programming problem, the inequality that can be satisfied by the points of the feasible region is called the effective inequality. Integer planning problems are difficult to solve, so first, many systems are treated as linear relaxation problems after removing integer conditions. The addition of an effective inequality that reduces the solution space of a linear relaxation problem is called the addition of a partition. With the addition of division, the linear relaxation solution system is gradually approaching the integer optimal solution, so it has a powerful effect on the speeding up of the calculation. In addition, by adding division, The feasible domain system is not cut off, so 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 explaining the division of the number of delivery vehicles related to the roads where supplies are left.

E ₁ represents the set of branches entering the road, E ₂ represents the set of branches leaving the road. With the restrictions 5 and 6 described later, the following formula (A) is established.

Formula (A) is a division of the number of delivery vehicles related to leaving from a road where supplies are present. In addition, the right side of the formula (A) represents dividing α by β-1, and rounding off the decimal point of the obtained value. The following equations are the same.

Here, α represents the maximum number of passengers who can take a car at all the distributions. β stands for the maximum number of passengers that can be taken at all delivery vehicles.

Fig. 12 is a second diagram illustrating an example of division in the second embodiment of the present invention.

FIG. 12 is a diagram for explaining the division of the number of delivery vehicles related to entering a road where a demand exists.

E ₁ represents the set of branches entering the road, E ₂ represents the set of branches leaving the road. With the following restrictions 5 and 6, the following formula (B) is established.

Equation (B) is a division of the number of delivery vehicles connected to a road where there is a demand.

Here, α represents the maximum number of passengers who can take a car at all the distributions. β stands for the maximum number of passengers that can be taken at all delivery vehicles.

FIG. 13 is a third diagram illustrating an example of division in the second embodiment of the present invention.

FIG. 13 is a diagram explaining the division of the number of delivery vehicles related to the road where supplies are present until time t. In addition, the so-called departure until time t refers to leaving before time t-1.

E ₁ represents the set of branches that have entered the road until time t, E ₂ represents the set of branches that have left the road until time t, and E ₃ represents the vertical of the port that has left at time t Collection of sticks. With the restriction conditions 5 and 6 described later, the following formula (C) is established.

Equation (C) is a division of the number of delivery vehicles connected to the road where there are supplies until time t.

Fig. 14 is a fourth diagram illustrating an example of division in the second embodiment of the present invention.

FIG. 14 is a diagram for explaining the division of the number of delivery vehicles related to the road leaving the demand supply after time t.

E ₁ represents the set of branches that have entered the road until time t, E ₂ represents the set of branches that have left the road until time t, E ₃ represents the vertical of the port that entered at time t Collection of sticks. With the following restrictions 5 and 6, the following formula (D) is established.

Equation (D) is a division of the number of delivery vehicles connected to the road where there is a demand until time t.

Fig. 15 is a fifth diagram illustrating an example of division in the second embodiment of the present invention.

FIG. 15 is a diagram for explaining a division in which the divisions described in FIGS. 11 and 13 are expanded.

E ₁ represents the set of branches that have left the road until time t, E ₂ represents the set of branches that have entered the road until time t, E ₃ represents the vertical of the port that has left at time t Collection of sticks. e _{4 is} the set of longitudinal branches representing the road entering at time t. The following inequality (division) (E) is derived by the mathematical operation of the same constraint expression as that described in Figs. In the road of supply number a,

Department established.

FIG. 16 is a sixth diagram illustrating an example of division in the second embodiment of the present invention.

FIG. 16 is a diagram for explaining a division in which the divisions described in FIGS. 12 and 14 are expanded.

E ₁ represents the set of branches entering the road up to time t, E ₂ represents the set of branches leaving the road at time t, E ₃ represents the vertical of the port entering at time t Collection of sticks. e _{4 is} the set of longitudinal branches representing the road leaving at time t. The following inequality (division) (F) is derived by the mathematical operation of the same constraint expression as that described in FIGS. 12 and 14. In the road of supply number a,

Department established.

FIG. 17 is a view showing a second embodiment of the present invention. Figure 7 illustrates an example of division.

Fig. 18 is an eighth diagram illustrating an example of division in the second embodiment of the present invention.

The division between the road and the port will be described with reference to FIGS. 17 and 18.

x (e) is the number of items on branch e, and z (e) is the number of persons on branch e. FIG. 18 is a table in which the relationships between z (e ₁ ), x (e ₂ ), x (e ₃ ), and x (e ₄ ) are integrated. For example, when the delivery person does not enter the port from the road, the number of items delivered in the port does not change.

In addition, when a delivery person enters a port from a road, the number of items delivered by the port will necessarily change. For example, if x (e ₂ ) is 1, the representative takes the delivery away. Also, for example, if x (e ₄ ) is 1, it means that the delivery item is taken. From the table of FIG. 18, the following equations are obtained.

z (e ₁ ) -x (e ₂ ) + x (e ₃ ) -x (e ₄ ) = 0

This formula is a division between the road and the port. By adding this division, it is calculated when it is not necessary for the delivery person to enter and exit the port unnecessarily.

In addition, a simple increase can be added to a port where a demand exists. The simple increase of division is at the port where there is a demand, and the number of deliveries specified is only increased from 0 to 1 and will not return to 0 after increasing from 0 to 1.

It is also possible to add a simple reduction to a port where a supply exists. Less division. The simple reduction of the increase is at the port where there is a supply, and the number of deliveries specified is only reduced from 1 to 0, and it will not increase to 1 after decreasing from 1 to 0 .

In addition, it is possible to add a division to determine the order in which the demand is satisfied at a port where a demand exists. Specifically, it is for the branch from the road to the port where there is a demand, and the condition that the port number is the smaller one is taken sequentially.

In addition, it is possible to add a division to determine the order in which the demand is satisfied at a port where there is a supply. Specifically, it is a condition for sequentially branching from the port where there is a supply to the road, and the order is taken from the smaller port number.

Fig. 19 is a ninth diagram illustrating an example of division in the second embodiment of the present invention.

Fig. 20 is a tenth diagram illustrating an example of division in the second embodiment of the present invention.

The division of the number of delivery vehicles will be described with reference to FIGS. 19 and 20.

E ₁ represents the set of branches that entered the road at time t, e ₂ represents the set of branches that entered the road from the road at time t, e ₃ represents the set of branches that existed at the time t-1 The port of demand enters the branch of the road. FIG. 20 is a table in which the relationships between z (e ₁ ), z (e ₂ ), and y (E ₁ ) are integrated. y (E) represents the total number of delivery vehicles of each branch of the branch set E, and z (e) represents the number of people on the branch e. Based on the table of Fig. 20, the following equations are obtained.

z (e ₁ ) ≦ z (e ₂ ) + y (E ₁ )

This formula is a division of the number of delivery vehicles.

Fig. 21 is an eleventh diagram illustrating an example of division in the second embodiment of the present invention.

FIG. 21 shows an example of a result when a linear relaxation problem is solved in a state where there is no division by the number of delivery vehicles described in FIGS. 19 and 20. As shown in the figure, when the division of the number of delivery vehicles is not applicable, there is a possibility that 3/4 delivery vehicles will arrive. However, in reality, more than one delivery vehicle should arrive.

Fig. 22 is a twelfth diagram illustrating an example of division in 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 division of the number of delivery vehicles described in FIGS. 19 and 20. As shown in the figure, when a division of the number of delivery vehicles is added, it is necessary to arrive at one or more delivery vehicles. According to FIG. 21 and FIG. 22, it can be known that, by adding the division, it is possible to exclude the calculation object from the fact that the distribution vehicles can arrive at 3/4, which is not realistic.

By adding divisions in this way, the range of the solution is limited, and the calculation is speeded up. Specifically, when an integer planning problem that requires several hours or more to solve the problem is solved in the case where no additional division is added, the case including the general division illustrated above can be added in minutes. Solve.

The above is a description of the processing in the second embodiment. The countermeasures adopted for the increase in speed have been described with regard to the problem of setting the distribution base to a 0-1 integer plan and the addition of divisions. Next, the objective function and restriction conditions of the integer programming problem will be specifically described by the first embodiment. In addition, as the delivery means, each of a case where the delivery is performed by a delivery vehicle and a bicycle (including a case where the delivery is performed only by a delivery vehicle) and a case where the delivery is performed by a truck are described. In addition, the bicycles of the distribution means are set to be used in the following manner: that is, the delivery personnel board the bicycles and move to the distribution base where there is a supply, and the bicycles are stored on the remaining vehicles there. Have the distribution staff drive the remaining vehicles and move to the distribution base where demand exists.

First, the purpose function will be explained. In the first embodiment, a case where the cost is minimized has been described as an example. In the present embodiment, the description will also be made including a case where the moving time consumed during distribution is minimized.

(For delivery by delivery vehicle and bicycle)

1. The objective function when minimizing the cost incurred during distribution is to multiply the travel time by the cost per unit time of each of the delivery, the delivery car, and the delivery staff and add them up. By.

2. The objective function when minimizing the travel time spent during delivery is set as the sum of the travel times of each of the delivery, delivery truck, and delivery staff.

(For delivery by truck)

1. The objective function in the case of minimizing the cost consumed in distribution is that the moving time is multiplied by the cost per unit time of each of the delivery truck and the delivery staff and added up.

2. The objective function in the case of minimizing the travel time consumed during delivery is set as the sum of the travel time of each of the delivery truck and delivery staff.

Next, restrictions will be explained.

(Common in the case of delivery by a delivery vehicle and a bicycle and in the case of delivery by a truck) Flow conservation (1) About the flow of goods

At the point in time when the delivery starts, the traffic leaving from the port where the supply is present becomes 1. At the point in time when the delivery ends, the traffic entering the port where there is a demand becomes 1. As for the other points, the outgoing flow and the incoming flow are equal.

(2) About the flow of delivery vehicles

At the point in time when the distribution starts, the amount of traffic leaving from the road on which the distribution vehicle exists is the number of vehicles in the distribution vehicle. At the point in time when the delivery is completed, the amount of traffic entering the road where the delivery vehicle exists is the amount of the existing vehicles. As for the other points, the outgoing flow and the incoming flow are equal.

(3) About the flow of delivery personnel

At the point in time when the distribution starts, the amount of traffic leaving from the road where the distribution personnel exist is the number of people who become the distribution personnel. At the point in time when the distribution ends, the amount of traffic entering the road where the distribution staff exists is the number of people who become distribution staff. As for the other points, the outgoing flow and the incoming flow are equal.

2.Capacity limitation

The amount of movement of people and people in the distribution base is 1 or less.

3. Restrictions in the distribution base 1

e E _wp (illustrated for E _wp in Figure 23)

(1) When the moving target of e is the supply point of d

The distribution system does not enter the port from the road.

(2) When the moving target of e is the demand point of d

The flow rate of the delivery items and delivery personnel is the same (0 or 1).

(3) In any case

The number of bicycles is less than the number of delivery staff.

4. Restrictions in the distribution base 2

e E _pw (illustrated for E _pw in Figure 23)

(1) When the starting point of e is the supply point of d

The flow rate of the delivery items and delivery personnel is the same (0 or 1).

(2) When the starting point of e is the demand point of d

The delivery system does not leave the road from the port.

(3) In any case

The number of bicycles is less than the number of delivery staff.

Hereinafter, a case where the delivery is performed by a delivery vehicle and a bicycle and a case where the delivery is performed by a truck are separately described.

(For delivery by delivery vehicle and bicycle) 5. Restrictions on branches when moving from a base to another base

e E _ww

(1) When e is a branch of a bicycle and a branch of a bicycle

There are cases where the delivery person is moving on the bicycle and the vehicle separately, and the case where the bicycle is stored on the vehicle and moving, and the number of the delivery personnel must be on the vehicle. The restrictions on the number of riders and the number of bicycles that cannot be mounted are limited to the number of bikes that can be stowed in the car.

(2) When e is a branch of a bicycle but not a branch of a bicycle

(Moving on a bicycle)

The number and number of bicycles are consistent with each other.

6. Restrictions on staying in the distribution base

The system limits the number of people who must be on board and the number of passengers below the limit.

(For delivery by truck) 5. Restrictions on branches when moving from a distribution base to another distribution base

The restrictions are that the number of persons on the truck must be on the truck, the number of persons on the truck must be less than the number of passengers on board, and the total volume of the items to be delivered on the truck.

6. Restrictions on staying in the stronghold

The restrictions are that the number of delivery personnel is less than the number of passengers that can be carried and the total volume of the delivery is less than the load capacity of the truck.

In step S12 of FIG. 4, the delivery plan generating unit 12a generates a time-space network model that divides the delivery base by road (d = 0) and parking port (d ≠ 0), and further Further, the above-mentioned restriction condition and the added division are used to calculate the branch information. According to this embodiment, since the distribution base can be modeled as a 0-1 integer planning problem, in addition to the effects of the first embodiment, the calculation of the distribution plan can be further obtained. The time required in the reduction effect. Furthermore, by adding division, the calculation time can be greatly reduced. With this, for example, it becomes possible to compare the distribution plans calculated under various initial conditions and to select a lower-cost distribution plan, etc., and the convenience of the plan creator is improved.

Next, a case where a delivery plan is calculated by the delivery plan device 10a of this embodiment will be described.

FIG. 24 is a diagram showing an example of a problem with the delivery plan in the second embodiment of the present invention.

Point 0 (depot) in FIG. 24 is the starting point. The other points 1 to 9 are distribution bases. For example, "d1: 2" at point 7 indicates that there are two additional items d1, and "d2: -1" at point 5 indicates that there is a shortage of one d2. Of the state. In addition, "d1: -1, d2: 1" at the point 2 represents a state where there is a shortage of one distribution item d1 and a state where there is one excess distribution item d2. The distribution items d1 to d3 shown in FIG. 24 are distributed in such a manner that there is no shortage of the distribution items d1 to d3 at each distribution base so that the distribution items d1 to d3 are distributed. Think about it. In the following, an example of the distribution plan calculated by the distribution planning device 10a will be given for each of the case where the vehicle and the bicycle are used for distribution and the case where the truck is used for the distribution.

1. Delivery by car and bicycle

(1) Input

‧At the depot, there are 1 delivery vehicle, 3 bicycles, and 3 delivery personnel.

‧Delivery period: 120 minutes

‧Cost of delivery vehicle: 1.5yuan / minute

‧Cost of delivery staff: 17 yuan / minute

‧Cost of d1, d2, d3: 1.5 Yuan / minute

‧ The number of passengers on the delivery vehicle: 4 people, the number of bicycles: 1

‧D1's number of passengers: 1 person, the number of bicycles that can be stowed: 0 Car

‧D2: 4 passengers, bicycles: 1

‧D3's number of passengers: 2 persons, bicycles can be stowed: 0

(2) Objective function

Cost minimization

(3) Output

‧One delivery vehicle, one bicycle, and two delivery personnel are used to distribute as shown in Figure 25.

‧Distribution cost: 2768 yuan

‧Time required: 60 minutes

In this way, it is possible to obtain a delivery plan that minimizes costs within the conditions of the delivery means, delivery personnel, and delivery deadline set in the initial conditions.

Fig. 25 is a first diagram showing an example of a result of establishing a delivery plan in the second embodiment of the present invention.

In FIG. 25, a delivery plan of the delivery vehicles d1 to d3 with the minimum cost is displayed. When the delivery plan calculated by the delivery plan device 10a is divided into two delivery paths 1 shown by S1 to S7 and delivery paths 2 shown by T1 to T9, the delivery is performed. The delivery staff responsible for delivery route 1 moves and delivers in the order of S1 to S7. The delivery personnel responsible for delivery route 2 are in the order of T1 ~ T9 To move and deliver. In addition, the delivery staff of the delivery route 1 and the delivery staff of the delivery route 2 wait at the delivery base 7 and move from the delivery base 7 to the delivery base 2 together. Although not shown in FIG. 25, for example, for S1, the flow rate of the delivery item x ((depot, departure time), (delivery base 3, arrival time)) = 0, and the flow rate of the delivery vehicle y ((depot, departure time), (delivery point 3, arrival time)) = 1, the flow of delivery personnel z ((depot, departure time), (delivery point 3, arrival time)) = 2, which are used as output items. Is output. Departments can also use this information to express this distribution plan through the time-space network model illustrated in Figures 6, 7, 9, and 10.

2. Delivery by truck

(1) Input

‧At the depot, there is one truck and two delivery personnel

‧Delivery period: 120 minutes

‧Cost of truck: 25yuan / minute

‧Cost of delivery staff: 17 yuan / minute

‧Truck stowage: 16

‧ Suppose 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

‧One truck and one delivery person are used to distribute as shown in Figure 26.

‧Distribution cost: 3456 yuan

‧Time required: 80 minutes

Fig. 26 is a second diagram showing an example of the result of establishing a delivery plan in the second embodiment of the present invention.

In FIG. 26, the delivery plan of the delivery items d1 to d3 with the minimum cost is displayed. In the case of the delivery plan of FIG. 26 calculated by the delivery planning device 10a, the delivery is performed by the delivery route shown in 1 to 9. As in FIG. 25, the output items include information on the time of departure and arrival related to the movement of each distribution base, the flow of goods, the delivery vehicle, and the delivery personnel.

As exemplified in FIGS. 24 to 26, according to the present embodiment, each of the case where the boardable goods can be delivered by a car and a bicycle, and the case where the goods can be delivered by a truck, And calculate a distribution plan that minimizes costs. Moreover, the creator of the distribution plan can set various initial conditions and compare the calculated distribution plans to determine what kind of distribution method to use and how many people to distribute. Review for ideals. In addition, although the description is made by taking an example of minimizing the distribution cost, as described above, by minimizing the travel time spent in distribution as the objective function, it is possible to calculate the minimum distribution time. Delivery plan. In the above example, although the starting point is only one place, the It is also possible to calculate a delivery plan when there are plural departure bases. From the viewpoint of the time required for calculation, the second embodiment is more ideal. However, the problems dealt with in FIGS. 24 to 26 can be calculated by the first embodiment. Draw device 10 to solve.

The processes of each processing in the above-mentioned distribution planning device 10, 10a are stored in a computer-readable recording medium in the form of a program, and the program is read out by the computer of the distribution planning system and Implementation, the above processing is performed. Here, the computer-readable recording medium refers to a magnetic disk, an optical magnetic disk, a CD-ROM, a DVD-ROM, a semiconductor memory, and the like. In addition, the system may be configured to distribute the computer program to the computer through a communication line, and cause the computer that has received the distribution to execute the program.

The above-mentioned program may be a part for realizing the aforementioned functions. Furthermore, it may be realized by combining the aforementioned function with a program that has been recorded in a computer system, that is, it may also be a so-called differential file (differential program).

The distribution planning devices 10 and 10a may be constituted by a single computer, or may be constituted by a plurality of computers that are communicably connected.

In addition, within a range not departing from the gist of the present invention, it is possible to appropriately replace the constituent elements in the above-mentioned embodiments with well-known constituent elements. The technical scope of the present invention is not limited to the embodiments described above, and various changes can be made without departing from the gist of the present invention. For example, the system can also be applied to transportation The distribution, transfer, and after-sales service of the delivered goods are under tour. In addition, it can also be used for the delivery of goods that are not carried on board.

For example, in the after-sales service, it is necessary to adjust the parts and other parts required in the after-sales service before going to the customer, or it is necessary to patrol and provide services to multiple customers. If the delivery items are used as parts used in after-sales service, etc., and the delivery subject is a salesperson, and the delivery means is a vehicle used by the salesperson during the movement or required for the transportation of parts Delivery vehicles, etc., and set up the base as a place for customers or after-sales service products, and apply the mathematical model described above, it can be done in the first to second embodiments. The method described is used to solve the integer planning problem. When the salesperson performs after-sales service at a plurality of customers, it is a patrol method that can calculate the patrol cost or patrol time to the minimum (tour means, patrol). path). Taking Figure 2 as an example, it is only necessary to set parking lot A to parking lot C (delivery base) as customers who provide after-sales service, set the vehicle (delivery goods) as parts, and set the riding car (delivery means) as The means used by the salesperson during the movement, and the delivery person (delivery subject) may be the salesperson. In addition, in the case of after-sales service, inspections and repairs are performed not only at the customer, but also at the customer. According to the use of the distribution planning device 10, 10a with a time and space network mode, it can be a patrol operation for the salesman, and this operation time is also considered as a model for consideration.

The cost spent in distribution and the movement time spent in distribution are examples of evaluation values. Delivery staff, for delivery One example of the subject is a delivery vehicle, truck, or bicycle, which is one example of a delivery method, and a shared vehicle in a vehicle ride is one example of a distribution item.

[Industrial possibilities]

According to the above-mentioned distribution planning system, distribution planning method and program, it is possible to establish the situation when the distribution personnel pick up the distribution items existing in various places and deliver to the appropriate distribution destination. Cost or travel time becomes the smallest delivery plan.

10‧‧‧ Delivery plan device

11‧‧‧Initial condition setting section

12‧‧‧ Delivery Plan Generation Department

13‧‧‧I / O Department

14‧‧‧Memory Department

Claims (15)

A distribution planning system including an initial condition setting section for receiving a place where any one of a distribution object and a distribution entity and a distribution means that moves the distribution object or the distribution entity stays. The demand quantity and supply quantity of the aforementioned distribution items at each of the distribution bases, and information representing one or a plurality of departure points of the initial positions of the aforementioned distribution subject and the aforementioned distribution means, and the distribution means available at the aforementioned departure points And the information of the delivery subject and the delivery deadline, input these information, and set the initial conditions in the delivery plan; and the delivery plan generation unit, which calculates the aforementioned delivery base and the aforementioned departure base and The point information grouped on the basis of the start of delivery and the point information representing the two points information related to the delivery of the delivery item among the foregoing point information are related to the delivery item and the delivery subject of the delivery item, and The branch information of the aforementioned distribution means, and at least one will be generated within the aforementioned distribution period. The number of full distribution of the above requirements were distributed to the collection of information during the aforementioned branches have been set at the number of cases and distribution bases that requirement. According to the distribution planning system described in item 1 of the scope of patent application, the distribution planning generating unit calculates an evaluation value for the generated branch information, and determines the most appropriate branch information based on the evaluation value. Of collections. The distribution plan system described in item 1 or 2 of the scope of the patent application, wherein the aforementioned distribution plan generating unit generates branch information representing the aforementioned traffic between different aforementioned distribution bases and the same information representing the same The aforementioned traffic branch information in the aforementioned distribution base and in the aforementioned departure base. According to the distribution planning system described in any one of the items 1 to 3 of the scope of the patent application, the distribution plan generating unit generates an entry and time for the distribution base for one of the distribution bases. Grouped point information related to the entrance, grouped outlets and times grouped related to the point information, and point-by-point grouped times for distribution items related to the distribution point The point information related to the place where the distribution is placed will be between the point information related to the entrance and the point information related to the distribution, the point information related to the exit, and the point information related to the distribution. The value of the flow rate of the distribution subject and the distribution item is set to 0 or 1. The delivery plan system described in item 4 of the scope of the patent application, wherein the delivery plan generation unit is set to minimize costs based on the flow rate and moving time of the delivery subject, the delivery method, and the delivery item. The purpose function of transformation is to solve the integer distribution problem including the following constraints for each of the aforementioned distribution objects, the aforementioned distribution methods, and the aforementioned distribution entities, and determine the collection of the aforementioned branch information: The difference between the incoming flow and the outgoing flow at the aforementioned distribution base is 0; each of the aforementioned distribution's traffic, the aforementioned distribution means's traffic, and the aforementioned distribution subject's traffic is above 0; the aforementioned distribution at the aforementioned distribution base Each of the flow rate and the flow rate of the foregoing distribution subject is 1 or less; when the flow rate of the distribution item in the distribution base is 1, the flow rate of the distribution subject related to the flow rate of the distribution item is 1 Is 1; in the aforementioned distribution means when moving from the aforementioned distribution point to other aforementioned distribution points, the aforementioned distribution subject is absolutely taken; the aforementioned distribution when moved from the aforementioned distribution point to other aforementioned distribution points The number of persons of the aforementioned distribution entity boarded in the means is less than the number of passengers who can be carried; the total number of the items and means of transport carried in the distribution means when moving from the aforementioned distribution base to other aforementioned distribution bases are It is below the amount that can be carried by the delivery means related to the movement; when staying in the aforementioned distribution base, the aforementioned delivery Take the main system on the aforementioned distribution means; when the residence is within the aforementioned distribution base, the number of people aboard the foregoing means on said distribution of the main distribution, the Department can be reached for the number of people below. According to the distribution planning system described in item 5 of the scope of the patent application, the distribution planning generation unit is configured to replace the distribution function and the distribution means and the distribution function instead of the objective function of minimizing the cost. The objective function of minimizing the moving time of the delivery, and solving the integer planning problem to determine the set of the branch information. The delivery plan system described in item 5 or 6 of the scope of patent application, wherein the delivery plan generation unit is more related to the restriction on the delivery means that is left from the delivery base where the delivery is provided. Conditions, and determine the collection of the aforementioned branch information. According to the distribution plan system described in any one of the items 5 to 7 of the scope of patent application, the aforementioned distribution plan generation unit is more related to the aforementioned entry to the aforementioned distribution base having the demand for the aforementioned distribution items. Restrictions on distribution methods determine the collection of the aforementioned branch information. According to the distribution plan system described in any one of items 5 to 8 of the scope of patent application, wherein the aforementioned distribution plan generating section is further related to the place where the aforementioned distribution items are located in the aforementioned distribution base. Restrictions on the relationship between the increase or decrease of the aforementioned distribution items and the number of the aforementioned distribution entities entering the placement site determine the collection of the aforementioned branch information. According to the distribution planning system described in any one of items 5 to 9 of the scope of patent application, wherein the aforementioned distribution plan generating section is further related to the place where the aforementioned distribution items are located in the aforementioned distribution base. The restrictions on the increase and decrease of the aforementioned distribution items determine the collection of the aforementioned branch information. According to the distribution plan system described in any one of items 5 to 10 of the scope of the patent application, wherein the distribution plan generation unit has a plurality of cases where the distribution items are located in the distribution base. At this time, the collection condition of the aforementioned branch information is determined based on the restriction condition of the order of addition and removal of the distribution items in plural places. According to the distribution planning system described in any one of the items 5 to 11 of the scope of patent application, wherein the aforementioned distribution plan generating section is further related to the restriction on the number of the aforementioned distribution means entering the aforementioned distribution base , And determine the collection of the aforementioned branch information. The delivery plan system described in any one of the items 1 to 12 of the scope of application for a patent, wherein the delivery object is a branch that can be carried and moved by the delivery subject and calculated by the delivery plan generation unit. The information includes branch information representing the movement of the distribution item caused by the distribution means described above, as well as branch information representing the distribution subject boarding the distribution item and moving the distribution item. A distribution planning method, characterized in that a distribution planning device is used to receive a distribution base of a place where any one of the distribution object and the distribution subject and the distribution means that moves the distribution subject or the distribution subject moves. Each of the demand quantity and supply quantity of the aforementioned distribution goods, and one or more of the initial positions representing the aforementioned distribution subject and the aforementioned distribution means Enter the information of the starting point, the information about the delivery method and the delivery subject that can be used at the starting point, and the information of the delivery deadline. Enter these information and set the initial conditions in the delivery plan and calculate The distribution point is grouped with the distribution point and the starting point and the point information grouped at the time when the distribution start is used, and the point information representing the two point information related to the distribution of the distribution item in the point information is related to the distribution. The above-mentioned distribution items, the distribution subject, and the flow information of the distribution means, and at least one distribution item that meets the aforementioned demand quantity is distributed to the distribution base set with the required quantity within the aforementioned distribution period. A collection of the aforementioned branch information at the time of the situation. A program characterized in that a computer of a distribution planning device functions as a means for receiving any one of a distribution object and a distribution entity and a distribution means for moving the distribution object or the distribution entity The demand quantity and supply quantity of each of the distribution bases of the place where they stayed, the information of one or a plurality of departure bases representing the initial positions of the aforementioned distribution subject and the aforementioned distribution means, and the location of the aforementioned departure base Available means of delivery, information on the delivery subject, and information on delivery deadlines, input of such information, and means to set initial conditions in the delivery plan; and calculate the aforementioned delivery locations and the aforementioned departure locations, and Correlation between point information grouped at the time when the start of distribution is used as a reference, and the point information representing the two point information related to the distribution of the aforementioned distribution item in the aforementioned point information Information on the flow of the distribution item, the distribution subject, and the distribution means in the distribution above, and at least one distribution item that meets the demand quantity within the distribution period is delivered to the quantity that is set to the demand quantity A means of assembling the aforementioned branch information at the time of delivery at the distribution base.