JPH10134300A - Device and method for deciding optimum delivery route and delivery vehicle and medium recording program for deciding optimum delivery route and delivery vehicle - Google Patents

Abstract

PROBLEM TO BE SOLVED: To accelerate efficient merchandise delivery by giving necessary information to a computer system so as to automatically decide an optimum delivery route and the kind and the number of necessary delivering vehicle concerning delivery to plural customers. SOLUTION: An application program stored in a storing part 17 is read into an arithmetic processing part 12 to execute. A dividing means 31 divides plural stores, which are arranged on a map and receive the request of merchandise delivery, into delivery areas decided from their distribution by applying a mesh method and a combining means 32 combines a mesh including a store and road data in map data so as to decide the optimum delivery route based on minimizing a delivery distance by a method of single stroke drawing. After deciding the optimum delivery route, a delivery vehicle deciding means 33 divides the delivery route by assigning a proper delivery vehicle by a direction from a starting point to a finish point so as to decide the kind and the number of necessary delivery vehicles. A traveling route of each delivery vehicle is decided as an assigned section.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a method for efficiently setting a delivery route and determining a vehicle required for delivery in a short time, thereby reducing the number of delivery vehicles and reducing delivery costs. TECHNICAL FIELD The present invention relates to an optimal delivery route / delivery vehicle determining apparatus, a method for determining an optimal delivery route / delivery vehicle, and a medium recording a program for executing the method.

[0002]

2. Description of the Related Art For products such as foods sold at convenience stores and supermarkets, necessary products are ordered daily from a manufacturing company in accordance with the sales status of the products. Will be delivered to the required quantity ordered. On the other hand, a manufacturing company or a product delivery company
It is required to receive an order for product distribution from a large number of stores, and to deliver various types of commodities required in each of the large number of stores in a required amount. Traditionally, delivery of such products has been based on many years of experience,
The type and number of delivery vehicles and the traveling route of each delivery vehicle are determined, and delivery is performed.

[0003]

For example, in the case where a product ordered by each retail store is distributed from one factory of a food manufacturing company to a large number of stores scattered in a limited area covered by the factory, Now, the variety of products has increased,
Due to the increased number of stores, each store has its own unique circumstances, etc., it is difficult for individual delivery staff to make vehicle allocation plans and determine delivery routes (delivery planning) as before. It has become Also on the food manufacturing side,
In order to reduce the cost of the logistics department from a management standpoint, it is desired to efficiently and optimally perform a vehicle allocation plan and a delivery route in product delivery.

[0004] An object of the present invention is to solve the above-mentioned problems, and to automatically determine an optimal delivery route and the type and number of required delivery vehicles, thereby efficiently planning a product delivery. An object of the present invention is to provide an optimal delivery route / delivery vehicle determining apparatus, a method for determining an optimal delivery route / delivery vehicle, and a medium recording a program for executing the method, which reduce the product delivery cost by performing the method quickly.

[0005]

The optimal delivery route / delivery vehicle determining apparatus according to the present invention is configured as follows to achieve the above object.

A first optimum delivery route / delivery vehicle determination device (corresponding to claim 1) is a map data used for drawing a map of a delivery area on a screen of a display means, and a map data specified on the map. Location data of each of a plurality of delivery destinations (stores or customers) and at least one delivery source (a factory or the like);
First storage means for storing various data necessary for a delivery plan of a vehicle or the like prepared at a delivery source or an order amount from each delivery destination; and a plurality of delivery ranges including a plurality of delivery destinations using a mesh method. Dividing means (means for creating a mesh), a second storage means for storing a mesh including any of a plurality of delivery destinations among a plurality of meshes, and a mesh stored in the second storage means, A connection means (delivery route creation means) for creating an optimal delivery route by using the road data included in the map data and connecting with one stroke so as to satisfy the shortest distance condition.
And third storage means for storing the optimum delivery route created by the connecting means; and optimal delivery while moving from the first delivery destination to the last delivery destination according to the optimum delivery route stored in the third storage means. The route is divided by allocating appropriate delivery vehicles, and a delivery vehicle determining means for determining a required type and number of delivery vehicles.

In the apparatus for determining an optimum delivery route / delivery vehicle according to the present invention, a plurality of stores, that is, delivery destinations that have been requested to deliver a product are arranged on a map, and determined based on a distribution state of the plurality of delivery destinations on the map. The range is divided by applying the mesh method to the delivery range, and the mesh including the delivery destination is combined with the road data in the map data by a one-stroke method and based on the criterion that the delivery distance is minimized. Determine the delivery route. After the optimal delivery route is determined, the delivery route is allocated and divided in the direction from the start point to the end point, and the type and the number of required delivery vehicles are determined. The travel route of each delivery vehicle is determined as an assigned section. In this manner, when a product is delivered from a delivery source to a plurality of delivery destinations for which a product delivery order has been placed, information such as the location of the delivery destination on a map, the order amount, and other restraint time is transmitted to the computer system. By giving and determining the range to be delivered, the optimal delivery route and the type and number of required delivery vehicles can be automatically determined, and a delivery plan can be made efficiently.

[0008] In the second optimal delivery route / delivery vehicle determining apparatus (corresponding to claim 2), when the network includes two or more delivery destinations in the first apparatus configuration, the dividing means is configured to perform The mesh is subdivided into smaller meshes so as to include one delivery destination, and the linking means creates a delivery route by a single stroke using the small meshes and road data in a mesh including two or more delivery destinations. It is characterized by doing. If the mesh applied in the first stage is large and one mesh includes a plurality of destinations, the range of the large mesh is divided into smaller meshes so that one mesh includes one destination, An optimum delivery route is determined in the same manner. Delivery routes made using small meshes
Connected to a delivery route made using a large mesh,
An optimal single-stroke delivery route is created for a plurality of delivery destinations for which product delivery orders have been placed.

