JP2000331293A - Delivery order deciding device and distance database generating method - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a delivery order deciding device which easily realizes an efficient delivery order. SOLUTION: A delivery order deciding device is provided with an input means 1 inputting a customer name, a locating position and the regulation of the invasion direction of a contact road to which a stronghold faces at every strong hold being a delivery object, a customer database 2 storing a content inputted by the input means, a distance data base operation means 3 operating distance data among the whole strongholds of the delivery objects based on the content of the customer database, retrieving the stronghold to which a vehicle invades from a regulated direction against the stronghold where the invading direction is regulated and largely weighting the value of the regulated direction in distance data between the strongholds so as to generate a distance database 4, a delivery order operation means 5 operating the delivery order by which distance cost is made to be minimum based on the distance database. The delivery order is decided by using the distance data base generated by considering the traffic regulation such as 'No right/left turn' and one-way by a simple method.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an apparatus for determining the order of delivery and collection (hereinafter collectively referred to as delivery) to a plurality of locations by a vehicle, and more particularly to an apparatus for determining the delivery order in consideration of traffic regulation information. Regarding the technology to decide.

[0002]

2. Description of the Related Art An apparatus for determining a delivery route is used for optimizing a collection / delivery plan for a plurality of customers, such as truck pick-up and delivery. The algorithm has been remarkably advanced in recent years, and various methods have been used. For example, a solution using a simulated annealing method as described in Japanese Patent Application Laid-Open No.
One using a genetic algorithm (GA) as described in Japanese Patent No. 34020 is a typical example.

[0003] When performing these calculations, a so-called distance database, such as the distance between customers and travel time, is normally held in the system, and the travel distance and travel time of the tour route are calculated using this database. I have. The delivery planning simulation calculates the objective function using the mileage and travel time,
Alternatively, these objective functions are minimized by using the above-mentioned algorithm with the transportation costs derived therefrom.

Normally, a distance database used for these uses a straight-line distance between two points or a distance obtained by multiplying the straight-line distance by a certain coefficient. The average traveling speed is given uniformly, and the time is obtained from the distance and the average traveling speed. Such a method is adopted from the viewpoint of increasing the calculation speed and saving the data input. However, it is also true that a more realistic calculation is required as a request from the user. For example, roads are one-way, no entry,
Although various traffic regulations such as ban on right and left turns are imposed, the current software cannot reflect them. In actual delivery operations, delivery is performed under these traffic regulations, and there are many requests from users for a vehicle allocation plan that takes traffic regulations into account.

As means for reflecting traffic regulation information on roads in the distance database, as described in Japanese Patent Application Laid-Open No. 63-83805, all routes existing in closed spaces such as factories and warehouses are one-way traffic. Attempts have been made to have traffic regulation information and to formulate delivery route plans based on this data. Further, as disclosed in JP-A-6-273181, a method of manually providing traffic regulation information and the like to a general road network is also disclosed.

[0006]

However, general delivery operations are performed not in a limited space but in a wide area spanning prefectures. Therefore, information on all routes is input to the above system. It is practically impossible to use it for simulation. In recent years, the accuracy of commercially available map databases has been remarkably improved, but in most cases, traffic regulation information is limited to high-level roads such as national roads. In addition, it is virtually impossible to reflect time-limited entry restrictions in a shopping street or the like in a commercially available map database. In the case of delivery business to convenience stores and pharmacies, delivery to customers in shopping streets is very common, but delivery planning that incorporates traffic regulation information can be done using conventional methods and commercial map databases. Doing so is difficult at present. At the delivery site, even if a delivery plan is made using a computer, the problem is that the delivery distance is extended due to the above-mentioned planning that does not take traffic regulations into consideration, and the delivery efficiency is rather deteriorated. Has occurred.

As described above, it is actually extremely difficult to add traffic regulation information as road information in advance in association with all roads. Even if the delivery route (route to each delivery destination) is minimized, if the delivery order (order to deliver to each delivery destination) is not efficient, efficiency of the entire delivery business cannot be realized. . For example, even if a certain delivery order is the shortest route in the route, if the detour is made due to traffic restrictions such as right turn prohibition and a median strip, changing the order of the delivery destination will shorten the actual mileage. May be. There is no delivery planning software that takes such road regulations into account, and the calculation results may not be practically run or may be inefficient.

The present invention has been made to solve the problems of the prior art as described above, and it is an object of the present invention to provide a delivery order determining apparatus capable of easily realizing an efficient delivery order. Another object of the present invention is to provide a distance database creation method used in the above-described delivery order determination device.

