JP4721678B2 - Delivery route creation device and program - Google Patents

Description

The present invention relates to an apparatus for creating a delivery route for delivering an article having a certain delivery allowable time from a specific delivery base to each destination managed by the delivery base , and a computer functioning as the apparatus Related to the program

Japanese Patent Application Laid-Open No. 2001-188984 discloses an input device that inputs input information related to a delivery plan such as location information of a delivery destination, and a plurality of delivery vehicles that depart from a logistics base by the input information. Delivery that includes a processing device that creates a delivery plan that minimizes the total mileage on the route back to the original distribution base after delivering the cargo first, and an output device that outputs the created delivery plan In the planning system, multiple delivery planning processes with algorithms with different planning strategies are executed in a single processing unit in a time-sharing manner or in parallel with multiple processing units, and the total travel distance is the shortest among the execution results. It describes that a processing result is selected and output from the output device (see Patent Document 1).
Japanese Patent Application Laid-Open No. 2003-109170 discloses a base location such as a delivery destination, package information relating to a package to be delivered to the delivery destination, transportation flight information including information such as a truck used for transportation, surplus time and travel relating to evaluation of a transportation plan. It is described that target information consisting of priorities such as distance is input and a transportation route is generated based on such information (see Patent Document 2). In the generation of the transportation route, the plan is evaluated according to the objective information to search for the optimum plan, and the travel plan for a plurality of transportation flights is created at a time based on the other input information. In particular, an initial solution group consisting of a plurality of initial solutions is created, and a transportation plan is created using a so-called genetic algorithm that improves the created initial solution population by genetic processing.
Japanese Patent Application Laid-Open No. 2003-137437 discloses input information for inputting various information, base locations such as a distribution center and a delivery destination, baggage information related to luggage transported from the distribution center to the delivery destination, and information such as trucks used for transportation. Transport route information, distance information and road map information for storing distances between bases, storage means for storing transport route information, route generating means for generating a transport route based on the above information, route created by the route generating means A system composed of result output means for main display and output of information is described (see Patent Document 3).

JP 2001-188984 A. JP2003-109170A. JP2003-137437A.

Depart from the delivery base, follow the jurisdiction delivery destination that is the destination of the delivery base, and with respect to the delivery that returns to the delivery base, the jurisdiction delivery destination can be traced without omission and without duplication. There is a demand for a delivery route that can deliver a required article within the delivery allowable time and that can minimize the number of deliveries.
The present invention aims to meet the above-mentioned needs.

The present invention is configured as described in [1] to [ 4 ] below.

[ 1 ] Configuration 1 :
The model volume that represents the volume of an article per delivery unit, which is the minimum unit of handling in the delivery operation of the article, and the volume that the delivery unit of the article occupies when mixed with other articles at a predetermined ratio is the model volume of the article. A volume information storage means which holds the volume expansion coefficient, which is a coefficient obtained by division, and holds for each article;
A loadable capacity storage means for holding the loadable capacity of the transport means used for delivery;
Azimuth angle storage means for holding each azimuth angle formed by an azimuth line connecting the delivery base and the jurisdiction delivery destination with respect to a virtual azimuth reference line passing through the delivery base;
A delivery destination extracting means for extracting a jurisdiction delivery destination in ascending order of the azimuth;
The total volume of articles destined for each jurisdiction delivery destination on the round route that returns from the delivery base to the delivery base by tracing the jurisdiction delivery destination extracted by the delivery destination extraction means without omission is calculated on the round trip route. A total of values obtained by multiplying the number of delivery units of each article addressed to each jurisdiction delivery destination by the model volume and the volume expansion rate of each article held by the volume information storage means, A route load amount calculation means for obtaining a total route route load amount based on the sum,
An extraction control means for comparing the round trip total load amount obtained by the route load amount calculation means with the loadable capacity of the transport means and delimiting the extraction operation of the delivery destination extraction means based on the comparison result;
A one-round route determination means for setting a one-round route corresponding to the total amount of one-round route determined by the route load amount calculating means as a one-round route of the section;
A delivery route creation device characterized by comprising:

[ 2 ] Configuration 2 :
In configuration 1 ,
The extraction control means delimits the extraction operation when the total round route route load amount obtained by the route load amount calculation unit exceeds the loadable capacity;
A delivery route creation device characterized by the above.
[ 3 ] Configuration 3 :
In configuration 1 ,
The route load amount calculation means, when the total route route load provided to the extraction control means for comparison with the loadable capacity exceeds the loadable capacity, the jurisdiction delivery destination and the A predetermined number of jurisdiction delivery destinations extracted immediately before are set as a correction range on the end side of the section that the extraction control means intends to divide, and a predetermined number of jurisdiction delivery destinations to be extracted following the jurisdiction delivery destinations beyond Set the jurisdiction delivery destination to the correction range at the beginning of the next section, replace the jurisdiction delivery destination selected according to the predetermined rule from both correction ranges, and recalculate the total route route load,
The one-round route determining means sets the one-round route corresponding to the total one-round route load obtained by the route load amount calculating means as the one-round route of the section.
A delivery route creation device characterized by the above.
[ 4 ] Configuration 4 :
A program for causing a computer to function as the delivery route creation device according to any one of Configurations 1 to 3 .

Configuration 1 is the a model volume representing the article volume per delivery unit is the minimum unit of handling in shipping operations of the article, the volume delivery unit of the article is occupied when mixed in a predetermined ratio with other articles It is possible to hold the volume information storage means held for each article and the loadable capacity of the transportation means used for delivery by associating with the volume expansion coefficient obtained by dividing by the model volume of the article. Loading capacity storage means, and azimuth angle storage means for holding each azimuth angle formed by an azimuth line connecting the delivery base and the jurisdiction delivery destination with respect to a virtual azimuth reference line passing through the delivery base, for each jurisdiction delivery destination; A delivery destination extracting means for extracting the jurisdiction delivery destinations in ascending order of the azimuth, and a round trip without departing from the delivery base and following the jurisdiction delivery destinations extracted by the delivery destination extraction means without omission. Each jurisdiction on the route The total volume of the articles destined for the destination is set to the number of delivery units of each article destined for each jurisdiction delivery destination on the one-round route, and the model volume and the volume expansion rate of each article held by the volume information storage means A route load amount calculating means for obtaining a total amount of one-round route based on the sum, and a route route total load amount obtained by the route load amount calculating means as the transport means. An extraction control means for dividing the extraction operation of the delivery destination extraction means based on the comparison result in comparison with the loadable capacity of the vehicle, and a round route corresponding to the total round route quantity obtained by the route load quantity calculating means A delivery route creation device characterized by having a round route determination means for making a round route for a section, so that the delivery route departs from the delivery base and traces the jurisdiction delivery destination which is the delivery destination of the delivery base. For delivery back to the base Stomach, jurisdiction destination can be a follow not and duplication without leakage, it can deliver the required goods to all of jurisdiction destination. In addition, the number of deliveries can be minimized.

Hereinafter, embodiments of the present invention will be described with reference to the drawings.
[A] Overview of system configuration and functions:
[B] Travel time calculation function:
[C] Delivery base location determination function:
[D] Delivery affiliation decision / delivery route decision function:
Will be described in the order.

[A] Overview of system configuration and functions:
FIG. 1 shows a computer system according to an embodiment of the present invention, that is, a computer system that functions as a delivery affiliation determination device and a delivery route determination device. The illustrated system includes a control device 10, an auxiliary storage device (hard disk or the like) 20, a main storage device (RAM) 30 used for work, a display device (CRT display, liquid crystal display, etc.) 51, a printing device 53, an input device. (Keyboard, mouse, etc.) 55 and communication device (NCU, etc.) 57 are provided. Although FIG. 3 shows a stand-alone configuration, the present invention may be configured by a plurality of computers connected by a LAN or the like. For example, the server may have various tables and the like. In short, any system configuration capable of realizing the functions of the present invention by a computer may be used.

Control device 10:
The control device 10 is configured by a known device such as a CPU or an interface. The control device 10 cooperates with each of the above-described devices by executing processing procedures to be described later, thereby providing a delivery base location determination function 11, a delivery affiliation determination function 12, a delivery route determination function 13, and a required travel time calculation function 14. Realize. Although details of the processing procedure are omitted, the distribution cost calculation function 18 and the distribution cost contrast function 19 can be achieved in cooperation with the peripheral device by executing a predetermined program installed therein.
The control device 10 also functions to control each of the devices (the auxiliary storage device 20, the main storage device 30, the display device 51, the printing device 53, the input device 55, and the communication device 57) connected to the control device 10. Also play. Since this function is well-known, description is abbreviate | omitted.