The third optimum delivery route / delivery vehicle determining device (corresponding to claim 3) is preferably arranged such that, in the first or second device configuration, the delivery vehicle determining means is provided for dividing the optimum delivery route. , Compares the accumulated amount of the delivery amount to the delivery destinations arranged in the order of the optimal delivery route with the maximum load amount of the assigned delivery vehicle, and immediately before the accumulated amount exceeds the maximum load amount, Is characterized as a delivery section. When deciding the delivery vehicle, register the vehicles that can be used from the beginning in the system, and apply the vehicles with the largest loading capacity sequentially to separate the optimal delivery route while considering the maximum loading capacity of the vehicle. Will determine the delivery vehicle. Before the delivery amount of the vehicle exceeds its maximum load capacity, the delivery route of the vehicle is determined, and thereby one delivery vehicle is determined.

The fourth optimum delivery route / delivery vehicle determining device (corresponding to claim 4) is preferably configured such that, in the first or second device configuration, the delivery vehicle determining means is configured to separate the optimum delivery route. Comparing the delivery time required when moving in the order of the delivery destination on the optimal delivery route with the binding time of the assigned delivery vehicle, and delimiting the delivery section of the delivery vehicle immediately before the delivery time exceeds the binding time. It is characterized by. As another criterion for determining a delivery vehicle, the restraint time of the vehicle may be used. This is because the delivery time to each delivery destination may be emphasized.

The fifth optimum delivery route / delivery vehicle determining apparatus (corresponding to claim 5) is preferably arranged such that, in the first or second apparatus configuration, the delivery vehicle determining means is provided for dividing the optimum delivery route. Then, the integrated amount obtained by sequentially integrating the delivery amounts to the delivery destinations arranged in the order of the optimal delivery route is compared with the maximum load amount of the assigned delivery vehicle, and the delivery amount is determined immediately before the integrated amount exceeds the maximum load amount. A comparison is made between the criterion for dividing the vehicle as a delivery section, the delivery time required when moving in the order of the delivery destination on the optimal delivery route, and the binding time of the assigned delivery vehicle. A criterion for dividing a delivery section of a delivery vehicle is provided, and one of the criteria is used. As a criterion for dividing an optimal delivery route and determining a delivery vehicle, a combination of each criterion of a limit based on the maximum load capacity and a limit based on the restraint time may be used.

The sixth optimum delivery route / delivery vehicle determining device (corresponding to claim 6) is the fourth or fifth device configuration, wherein preferably, the delivery vehicle determining means includes a delivery corresponding to a delivery section. As a vehicle, a vehicle whose loading rate is closest to 100% is selected from the available vehicle types. When the delivery section is determined in accordance with the criterion using the restriction of the restraint time, a vehicle type having the highest loading ratio of the delivery product is selected in order to increase the delivery efficiency of the vehicle used in the delivery section.

Next, an optimal delivery route / delivery vehicle determination method according to the present invention comprises the following procedure to achieve the above object.

[0014] The first optimum delivery route / delivery vehicle determination method (corresponding to claim 7) is a method for determining an optimum delivery route and a required delivery vehicle by using map data which can draw a map of a delivery area on a screen of a display means. A method of determining a plurality of delivery destinations specified on a map, a procedure of storing position data of each of at least one delivery source, and various data related to a delivery plan, and a range including a plurality of delivery destinations. A procedure of dividing the data into a plurality of meshes, a procedure of storing a mesh including any of the plurality of destinations among the plurality of meshes, and a method of dividing the mesh including any of the plurality of destinations into road data included in the map data. A procedure for creating an optimal delivery route by connecting the strokes so that the shortest distance condition is satisfied, storing the created optimal delivery route, and a procedure from the first delivery destination to the last delivery route according to the optimal delivery route. While moving toward the front, the optimum separate the delivery route by assigning a delivery vehicle, the method comprising the steps of determining the vehicle type and the number of required delivery vehicle.

[0015] The second optimal delivery route / delivery vehicle determination method (corresponding to claim 8) is a method according to the first method, wherein
When the above delivery destinations are included, the mesh is finely divided into smaller meshes so as to include one delivery destination, and a mesh including two or more delivery destinations is drawn using a small mesh and road data. It is characterized by including a procedure for creating a delivery route by writing.

A third optimum delivery route / delivery vehicle determining method (corresponding to claim 9) is a method according to the second or third method, wherein the delivery is preferably arranged in the order of the optimum delivery route when the optimum delivery route is separated. The integrated amount obtained by sequentially integrating the delivery amount to the destination is compared with the maximum load amount of the assigned delivery vehicle, and the delivery amount of the delivery vehicle is divided just before the integrated amount exceeds the maximum load amount. I do.

A fourth optimum delivery route / delivery vehicle determination method (corresponding to claim 10) is that, in the second or third method, preferably, when dividing the optimum delivery route, the order of delivery destinations in the optimum delivery route is determined. A comparison is made between the delivery time required when the vehicle is moved in and the binding time of the assigned delivery vehicle, and the delivery section of the delivery vehicle is divided immediately before the delivery time exceeds the binding time.

According to a fifth optimum delivery route / delivery vehicle determining method (corresponding to claim 11), in the second or third method, preferably, when dividing the optimum delivery route, the optimal delivery routes are arranged in the order of the best delivery route. A comparison is made between the integrated amount obtained by sequentially integrating the delivery amount to the delivery destination and the maximum loading amount of the assigned delivery vehicle, and a reference for dividing the delivery vehicle as a delivery section immediately before the integration amount exceeds the maximum loading amount, The delivery time required when moving in the order of the delivery destinations in the optimal delivery route is compared with the binding time of the assigned delivery vehicle, and the criterion for dividing the delivery section of the delivery vehicle immediately before the delivery time exceeds the binding time is compared. It is characterized in that one of the criteria is used.

The sixth optimum delivery route / delivery vehicle determination method (corresponding to claim 12) is a method according to the second or third method, wherein the delivery vehicle corresponding to the delivery section is preferably
It is characterized in that a vehicle having a loading rate closest to 100% is selected from the available vehicle types.

Further, the medium according to the present invention (corresponding to claim 13) determines an optimum delivery route and a required type and number of delivery vehicles by using map data for displaying a map of a delivery area. A program for storing position data of a plurality of delivery destinations specified on a map and at least one delivery source in a computer,
A procedure of dividing a range including a plurality of delivery destinations by a plurality of meshes, a procedure of storing a mesh including any of a plurality of delivery destinations among the plurality of meshes, and a mesh including any of a plurality of delivery destinations. Using the road data included in the map data, connect the strokes with one stroke to satisfy the shortest distance condition, create the optimal delivery route, store the created optimal delivery route, While moving from the delivery destination to the final delivery destination, the optimal delivery route is allocated and divided into delivery vehicles, and a procedure for determining the type and number of required delivery vehicles is recorded. is there.