[0009]

In order to achieve the above object, the present invention is configured as described in the appended claims. That is, in the present invention, when inputting traffic regulation and the like into the database, instead of providing traffic regulation information on each route on the map, a road (hereinafter, referred to as a road) facing a base for delivery to each customer. The entry direction regulation (presence or absence of right turn prohibition, etc., distance La, angle θa) about the approach direction is stored, and the distance data of the route from the entry prohibition direction is heavily weighted (> 1) based on it. Thus, the route in that direction is not selected as the delivery order.

[0010] With the above configuration, even if the delivery area covers a wide range, the data to be input can be the traffic regulation information near each base, so that the data can be easily input and the calculation can be performed easily. This facilitates the determination of the delivery order taking into account the traffic regulation information. Further, in the present invention, a delivery order is determined not only by simply determining a delivery route but also by taking traffic directions into account and taking a direction into consideration. For example, in a case where four customers A, customer B, customer C, and customer D are visited, customer A →
The route of customer B → customer C → customer D and the route of customer D → customer C → customer B → customer A have the same route distance. Therefore, when only the shortest distance is considered as in the related art, both of the above two routes may be selected. However, in reality, for example, the route from the customer B to the customer C becomes large due to traffic regulation on the approach road of the customer C, so that it may not be adopted in some cases. In the present invention, in such a case, the value of the distance of the route from the customer B to the customer C is increased by weighting, so that a route including the route is not selected, and as a result, the customer D →
Only the route of customer C → customer B → customer A will be selected.

The invention described in claim 2 describes a specific configuration of the present invention, and corresponds to, for example, the configuration of FIG. 1 described later. As the contents of the customer database, in addition to the customer name, the location, and the restriction on the approach direction of the approach road facing the base, the name of the approach road, the amount of cargo, the designated delivery time, and the like can be used. The contents of the entry direction restriction include, for example, the presence or absence of an entry direction restriction (right turn prohibition, etc.), the distance La indicating the range of the entry prohibition area, the angle θa with respect to the approach road, and the like.

Further, the invention according to claim 3 shows the contents of the distance database calculating means, wherein the distance La and the angle with respect to the approach road indicating the range of the no-entry area entered as the approach direction restriction in the customer database. Based on θa, a fan-shaped entry-prohibited area is set, a base that enters the no-entry area is searched for a base with an entry direction restriction, and a value in the restricted direction in the distance data between the bases is weighted. Is performed.

Further, in the invention according to claim 4, the distance database computing means has a plurality of distances La, has a plurality of entry prohibited areas corresponding to the respective distances La, and has a distance data for each area. It is configured to perform different weighting. This corresponds to, for example, an embodiment of FIG. 10 described later.

The invention according to claim 5 shows a method of creating a distance database used in the delivery order determination device of the present invention.

[0015]

According to the present invention, even if the delivery area covers a wide range, the data to be input is only traffic regulation information near each base, so that the data can be easily input and the calculation can be easily performed. That is, an effect is obtained that the delivery order can be practically determined in consideration of the traffic regulation information.

Further, in the present invention, the delivery order is determined in consideration of the direction in consideration of the traffic regulation information instead of simply determining the delivery route, so that the traffic regulation such as the one-way regulation is avoided in the actual operation. Inefficiency such as detouring due to the operation does not occur. In addition, since the route is not set so that the customer enters the road while turning right on a road with a median or a high traffic volume, these will not only improve operating efficiency but also improve driver safety. The effect is obtained.

Further, when a plurality of entry-prohibited areas are provided and different weights are applied to the distance data for each area as described in claim 4, the distance from the entry-restricted direction is set. Since the combination is started from a site having a low degree of entry confirmation, an effect that a realistic delivery order is easily obtained is obtained.

[0018]

FIG. 1 is a block diagram showing the configuration of an embodiment of a delivery order determining apparatus according to the present invention.
In FIG. 1, a customer data input unit 1 is an input device such as a keyboard, for example, and inputs customer data (details will be described later) of a delivery destination. The customer database memory 2 is a device for storing inputted customer data. The distance database calculation means 3 calculates a distance database based on the customer database stored in the customer database memory 2 (details will be described later). The distance database memory 4 is a device that stores the calculated distance database (described in detail later). The delivery order calculating means 5 calculates the delivery order based on the distance database stored in the distance database memory 4 (details will be described later). The delivery order determining device shown in FIG. 1 can be constituted by a computer device including, for example, a CPU, a RAM, a ROM, an interface, a keyboard, and the like.