The delivery base location determination function 11 optimally determines the arrangement of distribution bases (distribution facilities) for delivering articles having a predetermined delivery allowable time to each destination distributed within a given predetermined area. It is a function. In other words, this is a function for determining the location of each delivery base so that the above-mentioned articles can be delivered to each of the above-mentioned destinations within the allowable delivery time and the total number of delivery bases is reduced. At this time, a delivery destination candidate that is a candidate for a destination managed by each delivery base is also determined for each delivery base. When a certain delivery destination candidate belongs to two or more delivery bases in duplicate, that is, when a certain delivery destination candidate is a delivery destination candidate for two or more delivery bases, for example, it is closer (time It is also possible to determine a delivery base having a location close to (distance close to each other) as a delivery base to which the delivery destination candidate should belong. Alternatively, the delivery base of the affiliation may be determined so that the total cost calculated by the distribution cost calculation function 18 is lower.
In the delivery base location determination function, as will be described later, the travel time of two points (a candidate for a certain delivery base—a delivery destination candidate that is a candidate for a destination managed by the delivery base candidate) is used. The calculation is performed, and it is assumed that the route with the minimum required travel time is selected as the required travel time at the two points among the connected routes connecting the two points.

The delivery affiliation determination function 12 starts each distribution destination under the jurisdiction of a certain delivery base (= the delivery destination belonging to the certain delivery base; hereinafter referred to as “the jurisdiction delivery destination”) from the certain delivery base. This is a function for determining the number of deliveries (delivery of the first delivery route, delivery of the second delivery route,. In other words, this is a function for determining for each jurisdiction delivery destination which delivery route should be delivered. The jurisdiction delivery destination that has been determined to belong to which delivery is hereinafter referred to as “delivery destination”. The determination by the delivery affiliation determination function 12 is performed so that the maximum load amount is delivered in the delivery of each delivery route, and the delivery in each delivery route is completed within the delivery allowable time. In addition, the total number of deliveries can be reduced.
As will be described later, in the delivery affiliation function, movement between two points (between a certain delivery base and a jurisdiction delivery destination which is a delivery destination under the jurisdiction of the certain delivery base, between each jurisdiction delivery destination and each jurisdiction delivery destination) The calculation is performed using the required time. As the required travel time between the two points, it is assumed that the route having the minimum required travel time is selected from among the connected routes connecting the two points.
In addition, as a delivery base to be calculated, for example, any delivery base among the delivery bases optimally determined by the delivery base location determination function 11 can be adopted.

The delivery route determination function 13 traces the delivery destinations belonging to the delivery in any order in a certain delivery (delivery of a delivery route) performed from a delivery base. It is a function that determines whether or not. In other words, a round-trip route that can be traced when an article is delivered to each delivery destination belonging to a certain delivery (departs from the delivery base, sequentially follows the delivery destinations belonging to the relevant delivery, and returns to the delivery base. Various routes are assumed as the route), and this is a function for determining which one-round route is selected from among them. The selection of the one-round route performed by the delivery route determination function 13 is performed so that the maximum load amount is delivered in the delivery of the one-round route and the delivery of the one-round route is completed within the allowable delivery time.
The delivery affiliation determination function 12 and the delivery route determination function 13 are conceptually separable, but actually, in the process of determining a round route for a certain delivery, as described later, The jurisdiction delivery destination that should belong to the th and the jurisdiction delivery destination not to belong to the th are determined. Further, if necessary, a part of the jurisdiction delivery destination to be assigned to the next next is determined.
As will be described later, in the delivery route function, movement between two points (between a certain delivery base and a jurisdiction delivery destination that is a destination managed by the delivery base, between each jurisdiction delivery destination and each jurisdiction delivery destination) The calculation is performed using the required time, and it is assumed that the route with the minimum required travel time is selected as the required travel time at the two points among the connected routes connecting the two points.
In addition, as a delivery base to be calculated, for example, any delivery base among the delivery bases optimally determined by the delivery base location determination function 11 can be adopted.

The required travel time calculation function 14 is a function for calculating the required travel time when moving between two points by a predetermined moving means (eg, a truck or the like) with reference to a predetermined distance time table or the like. In the distance time table, the unit required time, which is the required time for moving the unit distance in the unit area by the moving means, is held for each unit area. When there are a plurality of routes connecting two points to be calculated, it may be specified according to the operator's input which route of the route is required to be calculated, or according to a predetermined rule. It may be specified. The predetermined rule is, for example, a rule for selecting a route with the shortest path. Moreover, the rule which avoids a toll road, the rule which uses a toll road, etc. may be sufficient.
In addition, in the case where there are a plurality of routes connecting the two points to be calculated, the required travel time for each route is obtained, and the travel required time of the route with the minimum required travel time is You may comprise so that it may be set as the movement required time of the said 2 points | pieces.

The logistics cost calculation function 18 relates to a company having a logistics business, the logistics cost of the entire company, the logistics cost of each logistics facility, the logistics cost of each logistics facility and each work process, each logistics facility and each work process, and the item to be distributed. Per logistics cost by category (eg, by item size category), per unit quantity (unit number; minimum unit handled by work in the work process) by logistics facility, by work process, and by item category (eg, by article size category) The distribution cost is calculated using the cost of the company's income statement and the interest cost of the balance sheet.
The distribution cost per unit quantity for each logistics facility, each work process, and each article classification (eg, each article size classification) is referred to as a micro cost of the distribution facility, each work process, and each article classification (eg, article size classification).
The physical distribution facility corresponds to the delivery base referred to in the delivery base location determination function 11.

The distribution cost comparison function 19 compares the distribution cost of the entire company obtained from the current distribution network (current network) with the distribution cost of the entire company obtained from the network after the modification of the current distribution network (new network). This is a contrasting function. For example, the location of the delivery base, the delivery destination under each delivery base, the vehicle type and number of the transportation means ("truck" in the example described later) possessed by each delivery base, and the delivery route to which each delivery delivery destination belongs. And the distribution order of each delivery route when the first state (current network) is set and when the second state (new network) different from the first state is set This is a function to compare and contrast costs.
Logistics costs for the entire company are called macro costs.

Auxiliary storage device 20:
The auxiliary storage device 20 configured with a hard disk or the like stores application programs for the control device 10 to realize the functions in cooperation with the peripheral devices. In addition, a database having various tables used in the functions is stored, and various data created by the functions are newly recorded in predetermined tables in the database.
Examples of the table stored in the auxiliary storage device 20 include the following (a) to (h).
(A) Distance time table (FIG. 5 (a)):
A unit area corresponding to a unique mesh ID is associated with a unit required time, which is a required time when a unit distance in a unit area (mesh), which is a small area formed by dividing the target area, is moved by a predetermined moving means. Hold every time.
(B) Road table (FIG. 3 (a)):
The road name of the road that is the smallest section that can be represented by one line without a branch road, the A end ID that uniquely identifies the A end that is one end of the road, and the other end of the road A B end ID that uniquely identifies a certain B end is associated with a unique road ID and held for each road.
(C) Unit road table (FIG. 3B):
For a unit road obtained by dividing the above-defined road by the unit area to which the unit belongs, the road ID of the road to which the unit road belongs, the mesh ID of the unit area to which the unit road belongs, and the length of the unit road (the road ) Is stored for each unit road in association with a unique unit road ID.
(D) Recipient table (FIG. 4):
The name (destination name) of the product destination (customer), which is an example of a point for obtaining travel time, the unit road ID of the unit road that the destination faces, and the length from a specific end of the unit road (Unit road location), the amount of cargo to be delivered to the recipient, and the bibliographic items of the recipient (recipient name, address, phone number, location, name, jurisdiction delivery base, etc.) are associated with a unique recipient ID Hold for each recipient.
(E) Time required table between points (FIGS. 6 and 23):
The required travel time between points (eg, destination, delivery base (including delivery base candidates), etc.) for which the travel required time has been obtained by the travel required time calculation function 14 is held.
With respect to each of the delivery bases Ga, Gb,..., Whose location has been determined by the delivery base location determination function 11, each of the delivery bases Ga, Gb,. The time required for movement between the controlled delivery destinations b,... and the time required for transfer between the controlled delivery destinations holding the transfer required time between the controlled delivery destinations G-a, Gb,. It is the same. The inter-delivery destination required time table is composed of specific parts of the inter-point required time table for use in determining delivery affiliation and delivery route. Note that this inter-delivery destination required time table is configured in a memory based on the inter-point required time table in the example described later (FIG. 17, S85), but is configured to be stored in the hard disk 20 in advance. May be.
(F) Base-destination / required time / angle table (FIG. 24 (a)):
With respect to each of the delivery bases Ga, Gb,..., Whose location has been determined by the delivery base location determination function 11, the required travel time between each delivery base Ga, Gb,. Are held in association with each other, and the azimuth of each destination viewed from each delivery base G-a, G-b,... Is held in association with each other as an angle from the reference azimuth (eg, true north) of the delivery base. table.
Although all the delivery destinations may be associated with each delivery base G-a, G-b,..., A delivery destination that is likely to be set as a responsible delivery destination of the delivery base (comparison from the delivery base) It is also possible to hold a destination that is close to the target in association with the delivery base concerned. The travel required time holds the value obtained by the travel required time calculation function 14.
(G) Size classification table etc. (FIGS. 25 and 26):
Size classification table (FIG. 25 (a)) for classifying articles (products) by size, delivery time classification table (FIG. 25 (b)) for classifying articles (products) by allowable delivery time, each article (product) and size An article table (FIG. 26 (a)) for associating the classification and the delivery time classification, a truck table having a loadable capacity and a delivery location to which the truck belongs.
(H) Tables other than the above, etc .:
Profit and loss statement (P / L) data of a company having each delivery base and carrying out delivery operations, balance sheet (B / S) data by logistics facility of the company, etc.

RAM 30:
The RAM 30 is used for work or the like when realizing the above functions. For example, in the delivery affiliation determination function 12 and the delivery route determination function 13, a jurisdiction delivery destination management table (FIG. 24B) and a required time table between jurisdictions and delivery destinations (FIG. 23) are configured on the RAM 30.

Peripheral devices:
The input device 55 is a device for a user to input data and instructions necessary for realizing the above functions.
The display device 51 is a device that displays a screen or the like necessary for realizing each function.
The printing device 53 is used to print out various data created by the above-described functions and various data necessary for realizing the above-described functions as necessary.
The communication device 57 is used for communication with other computer systems (not shown) connected to the LAN and other computer systems connected to an external network (not shown) such as the Internet. For example, the driver in charge of home delivery in the area including the unit area transmits the experience value of the required time for movement in the unit area (mesh) with a portable information terminal such as a mobile phone or PDS, and finely corrects the unit required time accordingly. If configured, the transmission data is taken in via the communication device 57. Further, if the above-described database is placed on a server (not shown), reading and writing of data from the database is performed via the communication device 57.

[B] Travel time calculation function:
FIG. 2 is a flowchart showing a procedure for calculating a required moving time when moving between two arbitrary points by a predetermined moving means. The predetermined moving means is, for example, a motorcycle / passenger car / truck / train / airplane / ship.

First, two points that are targets for calculating the required travel time are acquired (S01).
These two points can be, for example, two points designated by the user's operation input from the input device 55.
For example, two points arbitrarily selected by the operator from the candidate sites listed on the display 51 can be used. In addition, at two points where the operator arbitrarily inputs an address / phone number / latitude / longitude, etc., or at two points arbitrarily designated by the operator by a pointer operation using a mouse or the like on the map displayed on the display 51. There may be.
For example, in a car navigation apparatus, the time required for movement between two points arbitrarily specified by an operator as described above is often obtained using an input device. One of the two points is a well-known GPS function (a function that receives radio waves from 3 to 4 GPS satellites to calculate the current position; GPS = Global Positioning System) or PHS (Persona Handy-Phone). It may be a current position obtained by using a position specifying function of System). In that case, of course, a device for a GPS function, a PHS function, or the like is separately required.
In this way, when two points designated by the user's operation input are acquired in step S01, the two points are assigned to the belonging unit road and the end point of either of the belonging unit roads. A process for converting the path and any one of the end portions into data is required.

The two points acquired in step S01 may be two points that are sequentially extracted from a table having data of a large number of points according to a predetermined rule.
An example of a table having data at many points is a destination table (FIG. 4). As described above, the destination table is a name (destination name) of a product destination (customer), a unit road ID of a unit road that the destination is facing, and a length from a specific end of the unit road. Corresponding to the unique destination ID for the location (unit road position), the volume to be delivered to the destination, and the bibliographic items of the destination (the destination name, address, phone number, location, name, jurisdiction delivery base, etc.) In addition, it is a table held for each recipient.
Note that when two points are extracted in order from a table having data on a large number of points according to a predetermined rule, the processes in steps S03 to S17 described below are executed for each of the two points extracted in that order.
Moreover, as a predetermined rule which extracts two points in order, the following (a) (b) can be mentioned, for example.
(A) For the delivery base location determination function 11:
A delivery base candidate is extracted as one of the points, and a destination that can be assumed as a destination of goods from the delivery base candidate is extracted in order, and once all the possible destinations are extracted, the next delivery base candidate is selected. The rules are such that the destinations that can be assumed as the destinations of the products from the changed delivery base candidates are sequentially extracted, and the same is repeated thereafter.
(B) In the case of the delivery affiliation determination function 12 and the delivery route determination function 13:
The location of the delivery base being noticed and the locations of a number of recipients under the jurisdiction of the delivery base are taken as point candidates, and two of them located relatively close to each other (eg, the distance between them is a predetermined distance) Rule to select 2 points that are within. Or rule to choose two points without omission.
A table that holds the distance between each two points selected according to the above rule is the required time table between jurisdictions and delivery destinations (FIG. 23).
In this way, by obtaining two points in order from a table having data on a large number of points (eg, a destination table / FIG. 4) in accordance with a predetermined rule to obtain a required time for movement, a required time table for movement between a large number of points ( FIG. 6; alias “time map”) can be created.
The required travel time between two points is hereinafter also referred to as a time distance between the two points.

Next, the road IDs of one or more roads that are components of the connecting route connecting the two points acquired in step S01 are acquired from the road table (FIG. 3A) (S03).
A road here is a section specified by a unique road ID, and is divided at an end of a road such as an intersection or a dead end, for example, between an intersection and an intersection or between an intersection and a dead end. In addition, it is a section in the road which is expressed as a single line (straight line / curve) without branching by being divided.
In addition, the connection route is one or more routes identified as the calculation target of the travel time from one or more routes connecting the two points. As the connection route, for example, one route arbitrarily designated by the operator from the input device 55 or a relatively small number of two or more routes may be adopted, and among the many routes connecting the two points. One route narrowed down by a known method or a relatively small number of two or more routes may be adopted. When a plurality of routes are employed as the connection route, the travel time is determined for each.
Further, as the connection route, one specific route selected by the present apparatus according to a predetermined rule from two or more routes narrowed down to a relatively small number by a known method may be adopted. Examples of the predetermined rule include a rule that selects a route that has the shortest route from routes connecting two points, a rule that excludes a toll road, a rule that includes a toll road, and the like. It may be configured so that the operator can specify from the input device 55 which rule is adopted.
The above-mentioned known method of extracting one route or a relatively small number of two or more routes from a large number of routes connecting two arbitrarily designated points has been conventionally used in car navigation systems, for example. It is a technique.
Whether a certain road (end-to-end road section) and another road (end-to-end road section) can be linked when extracting a route connecting two points However, this is because either one of the A end ID and B end ID (see FIG. 3A) of the certain road is the A end of the other certain road. The determination can be made based on whether the ID matches one of the ID and the B end ID. Note that the A end is one end, and the B end is the other end.

  When a configuration is employed in which the operator arbitrarily designates a connection route from the input device 55, the operator can specify a plurality of connection routes in an interactive manner, and each time required for movement can be obtained. Therefore, the operator can select a desired route from them. Similarly, when adopting a configuration in which the time required for moving each of a relatively small number of routes narrowed down by a known method is selected from a large number of routes connecting two points, the operator similarly selects a desired one of them. Can be selected. These configurations are useful for making a drive plan, for example. Further, when a toll road is included in the connection route, the toll road fee may be acquired from a predetermined table (not shown) and the calculated fee may be displayed together with the required travel time. Good.

Next, a unit having a road ID of any one of the one or more roads (one or more roads that are components of a connecting route connecting two points) from which the road ID is obtained in step S03 All roads are extracted from the unit road table (FIG. 3B), and the length and mesh ID of each extracted unit road are obtained from the unit road table (FIG. 3B) (S05). In other words, the length and mesh ID of each unit road that is a component of one or more roads for which the road ID has been acquired in step S03 are acquired from the unit road table (FIG. 3B) (S05). ).
As described above, the unit road is each road portion obtained by dividing the defined road by the boundary of the mesh (unit region), and this unit road corresponds to the unit route described in the claims. Since the unit required time of the mesh can be acquired from the distance time table (FIG. 5 (a)) using the mesh ID acquired as described above as a key, it is possible to obtain the required travel time for each extracted unit road. It becomes.