When the above storage medium is set in a computer system, and the above program is read and executed by the computer, the above-described optimal delivery route / delivery vehicle determining device is realized, and this device realizes the above-mentioned optimal delivery route / delivery vehicle. A decision method is performed.

[0022]

Preferred embodiments of the present invention will be described below with reference to the accompanying drawings.

The optimum delivery route / delivery vehicle determining apparatus according to the present invention is a system for automatically performing a delivery plan (hereinafter referred to as an "automatic delivery system"), and a method for determining an optimum delivery route and a required delivery vehicle. Is implemented by preferably incorporating an application program for executing the program in a personal computer (hereinafter, referred to as a computer system) and executing the program, and is constructed on the computer system. This optimum delivery route / delivery vehicle determination device is a content displayed on a screen of a display device of a computer system (hereinafter referred to as a “display object”).
The operation is performed when the operator gives necessary conditions (parameters and the like) by the input unit and performs a predetermined operation on the display object through the input unit. Optimal delivery route
The delivery vehicle determination device performs an optimal delivery plan based on given delivery conditions, that is, an optimal delivery route of the delivery vehicle,
In addition, the type and number of required delivery vehicles are automatically and promptly determined and presented to the user on the screen of the display device.

The above program for executing the method for determining the optimum delivery route and delivery vehicle is recorded on a floppy disk or the like, transported in this storage form, loaded into a computer system, and activated as an automatic delivery system. You.

The above-mentioned automatic delivery system utilizes a system including map information and is built on top of it. A prerequisite technical part of an automatic delivery system constructed using a computer system is a system including map information. The automatic delivery system manufactures the product, preferably in a limited area (target area for product delivery),
One (or more) merchandise delivery source (manufacturer's factory, etc.) that delivers the merchandise and an order to sell the merchandise and replenish the missing merchandise according to the sales situation It is assumed that there are a large number of stores (customers, delivery destinations) scattered in the above-mentioned area to receive and deliver ordered products, and under this assumption, ordering by vehicle from the product delivery source to each store This is a system for making a delivery plan on how to deliver goods efficiently. Therefore, a map of the limited area, the location of the merchandise delivery source on the map, the location of a number of stores to which the merchandise is delivered, and the road existing between the merchandise delivery source and each of the number of stores. (Data) relating to the location relationship based on the road and the location relationship based on the road existing between each of the multiple stores, a system including at least the map information on the limited area is required. . The basic map information is usually read into a computer using an image scanner, created as image data, and stored in a storage unit. Also, commercially available map data can be used.

The map information included as image data in the automatic delivery system includes a part of the map information defined by the size of the display screen of the display device through the operation of the input unit.
It is displayed on the display screen. A map representing at least roads, place names, town names, buildings, and the like (according to the scale) is displayed on the screen of the display device. In the map shown on the screen of the display device, for example, the upper part of the screen is set to be true north,
Two-dimensional coordinate management is performed with an arbitrary location as the origin. Therefore, the map displayed on the screen is managed by two-dimensional coordinates with the set accuracy, and coordinates (x, y) are given to each point on the map. In the map information stored in the storage unit, a partial map of an arbitrary area in the map information can be displayed on a screen of a display device, and each point on the map is uniquely given coordinates. The map displayed on the screen is a partial map of the above-mentioned limited area, and the partial map displayed on the screen is scrolled in a vertical direction or a horizontal direction,
It is continuously connected to the adjacent map part stored in the storage unit.

FIG. 1 is a block diagram of a computer system in which an automatic delivery system according to the present invention is realized. The computer system 11 includes an arithmetic processing unit 12 for performing various data processing, image data 13 of a map relating to the above-mentioned limited area, and condition data (variables and the like) 14 for creating an automatic delivery plan described later. , Calculation data (position, route, etc.) obtained by calculation processing 15, application program 16 for realizing automatic delivery system
(A hard disk or the like) 17 for storing the information, a display unit 18 as an output device, and an input unit 19 for inputting various condition data. The contents of the application program 16 will be described later with reference to a flowchart.

Image data 1 stored in storage unit 17
3, when the map data is partially specified and read out and displayed on the screen of the display unit 18 by appropriately instructing the scale of the map, the result is as shown in FIG. The map displayed on the screen shows a large number of roads, railways, town names and place names, buildings and structures, schools, public facilities, etc., and displays notations on roads and buildings (building names and residences) according to the scale. ). When the designation of the display object is changed and scrolling is performed, the display object on the screen changes continuously. When an arbitrary point is designated on the display object on the screen shown in FIG. 2, that is, on the map, the coordinate value (x, y) of the point is uniquely determined.

FIG. 3 shows an example of a map showing a certain limited area, that is, an area to which goods are to be delivered, using FIG. This map 21 shows a product delivery source 22 which is a factory and all stores 23 which can be product delivery destinations in a product delivery target area. When the entire map 21 cannot be displayed on the screen of the display unit 18, a part required in the map 21 is displayed. In the automatic delivery system according to the present invention, by providing conditions such as position information (position coordinates) of a store to be delivered, a delivery amount of a product to each store, and a delivery order at each store, a product delivery source is provided. A vehicle movement route (delivery route or delivery route) optimal for delivery from 22 to each store 23, and the type and number of vehicles required for delivery are automatically determined. In the automatic delivery plan by the automatic delivery system, the above-mentioned map 21 is used as a background map, and the goods delivery source 22 and all the stores 23 are recognized as points on the map 21, and the position coordinates can be obtained. The distance between them (linear distance) can be calculated on the system using the scale of the background map.