FIG. 2 is a schematic diagram showing a use situation of the delivery order determination device of the present invention. In FIG. 2, a delivery order determining device 7 of the present invention is installed in a fixed station 6 such as a delivery center, and transmits the delivery order information determined by the delivery order determining device 7. On the other hand, a vehicle 8 such as a delivery truck is equipped with an in-vehicle navigation device 9 which receives a radio signal from a fixed station, displays delivery order information, and presents it to the driver.

Hereinafter, the contents of the processing in FIG. 1 will be described in detail. FIG. 3 is a flowchart showing the flow of the entire processing in the apparatus shown in FIG. 1, FIG. 4 is a flowchart showing the calculation processing of the distance database (contents of step S2 in FIG. 3), and FIG. 3 is a flowchart showing the contents of step S5 in FIG. 3) and the delivery order calculation process (the contents of step S6 in FIG. 3).

In FIG. 3, first, in step S1,
The customer data is input from the customer data input means 1 to create a customer database. The customer data input by the customer data input means 1 is as follows. 1. Customer name 2. 2. Customer location (latitude, longitude of location) 3. Baggage volume (volume) Time designation 5. Approach Direction Restriction In addition, if the approach road has a name, the name of the approach road may be input.

The "entrance direction constraint" shown in 5 is a flag indicating whether or not there is an entry direction constraint ("1" is a constraint,
“0” indicates no restriction) and the distance L indicating the range of the no-go area
a and the angle θa. For example, as shown in FIG. 9 (A), the approach direction restriction means that there is a right turn prohibition facility such as a median strip or a sign on the road (tangential road) facing the customer facility, (When viewed from the left), it is not possible to directly arrive at the customer facility, or the approach to the customer facility can only be made from the direction determined by the one-way regulation, Means that it is practically difficult to make a right turn on a main street or the like to reach customer facilities. In some cases, the left side may be restricted such as a left turn prohibition.

Next, with reference to FIG. 6, a description will be given of the condition setting of the entry prohibited area for the arrival base (customer of the delivery destination) having the designated entry direction. In FIG. 6, traffic restrictions such as right turn prohibition and one-way traffic are imposed on the approach road L of the base A, so that vehicles cannot arrive from the right side (left side as viewed from the base A). In such a case, the base point is the contact point P between the arrival point A having the approach direction designation and the approach road L,
Within a range (sector-shaped range) defined by a certain distance La and an angle θa, the approach direction upon arrival at the base A is in one direction (in this case, from right to left). Is extremely high. In this manner, at a base where the approach direction needs to be designated, a range where entry from a direction where entry is impossible is determined as an approach-prohibited area, a traveling direction designation flag is set, and the distance La and angle θa of the approach-prohibited area are set. Set. Even in the direction of entry prohibition, if it is a certain distance, it is possible to go to the left side of the base A through a route other than the approach road L without making a detour. You have set. Also, the angle θa
Are provided on both sides with respect to the approach road, so that the overall angle is 2θa
Becomes

FIG. 7 shows an example of the customer database input as described above. FIG. 7 illustrates a case where the flag is “1” for the customer “X supermarket”, the distance La of the prohibited area is 1000 m, and the angle θa is 30 °.

Next, returning to FIG. 3, the generation of the distance database in step S2 will be described. FIG. 4 is a flowchart showing the contents of step S2, that is, the calculation processing of the distance database. The distance database obtains and holds the distance between two points for all combinations of customers used in the delivery order calculation. The distance database is basically generated using a customer database, and usually calculates and uses a straight-line distance between two points or a distance of a most general route among routes between two points from a map database. Also, in a normal distance database, there is a case where only one value in both directions is common as data between two points. However, in the present invention, in a combination of two points, an approach direction becomes a problem for each arrival point. Has a bidirectional distance database.