The relationship between the above-described unit areas, unit roads, roads, etc. will be described with reference to FIG.
In FIG. 8, ad11, ad12, ec11, etc. are road names. In the road table of FIG. 3A, the road names are written as Mizuho ad11, Mizuho ad12, Mizuho ec11, and the like. The A end ID and B end ID shown in FIG. 3A are also shown in FIG.
In FIG. 8, 0150121, 0150122, 0150123, etc. are unit road IDs, and each shaded area and white area are unit areas (mesh). In the unit area, the mesh ID of the unit area is shown in association with FIG. 3B, and the unit area names such as a and b shown in FIG. 8 are shown in FIG. 7 showing the wide area in FIG. (A) and (b) are shown in association with each other.

The above-described processing of steps S01 to S05 is described as follows in a specific example of obtaining the required travel time between two points A and B in FIG.
First, points A and B are acquired (S01). Next, for example, road IDs (1104, 1012, 1011) of the roads Mizuho ad14, Mizuho ec12, Mizuho ec11 are acquired as components of the connection route designated between A and B (S03). As shown in the unit road table (FIG. 3B), Mizuho ad14 (ID: 1104) is composed of two sections (unit roads) of unit road IDs “01505018” and “01505019”, and each unit road is “750 m”. ”And“ 400 m ”and mesh IDs“ 001023 ”and“ 001024 ”. Mizuho ec12 (ID: 1012) is composed of two sections (unit roads) of unit road IDs “0150124” and “0150125”. Each unit road has a length of “400 m” and “200 m” and “001022”, respectively. It has a mesh ID of “001023”. Mizuho ec11 (ID: 1011) is composed of three sections (unit roads) of unit road IDs “0150121”, “0150122”, and “0150123”. The unit roads are “350 m”, “200 m”, and “200 m”, respectively. It has a length of “300 m” and mesh IDs of “001025”, “001026”, and “001022”. In step S05, the unit road ID, the length and mesh ID associated with each unit road ID are acquired.

Steps S07 to S15 are processes for obtaining the required travel time of each unit road for which the ID is acquired in step S05 in order for each unit road.
That is, using the mesh ID associated with the unit road ID as a key, the unit required time of the mesh (unit area) to which the unit road belongs is acquired from the distance time table (FIG. 5A) (S09). ) The obtained unit required time is multiplied by the length of the unit road acquired in step S05 and normalized (divided by the unit distance) (S11), thereby obtaining the required time for movement of the unit road.

This process is executed in order for the unit roads whose IDs have been acquired in step S05 (S07, S13, S15), thereby obtaining the required travel time for each unit road.
When the required travel time for all the unit roads whose IDs have been acquired in step S05 is obtained (YES in S15), the sum is obtained (S17). In this way, the required travel time between the two points where the point data was acquired in step S01 is obtained.
In this way, by calculating the time required for movement between a large number of two points, the time required table between points (FIG. 6) can be constructed.

  In the distance time table described above, as shown in FIG. 5A, a mesh name and unit required time are associated with a unique mesh ID, and an application type ID is further associated. This application type ID represents an applicable time zone and / or day of the week. For example, as shown in the application type table of FIG. To express. Therefore, the record having the application type ID = 2 in the distance time table (FIG. 5A) indicates that the unit required time of the mesh ID of the record is the unit required time on weekdays.

  Therefore, when the time zone and / or day of the week is specified prior to the calculation of the required travel time in FIG. 2, in step S09, the mesh ID associated with the unit road ID acquired in step S05 The unit time required for the record having the specified application type ID is acquired. If no time zone or day of the week is specified, the unit required time of a record having an application type ID such as the time zone and day of the week corresponding to the current time is acquired.

The process of steps S07 to S09 is described as follows in the specific example of obtaining the required time for movement between the two points A and B described above.
Mizuho ad14 (road ID: 1104) is composed of two unit roads with unit road IDs “01505018” and “01505019” as shown in the unit road table (FIG. 3B). It has lengths of “750 m” and “400 m” and mesh IDs of “001023” and “001024”. In addition, as shown in the distance time table (FIG. 5A), these mesh IDs “001023” and “001024” are unit required times of “120 sec” and “110 sec” (units in “weekday noon”), respectively. Time). In this example, the unit distance is set to 500 m in the system setting. Therefore, the travel time required for each unit road with the unit road IDs “01505018” and “01505019” is “750 m × 120 sec / 500 m = 180 sec” and “400 m × 110 sec / 500 m = 88 sec”, respectively.

  Similarly, Mizuho ec12 (road ID: 1012) is composed of two unit roads whose unit road IDs are “0150124” and “0150125”. Each unit road has a length of “400 m” and “200 m”, respectively. It has mesh IDs “001022” and “001023”. These mesh IDs “001022” and “001023” have unit required times of “90 sec” and “120 sec”, respectively. Therefore, the movement use time of each of the two unit roads whose unit road IDs are “0150124” and “0150125” are “400 m × 90 sec / 500 m = 72 sec” and “200 m × 120 sec / 500 m = 48 sec”, respectively.

  Similarly, Mizuho ec11 (road ID: 1011) is composed of three unit roads whose unit road IDs are “0150121”, “0150122”, and “0150123”, and each unit road is “350 m” and “200 m”, respectively. It has a length of “300 m” and mesh IDs of “001025”, “001026”, and “001022”. These mesh IDs “001025”, “001026”, and “001022” have unit required times of “90 sec”, “90 sec”, and “90 sec”, respectively. Accordingly, the travel usage time of each of the three unit roads whose unit road IDs are “0150121”, “0150122”, and “0150123” are “350 m × 90 sec / 500 m = 63 sec” and “200 m × 90 sec / 500 m = 36 sec”, respectively. “300 m × 90 sec / 500 m = 54 sec”.

As shown in step S17 (FIG. 2), the required travel time between the points A and B is the sum of the calculation results, and is obtained as “180 + 88 + 72 + 48 + 63 + 36 + 54 = 541 sec”.
As described above, the required travel time between the two points A and B is obtained.
Each table such as the road table and the unit road table mentioned above is an example, and a table configuration other than the illustrated table configuration is adopted as long as the function of the present invention can be realized. Of course it is good.

Time map:
Here, the concept of the time map will be described.
The time map is the distance between any two points on the time map that is moved by means of moving between these two points (motorcycle / passenger car / truck, freight car / airplane / ship, etc.) This is a map in which two points are arranged so as to be proportional to the required travel time. Therefore, when the time required for movement between two points varies depending on the time zone, day of the week, route to be selected, moving means, etc., the time maps are also different.
However, when displaying an image, a certain point (eg, point a) is specified, and is proportional to the required travel time from the specified point a, and in the normal map orientation viewed from the point a. Each point is arranged so as to match, and this is referred to as a time map viewed from the point a. As described above, the reason for specifying and indicating the point a at the time of image display is that the distance between the points is proportional to the travel time between three or more points, and the direction between the points is a normal map. This is because it is impossible to arrange each point so as to be in the azimuth direction.

  The entity of the time map is a time required table between points illustrated in FIG. 6 in this apparatus. This point-to-point required time table is a table created by obtaining the required time for movement for each of a number of two points extracted from a number of points (destination and delivery base candidates). The required travel time calculation function 14 is used for calculating the required travel time. As two points extracted from a large number of points, in this apparatus, between two points necessary for a delivery base determination process described later, or two points required for a delivery belonging / delivery route determination process described later. Including at least.

  In the present apparatus, the area covered by the time map is determined according to the area where the delivery destinations of the items to be delivered are distributed. For example, in the case of a delivery company that targets the entire Nagoya city, the entire Nagoya city becomes the time map cover area. Similarly, it may be the whole Aichi prefecture, the whole Tokai region, the whole Chubu region, the whole Honshu, the whole Japan, the whole East Asia, the whole Asia, the whole world, etc.