The data of the location coordinates of the product delivery source 22 and all the stores 23 on the product delivery target area, that is, the map 21, are input in advance and stored in the storage unit 17. Position information of an arbitrary place such as a store can be input through the input unit 19, and a corresponding map is displayed on the screen of the display unit 18, and a pointing device (FIG. (Not shown), the position coordinates of the designated location are automatically calculated and input to the storage unit 17. A plurality of stores to be delivered according to the order are input via the input unit 19 or specified on a map displayed on the screen of the display unit 18 so that their position coordinates are automatically distributed. Given to the system.

FIG. 4 is a block diagram showing the apparatus configuration of the automatic delivery system from a functional viewpoint. The automatic delivery system is realized by reading the application program 16 stored in the storage unit 17 of FIG. 1 into the arithmetic processing unit 12 and executing the application program 16 as described above. Due to the execution operation of the arithmetic processing unit 12, the automatic delivery system places an order for product delivery and sets a delivery range surrounding these stores for a plurality of stores (delivery destinations) to be delivered according to the order. Then, a dividing means (means for creating a mesh) 31 for dividing the distribution range into a plurality of meshes by applying a mesh method to the distribution range, and a plurality of meshes formed by the division means 31 A connecting means (delivery route creating means) 32 for creating an optimal delivery route by connecting a mesh including stores with a single stroke using the road data included in the map data so as to satisfy the shortest distance condition; While moving from the first delivery destination to the last delivery destination according to the optimal delivery route made in the above, the optimal delivery route is prepared in advance according to the maximum loading capacity standard etc. Both the assignment delimit optimal delivery route, and a delivery vehicle determining unit 33 for determining the required model and the number of delivery vehicles, delivery to be interval of each delivery vehicle. As shown in FIG. 1, map data that can be used to draw a map of a delivery area on the screen of the display unit 18, position data of a plurality of stores and at least one delivery source specified on this map, and each store The data such as the order quantity, the length of stay in the store, the type of vehicle that can be used for delivery, the number of vehicles, the traveling speed, the restraint time, and the like are stored as the image data 13 and the condition data 14 in the storage unit 17. The part where this storage is performed is the first
The storage unit 34 is used. The plurality of meshes formed by the dividing means 31 and each data of the meshes including the stores to be delivered among the meshes are stored in the storage unit 17 as the calculation data 15. The part where this storage is performed is stored in the second storage unit 3
5 is assumed. Similarly, the optimal delivery route created by the connecting means 32 is stored in the storage unit 17 as the operation data 15. The portion where the storage is performed is referred to as a third storage unit 36. Further, the type and number of the required delivery vehicles determined by the delivery vehicle determination means 33 and the section to be delivered by each delivery vehicle are finally stored in the storage unit 17 as the calculation data 15. In the above configuration, the dividing means 31 divides a plurality of stores on the map, for which a product distribution request has been made, by applying a mesh method to a distribution range determined from the distribution, and the connecting means 32 divides the stores. An optimum delivery route is determined based on a combination of the mesh data and the road data in the map data by a one-stroke technique based on the criterion that the delivery distance is minimized. After the optimal delivery route is determined, the delivery vehicle determination means 33
Allocates an appropriate delivery vehicle in the direction from the start point to the end point and divides the delivery route, and determines the type and number of required delivery vehicles. The travel route of each delivery vehicle is determined as an assigned section. Thus, in the case of performing product delivery from a delivery source to a plurality of stores where a product delivery order has been placed, information such as the location of the store on a map, the order amount, and other restraint time should be given to the computer system and delivered. By determining the range, it is possible to automatically determine the optimal delivery route and the type and number of required delivery vehicles.

Next, the operation of executing the delivery plan by the automatic delivery system will be described with reference to the flowcharts of FIGS. 5A and 5B. The automatic delivery system shown in these flowcharts is stored in the storage unit 17 as an application program.

In the delivery plan, at a certain time, a plurality of (hereinafter referred to as n) stores (customers or customers) 23-1 to 23-n of the stores 23 are sent to the product delivery source 22.
When a product delivery order is given from, the delivery amount is calculated in consideration of the delivery conditions, and the optimal delivery route (delivery route)
Is calculated by a one-stroke method, and then the type and the number of required delivery vehicles are calculated by giving the condition of the maximum loading capacity or the restraint time for one delivery vehicle.

In the present invention, the automatic determination of the delivery route is performed by ordering a plurality of destination stores based on a single-stroke order in which the delivery distance is the shortest (the same meaning as the best delivery efficiency). It is performed by Then, based on the conditions of the maximum loading amount and the restraint time for each delivery vehicle, the required types and number of delivery vehicles are determined by dividing the delivery vehicles in a single-stroke order and applying each delivery vehicle to a delivery route. As a result, the overall delivery efficiency is optimized. The above-described method is based on the idea that a route created with a single stroke can be delivered efficiently regardless of where it is divided.

The flowchart of FIG. 5A shows a delivery route creation process for determining an optimal delivery route, and the flowchart of FIG. 5B shows a delivery information creation process for determining a vehicle type with a delivery vehicle. The operation of executing the delivery plan by the automatic delivery system includes a delivery route creation process and a delivery information creation process. After the delivery route creation process is executed, the delivery information creation process is executed. The optimum delivery route of the delivery vehicle is determined by the delivery route creation process. In addition, the type of the required delivery vehicle, the location to be delivered, and the number of delivery vehicles are determined by the delivery information creation route.

When a delivery plan is determined by the automatic delivery system to determine an optimum delivery route of a delivery vehicle and a necessary delivery vehicle, delivery conditions are input at an initial stage. The contents of the delivery conditions are as follows. Further, regarding the setting of the delivery condition, variables used for the operation on the automatic delivery system are defined.

The first delivery condition is the above-mentioned n to be delivered.
The location of the store. This position is the person (operator)
By directly plotting and specifying the coordinates on the map displayed on the screen of the display unit 18 or by inputting via the input unit 19, the position coordinates (X
[I], Y [i]: i = 1, 2, 3,..., N) are given to the computer system. The above n stores are
Given the position coordinates on the background map, it is plotted. In addition, the total delivery amount is the number of ordered boxes (Hako [i]) for product orders from each store. Similarly, the following other variables are set.

Ban [i]: Vehicle number No [i]: Delivery order Taizai [i]: Stay time at each store, CRyo [i]: Set the maximum number of loading boxes for each vehicle, k is the vehicle number Mmin: Delivery Minimum value of range mesh Mmax: Maximum value of delivery range mesh Zisoku: Vehicle traveling speed (Km / h) Douro: Road network (length = 0: width = 1) Utime: Vehicle restraint time Kiten: Mesh base point (start point) Hosei : Distance correction coefficient

The detailed contents and usage of each of the above variables will be described later in the description of the flowchart.

In calculating an optimal delivery route and determining a required delivery vehicle based on the automatic delivery system, a method using a mesh (referred to as a "mesh method") is used. In the mesh method, a rectangular eye (1) of an arbitrary size (mesh width) is used.
This is a method of dividing a map area using two meshes (hereinafter, referred to as “mesh”).

In the mesh method, the computer system 1
The position of n stores is registered on the map stored in the storage unit 17 of the first store, and then a rectangular area surrounding all the stores of n stores is created on the map. Partitioning is performed by a mesh (preferably square) of side x meters, and all the n stores are divided into groups for each mesh. One mesh is set as a group area to be delivered, and moves to the next mesh after the delivery of the store of one mesh is completed.

The initial mesh size (mesh width) used in the mesh method is preferably such that one mesh includes 5 to 10 stores. The length of one side of the mesh (mesh width) differs depending on the area. For example, 500 m to 2 km in an urban area (densely packed area), 2 to 10 in a mountain area or the like.
km is desirably set. In the system of the present embodiment, the minimum value (Mmin) and the maximum value (Mm
ax) is registered, and the mesh width can be arbitrarily set between the minimum value and the maximum value according to the distribution state of the store. Note that the distribution status of stores differs depending on the user who uses the automatic delivery system, and ranges from a minimum of 1 m to a maximum of 100 k.
m can be set.

On the other hand, information on the road network of the delivery target area is registered in advance as a part of the map information. In this case, the east-west direction is the horizontal direction, and the north-south direction is the vertical direction. In the mesh, adjacent meshes are connected so as to correspond to the road network, and a delivery route is created by a one-stroke method so as to minimize the route distance.

When a plurality of stores are included in one mesh in the mesh by the mesh method, the mesh is divided further finely so that one store is included in one mesh. Here, the mesh before division is called a large mesh, and the mesh after subdivision is called a small mesh. In the case of the small mesh, as in the case of the large mesh, a delivery route that connects each store with a single stroke is created.

As described above, a region (delivery range) in which n stores to be delivered among distribution target regions are distributed is surrounded by a rectangular region, and the rectangular region is divided by the mesh. Then, the n stores are arranged in any of the meshes. The mesh width is initially set to a minimum value (Mmin). The operator specifies a mesh width for the automatic delivery system via the input unit 19.
N stores 23-1 and 2-2 according to the specified mesh width
The position of 3-n is partitioned. The optimum delivery route is calculated between the n stores thus partitioned. Further, if necessary, the mesh is subdivided by another mesh, and a delivery route is obtained.

The creation of the optimum route will be described in detail with reference to the flowchart shown in FIG. 5A. Step S11 is an initial setting step. In the initial setup steps,
Mmin, Mmax, Douro, Zisoku, Utime, Kiten, CRyo
Conditions are set for each variable of [k] and Hosei.

The variable Mmin is the minimum value of the mesh width when the distribution range is divided by a mesh composed of rectangular meshes.
The unit is, for example, meters (m). The variable Mmax is
This is the maximum value of the mesh width when the distribution range is divided by meshes composed of meshes. The variable Douro is a variable that determines the road network in the above-mentioned distribution range and sets whether the road is developed north-south or east-west. Variable Zi
soku is the average speed per hour of the delivery vehicle. The variable Utime is the constraint time of the delivery vehicle. The delivery vehicle cannot spend more delivery time than the set restraint time. Variable Kite
n is a start point specified when setting an optimal delivery route in the delivery range. In the present embodiment, any of the four starting points, upper left, lower left, upper right, and lower right, is designated as the starting point in the delivery range. The variable CRyo [k] is the maximum number of boxes that can be loaded on the delivery vehicle with the vehicle number k (= 1, 2,...). The variable Hosei is a coefficient for correcting the distance.

Next, the delivery range in which all the n stores are accommodated is set as a rectangular area based on their position coordinates, and the coordinates (R
_x1 , _Ry1 ) and the coordinates ( _Rx2 , _Ry2 ) of the lower right end are obtained (step S12). FIG. 6 shows a simple example of this state. In FIG. 6, a plurality of black dots 41 indicate stores in the delivery range 42. A point 43 is a point at the upper left end of the coordinates (R _x1 , R _y1 ), and a point 44 is a point at the lower right end of the coordinates (R _x2 , R _y2 ).

In step S13, a minimum value Mmin of the mesh width (mesh size) is set. When the mesh width is specified in this way, in the delivery range in which the above-mentioned n stores are accommodated, the delivery range is partitioned by the mesh width of the minimum value Mmin, and a mesh is created (step S).
14). Each store enters one of the meshes of the mesh. In the created mesh, at least one of the n stores enters one of the meshes. Note that, depending on the mesh, two or more stores may be included. This state is shown in FIG. FIG. 7 shows the distribution range 42 of FIG. 6 divided by a mesh 45 and grouped.