In FIG. 4, first, in step S10, it is confirmed whether or not there is an entry direction designation for each of all the bases based on the entry direction designation flag of the customer database as shown in FIG. For a base that has not been designated, the process goes to step S13, where distance data generation logic (for example, a straight-line distance between two points or two-
The distance is calculated by calculating the distance of the most general route among the routes between points, and the result is stored in the distance database (step S3 in FIG. 3).

On the other hand, for a base having an entry direction designation, the entry prohibited area (the fan-shaped range in FIG. 6) of the base is calculated in step S11 by the entry prohibited area calculation logic. That is, an entry prohibited area is set on the map using the distance La and the angle θa. And in step S12,
It is determined whether or not all the bases except the arrival base (hereinafter, referred to as the arrival base A) are included in the above-described calculated no-go area, that is, the no-go area for the arrival base A. For locations that are not included in the entry-prohibited area, in step S13, the distance between the two locations is calculated using the distance data generation logic for all combinations of all locations targeted for the delivery order calculation to create distance data. . For the bases included in the no-entry area of the base A, go to step S14, calculate the distance data composed of a combination of the bases and the base A included in the no-access area of the base A, and weight the distance data. And store it in the distance database. The above calculation is performed for all bases.

FIG. 8 is a diagram showing an example of the distance database calculated as described above. In FIG.
1 is each arrival point, and the numerical value indicates the distance (unit: km) between the two points. Each base that is not included in the no-go area is the same in both directions (both departure and arrival), but if it is in the no-go area, it is weighted in step S14, The numerical value is greatly increased. For example, in FIG. 8, a portion surrounded by a bold frame (e.g., f / c, j / c, i / e) corresponds to this. For example, the value is 2.5 in the direction of arrival and departure from c, but becomes 25 in the case of arrival and departure from f in the opposite direction, and the numerical value becomes ten times. That is, in FIG. 8, weighting of “× 10” is performed.

In the flow of FIG. 3, the delivery order is calculated in step S6 based on the distance data stored in the distance database in step S3 as described above.

Normally, when calculating the delivery order optimization using the distance database, the travel distance or the travel time or cost derived from the distance is used as an objective function to minimize it. However, in the present invention, since the distance database is weighted for the combination of customers in the inaccessible direction as described above, the nominal distance of the combination is greatly increased. (In the above example, f arrival and departure, etc.) do not occur. Therefore, the optimization calculation is performed without generating a combination of customers in the inaccessible direction.

In FIG. 3, a truck database (the number of trucks, the loading capacity, the operating time, etc.) is input in step S4, and the necessary number of trucks and the delivery route are calculated in step S5. Hereinafter, an example of steps S5 and S6 will be described with reference to FIG. FIG. 5A is a routine showing calculation processing of the number of trucks and the delivery route. This processing is saving (S
aving) method. First, step S
In step 20, the distance database (step S in FIG. 3) is used.
From 3), the distance data for all combinations between two points and the distance data from the departure point to each point are read.

Next, in step S21, a saving value is calculated and a saving table is created. That is, the difference between the distance (or time derived from the distance) when the vehicle returns to the departure place after two round trips from the departure point to two points from the departure value is calculated. This value is called the saving value. This value is calculated for all combinations of the two points. Further, saving values of all combinations calculated in the same manner as the matrix of the distance database are stored as a matrix. This matrix is called a saving table.

Next, in step S22, a route is generated. That is, a route having the largest value in the saving table is selected and connected as a node to create a route. For example, when the base i and the base j are respectively represented as a node i and a node j, and when the saving value Sij (the saving value between the node i and the node j) is the maximum, the node i
And node j to one route. If neither the node i nor the node j has been assigned to a route yet, a new route is generated and a track is assigned. If one is already assigned, incorporate the other into the route. Merge both routes if both are already assigned. However, if the conditions of one route (such as the maximum load capacity) are not satisfied during the connection, the connection is not performed.

Next, in step S23, the saving value is rewritten and the route is stored. That is, the calculated route is stored, and the saving value is replaced with 0 for the combination of the two points that generated the route.

Next, in step S24, the saving table is checked. That is, it is confirmed whether or not all the saving values on the saving table have become zero. If all are 0, proceed to the next step. If the value is not 0, there is an unassigned route, so the above-described step S2
Return to step 2 and continue generating the route.

Next, at step S24, the number of trucks is displayed. That is, it is calculated in step S22,
Since one track is required for each of the routes stored in step S23, the above-described route and the number of trucks corresponding to the number are displayed, and the route is sent to the delivery order calculation routine.