[C] Delivery base location determination function:
FIG. 11 and FIG. 12 are flowcharts showing the delivery base location determination procedure.
First, a location interval distance that gives the shortest distance between adjacent delivery base candidates, a delivery range prescribed time that defines a range in which delivery should be performed from the delivery base candidates, and positions of a large number of recipients are acquired (S21). In this apparatus, since the delivery base candidates are evenly arranged (arranged as grid points) in the location target area where a plurality of delivery bases are located, the location interval distance gives the shortest distance between the grid points. In this example, the location interval distance is determined so that the delivery base candidates whose total number is determined in consideration of the area and population of the location target area are evenly arranged in the location target area. Further, in this example, the distance estimated to be able to move within the delivery range specified time determined based on the delivery allowable time Tp of the delivery target article is determined as the location interval upper limit distance and does not exceed the location interval upper limit distance. As such, the distance between locations is determined.

  For example, the step S21 may be configured so that the location interval distance and the delivery range specified time are acquired from the input device 55 by the operator. Moreover, the structure which acquires the value hold | maintained in the predetermined | prescribed database may be sufficient. In addition, the operator inputs the allowable delivery time Tp from the input device 55, and determines the location interval distance and the delivery range specified time based on the input allowable delivery time Tp, and acquires these. S21 may be configured. Alternatively, the operator inputs the delivery target article from the input device 55, acquires the delivery allowable time Tp corresponding to the input delivery target article from a predetermined database, and acquires the acquired delivery allowable time Tp. Step S21 may be configured to determine the location interval distance and the delivery range specified time based on the above and acquire them.

The location of each of the many destinations is, for example, bibliographic information (address, telephone number, destination name, unit road ID of the unit road where the destination is located, and the location of the destination on the unit road from a predetermined end of the unit road. Destination table (Fig. 4; provided) for each destination (customer) including the position in the unit road indicated by the length of the road, the amount of cargo to be delivered [m ³ ], the amount of cargo to be delivered (number), the point name, etc. In FIG. 4, “address”, “telephone number”, and the like can be obtained from (not shown). Records in this destination table can be added / deleted as appropriate. In addition, the recorded items of each item of each record of the destination table can be appropriately modified. For example, the load amount is appropriately recorded according to the order.

  The location data of the destination is composed of data specifying the unit road where the destination is located, and data indicating the location of the destination on the unit road (the path from a predetermined end of the unit road). As described above, a unit road is a section of roads divided by intersections and given a road name for each part between the intersections. The road part with the road name (inter-intersection part) is a belonging unit area (mesh). Each mesh portion (portion associated with the unit road ID) when the unit road ID is assigned to each mesh portion after division.

  After acquiring the location interval distance, the delivery range specified time, and the location of each recipient (S21), the location of the first delivery base candidate is obtained (S23). For example, the position of the delivery base candidate input by the operator as the first delivery base candidate is acquired from the input device 55. The position input of the first delivery base candidate may be performed, for example, by displaying a map of the location target area on the screen and pointing to a desired position on the map. In this example, it is assumed that the position of the delivery base candidate G11 in the upper left corner in FIG. 9 is acquired as the position of the first delivery base candidate.

  Next, the position of each delivery base candidate is calculated (S25). This calculation can be performed according to a predetermined rule that uses the position of the first delivery base candidate acquired in step S23 and the location interval distance acquired in step S21 and defines the direction and range of the calculation. For example, first, the position of the first delivery base candidate (position of the delivery base candidate G11) is set as the starting position, and the location interval from the starting position to a predetermined direction (eg, rightward (or downward) in FIG. 9). The position separated by the distance is determined as the position of the delivery base candidate G12 (or G21). Next, the position of the delivery base candidate G12 (or G21) is set as a starting position, and is similarly separated from the starting position by a location interval distance in a predetermined direction (eg, right direction (or downward direction in FIG. 9)). The position is determined as the position of the delivery base candidate G13 (or G31). Thereafter, the same is repeated, and when reaching the end of the location target area, the direction is changed and the same is repeated. By repeating such processing, the position of each delivery base candidate can be determined.

  In place of the processing in steps S21 to S25, for example, the operator may input the positions of all the delivery base candidates from the input device 55. In this case, it is not always necessary to set the distribution base candidate arrangements evenly (in a grid pattern), and the arrangement in an arbitrary pattern is possible.

  Alternatively, the operator inputs the area of the location target area and the positions of the delivery base candidates at the four corners in the location target area from the input device 55, and based on this, the total number of delivery base candidates and further the location interval distance are obtained. It is also possible to determine and determine the positions of the remaining delivery base candidates from these.

  When the position of each delivery base candidate is determined (S25), next, the required travel time between the delivery base candidate and each destination is acquired for each delivery base candidate (S27). Desirably, the time required for movement between the delivery base candidate and each destination near the delivery base candidate is acquired for each delivery base (S27). Here, the neighboring destination is a destination located in a range where the required travel time from the delivery base candidate being noticed does not significantly exceed the specified delivery range time. The destinations are located in the four lattice areas. For example, the delivery base candidate G22 in FIG. 1 is a destination located in a rectangular area surrounded by G11, G13, G33, and G31. By limiting the range for obtaining the travel time to nearby destinations in this way, the processing load can be reduced. It goes without saying that the required travel time between all destinations may be acquired.

  The travel time required between the delivery base candidate and each destination is obtained, for example, by the travel time calculation function 14 described in the section “[B] Required travel time calculation function” and is obtained. can do. Moreover, it can also be configured to obtain from a predetermined table holding the required travel time between the delivery base candidate and each destination. In the latter case, the predetermined table may be a table created by using the required travel time calculation function 14 described in the section “[B] Required travel time calculation function”, or created by another known method. It can be a table.

Next, the required travel time acquired in step S27 (the required travel time between each of the delivery base candidates and the destination (preferably the destination near the delivery base candidate)) is the delivery range acquired in step S21. Compared with the specified time (S29), if the required travel time acquired in step S27 is smaller than the specified delivery range time acquired in step S21 (YES in S31), the destination related to the required travel time is transferred to the target time. It is set as a delivery destination candidate of a delivery base candidate related to the required time (S33).
The comparison / setting / non-setting process (S29 to S33) is executed for all the required travel times acquired in step S27, and when all the processes are completed (YES in S35), the process proceeds to steps S37 to S43. .

  In the processing of steps S37 to S43, is the delivery destination candidate focused on at the time of the current processing (hereinafter referred to as “currently focused”) a delivery destination candidate belonging to only one delivery base candidate? Or a step of checking whether a delivery destination candidate (duplicate candidate) belongs to two or more delivery base candidates. Here, “belongs to” means that it is set as a delivery destination candidate of a delivery base candidate by the process of step S33.

  First, when a match is detected by comparing the delivery destination candidate currently focused on the delivery base candidate currently focused on with a delivery destination candidate belonging to another delivery base candidate (S37). (YES in S39), the delivery destination candidate currently focused on is set as a delivery destination candidate (duplicate candidate) that belongs to both the delivery base currently focused on and the other delivery base. The correspondence relationship with the duplication destination is held (S41).

  In this comparison / duplication setting / duplication non-setting process (S37 to S41), the “currently focused delivery destination candidate belonging to the currently focused delivery base candidate” is sequentially replaced with “currently focused”. Instead of “delivery base candidates”, the processes are executed in order. Comparison / duplication setting / non-setting processing for all “currently focused delivery destination candidates belonging to the currently focused delivery base candidate” and all “currently focused delivery base candidates” (S37) ˜S41) is completed (YES in S43), the process proceeds to step S45.

Step S45 is a process of extracting delivery base candidates in which all of the delivery destination candidates to which they belong are set as duplication candidates and setting them as delivery base deletion candidates.
For example, in FIG. 9, in the delivery base candidate G21, all of the delivery destination candidates to which it belongs are set as duplication candidates.
That is, three delivery destination candidates a, b, and c belong to the delivery base candidate G21 as shown in the figure. Among these, the delivery destination candidate a is a delivery destination candidate of the delivery base candidate G21 and at the same time is a delivery destination candidate of the delivery base candidate G11 adjacent in the upper position in the figure. Similarly, the delivery destination candidate b is a delivery destination candidate of the delivery base candidate G21 and at the same time a delivery destination candidate of the delivery base candidate G31 adjacent in the lower position in the figure. Similarly, the delivery destination candidate c is a delivery destination candidate of the delivery base candidate G21 and at the same time a delivery destination candidate of the delivery base candidate G32 located in the lower right part of the figure. Therefore, in the delivery base candidate G21, all delivery destination candidates are included in the delivery range of any nearby delivery base candidate.
Similarly, in the delivery base candidates G32 and G43, all of the delivery destination candidates to which they belong are set as duplication candidates.
Therefore, these delivery base candidates G21, G32, and G43 are set as delivery base deletion candidates. When the setting of the delivery base deletion candidate is completed (S45), the process proceeds to steps S47 to S51.

  In steps S47 to S51, whether or not a combination of delivery base candidates excluding only one or two or more delivery base deletion candidates selected from the delivery base deletion candidates set in step S45 covers all destinations. Are checked (S47), and as a result, if they are covered (YES in S49), a combination of delivery base candidates excluding only one or more delivery base deletion candidates is set as a delivery base combination candidate (S51). ) Processing. Each delivery base combination candidate naturally includes delivery base deletion candidates other than the delivery base deletion candidates selected to be excluded.

  For example, in FIG. 9, in the combination of 11 delivery base candidates excluding only the delivery base deletion candidate G21, all the delivery destinations are covered as delivery destination candidates of one or more delivery base candidates. Therefore, a combination of 11 delivery base candidates excluding only the delivery base deletion candidate G21 is set as a delivery base combination candidate.

  Further, in the combination of 11 delivery base candidates excluding only the delivery base deletion candidate G32, all the delivery destinations are covered as delivery destination candidates of any one or more delivery base candidates. Accordingly, a combination of eleven delivery base candidates excluding only the delivery base deletion candidate G32 is set as a delivery base combination candidate.

  Further, in the combination of 11 delivery base candidates excluding only the delivery base deletion candidate G43, all the delivery destinations are covered as delivery destination candidates of any one or more delivery base candidates. Accordingly, a combination of eleven delivery base candidates excluding only the delivery base deletion candidate G43 is set as a delivery base combination candidate.

  However, the combination of ten delivery base candidates excluding only the two delivery base deletion candidates G21 and G32 does not cover the recipients c belonging to only the delivery destination base deletion candidates G21 and G32. Therefore, the combination of ten delivery base candidates excluding only the two delivery base deletion candidates G21 and G32 is not set as the delivery base combination candidate.

  On the other hand, in the combination of 10 delivery base candidates excluding only the two delivery base deletion candidates G21 and G43, all the delivery destinations are covered as delivery destination candidates of one or more delivery base candidates. The Therefore, a combination of ten delivery base candidates excluding only two delivery base deletion candidates G21 and G43 is set as a delivery base combination candidate.

  However, in the combination of 10 delivery base candidates excluding only the two delivery base deletion candidates G32 and G43, the destinations i belonging to only the delivery destination base deletion candidates G32 and G43 are not covered. Accordingly, a combination of ten delivery base candidates excluding only two delivery base deletion candidates G32 and G43 is not set as a delivery base combination candidate.

  In addition, in the combination of nine delivery base candidates except only the three delivery base deletion candidates G21, G32, and G43, only the delivery destination base deletion candidates G21, G32, and G43 belong to each other. The destination address c and the destination address i are not covered. Therefore, the combination of nine delivery base candidates excluding only the three delivery base deletion candidates G21, G32, and G43 is not set as the delivery base combination candidate.