In this state, an optimal delivery route is created by a one-stroke method (step S15). In the step of creating a one-stroke writing route, the n stores accommodated in the set delivery range are placed in one of the meshes having the minimum mesh width (Mmin) while using the road network. Connect all the meshes. In this case, using the variable Kiten and the road characteristics (variable Douro), each mesh is connected by using the road network by the designated start point.

FIG. 8 shows how to connect meshes according to the starting point.
A to D of FIG. Preferably, when the starting point is at the upper left, the connection is made on a vertical (north-south) road (FIG. 8A), and when the starting point is on the upper right, the connection is made on a lateral (east-west) road. (B in FIG. 8), when the starting point is at the lower left, the connection is made on the horizontal road (C in FIG. 8), and when the starting point is on the lower right, the connection is made on the vertical road (FIG. 8). D).

The location of the start point is determined on the basis of the relationship between the delivery range 43 and the above-mentioned merchandise delivery source 22, and as a delivery method, the store that is farthest from the merchandise delivery source 22 is determined first. The method is broadly divided into a delivery method and a delivery method from a store closest to the commodity delivery source 22 first. Also, the delivery method differs depending on the user,
Alternatively, since the setting method differs according to the characteristics of the area, the starting point can be manually set. Further, the method of connecting the meshes of the mesh is determined depending on the setting of the road network.