Next, FIG. 5B is a routine showing the calculation of the delivery order. This process is based on TSP. In FIG. 5B, first, in step S30,
The number of trucks and the route are read. Next, in step S31, exchange between two points is performed. In other words, for all combinations of links (a connection from a certain node to another node is called a link), an improvement value (final arrival time, etc.) is calculated when the combination is replaced. If a delay is currently occurring, the link is replaced with a link having the smallest delay as a result of the link exchange.
If the delay has already been eliminated, the link is replaced with a link that can return quickly without delay. If the return time has not become earlier, the link is replaced with a link that has the shortest traveling distance within a range in which the return time does not become longer. Then, in step S32, a constraint condition is checked, and in step S33, the values that minimize the distance and time are stored. Then, in step S34, the above processing is performed until all cases are completed. That is, the above operation is repeated until the value no longer changes or reaches the predetermined number of times. The above constraint check is to check whether or not the planned route satisfies transportation constraints such as the specification of the delivery time and the maximum value of the loading capacity input to the customer database and the truck database. Saving the minimum value means, when performing all the combination calculations, calculating the travel distance (or operating time) as an evaluation function, and storing the combination that becomes the minimum value and its value.

In the present invention, step S in FIG.
In the distance data read in 20, as described with reference to FIG. 4, the direction in which the traffic regulation exists has a larger value due to weighting. Therefore, in the calculation of FIG. 5, there is no possibility that the direction in which the traffic regulation exists is selected as the route. Hereinafter, this content will be specifically described with reference to FIG.

FIG. 9 is for selecting a route from the distribution center to the seven customers 1 to 7 and returning to the distribution center. For example, as shown in FIG. 9A, it is assumed that right turn prohibition is restricted on the approach road of customer A, and it is impossible to enter from the right direction. When the customer B tries to come to the customer A from the arbitrary customer B, the closer the customer B is to the customer A and the smaller the angle (θa on both sides of the approach road) to the approach road of the shop, the more the approach road becomes. There is a high probability that the vehicle will pass from the right direction. Therefore, the fan shape centered on the customer A (distance La, angle 2θ)
By setting an entry-prohibited area in the range of a) and prohibiting the delivery order of delivering to the customer A next to the customer located within the range, it is possible to prevent the setting of a route that is difficult to deliver. In the present invention, as described above, the route from the customer located in the area of the no-go area (fan-shaped) to the customer A is heavily weighted to the distance value. Will not be selected. For example, in the example shown in FIG. 9B, the customer 2 and the customer 5 have an “entry direction restriction”, the customer 3 enters the area where the customer 2 does not enter, and the customer 6 enters the area where the customer 5 does not enter. ing. Therefore, the link of 3 → 2 in FIG.
The link of 6 → 5 is no longer selected, and as a result (D)
Only the clockwise route like is selected. In the conventional example, there is a possibility that both (C) and (D) of FIG. 9 are selected. However, in the present invention, the counterclockwise rotation of (C) in which it is difficult or inefficient to actually run is selected. Not done.

Normally, if traffic regulation information is to be reflected in the delivery order determination device, it is necessary to input traffic regulation information for roads in all regions to be calculated. However, the target area in the actual delivery business is generally a wide area spanning prefectures, and this is not possible as a practical problem. The present invention, by inputting traffic regulation input only for the target customer,
It is possible to formulate a delivery plan that reflects traffic regulations. By making it possible to formulate a delivery plan that reflects traffic regulations, inefficiencies such as detours to avoid traffic regulations such as one-way regulations do not occur in actual operation. In addition, since the route is not set so that the customer enters the road while turning right on a road with a median strip or a high traffic volume, the operation efficiency is improved and the safety of the driver is also improved.

It is to be noted that the traffic regulation in the vicinity of the destination (customer) as described above can be quickly and easily known by each customer. Regulatory information can be easily obtained.

Next, FIG. 10 is a view for explaining another embodiment of the present invention.
An example is shown in which an entry-prohibited area having a plurality of weights can be set for one customer. In FIG. 10, a plurality of entry prohibited area distances La (L
By setting a1 and La2), the entry prohibited area is divided into a plurality of (entry prohibited areas 1 and 2). The weighting index for each entry-prohibited area in step S14 of FIG. 4 is separately provided. In general, an area closer to a restricted base is weighted more heavily, and the weight is set smaller (more than 1) as the distance increases.

The area designated as the entry-prohibited area is an area where it is calculated that the arrival base is expected to enter the arrival base from the entry restriction direction. In the setting method shown in FIG. 6, the combination with the base in the area is basically selected. Impossible. However, in practice, when the distance from the restricted base increases, the selectivity of a plurality of routes increases, and entry from a direction other than the entry restriction direction may be possible. Further, when determining the delivery order, depending on the location of the target bases, if all bases in the no-go area are excluded, a realistic delivery order may not be formed. Therefore, as shown in FIG. 10, if the distance data is weighted in a plurality of stages and the weight of a far site is reduced, the base is a combination target from a site with a low degree of definiteness of approach from the approach restriction direction. A simple delivery order can be easily obtained.