When the above-described comprehensive check / delivery base combination candidate setting / non-setting process (S47 to S51) is completed for all cases where only one or two or more delivery base deletion candidates are excluded from the delivery base candidates (YES in S53), delivery is performed. The combination having the smallest number of delivery base candidates constituting the combination candidate is selected from the base combination candidates and set as the delivery base combination (S55). In the above example, the combination of 10 delivery base candidates excluding only the two delivery base deletion candidates G21 and G43 is set as the delivery base combination because the number of delivery base candidates is the smallest ( S55).
The delivery base is determined as described above.

[D] Delivery affiliation decision / delivery route decision function:
Time circle:
The time circle is a circle drawn on the time map described above. That is, a certain point (for example, a point a of the delivery base that is the starting point of the delivery route) is specified, and the normal map viewed from the point a is proportional to the travel time from the specified point a. Each point is arranged so as to coincide with the upper direction, and the circle is drawn with the point a as the center.
In this example, as shown in FIG. 13, a time circle having a radius rg of Tp / π, which is a value obtained by dividing the allowable delivery time Tp by π, is set as the delivery range prescribed time circle Tg. A delivery base is placed in the center G. In addition, each delivery destination distributed in the area of the delivery range prescribed time circle Tg is set as the jurisdiction delivery destination of the delivery base G.

The reason for determining the delivery range prescribed time circle Tg as described above will be described below.
In a delivery operation in which goods are loaded onto a truck, depart from the delivery base, and are delivered in order to a plurality of jurisdiction delivery destinations and returned to the delivery base G, the goods are fully loaded at the time of departure and are delivered in order on the outbound route, and the return route is also empty. The cargo is continuously delivered without running on the load, the truck becomes empty immediately before returning to the delivery base G, and the time when the truck becomes empty is less than the allowable delivery time Tp and within the allowable delivery time. Closeness is desirable from the viewpoint of truck utilization efficiency.
With this desirable delivery,
(A) In one delivery, it is required that the time immediately before returning to the delivery base G, which is the time when the truck becomes empty, falls within the delivery allowable time Tp of the article. It is desirable that it is substantially the same as the allowable time Tp.
Also,
(B) The amount of articles to be delivered in one delivery, in other words, the amount of articles to be delivered to the jurisdiction delivery destination on one delivery route is less than or equal to the loadable capacity Q of the truck. It is required and is preferably substantially the same as the loadable capacity Q.
In addition, one or more delivery routes each for the desired delivery are:
(C) It is essential that all of the delivery destinations under the control of the delivery base G can be traced by the sum of the one or more delivery routes, each of which is one delivery.
further,
(D) In order to deliver efficiently, the jurisdiction delivery destination of the delivery base G is traced through the above-mentioned one or more delivery routes without overlapping, in other words, once for one jurisdiction delivery destination. It is also required to deliver goods by delivery.

The above requests (a) to (d) can be paraphrased into the following methods, respectively.
(A) It is essential that the sum of the time distances (travel required time = travel required time) to follow the jurisdiction delivery destination on one delivery route is equal to or less than the allowable delivery time Tp, and the allowable delivery time Tp It is desirable that they be substantially the same. The one delivery route and the jurisdiction delivery destination included in the one delivery route are determined so as to satisfy this.
(B) It is essential that the total amount of articles to be delivered to the jurisdiction delivery destination on one delivery route is equal to or less than the loadable capacity Q of the truck, and may be substantially the same as the loadable capacity Q. desirable. The jurisdiction delivery destination to be included on the one delivery route is determined so as to satisfy this.
(C) The distribution area of the delivery destination under the control of the delivery base G is scanned with a virtual line from one end to the other end, and the delivery destinations that contact the virtual line are extracted in order. By imposing the restrictions (b) and (b) on this scan, the division of jurisdiction delivery destination extraction for one delivery route is obtained. The scanning of the virtual line is preferably scanning in which a radial line starting from the delivery base G (center) is rotated in one direction.
(D) Same as (c) above.

For this reason, in the apparatus of the present example, the above-described methods (a) to (b) are embodied as follows.
(A) Departing from the delivery base G, tracing the jurisdiction delivery destination, and using the circumference length as the delivery allowable time Tp as a representative trajectory including various routes that can return to the delivery base G within the delivery allowable time Tp. Use the matched time circle. This time circle is hereinafter referred to as a delivery route circle. Time circles Pc and Pc1 in FIG. 13 correspond to delivery route circles. The diameters of the delivery path circles Pc and Pc1 are equal to the radius rg of the delivery range prescribed time circle Tg.
In an area where the jurisdiction delivery destination is distributed within a relatively narrow angle range when viewed from the delivery base G, the forward route has a long and narrow shape that extends in the radial direction and then returns to the delivery base G. In an area distributed within a relatively wide angle range when viewed from the delivery base G, the forward path has a shape close to a circle. Therefore, when the former is used as a reference, the delivery range specified time Tg is relatively long, and when the latter is used as a reference, the delivery range specified time Tg is relatively short. This device uses a circle as the representative shape of the forward route so that it can return to the departure point within the allowable delivery time even if the delivery destinations under control are distributed within a relatively wide angular range when viewed from the delivery base G. adopt. That is, a time corresponding to the diameter of a circle having the permissible delivery time of the article (product) as a circumference is adopted as the above-described delivery range specified time Tg.
(B) Introduced the concept of model volume and volume expansion coefficient by size classification as a method to convert the total load of goods of various shapes to be delivered to the jurisdiction delivery destination into the volume when loaded on the truck. To do. As a result, it is possible to compare the total load amount of articles of various shapes to be delivered to the delivery destination with the loadable capacity Q of the truck with high accuracy. The model volume and the volume expansion coefficient for each size classification will be described later.
(C) One end of the diameter rg of the delivery path circle Pc in (a) above is placed at the delivery base G, and this is adopted as the virtual line for the above-mentioned jurisdiction delivery destination extraction scan. In other words, one point on the circumference of the delivery route circle Pc is fixed so as to match the delivery base G, and the diameter line of the delivery route circle Pc around the delivery base G (the radius line of the delivery range prescribed time circle Tg). ) Rg is rotated in a certain direction (for example, clockwise), and the above-mentioned jurisdiction delivery destination extraction scan is performed.
As can be seen from the above, the region within the delivery range prescribed time circle Tg is a region that is filled with the delivery route circle Pc when the delivery route circle Pc is rotated as described above. Accordingly, all the jurisdiction delivery destinations distributed within the delivery range prescribed time circle Tg can be included on the delivery route without duplication.
(D) Same as (c) above.

Overview of delivery affiliation determination / delivery route determination:
14 and 15 show a delivery affiliation & route determination method.
In the apparatus of this example, an imaginary line rg drawn in the radial direction from the center G (delivery base) of the delivery range prescribed time circle Tg is set in a certain direction as shown in FIG. And the jurisdiction delivery destinations within the delivery range prescribed time circle Tg are scanned, and the jurisdiction delivery destinations extracted by this scanning are sequentially incorporated into the delivery route.

  In the extraction scanning of the jurisdiction delivery destination, if either one of the restriction on the delivery allowable time Tp in (a) and the restriction on the truck loadable capacity Q in (b) is satisfied, The delivery destination extraction scan is temporarily stopped. That is, during the extraction scan of the jurisdiction delivery destination, (b) the length of the delivery route (sum of travel time) that follows the jurisdiction delivery destination extracted from the delivery base G and returns to the delivery base G is the delivery allowance. When the time Tp is reached, or (b) when the total load q of articles to be delivered to the extracted jurisdiction delivery destination reaches the loadable capacity Q of the truck, the extraction scan of the jurisdiction delivery destination is temporarily stopped at that time.

  Various round trip routes are possible as the round trip route that returns to the delivery base G following the jurisdiction delivery destination extracted by the above scanning. Also, depending on circumstances, it may be better to adopt a one-way route in which one or a few jurisdiction delivery destinations are sandwiched across the virtual line rg that temporarily stops the extraction scan. In this example, taking these circumstances into consideration, the round route to be adopted is determined by the following method.

(A) Delivery route in extraction order:
First, a round route that returns to the delivery base G through the jurisdiction delivery destination in the order extracted by scanning is set as the first candidate. That is, a round route that follows the jurisdiction delivery destination in ascending order of the opening angle θ from the reference position at which extraction scanning is started (position of the virtual line rg in FIG. 15 = position where the virtual line rg faces upward) is defined as the first candidate. To do. In the example of FIG. 15, the jurisdiction delivery destination is a route (route indicated by a broken line arrow) that returns to the delivery base G by following D1, D2, D3, D4, D5, and D6 in this order. The jurisdiction delivery destination D7, when the jurisdiction delivery destination D7 is included in the current delivery route, satisfies the restriction (b) of the allowable delivery time Tp or the restriction (b) of the loadable volume Q of the truck. Therefore, it is a jurisdiction delivery destination excluded from the current delivery route. This jurisdiction delivery destination D7 is incorporated into the next delivery route.

(B) Correction of radial movement:
If the delivery route set in the scanning extraction order (ascending order of θ) is inappropriate, for example, the number of times of relatively long movements in the radial direction is large, and therefore the length of the delivery route (sum of travel time) is early. When the allowable delivery time Tp is reached, the scanning extraction order is relatively fast and the scanning extraction order is relatively fast and the delivery range from the jurisdiction delivery destination near the center of the delivery range prescribed time circle Tg. Extract the scan after following the jurisdiction delivery destination of the specified time circle Tg near the circumference, and further following the jurisdiction delivery destination of the delivery range specified time circle Tg near the circumference, with the scanning extraction order being relatively slow. A round route that is relatively late and returns to the delivery base G through the delivery destination near the center of the delivery range prescribed time circle Tg is set as the second candidate. This corresponds to the route indicated by the solid arrow shown in the upper right in FIG. 15, that is, the route returning to the delivery base G by following the jurisdiction delivery destinations in the order of D3, D2, D1, D4, D6, D5. The method of comparing the second candidate with the first candidate and obtaining a good result is adopted. Alternatively, leave it for comparison with other candidates. A good result is, for example, that the total travel time can be shortened, and preferably the total travel time can be shortened, so that the number of jurisdiction delivery destinations for one time (one time where a round route is set) is increased. Say to get.

(C) Recorrection of radial movement:
According to the correction in (b) above, a plurality of one-round routes may be picked up as candidates. For example, the path indicated by the solid arrow that follows the delivery destination in the order of D3, D1, D2, D4, D6, D5 shown in the lower right in FIG. 15 and returns to the delivery base G is D3, D2, It is considered that it can be picked up as a second candidate along with a route returning to the delivery base G following the order of D1, D4, D6, and D5. In such a case, a round route with a shorter delivery route length (total travel time) is adopted. Alternatively, leave it for comparison with other candidates.