When a plurality of stores exist in one mesh (for example, 45a in FIG. 7), it is necessary to determine a delivery route between the plurality of stores in the mesh. Therefore, the mesh is further finely divided by a small mesh, and a plurality of stores are connected in a one-stroke form by setting a road network.

FIG. 9A shows an example in which, for example, five stores 41 are included in one mesh 45 of a large mesh. Regarding the mesh 45, as shown by an arrow 46, it is assumed that the mesh 45 is connected to another adjacent mesh by a vertical road network. In such a case, in a small mesh by fine division,
A plurality of stores 41 are connected in the horizontal direction. As a result, FIG.
As shown in FIG.
1 are connected by a single stroke 47. As described above, in the case where the mesh is connected by a vertical road network in the large mesh, the connection in the horizontal direction by the small mesh is efficient in terms of shortening the moving distance between stores. On the other hand, when the meshes are connected by a horizontal road network in a large mesh, the connection in the vertical direction with a small mesh is efficient from the viewpoint that the moving distance between stores is shortened.

As described above, in the delivery range 42, when the mesh width is Mmin, n stores are connected with one stroke using a straight line, and an example of the delivery route is calculated.

In the next step S16, step S15
The distance of the delivery route calculated in is calculated. This distance is the scale of the background map and the distance correction coefficient (Hosei) described above.
Is calculated by the arithmetic processing unit 11 using The calculated distance is stored in the variable Kyori. The value of this variable Kyori is
In determination step S17, the distance is compared with the distance ("previous distance") obtained in the previous delivery route calculation process.
If Kyori is smaller than the previous distance, the variable Kyori
Is replaced with the "previous distance" (step S1).
8). Next, the mesh width is increased by a predetermined amount from the minimum mesh width Mmin (step S19), and further, in decision step S20, the newly set mesh width is set to the value set by the variable Mmax (maximum mesh width). It is determined whether it is greater than or not. Incidentally, in the judgment step S17,
When it is determined that the value of the variable Kyori is smaller than “the previous distance”, step S19 is executed, and the process proceeds to the determination step S20. At decision step S20, step S1
Steps S14 to S19 are repeated as long as it is determined that the mesh width set in 9 is smaller than the maximum value Mmax of the mesh width. If it is determined in the determination step S20 that the mesh width is larger than the maximum value Mmax of the mesh width, the process proceeds to step S21. Step S
In 21, the n stores are arranged so that the distance of the delivery route is the shortest. An example is shown in FIG. 48 is the optimal delivery route.

The reason why the distance of the delivery route may be reduced by changing the mesh width is that the mesh to which a part of the store belongs may be changed and the delivery route may be optimized. is there. As described above, the delivery route determined as the minimum distance among the calculated delivery routes is determined as the optimal delivery route in delivering the product to the n stores.

Next, according to the flowchart shown in FIG. 5B, the delivery route obtained as described above is divided based on the delivery conditions of the delivery vehicle to be used and the conditions of each store (customer). A process for determining the type and number of delivery vehicles and the route to be delivered will be described.

Vehicles required for delivery are determined based on the delivery conditions of each delivery vehicle and the conditions of each store. The delivery conditions include the maximum load capacity, restraint time, traveling speed, and distance correction coefficient. In the conditions, the number of order boxes and the stay time are present.
The above-mentioned optimal delivery route determined by a one-stroke method is divided by each delivery route of a plurality of delivery vehicles, but the condition for dividing the delivery route by the vehicle is when the load capacity is over and the restraint time is over. is there. If overage occurs under either of the conditions, a break for one delivery vehicle is set at the preceding stage.

Therefore, in the initial setting step S22, Sy
aban, Rno, Mise and ALLHako are used.
Syaban = 1, Rno = 1, Mise = 1, ALLHako = Hako [Mise]. Here, Syaban = 1 means that the vehicle number of the first delivery vehicle has been designated, Rno = 1 means that the delivery route number for each delivery vehicle is designated, and Mise = 1 means one. The second store means ALLHako = Hako [Mise]
In this case, it means the delivery amount of the first store. The delivery time of one vehicle is calculated as Time = Taizai [Mise].

In the above description, it is assumed that the first delivery vehicle whose vehicle number is set as Syaban = 1 has the largest loading capacity among the registered vehicles. More specifically, for example, a 4-ton vehicle, a 3-ton vehicle, a 2-ton vehicle,
Assuming that there are five types of four-ton vehicles,
All of these vehicles are registered, and among them, one of the 4-ton vehicles is initially set as Syaban = 1. Regarding the first delivery vehicle set as Syaban = 1, when the delivery vehicle sequentially delivers stores along the optimal delivery route determined as described above, it is determined whether or not the loading capacity is over. It is determined in step S23, and it is determined in determination step S24 whether or not the constraint time is exceeded.

In decision step S23, ALLHako + Hako [M
The number of boxes given by the expression of ise + 1] is the maximum loading capacity (maximum number of loading boxes) CRyo [1] (generally CRyo [k]: vehicle number k =
.., K in this case because it is the first delivery vehicle
Is greater than 1). This large / small relationship is determined by adding the number of boxes for the next store (Mise + 1) (Hako [Mise + 1]) to the current number of boxes (ALLHako), When it exceeds, it is a determination to set one break so that the delivery by the vehicle is completed on the delivery route to the current store. Therefore, in other words, in this case, the number of boxes obtained by adding the number of order boxes of the first store and the number of order boxes of the second store to the first delivery vehicle is the largest of the delivery vehicles. It is determined whether the number is larger than the number of loading boxes. If NO is determined in the determination step S23, the process proceeds to the next determination step S24, and YES
If it is determined, the process proceeds to step S29.