[Brief description of the drawings]

FIG. 1 is a block diagram showing a configuration of an embodiment of a delivery order determination device according to the present invention.

FIG. 2 is a schematic diagram showing the use status of the delivery order determination device of the present invention.

FIG. 3 is a flowchart showing a flow of an entire process in the apparatus of FIG. 1;

FIG. 4 is a flowchart showing a calculation process (contents of step S2 in FIG. 3) of a distance database.

FIG. 5 is a process for determining the number of trucks (step S5 in FIG. 3).
FIG. 4 is a flowchart showing a delivery order calculation process (contents of step S6 in FIG. 3).

FIG. 6 is a diagram for explaining the condition setting of an entry prohibition area for an arrival base having an entry direction designation.

FIG. 7 is a diagram showing an example of a customer database.

FIG. 8 is a diagram showing an example of a distance database.

FIG. 9 is a diagram for explaining a delivery order determination method when there is an entry direction restriction.

FIG. 10 is a view for explaining an example of setting an entry-prohibited area having a plurality of weights for one customer when setting an entry-prohibited area.

[Explanation of symbols]

DESCRIPTION OF SYMBOLS 1 ... Customer data input means 2 ... Customer database memory 3 ... Distance database calculation means 4 ... Distance database memory 5 ... Delivery order calculation means 6 ... Fixed station 7 ... Delivery order determination device 8 ... Vehicle 9 ... In-vehicle navigation device

 ──────────────────────────────────────────────────続 き Continued on the front page F term (reference) 2F029 AA02 AB12 AB13 AC02 AC09 AC13 5B049 BB31 EE31 FF01 GG03 5B075 QP05 UU14 5H180 AA15 CC12 EE02 FF12 FF13 FF21

Claims (5)

[Claims] An apparatus for calculating a delivery order in which a plurality of locations to be delivered or picked up is circulated, comprising a customer database that stores the restrictions on the approach direction for locations having restrictions on the approach direction. Based on the customer database, search for a base approaching from a restricted direction to a base with a restricted approach direction, by weighting the value of the restricted direction in the distance data between the bases, A delivery order determination device, characterized by adding an algorithm for avoiding entry from a restricted direction when calculating the delivery order. 2. Input means for inputting at least a customer name, a location, and an approach direction restriction of a approach road facing the base for each base to be delivered or picked up, and the contents input by the input means are stored. Based on the contents of the customer database and the contents of the customer database, the distance data between all the locations to be delivered or picked up is calculated, and the location where the approach direction is restricted is entered from the restricted direction. A distance database calculating means for creating a distance database by searching for a base to be performed and weighting the value of the restricted direction in the distance data between the bases with a large weight. The delivery order determining device according to claim 1, further comprising: a delivery order calculating unit that calculates a delivery order to be performed. 3. The distance database computing means searches the customer database for entry direction constraints for a plurality of delivery points designated and input from the input means, and, for a base having entry direction restrictions, the entry direction constraint. Setting a fan-shaped entry-prohibition area based on the distance La indicating the range of the entry-prohibition area and the angle θa with respect to the approach road,
Calculate the distance data between all the bases to be delivered or picked up, and search for bases that fall within the no-go area with respect to the bases with the approach direction restriction, and search for the bases in the distance data between the bases. 3. The delivery order determination device according to claim 2, wherein the distance database is created by weighting the values of the restricted directions. 4. The distance database calculating means includes a plurality of distances La indicating the range of the no-going area for one base, a plurality of no-going areas corresponding to the respective distances La, and 4. The distribution order determining apparatus according to claim 2, wherein the distance database is generated by performing different weighting for each area. 5. A plurality of designated deliveries for each base to be delivered or picked up, based on at least the location, restrictions on the approach direction of the approaching road facing the base, and the contents of a customer database storing customer names. A search is made for the entry direction constraint for the base, and for a base having the entry direction constraint, a sector-shaped approach is performed based on the distance La indicating the range of the entry prohibited area input as the entry direction constraint and the angle θa with respect to the approach road. A prohibited area is set, distance data between all the bases to be delivered or picked up is calculated, and a base that is within the restricted area is searched for a base with the restriction on the approach direction, and the base is searched. A distance database creating method, wherein a distance database is created by giving a large weight to the value of the restricted direction in the distance data between the two.