(D) Replacement correction across the stopped extraction scanning line:
When one or a small number of jurisdiction delivery destinations across the virtual line rg for which extraction scanning has been temporarily stopped are replaced, and a better result is obtained after the replacement (eg, when the total travel time can be shortened / moved) When the total amount of required time can be shortened, the jurisdiction delivery destination to be included in the one time can be increased / When the total load amount can be reduced / When the total load amount can be reduced, the jurisdiction delivery destination to be included in the one time can be increased ) Adopts the delivery route after the replacement. Alternatively, leave it for comparison with other candidates.
In addition to the above, as an evaluation method for determining whether or not a good result is obtained, for example, there is an evaluation based on a predetermined evaluation formula for evaluating delivery efficiency.

(E) Non-correction / correction / minor correction after re-correction:
After deciding a delivery route candidate, further create a delivery route with a fine modification of the candidate, compare the length of the delivery route (total travel time), and adopt the shorter one Also good. As a method of this fine correction, for example, (e1) One of two jurisdiction delivery destinations adjacent to each other on the delivery route is temporarily replaced with a nearby jurisdiction delivery destination, and the travel time before and after the exchange is compared. Method: (e2) When the length of the delivery route (total travel time) can be sufficiently shortened by the fine modification, the jurisdiction delivery destination (the jurisdiction delivery destination D7 in the example of FIG. 15) that was initially excluded is If the total travel time after incorporation is less than the allowable delivery time Tp and the total load after incorporation is less than or equal to the loadable capacity Q of the truck. The method of incorporating the jurisdiction delivery destination excluded at the beginning into this delivery (delivery where a round route is defined) can be mentioned.

(F) Resume extraction scan:
When the delivery route for one time is determined as described above, the extraction scanning once stopped is restarted, and the next delivery route for the next time is determined in the same manner as described above. In the example of FIG. 15, scanning is resumed from the position of the jurisdiction delivery destination D7. However, when the replacement correction (d) or the fine correction (e2) is performed, the process is resumed in consideration of the circumstances.
Further, when the extraction scanning with the virtual line rg is rotated once (360 °), the delivery route of all the delivery destinations within the delivery range prescribed time circle Tg is determined. As a result, the delivery affiliation determination / delivery route determination process ends.

Procedure for determining delivery affiliation and delivery route:
A procedure for determining a delivery affiliation and a delivery route for a specific delivery base (a delivery base Ga in the illustrated example) in the delivery base group whose location is optimally determined by the delivery base location determination function 11 This will be described with reference to the flowcharts of FIGS. In the delivery affiliation determination, it is determined what number of delivery routes in the delivery route starting from the delivery base Ga is to belong to each delivery destination of the delivery base Ga. In the delivery route determination, the order of tracing each controlled delivery destination belonging to a certain delivery route, that is, the route of the delivery route is determined.

In Steps S71 to S77, each destination whose travel time from the delivery base Ga is equal to or less than the radius rg (= delivery scope specified time) of the delivery range prescribed time circle is set as the jurisdiction delivery destination of the delivery base Ga. Extract each one.
That is, the required travel time between the delivery base Ga and each destination is extracted from the base-destination / required time & angle table (FIG. 24A) (S71), and the extracted required travel time is extracted. If it is equal to or less than the delivery range specified time rg (YES in S73), the notification destination is set as the jurisdiction delivery destination of the delivery base Ga (S75). For example, in FIG. 24A, each destination with the destination ID of 1, 2, 4-7, 9, 10 has the required travel time equal to or less than the delivery range specified time rg = 1.273 [hour], so the jurisdiction delivery The destinations with destination IDs 3 and 8 are not extracted because the required travel time exceeds the delivery range specified time rg = 1.273 [hour]. Such processing is sequentially executed for all the destinations associated with the delivery base Ga, and when the processing is completed for all the destinations (YES in S77), the process proceeds to step S79.

In step S79, the angle θ and the load amount of each jurisdiction delivery destination extracted in steps S71 to S75 are acquired from the base-destination / required time & angle table.
Here, the angle θ that the jurisdiction delivery destination has is that a line connecting the jurisdiction delivery destination and the delivery base Ga is a reference line in a predetermined direction passing through the delivery base Ga (eg, a line extending in the north-south direction). The angle formed (refer to FIGS. 16A and 16B; as in a general distance map, in FIGS. 16A and 16B, the north faces upward). The base-destination / destination / required time & angle table may be stored in the hard disk 20 in advance by the apparatus, and data indicating the location of each destination and each delivery base in the destination table (FIG. 4). 4) (not shown in FIG. 4) or the required movement time calculation function 14 or the like, the required data may be obtained and configured on the memory 30.
Further, the amount of cargo possessed by the responsible delivery destination is the amount [m ³ ] of the package to be delivered from the delivery base Ga to the relevant delivery destination. As this load [m ³ ], in the present apparatus, the model volume and the volume expansion rate (size classification table) associated with the size classification (article table; see FIG. 26A) to which the delivery target article belongs. A value obtained based on FIG. 25 (a) and the number of articles to be delivered. That is, a value obtained by multiplying the model volume of the article to be delivered by the number to be delivered (number of delivery units) and further multiplying by the volume expansion rate is used.
Here, the model volume of a certain size classification means the average value of the volume per article (per delivery unit of articles) measured for each of various articles belonging to the certain size classification. Actually, the model volume is the average value of the volume per delivery unit actually measured for each of the top 10 items in the past delivery record. The volume expansion rate is the amount of increase in bulk (increased amount per delivery unit = increase rate) when articles of various size classifications are mixed at a predetermined ratio (eg, ratio based on past mixed loading results). ) Is a correction coefficient for each size classification obtained by actual measurement for each size classification. The “delivery unit” refers to the minimum unit for handling the article in the delivery operation. Further, in the claims, a value obtained by multiplying the model volume of a certain article by the volume expansion coefficient of the article is referred to as “unit volume” of the article.
Note that the amount of cargo to be delivered to the responsible delivery destination is acquired from the destination table (FIG. 4).

Next, the process proceeds to step S81.
In step S81, first, the jurisdiction delivery destinations acquired in step S79 are arranged in ascending order of θ (rearrangement processing). In the base-destination / destination / required time & angle table of FIG. 24 (a), the destinations are arranged in ascending order of θ, so the rearrangement process in step S81 seems unnecessary, but this rearrangement process. In (S81), a record of the destination is newly added to the required time & angle table between the delivery base and the destination later. As a result, the arrangement of the destinations in the required time & angle table between the delivery base and the destination is obtained. It is also possible to cope with the case where the values disappear in the ascending order of θ.
Based on the rearrangement process, the jurisdiction delivery destination management table (delivery base G-) has a jurisdiction delivery destination ID, a destination ID, an angle θ, a load amount, and a route as items, and a record is configured for each rearranged jurisdiction delivery destination. The jurisdiction delivery destination management table a in FIG. 24B is configured on the memory. The jurisdiction delivery destination ID is sequentially assigned to the jurisdiction delivery destination after the rearrangement process. This jurisdiction delivery destination ID is used as data for managing the order of delivery within the same delivery route, as will be described later. The route item includes one or two or more delivery routes created for the delivery base Ga, that is, a return from the delivery base Ga to the delivery base Ga through several jurisdiction delivery destinations 1 Alternatively, data indicating which delivery route of two or more delivery routes belongs is recorded.

  Next, in step S83, the track load capacity of each track belonging to the delivery base Ga is acquired from the track table (FIG. 26 (b)). Further, in step S85, the required travel time between the respective delivery destinations of the delivery base Ga is acquired from the inter-point travel time table (FIG. 6), and the delivery under the jurisdiction of the delivery base Ga is stored in the memory. The destination required time table (FIG. 23) is constructed. Note that this inter-delivery destination required time table (FIG. 23) may be configured in advance on the hard disk 20 and used. In this required delivery time table between delivery destinations, the delivery base Ga is also treated as one point (the delivery destination), and data relating to the required travel time between the delivery base Ga and the delivery destination is also provided. It is held in the same way as the required travel time.

  When the angle and load quantity table for each delivery destination at the delivery base Ga and the time table between delivery destinations at the delivery base Ga are created as described above, the processing after step S87 is executed. To do.

  First, in step S87, an initial value “0” is set to a variable j representing a route to be processed at the current time point (a jurisdiction delivery destination to belong to the route and a target for determining the order of tracing them = a delivery route being created). 1 ”is set. In addition, an initial value “0” is set to a variable k that represents the cumulative value of the number of delivery destinations (the jurisdiction delivery destinations for which the delivery route of the affiliation destination is determined).

  Next, in step S89, the jurisdiction delivery destination currently focused on the route j to be processed at the current time (the jurisdiction delivery destination to be judged whether or not to belong to the delivery route j currently being created) An initial value “1” is set to a variable i representing In addition, an initial value “0” is set to a variable q that represents the cumulative amount of cargo from the first jurisdiction delivery destination on the route j to be processed at the current time point to the jurisdiction delivery destination currently focused on. In addition, an initial value “0” is set to a variable t that represents the total required travel time from the delivery base Ga on the processing target route j to the jurisdiction delivery destination that is currently focused on. .

After each initial value is set, the processing in steps S91, S93, and S99 is performed for the load amount from the first jurisdiction delivery destination on the route j to be processed at the current time point to the jurisdiction delivery destination currently focused on. The jurisdiction that is currently focused on until the total q exceeds the loadable capacity Q of the truck used in the route (NO in S95) or from the delivery base Ga on the route j to be processed at the current time The process is repeatedly executed until the total movement time t until reaching the delivery destination exceeds the delivery allowable time Tp (NO in S97).
Step S91 is currently focused on the cumulative amount of cargo from the first jurisdiction delivery destination on the processing target route j at the current time point to the jurisdiction delivery destination immediately before the jurisdiction delivery destination that is currently focused on. This is a process of setting a value obtained by adding the amount of cargo of a jurisdiction delivery destination to be the total q of the amount of cargo to the jurisdiction delivery destination that is currently focused on. In other words, the cumulative amount of cargo from the first jurisdiction delivery destination on the route j to be processed at the current time point to the jurisdiction delivery destination immediately before the jurisdiction delivery destination that is currently focused on is the processing object at the current time point. A value obtained by adding the volume of the currently managed jurisdiction delivery destination to the cumulative amount of cargo from the first jurisdiction delivery destination to the jurisdiction delivery destination immediately before the current jurisdiction delivery destination in the route j of It is a process to update with.
In step S93, the previous jurisdiction delivery is added to the total travel time from the delivery base Ga on the route j to be processed at the current time point to the jurisdiction delivery destination immediately before the jurisdiction delivery destination of interest. A value obtained by adding the required travel time between the destination and the currently-accommodated delivery destination to be taken as the cumulative travel time t from the delivery base Ga to the currently-acquired delivery destination. is there. That is, the total travel time from the delivery base Ga on the route j to be processed at the current time point to the jurisdiction delivery destination immediately before the target delivery destination that is currently focused on is calculated as the processing target at the current time point. The total travel time from the delivery base Ga on route j to the jurisdiction delivery destination immediately before the jurisdiction delivery destination currently noticed is the distance between the previous delivery destination and the jurisdiction delivery destination currently noticed. It is the process which updates with the value which added movement required time.
Step S99 is a process in which the jurisdiction delivery destination having the next jurisdiction delivery destination ID of the jurisdiction delivery destination that is currently focused on is set as the currently targeted jurisdiction delivery destination. In other words, this is a process of advancing attention to the jurisdiction delivery destination having the next jurisdiction delivery destination ID of the jurisdiction delivery destination currently being noticed.

  If the determination in step S95 is NO during the above repetitive processing, in other words, the jurisdiction delivery destination that is currently focused on from the first jurisdiction delivery destination in the processing target route j at the current time point. When the cumulative quantity q up to i exceeds the loadable capacity of the track used in the route j (NO in S95), the process proceeds to step S101 and subsequent steps.

  On the other hand, if the determination in step S97 is NO during the above repetitive processing, in other words, from the delivery base Ga on the route j to be processed at the current time point to the jurisdiction delivery destination i currently focused on. If the cumulative time t required to travel has exceeded the allowable delivery time Tp of the delivery item (NO in S97), the process proceeds to step S141 and thereafter.