In the judgment step S24, Time + T [Mise + 1]
The time given by the formula is the restraint time (Utime
) Is determined. The determination of the magnitude relationship is based on the time spent at the current store (first store) (Ti
to the next store (Mise + 1: in this case, the second store) and the time (T [Mise + 1]) consisting of the time spent at the next store If the time becomes longer than the constraint time (Utime), the determination is made as one break so that the delivery by the vehicle is completed on the delivery route to the current store. The calculation of the travel time in the determination of the excess of the restraint time is performed by multiplying the distance between stores by a distance correction coefficient according to the route of the optimal delivery route determined as described above to obtain a distance substantially equal to the actual distance. By dividing this distance by the traveling speed. By adding the stay time for each store to the travel time, a delivery time required for one delivery vehicle is obtained. Here, the corrected distance coefficient (Hosei) is a coefficient for correcting the distance error when driving on an actual road because the system can measure the distance only on the map using the relative coordinates between the stores. It is. The distance correction coefficient is set according to the area, and a numerical value from 1.3 to 1.7 is desirable. In the determination step S24, when the time does not exceed the binding time (NO
), The process proceeds to step S25, and if it exceeds the constraint time (YES), the process proceeds to step S28.

In step S25, the vehicle number of the delivery vehicle and the route of delivery are stored for each store. Variable Syaban
(In this case, 1) is stored in the variable Ban [Mise], and the numerical value of the variable Ryo (in this case, 1) is stored in the variable No [Mise]. Specifically, regarding the first store, the vehicle number 1 of the first delivery vehicle is stored in Ban [1], and the delivery route 1 of the first delivery vehicle is stored in No [1]. You.

In the next step S26, the values of the variables Ryo and Mise are each increased by one. Further, in determination step S27, it is determined whether the value of variable Mise is smaller than the maximum number n of stores. That is, it is determined whether or not all stores on the delivery route to which product delivery should be performed have been connected. If the connection has not been completed, the process returns to the determination step S23, and the above steps S23 to S26 are repeated.

Step S for judging the first delivery vehicle
If YES in step 23, that is, if the number of loading boxes is larger than the maximum number of loading boxes, the delivery route of the delivery vehicle is determined, and the delivery information is recorded in step S29. In the recording of the delivery information, the vehicle number and the route number of the delivery vehicle are recorded for each store, and the delivery time, mileage, and loading ratio are recorded for each delivery vehicle. In the next step S30, the value of the variable Syaban is increased by 1, and the process returns to step S23.
In this case, it is the second delivery vehicle of vehicle number 2. Step S23 is performed for the second delivery vehicle in the same manner as described above.
To S27 are repeatedly executed.

Further, regarding the first delivery vehicle, YE is not determined in decision step S23 but in decision step S24.
If S, that is, if the delivery time is longer than the binding time, the delivery route is similarly determined, and the process proceeds to step S28. However, since the type of delivery vehicle has not been determined,
Determined in step S28. In step S28, a vehicle whose loading ratio is close to 100% is selected as a delivery vehicle,
Determine. This will be described specifically. The maximum loading capacity of the aforementioned 4-ton, 3-ton, 2-ton and 1-ton vehicles is 400 respectively.
Boxes, 300 boxes, 200 boxes, and 100 boxes.
As a result of the above processing, when ALLHako becomes 180, a 2-ton vehicle is selected from the registered vehicle types instead of the initially set 4-ton vehicle. This is because a 2-ton vehicle has a loading ratio of 90% and can use the vehicle more efficiently. As described above, when one delivery vehicle is selected by using the restraint time, depending on the type of the vehicle, there is a case where the maximum load is not reached. Therefore, the loading ratio approaches the 100% among the available types of the vehicle. Select a vehicle. Then, in step S29, S
Then, the process returns to step S30.

As described above, in the judgment step S27,
Unless the number of stores exceeds n, steps S23 to S30 are repeated, and the optimal delivery route is divided and divided by the optimal delivery vehicle. If the number of stores exceeds n in the judgment step S27, the process ends. As a result, the optimal delivery route is divided by the appropriate number of delivery vehicles and the number of delivery vehicles, and the vehicles required for delivery are determined.

[0069]

As is apparent from the above description, according to the present invention, when a plurality of customers in a delivery target area place an order for a product at a delivery source, map data managed by a computer system and the corresponding map data are stored. By using the customer's location data on the map, using the amount of orders from each customer, and information on vehicles that can be used for delivery by the delivery source, etc., only necessary information is given to the computer system, With regard to delivery to the above-mentioned plurality of customers, the optimum delivery route and the type and number of required delivery vehicles are automatically determined, and efficient product delivery can be quickly performed. Delivery costs can be reduced.

[Brief description of the drawings]

FIG. 1 is a block diagram of an apparatus according to the present invention.

FIG. 2 is a diagram showing an example of a map shown on a screen of a display unit.

FIG. 3 is a diagram showing a store (delivery destination) and a delivery source on a map.

FIG. 4 is a calibration diagram showing the configuration of the apparatus according to the present invention in a functional aspect.

FIG. 5A is a flowchart for obtaining an optimal delivery route.

FIG. 5B is a flowchart for obtaining delivery vehicle information.

FIG. 6 is a diagram showing a relationship between stores to be delivered and setting of a delivery range.

FIG. 7 is a diagram showing a state in which a delivery range is divided by a mesh.

FIG. 8 is a diagram illustrating how to determine a delivery route according to a start point.

FIG. 9 is a diagram for explaining a method of further subdividing a large mesh network with a smaller mesh.

FIG. 10 is a diagram showing a state in which an optimum delivery route is drawn by one-stroke drawing.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 11 Computer system 12 Arithmetic processing part 17 Storage part 18 Display part 23 Store (delivery destination) 22 Delivery origin 31 Division means 32 Connecting means 33 Delivery vehicle determination means

Claims (13)

[Claims] 1. Map data for drawing a map of a delivery area on a screen of a display means, position data of each of a plurality of delivery destinations and at least one delivery source specified on the map, and First storage means for storing related data; dividing means for dividing a range including the plurality of delivery destinations into a plurality of meshes; and storing a mesh containing any of the plurality of delivery destinations among the plurality of meshes. A second storage unit that connects the meshes stored in the second storage unit with a single stroke using a road data included in the map data so as to satisfy a shortest distance condition, and creates an optimal delivery route; Means, third storage means for storing the optimum delivery route created by the connecting means, and from the first delivery destination to the last delivery destination according to the optimum delivery route stored in the third storage means. While selfish move, the optimum separate the delivery route by assigning a delivery vehicle, the optimum delivery route and delivery vehicle determination apparatus characterized by including a delivery vehicle determining means for determining a delivery vehicle needed, the. 2. When the network includes two or more delivery destinations, the dividing means divides the mesh into smaller meshes so that one delivery destination is included, and the connecting means includes two or more delivery destinations. 2. The optimum delivery route / delivery vehicle determination device according to claim 1, wherein a delivery route is created by one-stroke drawing using the small mesh and the road data in the mesh including the delivery destination. 3. The delivery vehicle determining means, when delimiting the optimal delivery route, sequentially integrates delivery amounts to the delivery destinations arranged in the order of the optimal delivery route, and the assigned delivery vehicle. 3. The optimal delivery route / delivery vehicle determination device according to claim 1, wherein the maximum delivery amount is compared with the maximum delivery amount, and the delivery route of the delivery vehicle is divided just before the integrated amount exceeds the maximum delivery amount. 4. The delivery vehicle determining means, when delimiting the optimal delivery route, determines a delivery time required when moving in the order of the delivery destinations in the optimal delivery route, and a binding time of the assigned delivery vehicle. And comparing the delivery section with the delivery section of the delivery vehicle immediately before the delivery time exceeds the binding time.
Optimum delivery route / delivery vehicle determination device as described. 5. The delivery vehicle determining means, when delimiting the optimal delivery route, sequentially integrates delivery amounts to the delivery destinations arranged in the order of the optimal delivery route, and the assigned delivery amount The vehicle is compared with the maximum load capacity of the vehicle, and a criterion for delimiting the delivery section of the delivery vehicle immediately before the integrated amount exceeds the maximum load capacity, and a delivery required when moving in the order of the delivery destination in the optimal delivery route. Comparing the time with the assigned restraint time of the delivery vehicle, including a criterion for delimiting the delivery section of the delivery vehicle immediately before the delivery time exceeds the restraint time, and using any one of the criteria. 3. The optimal delivery route / delivery vehicle determination device according to claim 1 or 2, wherein: 6. The delivery vehicle determining means selects, as a delivery vehicle corresponding to a delivery section, a delivery vehicle having a loading rate closest to 100% among available vehicle types. Optimum delivery route / delivery vehicle determination device as described. 7. A method for determining an optimum delivery route and a necessary delivery vehicle by using map data which can draw a map of a delivery area on a screen of a display means, wherein a plurality of delivery destinations specified on the map are provided. And at least one
A procedure of storing position data of each of the three delivery sources and various data related to a delivery plan; a procedure of dividing a range including the plurality of delivery destinations by a plurality of meshes; and the plurality of delivery routes of the plurality of meshes. A procedure for storing a mesh including any one of the above destinations, and connecting the mesh including any of the plurality of delivery destinations with a single stroke so as to satisfy a shortest distance condition using road data included in the map data. Creating the optimal delivery route; storing the created optimal delivery route; and moving from the first destination to the last destination according to the optimal delivery route, And b. Determining a required delivery vehicle by allocating and separating delivery vehicles, and determining an optimal delivery route / delivery vehicle. 8. When the network includes two or more delivery destinations, the network is subdivided into smaller meshes so as to include one destination, and the network includes two or more delivery destinations. 8. A method for determining an optimal delivery route / delivery vehicle according to claim 7, further comprising the step of creating a delivery route by one stroke using said small mesh and said road data. 9. When dividing the optimal delivery route, a comparison is made between an integrated amount obtained by sequentially integrating delivery amounts to the delivery destinations arranged in the order of the optimal delivery route, and an assigned maximum loading amount of the delivery vehicle. The optimal delivery route according to claim 7 or 8, wherein the delivery section is divided as a delivery section of the delivery vehicle immediately before the integrated amount exceeds the maximum load amount.
Delivery vehicle decision method. 10. When delimiting the optimal delivery route, the delivery time required when moving in the order of the delivery destinations in the optimal delivery route is compared with the assigned time of the delivery vehicle, and the delivery time is determined. The optimal delivery route according to claim 7 or 8, wherein the section is divided as a delivery section of the delivery vehicle immediately before the time exceeds the binding time.
Delivery vehicle decision method. 11. When dividing the optimal delivery route, an integrated amount obtained by sequentially integrating delivery amounts to the delivery destinations arranged in the order of the optimal delivery route, and an assigned maximum loading amount of the delivery vehicle. In comparison, immediately before the integrated amount exceeds the maximum load capacity, a reference for dividing the delivery section of the delivery vehicle as a delivery section, a delivery time required when moving in the order of the delivery destination on the optimal delivery route, and 8. A criterion for comparing a delivery time of a delivery vehicle with the delivery vehicle and determining a delivery section of the delivery vehicle immediately before the delivery time exceeds the delivery time, wherein one of the criterion is used. 8. The optimal delivery route / delivery vehicle determination method described in 8. 12. The optimum delivery route / delivery vehicle according to claim 11, wherein, as the delivery vehicle corresponding to the delivery section, a vehicle having a loading rate closest to 100% is selected from available vehicle types. Decision method. 13. A program for determining an optimal delivery route and a required delivery vehicle by using map data for displaying a map of a delivery area on a display means. Delivery destination and at least one
A procedure for storing position data of each of the three delivery sources and data related to a delivery plan; a procedure for dividing a range including the plurality of delivery destinations into a plurality of meshes; and the plurality of delivery destinations among the plurality of meshes. A procedure for storing a mesh including any of the above, the mesh including any of the plurality of destinations, using the road data included in the map data, connected by a single stroke to satisfy the shortest distance condition, Creating an optimal delivery route; storing the created optimal delivery route; and moving the optimal delivery route from the first delivery destination to the last delivery destination according to the optimal delivery route. A medium for recording a procedure for allocating and separating delivery vehicles, determining a required delivery vehicle, and a program for executing