Processing after Step S101 (when the cumulative load is over):
If the cumulative q of the first to i-th loads on the route j to be processed at the current time exceeds the loadable capacity Q of the track (NO in S95), the processing after step S101 is performed. Executed.
In step S101, for example, the jurisdiction delivery destination i currently focused on and the jurisdiction delivery destination i + 1 having the next jurisdiction delivery destination ID of the current jurisdiction delivery destination are temporarily replaced. This is a process of checking whether or not the total amount q is equal to or less than the loadable capacity Q of the track used on the path j to be processed at the current time point.
As a result, when the cumulative total q after the replacement is less than or equal to the loadable capacity Q of the truck (YES in S103), the process proceeds to step S105.
On the other hand, if the cumulative total q after the replacement still exceeds the loadable capacity Q of the truck (NO in S103), it has a jurisdiction delivery destination ID before the jurisdiction delivery destination that is currently focused on. The jurisdiction delivery destination i-1 and the jurisdiction delivery destination i + 1 next to the jurisdiction delivery destination currently focused on are temporarily replaced, and the same check is performed (S101).
Alternatively, the jurisdiction delivery destination i currently focused on is replaced with the jurisdiction delivery destination i + 2 having the next jurisdiction delivery destination ID next to the currently targeted jurisdiction delivery destination, and the same check is performed (S101). .
As a result of the above check, if the cumulative quantity q after replacement still exceeds the loadable capacity Q of the truck (NO in S103), for the jurisdiction delivery destination i-2 or before, or the jurisdiction delivery destination i + 3 or later, Check in the same way. It should be noted that the criteria for determining which range to check back and the range to check over, that is, the criteria for determining whether or not the predetermined replacement check is completed in step S109 are preset in the system. It shall be.

If it is determined in step S103 that the accumulated load q after replacement has become equal to or less than the loadable capacity Q of the truck (YES in S103), the process proceeds to step S105.
In step S105, the delivery base G-a is departed, and i jurisdiction delivery destinations specified by the replacement process in step S101 (the jurisdiction delivery destination where the route to be assigned is determined = delivery destination) are followed. A round route (minimum time round route) in which the accumulated value t of the travel time is the minimum value Tmini is obtained in the round route of returning to the base Ga. Details of this processing will be described later.
In the above, i jurisdiction delivery destinations (delivery destinations) are, for example, when jurisdiction delivery destinations i and i + 1 are interchanged, and the jurisdiction delivery destination ID is “k + 1, k + 2, k + 3,. k + i-1, k + i + 1 ". Further, if the jurisdiction delivery destination i and i + 2 are exchanged, the jurisdiction delivery destination ID is “k + 1, k + 2, k + 3,..., K + i−1, k + i + 2”. If the jurisdiction delivery destinations i-1 and i + 1 are exchanged, the jurisdiction delivery destination ID is "k + 1, k + 2, k + 3,..., K + i-2, k + i, k + i + 1". The same applies when replacement is performed for other delivery destinations. Note that “k = 0” at the time of processing for determining the first round trip route (see step S87).

  If the minimum value Tmini of the total travel time t obtained in step S105 is equal to or shorter than the allowable delivery time Tp (YES in S107), in other words, the vehicle departs from the delivery base Ga and is specified in step S101. The total travel time Tmini of the minimum time one-round route that is a one-round route that traces i jurisdiction delivery destinations (delivery destinations) and returns to the delivery base G-a is the minimum travel time t. If it is less than the allowable delivery time Tp, the replacement of the jurisdiction delivery destination (delivery destination) performed in step S101 is adopted. Specifically, the jurisdiction delivery destination IDs of the two jurisdiction delivery destinations that were temporarily replaced in step S101 are exchanged (S111). Thereby, i jurisdiction delivery destinations whose jurisdiction delivery destination IDs are “k + 1, k + 2, k + 3,..., K + i” are determined as jurisdiction delivery destinations (delivery destinations) belonging to the current processing target route j. Is done.

  When the jurisdiction delivery destinations (delivery destinations) belonging to the route j to be processed at the current time are determined in this way, the jurisdiction delivery destination IDs of the i jurisdiction delivery destinations are set to the cumulative total time t required for movement. The order in the minimum time-round route is changed so as to be in ascending order (S113). In other words, the tracks are switched in the ascending order in the order in which the tracks follow the i jurisdiction delivery destinations (delivery destinations) in the minimum time round route. As a result, it is possible to manage the order of tracing along the processing target path j at the current time point in ascending order of the jurisdiction delivery destination ID.

  Further, the item of the route of the above-mentioned i jurisdiction delivery destinations (delivery destinations) determined to belong to the processing target route j at the present time (the route of the delivery base G-a angle and load amount table by jurisdiction delivery destination) (J) is set to each item (S115).

  Next, the process proceeds to step S117, with respect to each jurisdiction delivery destination whose jurisdiction delivery destination ID is k + i + 1 or more, in other words, with respect to each jurisdiction delivery destination whose route to be determined is not yet determined, k + i + 1 is incremented one by one in order. The jurisdiction delivery destination ID is reset in ascending order of θ. This process is for determining the jurisdiction delivery destination to which the route should be determined in the same manner as described above with respect to the route to be determined next from the route j to be processed at that time.

  Next, k + i is substituted for k (= the jurisdiction that has been determined to belong to the route j to be processed at the current time in the previous cumulative number k of the delivery destinations that are the delivery destinations that have been determined to belong to the route. K is updated by adding the number i of the delivery destinations; S119; and j is incremented by 1 (= the current route to be processed is moved to the next; S129), and k is the delivery base G-a. On the condition that the total number of jurisdiction delivery destinations is less than m (YES in S131), the process returns to step S89. That is, the same processing as described above is executed for the next route. If k is equal to the total number m of delivery destinations under the control of the delivery base G-a (NO in S131), the process ends.

  On the other hand, if it is determined in step S109 that the predetermined replacement process has been completed, i.e., i jurisdiction deliveries despite all the replacement checks within the range preset in the system. If the cumulative total q of the previous load exceeds the loadable capacity Q of the truck, i-1 jurisdiction delivery destinations excluding the jurisdiction delivery destination i extracted last in the route j to be processed at the current time point are determined. The jurisdiction delivery destination (delivery destination) that should belong to the processing target route j at the current time is processed in substantially the same manner as in the case of i pieces. That is, as in step S105 in the case of i pieces, a minimum time-round route in which the cumulative value t of the required movement time becomes the minimum value Tmini is obtained (S121), and i in the same manner as in step S113 in the case of i pieces. The jurisdiction delivery destination IDs of the -1 jurisdiction delivery destinations are replaced so as to be in ascending order in the minimum time circuit route in which the total travel time t is minimum (S123), and step S115 for the i cases In the same manner as above, j is set in each of the items of the route of the i-1 jurisdiction delivery destination (delivery destination) determined to belong to the processing target route j at the current time (S125), and the i items In the same manner as step S119 in this case, k + i-1 is substituted for k (S127). Thereafter, j is incremented by 1 (S129), and the condition returns to step S89 on condition that k is less than the total number m of jurisdiction delivery destinations at the delivery base Ga (YES in S131).

Step S111 (replacement) in the case where i jurisdiction delivery destinations extracted in the processing target route j at the current time point belong to the processing target route j at the current time point (in the case of S111 to S117). And the process corresponding to step S117 (reset in ascending order of θ for undecided jurisdiction delivery destinations) is i-1 except for the jurisdiction delivery destination i last extracted in the path j to be processed at the current time point. The reason why there is no individual jurisdiction delivery destination belonging to the processing target path j at the present time (in the case of S121 to S125) is that the latter is not necessary because the jurisdiction delivery destination is not replaced. It is.
In step S101, one piece and one piece are exchanged. Instead, one piece and plural pieces are exchanged, plural pieces and one piece are exchanged, and plural pieces and plural pieces are exchanged. Thus, it may be processed in substantially the same manner.

Processing after step S141 (when the cumulative time is over):
When the cumulative t of required travel times up to the i-th time on the processing target route j at the current time exceeds the allowable delivery time Tp (NO in S97), the processing from step S141 is executed. .
In step S141, i jurisdiction delivery destinations whose jurisdiction delivery destination IDs are “k + 1, k + 2, k + 3,. This is a process of initially setting the accumulated value of the required travel time on the one-round route to follow. Note that the one-round route before replacement refers to the one-round route before switching the order of two controlled delivery destinations in the one-round route that traces the controlled delivery destination from the delivery base Ga and returns to the delivery base Ga. Say.
Step S143 is a process for obtaining the cumulative value of the required travel time for the one-round route after the replacement and setting it in the variable Tb0. The round trip route after replacement refers to a round trip route in which only the order of tracing two jurisdiction delivery destinations determined by a predetermined rule is replaced with the previous order. Further, as the predetermined rule, for example, a rule for extracting two jurisdiction delivery destinations whose difference in angle θ is equal to or smaller than a predetermined value as a target for order replacement, a difference in travel time between delivery bases Ga Rules for extracting two jurisdiction delivery destinations whose values are greater than or equal to a predetermined value as targets for permutation, rules defined as the logical product of these two rules, rules defined as the logical sum of these two rules, etc. Rules can be exemplified. This predetermined rule is set in the system in advance. The previous order is the order in which the i delivery destinations are traced in ascending order of θ in step S143 executed for the first time, but the order in which the destinations are traced in ascending order of θ in step S143 executed after the second time. Not that.

  In step S145, the values set in the two variables Ta0 and Tb0 are compared in magnitude. As a result, in the case of “Tb0 <Ta0”, that is, when the total travel time becomes smaller when the order of two jurisdiction delivery destinations is changed (YES in S145), the two jurisdiction delivery destinations. The jurisdiction delivery destination ID is replaced (S147), and the value of the variable Ta0 is updated with the value of the variable Tb0 (S149).

  By repeating the processes of steps S143 to S149, the travel time required for the one-round route having a smaller total travel time is set in the variable Ta0 for the route j to be processed at the current time point. . Note that the processing in steps S105 and S121 described above can be executed in substantially the same manner as the repetitive processing in steps S143 to S149.

When the predetermined replacement check is completed (YES in S151), the value of the variable Ta0 is compared with the allowable delivery time Tp. As a result, in the case of “Ta0 ≦ Tp”, that is, the cumulative value of the required travel time is minimized. In this way, when the cumulative value of the required travel time of the one-round route that follows the delivery destination is equal to or less than the allowable delivery time Tp (YES in S153), the i items in the same order as the order that follows the delivery destination in the one-round route. The jurisdiction delivery destination ID of the jurisdiction delivery destination is reset (S155), and the item of the route of the i jurisdiction delivery destination (delivery destination) (in the angle & quantity table of the delivery base G-a according to the jurisdiction delivery destination) J is set for each item of the route (S157). The processing in step S155 has the same meaning as the processing in steps S113 and S123 described above, and the processing in step S157 has the same meaning as the processing in steps S115 and S125 described above.
If YES in step S153, the process does not immediately proceed to step S155, but first, it is checked whether or not a destination (“i + 1” -th destination, etc.) can be further added. The process of adding the destination that can be added may also be placed before the step S155.

After that, k + i is substituted for k (= the jurisdiction delivery that is determined to belong to the processing target route j at the current time to the previous cumulative number k of the delivery destinations that are the delivery destinations for which the route to be assigned is determined. K is updated with the value obtained by adding the previous number i; S119), and j is incremented by 1 (= the route to be processed at the present time is moved to the next; S129), and k is the delivery base G-a. On the condition that the total number of jurisdiction delivery destinations is less than m (YES in S131), the process returns to step S89. That is, the same processing as described above is executed for the next route.
If k is equal to the total number m of delivery destinations under the control of the delivery base G-a (NO in S131), the process ends.

  On the other hand, if “Ta0> Tb0” in the step S153, that is, the accumulated value of the required travel time of the one-round route that traces the jurisdiction delivery destination so that the accumulated value of the required travel time becomes the minimum is still p. If it is larger (NO in S153), for i-1 jurisdiction delivery destinations excluding the jurisdiction delivery destination i last extracted in the path j to be processed at the current time point, substantially the same processing as in the case of i pieces. I do.

  That is, by executing the processing of steps S161 to S171 in substantially the same manner as in steps S141 to S151, the variable Ta1 has a round in which the accumulated value of the travel time required on the processing target path j is minimized. Set the travel time for the route. The required travel time is naturally equal to or shorter than the allowable delivery time Tp because the jurisdiction delivery destination i extracted last on the route j to be processed at the current time is excluded.

Next, the jurisdiction delivery destination IDs of the i-1 jurisdiction delivery destinations are reset in the same order in which the jurisdiction delivery destinations are traced in the one-round route (S173), and the i-1 jurisdiction delivery destinations (delivery) Each j is set in the item of destination (the item of the route in the angle and load table for each delivery destination under the jurisdiction of the delivery base Ga) (S175). The processing in step S173 has the same meaning as the processing in steps S113 and S123 described above, and the processing in step S175 has the same meaning as the processing in steps S115 and S125 described above.
If YES in step S171, the process does not immediately proceed to step S173, but first, it is checked whether or not further destinations (such as the “i” th destination) can be added. The process of adding the destination that can be added may also be placed before the step S173 when the delivery allowable time and the truck load capacity are satisfied.

Thereafter, k + i-1 is substituted for k in substantially the same manner as the processing in step S119 for i cases (S127). Further, j is incremented by 1 (S129), and on condition that k is less than the total number m of jurisdiction delivery destinations at delivery base Ga (YES in S111), the process returns to step S89.
As described above, the delivery destination managed by the delivery base Ga is determined from a large number of delivery destinations, and the route for delivering a predetermined package from the delivery base Ga to the determined delivery destination is determined. Is realized.

In the above, the delivery is started while leaving the delivery base G-a and sequentially tracing one or more delivery destinations (the jurisdiction delivery destinations whose belonging to the delivery route is determined among the delivery destinations of the delivery base Ga). However, it is needless to say that a delivery route can be created by making appropriate corrections according to the user's operation input according to the actual situation. .
For example, when it is not possible to return to the delivery base Ga within the working hours as seen from the departure time, the departure from the delivery base Ga and one or more delivery destinations (the delivery destinations under the jurisdiction of the delivery base Ga) In this case, it is also possible to add a route that arrives at the driver's home by performing delivery within the allowable delivery time while sequentially following the jurisdiction delivery destinations that belong to the delivery route. In that case, the delivery range specified time is longer than the above-described time. Further, in the scanning for sequentially extracting the jurisdiction delivery destination, the jurisdiction delivery destination within a certain angle range as viewed from the delivery base Ga is extracted.
In addition, since a small number of jurisdiction delivery destinations are isolated from the majority of other jurisdiction delivery destinations, it is disadvantageous in terms of cost to include the few jurisdiction delivery destinations in the delivery route determined by the above method. The delivery is permitted while starting from the delivery base G-a and sequentially tracing one or more delivery destinations (the jurisdiction delivery destinations that are determined to belong to the delivery route among the delivery destinations of the delivery base Ga). Deliver in time, arrive at another delivery base G-x, load the luggage at the other delivery base G-x, return on the same way, and deliver within the delivery allowable time in the same way. A route to return to a may be added. Also in this case, the delivery range specified time is longer than the above-described time. Further, in the scanning for sequentially extracting the jurisdiction delivery destination, the jurisdiction delivery destination within a certain angle range as viewed from the delivery base Ga is extracted.

The block diagram which shows the structure of the apparatus of embodiment, and the function of a control apparatus. The flowchart which shows a movement required time calculation procedure. Explanatory drawing which illustrates a road table (a) and a unit road table (b). Explanatory drawing which illustrates a destination table. Explanatory drawing which illustrates distance time table (a) and its application classification table (b). Explanatory drawing which illustrates a point required time table. Explanatory drawing which shows a mode that a distance map is divided | segmented into a mesh (the unit area | region where each unit required time required for unit distance driving | running | working is each set; each small area enclosed with the broken line in a figure). FIG. 8 is an explanatory diagram of a method for calculating a time distance between a point A and a point B in FIG. Explanatory drawing which shows the method of calculating | requiring the combination with the minimum number of delivery base candidates from the combination of delivery base candidates. The case where the location interval upper limit distance is adopted as the location interval upper limit value of the delivery base candidate is shown. Explanatory drawing which shows the method of calculating | requiring the combination with the minimum number of delivery base candidates from the combination of delivery base candidates. The case where the location interval upper limit time is adopted as the location interval upper limit value of the delivery base candidate is shown, (a) shows a time map representation, and (b) shows a distance map representation converted from (a). A part of flowchart which shows a delivery location determination procedure. The remainder of the flowchart showing the delivery site location determination procedure. Explanatory drawing of the delivery range prescribed | regulated time circle Tg in the case of determining based on the delivery route circle | round | yen Pc which makes a perimeter match the delivery allowable time Tp. Explanatory drawing which shows a mode that the jurisdiction delivery destination distributed within the delivery range regulation time circle Tg of the delivery base G is extracted in order without omission by the rotational scan to the predetermined direction of the virtual line rg. Explanatory drawing which shows a mode that the delivery route for delivering an article from the delivery base G to each jurisdiction delivery place D1, D2, D3, extracted in FIG. 14 is determined. Explanatory drawing which shows a mode that the jurisdiction delivery destination and delivery route of delivery base Ga are determined, contrasting with distance map (a) and time map (b). A part of flowchart which shows a delivery affiliation and delivery route determination procedure. A part of flowchart which shows the delivery affiliation 9 delivery route determination procedure. A part of flowchart which shows a delivery affiliation and delivery route determination procedure. A part of flowchart which shows a delivery affiliation and delivery route determination procedure. A part of flowchart which shows a delivery affiliation and delivery route determination procedure. The remainder of the flowchart showing the delivery affiliation / delivery route determination procedure. Explanatory drawing which illustrates the required time table between jurisdiction delivery destinations of delivery base Ga. Explanatory drawing which illustrates the required time & angle table (a) between a delivery base-destination, and the jurisdiction delivery destination management table (b) of a delivery base Ga. A size classification table (a) for classifying an article based on size and associating a model volume with a volume expansion rate; a delivery time classification table (b) for classifying an article based on an allowable delivery time and associating an allowable delivery time; Explanatory drawing which illustrates this. Explanation illustrating an article table (a) having a size classification ID and a delivery time classification ID for each article, and a delivery base ID indicating a delivery base to which each truck belongs and a track table (b) having a loadable capacity. Figure.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Control apparatus 11 Delivery base location determination function 12 Delivery affiliation determination function 13 Delivery route determination function 14 Travel time calculation function 18 Distribution cost calculation function 19 Distribution cost contrast function 20 Auxiliary storage device (hard disk etc.)
30 RAM

Claims (4)

The model volume that represents the volume of an article per delivery unit, which is the minimum unit of handling in the delivery operation of the article, and the volume that the delivery unit of the article occupies when mixed with other articles at a predetermined ratio is the model volume of the article. A volume information storage means which holds the volume expansion coefficient, which is a coefficient obtained by division, and holds for each article;
A loadable capacity storage means for holding the loadable capacity of the transport means used for delivery;
Azimuth angle storage means for holding each azimuth angle formed by an azimuth line connecting the delivery base and the jurisdiction delivery destination with respect to a virtual azimuth reference line passing through the delivery base;
A delivery destination extracting means for extracting a jurisdiction delivery destination in ascending order of the azimuth;
The total volume of articles destined for each jurisdiction delivery destination on the round route that returns from the delivery base to the delivery base by tracing the jurisdiction delivery destination extracted by the delivery destination extraction means without omission is calculated on the round trip route. A total of values obtained by multiplying the number of delivery units of each article addressed to each jurisdiction delivery destination by the model volume and the volume expansion rate of each article held by the volume information storage means, A route load amount calculation means for obtaining a total route route load amount based on the sum,
An extraction control means for comparing the round trip total load amount obtained by the route load amount calculation means with the loadable capacity of the transport means and delimiting the extraction operation of the delivery destination extraction means based on the comparison result;
A one-round route determination means for setting a one-round route corresponding to the total amount of one-round route determined by the route load amount calculating means as a one-round route of the section;
A delivery route creation device characterized by comprising: In claim 1 ,
The extraction control means delimits the extraction operation when the total round route route load amount obtained by the route load amount calculation unit exceeds the loadable capacity;
A delivery route creation device characterized by the above. In claim 1 ,
The route load amount calculation means, when the total route route load provided to the extraction control means for comparison with the loadable capacity exceeds the loadable capacity, the jurisdiction delivery destination and the A predetermined number of jurisdiction delivery destinations extracted immediately before are set as a correction range on the end side of the section that the extraction control means intends to divide, and a predetermined number of jurisdiction delivery destinations to be extracted following the jurisdiction delivery destinations beyond Set the jurisdiction delivery destination to the correction range at the beginning of the next section, replace the jurisdiction delivery destination selected according to the predetermined rule from both correction ranges, and recalculate the total route route load,
The one-round route determining means sets the one-round route corresponding to the total one-round route load obtained by the route load amount calculating means as the one-round route of the section.
A delivery route creation device characterized by the above. The program for functioning a computer as a delivery route creation apparatus in any one of Claims 1-3 .

Images