JP6834600B2 - Delivery plan creation program, delivery plan creation method, and delivery plan creation device - Google Patents

Description

The present invention relates to a delivery plan creation program, a delivery plan creation method, and a delivery plan creation device.

Traditionally, in the field of logistics, efforts have been made to reduce logistics costs. In recent years, further reduction of CO2 emissions has been required from the viewpoint of environmental consideration.

Regarding distribution costs, a technology for leveling the flow rate of goods such as the number of trucks has been proposed by combining distribution and demand forecasting and pre-delivering products with high demand forecast accuracy. Further, regarding the reduction of CO2 emissions, a technique for obtaining a collection / delivery route having the minimum total travel distance among the collection / delivery routes satisfying the required route by using the milk run method is known.

JP-A-2016-212757 Japanese Unexamined Patent Publication No. 2009-281791 Japanese Unexamined Patent Publication No. 2010-150020 JP-A-2002-207800

When the above-mentioned technology is used, in the CO2 emission reduction technology, the total travel distance is the minimum from the individual cargo and the delivery destination assigned in the physical distribution of one day obtained by leveling the physical distribution. Just look for a good route. In this case, since CO2 emissions are reduced only from the cargo allocated to a certain day and the delivery destination, there is a problem that the amount that can be reduced is limited.

Therefore, one aspect is aimed at reducing CO2 emissions associated with the delivery of cargo.

According to one aspect, a detour base is selected on the outermost route in the route diagram showing the route from the reference base for starting the delivery of the load to the reference base via the plurality of delivery destinations. The selected base ID that identifies the base is set as the aggregate base ID and stored in the storage unit, and the daily delivery information in which the load is leveled in the predetermined period stored in the storage unit is referred to. The first scheduled delivery date of the delivery information of the cargo including the aggregated base ID stored in the storage unit is changed to the second scheduled delivery date when the number of the aggregated base IDs is equal to or greater than the first threshold value, and the second scheduled delivery date is changed. Of the base IDs common to the delivery information of the above and the delivery information of the first scheduled delivery date, the second scheduled delivery date of the delivery information that specifies one or more base IDs different from the aggregate base ID is the first. A delivery planning program is provided that allows a computer to perform the process of changing the scheduled delivery date.

Further, as a means for solving the above-mentioned problems, a delivery plan creation method and a delivery plan creation device can be used.

It is possible to reduce CO2 emissions related to the delivery of cargo.

It is a figure which shows the calculation example of the CO2 emission amount in the improved ton-kilo method. It is a figure which shows the outline of the delivery plan making process by an existing technology. It is a figure for demonstrating the reduction method of a delivery destination. It is a figure for demonstrating aggregation and reverse movement. It is a figure which shows the outline of the whole processing of this Example. It is a figure which shows the hardware configuration of the delivery plan making apparatus. It is a figure which shows the functional configuration example of the delivery plan creation apparatus. It is a figure which shows the data structure example of the order information DB. It is a figure which shows the data structure example of the base information DB. It is a figure which shows the data structure example of the distance information DB. It is a figure which shows the data structure example of the load leveling result DB. It is a figure which shows the data structure example of the aggregation base DB. It is a figure which shows the data structure example of the aggregation result DB. It is a figure which shows the data structure example of the delivery plan DB. It is a figure for demonstrating the outermost base in a route map. It is a figure which shows the example of the route map. It is a figure for demonstrating the example of the aggregation base selection processing. It is a figure for demonstrating the case where the base existing along the outer circumference is not an aggregation base. It is a figure which shows the example of the selected aggregation base. It is a figure for demonstrating an example of aggregation date selection processing. It is a figure for demonstrating the aggregate execution process. It is a figure for demonstrating the load amount adjustment process. It is a figure which shows the data example of the aggregation result DB after the load amount adjustment. It is a figure which shows the transition of the total cargo amount between the aggregation date and the original date. It is a figure which showed the example of the total load amount for each base depending on whether or not this Example is applied. It is a figure which showed the example of the CO2 emission amount based on the delivery plan depending on whether or not this Example is applied. It is a flowchart for demonstrating the outline of the delivery management process by a delivery management part. It is a flowchart for demonstrating the outline of the load leveling process by a load leveling part. It is a flowchart for demonstrating the outline of the aggregation base selection process by the aggregation base selection department. It is a figure for demonstrating an example of the process in steps S1203 and S1204 of FIG. It is a figure for demonstrating the calculation method of the angle of a path. It is a figure for demonstrating the selection example of the consolidation base. It is a figure for demonstrating the aggregation date selection process by the aggregation date selection part. It is a flowchart for demonstrating the aggregation execution process by the aggregation execution part. It is a flowchart for demonstrating the additional function of aggregate execution processing. It is a figure for demonstrating the load amount adjustment process by a load amount adjustment part. It is a figure for demonstrating the delivery plan processing by a delivery planning department.

Hereinafter, embodiments of the present invention will be described with reference to the drawings. In the field of logistics, efforts have been made to reduce logistics costs, but from the viewpoint of environmental consideration, reduction of CO2 emissions is required. According to the "Act on Rationalization of Energy Use" (hereinafter referred to as the "Energy Energy Saving Act"), the improved ton-kilometer method applied to trucks is a mechanism to calculate CO2 emissions from the distance traveled, the amount of transportation, the maximum load capacity, and the load rate. It has become. Therefore, logistics companies are required to shorten the travel distance and improve the loading rate.

First, the improved Tonkilo method will be outlined. FIG. 1 is a diagram showing a calculation example of CO2 emissions in the improved Tonkilo method. FIG. 1 shows the difference in C02 emissions of different route patterns A and B when two trucks depart from the distribution center 1c, deliver the cargo to the bases d1 to d8, and return to the distribution center 1c. ..

In the route pattern A shown in FIG. 1A, the first truck travels from the distribution center 1c in the order of bases d1, d2, d3, d6, d7, d8, returns to the distribution center 1c, and is the second. The truck goes around the bases d1, d2, d4, d5, d7, and d8 in this order from the distribution center 1c, and shows a route returning to the distribution center 1c. The distance between the bases d1 to d8 is shown numerically. The unit is km.

The total moving distance of the two trucks in this case is represented by 78 km × 2 and obtains 156 km. Further, the C02 emission amount when 1.5 tons are delivered to each of the bases d1 to d8 is 0.127 t · CO2.

In the route pattern B shown in FIG. 1B, the first truck travels from the distribution center 1c in the order of bases d1, d2, d3, d5, d7, d8, returns to the distribution center 1c, and is the second. The truck goes around the bases d1, d2, d4, d6, d7, and d8 in this order from the distribution center 1c, and shows a route returning to the distribution center 1c. The distance between the bases d1 to d8 is the same as in FIG. 1 (A).

The total moving distance of the two trucks in this case is represented by 78 km + 70 km = 148 km, and 156 km is obtained. Further, the amount of C02 emitted when 1.5 tons are delivered to each of the bases d1 to d8 is 0.121 t · CO2. As can be seen from this example, the shorter the total travel distance, the smaller the CO2 emission.

Here, first, the process of creating a delivery plan using the existing technology will be considered. As an example, consider a case where a delivery plan is created by a technique of leveling the amount of cargo over a plurality of days (Patent Document 1) and a technique of optimizing the delivery plan in one day.

FIG. 2 is a diagram showing an outline of a delivery plan creation process using the existing technology. In FIG. 2, the load leveling process for leveling the load is represented in step A, and the delivery plan process for optimizing the delivery plan on a daily basis is represented in step B. In addition, the predetermined period for load leveling shall be 5 days. For convenience, these five days are referred to as 10/1, 10/2, 10/3, 10/4, and 10/5 (October 1 to October 5). The same applies to the following description.

In the load leveling process in step A, the load from 10/1 to 10/5 is predicted from the load in the same period in the past, and the prediction accuracy is used to predict the load from 10/1 to 10/5. Level the load.

When the daily load is determined, the delivery planning process is performed in step B. Specifically, the delivery planning process optimizes the number of trucks and the total travel distance with respect to the amount of cargo delivered on 10/1. From 10/2 to 10/5 thereafter, the optimization is performed in the same manner every day.

The number of peak trucks and the total travel distance are calculated from the daily processing results for a predetermined period. Further, the minimum value of the total movement distance is updated, and the above-mentioned steps A and B are alternately repeated until the difference from the previous time becomes equal to or less than the threshold value.

In the delivery plan creation process shown in FIG. 2, in the load leveling process in step A, the total amount of the daily load is determined, but the distance is not taken into consideration. In determining the total amount of cargo, the cargo to be delivered on the same day is specified, and therefore the base of the delivery destination is determined. The result is referred to in the delivery planning process in step B.

By leveling the amount of cargo in advance in a predetermined period and then planning the delivery for each day, it is possible to suppress an increase in calculation time. As for CO2 emissions, it is most effective to minimize the total travel distance of the truck, as described in FIG.

Therefore, in the delivery planning process of step B, it is a process of searching for the most effective reduction of CO2 emissions by delivering the total amount of the cargo determined for each day in the order of which truck and which base. .. On the other hand, due to the restrictions on the specified cargo and delivery destination, it is not possible to increase or decrease the number of bases on the delivery route in the delivery planning process.

For this reason, in step B, the reduction of CO2 emissions is only taken into consideration during the day, so when considering CO2 emissions in a predetermined period, the delivery plan can necessarily be the minimum CO2 emissions. Cannot be created.

Increasing the number of bases on the delivery route does not necessarily increase CO2 emissions. If the number of bases is increased between the two base routes in the delivery plan, it is considered that there is not much change in CO2 emissions.

On the other hand, in a route in which three bases are continuous, if a detour is made by an intermediate base, it is considered that CO2 emissions will increase. The inventors thought that if the number of bases that could be such a detour route could be reduced, CO2 emissions could be further reduced.

In this embodiment, it is possible to further reduce CO2 emissions by optimizing the total travel distance over a plurality of days. As described above, the shortest total travel distance is effective in reducing CO2 emissions.

The inventors first considered allocating the load having the minimum total travel distance from a plurality of candidate delivery dates to each load while considering the load leveling. In this method, the search space for considering multiple days at the same time becomes enormous, and the calculation time is not realistic, that is, the calculation time may be exponentially times longer than the number of days to be considered. The following methods have been proposed by the parties.

(Method 1)
Select delivery destinations that reduce the number of visits.
Among the outermost bases on the route map, the bases outside the straight line connecting the two bases are selected for the two adjacent bases on the outermost side.

(Method 2)
Select the delivery date (aggregation date) to be aggregated for the selected base.
Select a day (hereinafter referred to as "aggregation date") that includes more bases selected in (Method 1) as delivery bases. The aggregation date is the date on which the shipments to be delivered to the bases selected in (Method 1) on other delivery dates are also (aggregated) delivered. On other delivery dates, the total distance traveled can be reduced due to fewer locations.

(Method 3)
The cargo to the selected base is moved from each day to the consolidation date, and the inflow volume is calculated to estimate the offset volume.

(Method 4)
Move from the aggregation date Move the alternative load to the original moving date (reverse movement).
Select the load to be moved to the original day so that the load amount is commensurate with the load amount calculated in (Method 3). The amount equivalent to the amount collected on the aggregation date is offset by the amount delivered to other bases.

The outline of the above (method 1) will be described. FIG. 3 is a diagram for explaining a method of reducing delivery destinations. The reduction of delivery destinations described with reference to FIG. 3 shortens the travel distance by reducing the number of visits to a specific delivery destination in adjusting the delivery date after the convergence of step A described above. The delivery destination base is indicated by nodes such as d1, d2, d3, and d4.

In order to reduce the number of visits to the delivery destination base, each base on the outermost base on the delivery route map is targeted, and the two outermost adjacent bases are moved outward by a straight line connecting the two bases. Select a base to be located.

In FIG. 3, the outermost bases on the route map are d1, d2, d3, d4, d5, and the like. In these bases, the base immediately before delivery and the base immediately after delivery are connected by a straight line as adjacent bases, and if the target bases are connected to the outside by a straight line, the bases to be selected are selected.

In this example, when the base d3 is targeted, the adjacent bases are d2 and d4. When the base d2 and the base d4 are connected by a straight line, the base d3 is located outside on the route map. Therefore, the base d3 is selected to reduce the number of visits to the base.

The delivery date that includes many of the bases selected in this way as the delivery destination according to the above (method 2) is set as the aggregation date. Here, it is assumed that the aggregation date for which more bases are the delivery destinations is 10/3. Further, it is assumed that the cargo is delivered to any of the bases selected in (Method 2) on 10/5. In such an example, the reverse movement of the cargo from the aggregation date to the delivery date for the aggregation of the cargo to the same base in the above (method 3) and the offset of the cargo in the (method 4) will be described.

FIG. 4 is a diagram for explaining aggregation and reverse movement. FIG. 4A shows an outline of aggregation and reverse movement using a route map. At the same base d3, the cargo 9a is aggregated from the delivery date “10/5” to the aggregation date “10/3”.

Of the bases common to the delivery date "10/5" and the consolidation date "10/3", the load 9b equivalent to the amount of the consolidated load 9a is delivered at a base different from the base where the load is aggregated. By moving to "10/5", a part of the load on the aggregation date "10/3" will be moved backwards.

FIG. 4B shows an outline of aggregation and reverse movement in terms of the total amount of cargo delivered in one day. When the cargo 9a is aggregated from the total load on the delivery date "10/5" to the consolidation date "10/3", the total load on the consolidation date "10/3" increases. Of the various packages delivered on the aggregation date "10/3", the packages 9b having substantially the same volume are assigned to the delivery date "10/5" to offset the packages.

Using the result of the load leveling process in step A described above, the delivery of the load to the same base over multiple days was aggregated on a specific day, and a part of the load on the aggregation date was moved backward on the delivery date. After that, by performing the delivery planning process according to step B described above, the total travel distance required for delivery is further shortened, and the CO2 emission amount is reduced. The method of selecting a base for collecting cargo on the collection date to shorten the total travel distance will be described later.

FIG. 5 is a diagram showing an outline of the overall processing of this embodiment. In FIG. 5, the difference from FIG. 2 is that the aggregation process according to the present embodiment is performed after the load standardization process in step A. Based on the result of the aggregation process according to this embodiment, the delivery planning process of step B is performed.

In the aggregation process according to the present embodiment in FIG. 5, the bases to be aggregated (hereinafter referred to as aggregation bases) are selected (method 1), the aggregation date is selected (method 2), aggregation (method 3), and reverse movement (method 3). It briefly shows that method 4) is performed. Others are as described in FIG. 2, and the description thereof will be omitted.

The delivery plan creation process including the aggregation process according to the present embodiment is performed by, for example, the delivery plan creation device 100 having the hardware configuration as shown in FIG. FIG. 6 is a diagram showing a hardware configuration of the delivery plan creation device.

In FIG. 6, the delivery plan creation device 100 is an information processing device controlled by a computer, and displays a CPU (Central Processing Unit) 11, a main storage device 12, an auxiliary storage device 13, and an input device 14. It has a device 15, a communication I / F (interface) 17, and a drive device 18, and is connected to the bus B.

The CPU 11 corresponds to a processor that controls the delivery plan creating device 100 according to a program stored in the main storage device 12. A RAM (Random Access Memory), a ROM (Read Only Memory), or the like is used in the main storage device 12, and is obtained by a program executed by the CPU 11, data required for processing by the CPU 11, and processing by the CPU 11. Store or temporarily store the data, etc.

An HDD (Hard Disk Drive) or the like is used in the auxiliary storage device 13, and data such as a program for executing various processes is stored in the auxiliary storage device 13. Various processes are realized by loading a part of the program stored in the auxiliary storage device 13 into the main storage device 12 and executing the program in the CPU 11. The main storage device 12 and the auxiliary storage device 13 correspond to the storage unit 130.

The input device 14 has a mouse, a keyboard, and the like, and is used by the user to input various information necessary for processing by the delivery plan creation device 100. The display device 15 displays various information required under the control of the CPU 11. The input device 14 and the display device 15 may be a user interface using an integrated touch panel or the like. The communication I / F 17 communicates through a network such as a wired or wireless network. Communication by communication I / F17 is not limited to wireless or wired.
A program that realizes the processing performed by the delivery plan creation device 100 is provided to the delivery plan creation device 100 by a storage medium 19 such as a CD-ROM (Compact Disc Read-Only Memory), for example.

The drive device 18 interfaces the storage medium 19 (for example, a CD-ROM or the like) set in the drive device 18 with the delivery plan creation device 100.

Further, a program for realizing various processes according to the present embodiment described later is stored in the storage medium 19, and the program stored in the storage medium 19 is stored in the delivery plan creating device 100 via the drive device 18. Will be installed. The installed program can be executed by the delivery plan creation device 100.

The storage medium 19 for storing the program is not limited to the CD-ROM, and one or more non-transitory, tangible (tangible) having a structure as data that can be read by a computer. ) Any medium. The computer-readable storage medium may be a DVD (Digital Versatile Disk) disk, a portable recording medium such as a USB memory, or a semiconductor memory such as a flash memory, in addition to the CD-ROM.

A system may be configured in which the delivery plan creation device 100 is used as a server device and can be connected to a plurality of terminals via a network.

FIG. 7 is a diagram showing a functional configuration example of the delivery plan creating device. In FIG. 7, the delivery plan creation device 100 mainly has a delivery management unit 40. The delivery management unit 40 is realized by a process performed by executing a program corresponding to the CPU 11, and the delivery management process by the delivery management unit 40 corresponds to the main program.

The delivery management unit 40 controls a processing unit required to execute the delivery plan creation process. The storage unit 130 stores the order information DB 31, the base information DB 32, the distance information DB 33, the load leveling result DB 34, the aggregation base DB 35, the aggregation result DB 36, the delivery plan DB 37, and the like.

The processing units that operate under the control of the delivery management unit 40 are mainly the load leveling unit 41, the aggregation base selection unit 42, the aggregation date selection unit 43, and the delivery planning unit 46. Each processing unit is called in this order to perform each processing. The load leveling unit 41, the aggregation base selection unit 42, the aggregation date selection unit 43, and the delivery planning unit 46 are realized by processing performed by executing a program corresponding to the CPU 11.

The load leveling unit 41 performs a load leveling process for leveling the load within a predetermined period by changing the delivery date of the load with reference to the order information DB 31. The total amount of daily cargo is determined in a predetermined period. On a daily basis, the shipment to be delivered and the base to which the shipment is delivered are identified. The result of the load leveling process is stored in the load leveling result DB 34.

The aggregation base selection unit 42 uses the base information DB 32 to perform an aggregation base selection process for selecting a detour base among the outermost bases in the route map. The bases obtained by the aggregation base selection process are stored in the aggregation base DB35 as the aggregation base.

The aggregation date selection unit 43 selects an aggregation date that can aggregate the delivery of cargo to the aggregation base over a plurality of days within a predetermined period based on the load leveling result DB 34 and the aggregation base DB 35. I do. Further, the aggregation date selection unit 43 causes the aggregation execution unit 44 to perform the aggregation execution process of consolidating the load to the aggregation base on the selected aggregation date. The aggregation date selection unit 43 and the aggregation execution unit 44 correspond to the aggregation unit.

Upon receiving the notification of the aggregation date from the aggregation date selection unit 43, the aggregation execution unit 44 moves the cargo to the aggregation base on a day other than the aggregation date (original day) to the aggregation date, and sets the amount to be offset. Performs aggregate execution processing to be calculated. Further, the aggregation execution unit 44 causes the load adjustment unit 45 to perform a load adjustment process for moving the load corresponding to the load transferred on the consolidation date to the original day.

The load adjustment unit 45 receives a notification from the aggregation execution unit 44 of the amount of the load to be offset against the aggregation date, and from the packages delivered to the bases other than the aggregation base on the aggregation date, the load equivalent to the amount to be offset from the aggregation date. Performs a load adjustment process to move (reversely move) the load to the original day.

Based on the results of the aggregation execution unit 44 and the load adjustment unit 45, the aggregation date selection unit 43 stores the aggregation result in the aggregation result DB 36.

The delivery planning unit 46 refers to the base information DB 32, the distance information DB 33, and the aggregation result DB 36, and performs the delivery planning process for optimizing the delivery route on a daily basis. The delivery plan information obtained by the delivery plan processing is stored in the delivery plan DB 37.

The aggregation process of FIG. 5 is performed by the aggregation base selection unit 42, the aggregation date selection unit 43, the aggregation execution unit 44, and the load amount adjustment unit 45.

Next, examples of data configurations of various databases will be described with reference to FIGS. 8 to 14. FIG. 8 is a diagram showing a data configuration example of the order information DB. In FIG. 8, the order information DB 31 is a database for recording and managing delivery order information for each shipment, and includes items such as a scheduled delivery date, a delivery destination base ID, a quantity, an order date, a deliverable date, and a delivery date. Has.

The scheduled delivery date indicates the scheduled delivery date to the base for the delivery date specified when the shipment is ordered. The delivery destination base ID is identification information that identifies the base that is the delivery destination, and indicates the base ID registered in the base information DB 32.

The quantity indicates the weight of the ordered shipment, for example, the unit is expressed in grams. The order date indicates the date when the delivery request was received. The deliverable date indicates the date on which the product can be delivered to the base before the specified delivery date. The delivery date indicates the delivery date when the requester specified by the requester who requested the delivery of the package receives the package.

In this data example, there are three orders to the base d1 for the scheduled delivery date "10/3". Shipment amount "753", order date "10/1", shipping date "10 / 3,10 / 4", and delivery date "10/4", cargo amount "446", order date "10/1" , Shipment date "10 / 3,10 / 4", delivery date "10/4", quantity "120", order date "10/1", shipping date "10 / 3,10 /" It is a load of "4, 10/5" and a delivery date of "10/4".

Regarding the scheduled delivery date "10/3", there are at least three orders for base d2. Load "390", order date "10/1", shipping date "10 / 3,10 / 4", and delivery date "10/4", load amount "588", order date "10/1" , Shipment date "10 / 3,10 / 4", delivery date "10/4", quantity "419", order date "10/1", shipping date "10 / 3,10 /" It is a load of "4, 10/5" and a delivery date of "10/4". Order information is stored for other bases and other scheduled delivery dates.

FIG. 9 is a diagram showing an example of data configuration of the base information DB. In FIG. 9, the base information DB 32 is a table for storing and managing location information for each base as a delivery destination, and has items such as a base ID, latitude, and longitude.

The base ID is identification information that identifies the base. Latitude and longitude are information that identifies the location of the base. In this data example, it is shown that the position of the base specified by the base ID "d0" is the longitude "139.81" and the latitude "35.48". The same applies to each of the other bases.

FIG. 10 is a diagram showing a data configuration example of the distance information DB. In FIG. 10, the distance information DB 33 is a matrix showing base IDs in the vertical and horizontal directions and showing the distances between adjacent bases on the route map. The unit is km as an example.

In this data example, the distance between the base d0 and the base d1 is "7.88" km, and the distance between the base d0 and the base d10 is "4.03" km. The distance between the base d1 and the base d2 is "5.84" km, the distance between the base d1 and the base d3 is "5.36" km, and the distance between the base d1 and the base d3 is "8.64" km. Is. The distance between other bases is also shown.

FIG. 11 is a diagram showing a data configuration example of the load leveling result DB. In FIG. 11, the load leveling result DB 34 is a database that stores the result of leveling the load in a predetermined period, and has items such as a scheduled delivery date, a delivery destination base ID, a load, and a deliverable date.

The scheduled delivery date indicates the scheduled delivery date at the time of receiving an order managed in the order information DB 31, or the scheduled delivery date adjusted by the load leveling process. The delivery destination base ID indicates identification information that identifies a base for delivering the cargo, and indicates a delivery destination base ID obtained from the order information DB 31.

The load amount indicates the load amount obtained from the order information DB 31. The deliverable date indicates the deliverable date obtained from the order information DB 31.

In this data example, it is shown that the delivery base IDs "d1" and "d2" having the scheduled delivery date "10/3" have obtained almost the same results as the information obtained from the order information DB31. The explanation is omitted. Results after load leveling are also shown for other scheduled delivery dates.

FIG. 12 is a diagram showing an example of data configuration of the aggregation base DB. In FIG. 12, the aggregation base DB 35 stores the identification information of the bases selected by the aggregation base selection unit 42, and has items such as the aggregation base ID.

In this data example, it is shown that the bases with the base IDs "2", "4", "8", and "9" are selected as the aggregation bases. Based on such an aggregation base DB35, the collection and delivery of cargo to the bases with base IDs "2", "4", "8", and "9" over a plurality of days should be collectively performed on the aggregation day in a predetermined period. In addition, the load allocation is adjusted.

FIG. 13 is a diagram showing an example of data configuration of the aggregation result DB. In FIG. 13, the aggregation result DB 36 is a database showing the allocation of the load to the scheduled delivery date after the aggregation of the load, and has items such as the scheduled delivery date, the delivery destination base ID, the load amount, and the deliverable date.

The estimated delivery date indicates the estimated delivery date adjusted by the consolidation of cargo. The delivery destination base ID indicates identification information for identifying the base for delivering the load, and indicates the delivery destination base ID obtained from the load leveling result DB 34. The load amount indicates the deliverable date obtained from the load leveling result DB34.

In this data example, an example of the result of the aggregation process according to this embodiment is shown, and the shipment on the scheduled delivery date “10/3” includes the aggregated load 36p. The aggregated load 36p indicates information on the aggregated cargo from other scheduled delivery dates at least at the bases of the delivery destination base IDs “2” and “4”. The delivery destination base IDs "2" and "4" are base IDs included in the aggregation base DB35.

On the other hand, on the scheduled delivery date "10/5", among the scheduled deliveries, the reversely moved load 36r indicates information on the load moved by offsetting the load amount from the aggregation date (original day). The delivery destination base IDs of the reversely moved load 36r are "1", "3", "6", and "7", all of which are base IDs not included in the aggregation base DB35.

FIG. 14 is a diagram showing an example of data configuration of the delivery plan DB. In FIG. 14, the delivery plan DB 37 is a database that stores the delivery order for each day and each track created by the delivery planning unit 46, and stores items such as the delivery date, the track name, and the destination base ID (delivery order). Have.

As the delivery date, a date based on the scheduled delivery date of the aggregation result DB 36 is set. The truck name indicates information that identifies the truck that is assigned to deliver the same day shipment. The destination base ID (delivery order) indicates the base ID in the delivery order of each truck.

In this data example, trucks "A" and "B" are assigned to the delivery date "10/3", and for the truck "A", base d0-> base d2-> base d4-> base. A plan is created to deliver the cargo in the order of d5-> base d7-> base d0. For truck "B", a plan to deliver cargo in the order of base d0-> base d10-> base d9-> base d8-> base d7-> base d3-> base d1-> base d0 was created. There is. When the base ID "d0" corresponds to a distribution center or the like, it becomes a start base and an end base for daily delivery. For other delivery dates, the delivery order is also shown for each truck.

Next, an example of the aggregation process performed using the above-mentioned database will be described. First, the outermost base of the route map will be described with a simple example. FIG. 15 is a diagram for explaining the outermost base in the route map.

The base a, the base c, and the base e along the outer circumference 5 of the route diagram illustrated in FIG. 15 are the outermost bases. The outer circumference 5 does not include the base d0 such as the distribution center 1c which is the start point and the end point. Therefore, the base d0 is not included in the outermost base. Further, the base a, the base c, and the base b and the base d other than the base e along the outer circumference 5 are inner bases.

Next, a route map based on the base information DB 32 and the distance information DB 33 will be described. FIG. 16 is a diagram showing an example of a route diagram.

In the route diagram K1 illustrated in FIG. 16, 10 bases d1 to d10 are set as delivery destinations, the distribution center 1c starts, and the cargo is delivered around each base through the route on the route diagram K1. Return to again. Where the line connecting the bases is not shown, it means that the vehicle cannot pass due to obstacles such as mountains and lakes.

The bases d1 to d10 shown in the route map K1 are arranged based on the base information DB 32. Further, when the distance is set in the distance information DB 33, the connection between the bases is shown. If there is a connection, the distance between the bases can be obtained by referring to the distance information DB 33.

The outer circumference 5 can be specified from the route map K1 drawn by arranging the bases d1 to d10 based on the base information DB 32 and connecting the bases with a connection when the bases of the bases d1 to d10 can be a route based on the distance information DB 33. ..

Hereinafter, an example of aggregation processing will be described based on the route diagram K1 illustrated in FIG. First, selection of a delivery destination that reduces the number of visits by the above (method 1) will be described. This (method 1) is performed by the aggregation base selection unit 42. An example of the aggregation base selection process by the aggregation base selection unit 42 will be described with reference to FIGS. 17 to 19.

FIG. 17 is a diagram for explaining an example of aggregation base selection processing. In FIG. 17, the aggregation base selection unit 42 selects a base where the total travel distance required for truck delivery is shortened by excluding the bases d1 to d10 which can be delivery destinations.

There are multiple routes to reach the base, and the final total travel distance is not required unless the combination of delivery destinations is decided. Here, the bases that are likely to be detours when combined are determined in advance.

The aggregation base selection unit 42 selects bases in order along the outer circumference 5 of the route map K1, identifies two adjacent bases before and after the selected base, and connects the specified two bases with a straight line. The aggregation base selection unit 42 determines that it is an aggregation base when the connected straight line exists as a route.

In this route diagram K1, it is assumed that the base d0 representing the distribution center 1c is departed to the base d1, the base d10 returns to the distribution center 1c, and the bases are selected in order from the base d1 to the base d10. ..

First, it is determined that the first base d1 existing along the outer circumference 5 is not a centralized base because there are no two bases before and after. Next, the base d2 is selected. A base d1 and a base d4 exist as bases (hereinafter referred to as adjacent bases) adjacent to the base d2 along the outer circumference 5. When a route exists for a straight line passing through the base d1 and the base d4, the base d2 is determined to be an aggregate base. In this example, the base d2 is a centralized base.

In this way, the bases are sequentially selected along the outer circumference 5, and whether or not the bases are aggregated is determined by the presence or absence of a route directly connecting the two adjacent bases to the selected bases.

FIG. 18 is a diagram for explaining a case where the bases existing along the outer circumference are not aggregate bases. In FIG. 18, a case will be described in which it is determined whether or not the base d2, the base d4, and the base d3 are aggregated bases.

Adjacent bases of the selected base d3 along the outer circumference 5 are base d4 and base d5. There is no route for the straight line passing through the base d4 and the base d5. Therefore, it is determined that the base d3 is not a centralized base.

FIG. 19 is a diagram showing an example of the selected aggregation bases. FIG. 19 illustrates a state in which a base d4, a base d8, and a base d9 are selected in addition to the base d2 by the method of selecting the aggregation base 6 described above. Since there is an exception handling in the selection of the aggregation base 6, the base d5 is not selected as the aggregation base 6. Details will be described with reference to FIG.

From FIGS. 17 and 19, it can be seen that the aggregation base 6 in the route diagram K1 is the base d2, the base d4, the base d8, and the base d9. Such a result is stored in the aggregation base DB35 (FIG. 12). In the following description, only the data related to the aggregation process in this embodiment will be shown, and the others will be omitted.

Next, the selection of the delivery date (aggregation date) to be aggregated for the aggregation base 6 by the above (method 2) will be described. This (method 2) is performed by the aggregation date selection unit 43. The aggregation date selection process by the aggregation date selection unit 43 will be described.

FIG. 20 is a diagram for explaining an example of aggregation date selection processing. In FIG. 20, the aggregation date selection unit 43 uses the aggregation base DB 35 to select the scheduled delivery date including the most aggregation base 6 from the load leveling result DB 34.

In this example, the scheduled delivery date "10/3" includes all of the bases d2, d4, d8, and d9 that become the aggregation base 6 indicated by the aggregation base DB35 in the delivery destination base ID. Therefore, at least the scheduled delivery date "10/3" is selected as the aggregation date. By collecting and delivering the cargo of the aggregation base 6 on the selected aggregation date, it is possible to reduce the total travel distance in a predetermined period by preventing delivery to the aggregation base 6 on other days.

Next, according to the above (method 3), the load to the selected base is moved from each day to the aggregation date, and the amount of cargo flowing into the aggregation date for estimating the offset amount is calculated. This (method 3) is performed by the aggregation execution unit 44. The aggregation execution process by the aggregation execution unit 44 will be described.

FIG. 21 is a diagram for explaining the aggregation execution process. In FIG. 21, the aggregation execution unit 44 refers to the load leveling result DB 34 on a daily basis, and uses the aggregation base DB 35 to specify the scheduled delivery date including one or more aggregation bases 6.

The original daily cargo list 7a corresponds to all the records of the same scheduled delivery date including the delivery information of the cargo to one or more aggregation bases 6 among the daily records of the cargo leveling result DB 34. In this example, the record of the scheduled delivery date "10/5" is shown in the original daily cargo list 7a, and the delivery information of the cargoes of the base d2 and the base d4, which are the aggregation bases 6, is included.

From the original daily load list 7a, the aggregation execution unit 44 has a record 7a-1 of delivery information of the two packages of the base d2 and a record 7a-2 of the delivery information of the three packages of the base d4, which are the aggregation bases 6. And are added (moved) to the aggregated daily cargo list 8a to change the aggregated daily cargo list 8a. That is, the scheduled delivery dates "10/5" of the delivery information records 7a-1 and 7a-2 may be changed to "10/3".

The total cargo amount is calculated by counting the cargo amount indicated by the cargo delivery information added to the aggregated daily cargo list 8a. The total load "1982 kg" (= 240 + 483 + 500 + 424 + 335) is indicated by the moving load 7b.

The aggregated daily cargo list 8a corresponds to all the records of the same scheduled delivery date including the aggregated base 6 of the aggregated base DB35 as the delivery destination among the daily records of the cargo leveling result DB34. In this example, the aggregated daily cargo list 8a shows the delivery information of the scheduled delivery date "10/3". The delivery information on the scheduled delivery date "10/3" includes all of the four aggregation bases 6 designated by the aggregation base DB35.

Next, a method of offsetting the moving load 7b will be described. By the above (method 4), the load to be moved backward from the aggregation date to the original date is determined. This (method 4) is performed by the load adjusting unit 45. The load amount adjusting process by the load amount adjusting unit 45 will be described.

FIG. 22 is a diagram for explaining a load amount adjusting process. In FIG. 22, the load amount adjusting unit 45 reversely moves the record of the delivery information of the load with respect to the original day when the load is moved to the aggregation date by adjusting the amount of the load to be balanced with the amount moved to the aggregation date.

The load adjustment unit 45 processes the aggregated daily load list 8a one record at a time, and the load to the bases other than the aggregation base 6 is changed to the original date when the aggregation execution unit 44 changes the delivery date, and the change load 7b. Reverse the record of the delivery information of the shipment until it is balanced with.

In FIG. 22, in the original daily cargo list 7a related to the scheduled delivery date “10/5”, the records 7a-1 and 7a-2 of the cargo delivery information have changed the delivery date to the aggregation date “10/3”. not exist. Due to the load adjustment process, in this example, the records 8a-1, 8a-2, and 8a-3 of the delivery information of the load on the aggregation date "10/3" are moved back to the original daily load list 7a. The scheduled delivery date "10/3" of the delivery information records 8a-1 to 8a-3 may be changed to "10/5".

Three records 8a-1 are for delivery to base d1, two records 8a-2 are for delivery to base d2, and four records 8a-3 are for delivery to base d6 and base d7. It's a minute. These bases are not included in the centralized base DB35.

In addition, the total amount of cargo indicated by the reverse-moving delivery information is "1911 kg" (= 120 + 302 + 304 + 306 + 315 + 304 + 259). This total load is shown in the reverse transfer load 8b. By changing the scheduled delivery date from "10/3" to "10/5" with the reverse transfer load 8b corresponding to the changed load 7b, the total load indicated by the aggregate daily load list 8a is aggregated. Make the amount approximately the same as before the execution process. Similarly, the total load indicated by the original daily load list 7a is substantially the same as before the aggregation execution process.

The result obtained by the load adjustment process by the load adjustment unit 45 described above is notified to the caller's aggregation date selection unit 43 via the aggregation execution unit 44, and the aggregation date selection unit 43 notifies the result of load leveling. As a result of adjusting the load amount in the DB 34, the aggregation result DB 36 is output to the storage unit 130.

FIG. 23 is a diagram showing a data example of the aggregation result DB after adjusting the load amount. In FIG. 23, in the aggregation result DB36 after the aggregation and reverse movement of the load, at the aggregation date “10/3”, the load is 2 due to the movement of the record 7a-1 from the original day “10/5” with respect to the base d2. The number has increased, and for base d4, the load has increased by 3 due to the move from the original day "10/5" of record 7a-2.

On the other hand, due to the reverse movement from the aggregation date "10/3" to the original day "10/5", the record 8a-1 was added on the original day "10/5" and the load at the base d1 increased by one. Record 8a-2 is added and the load on the base d3 is increased by two, record 8a-3 is added and one load is added to the base d6, and three loads are added to the base d7.

The base d6 and the base d7 did not exist on the scheduled delivery date “10/5” in the load leveling DB 34, and may have been added due to the reverse movement, but in this embodiment, they are along the outer circumference 5. It is considered that the addition of bases other than bases does not affect the total travel distance, and the addition of inner bases is allowed during reverse movement.

FIG. 24 is a diagram showing changes in the total load amount between the aggregation date and the original date. FIG. 24A shows the total amount of cargo on the scheduled delivery dates “10/3” and “10/5”. The total load on the aggregation day "10/3" is "19345 kg", and the total load on the original day "10/5" is "18487 kg".

In FIG. 24B, the total load amount as a result of the aggregation execution unit 44 collecting the delivery information of the cargo to the aggregation base 6 from the original date “10/5” to the aggregation date “10/3”. Is shown. As shown in FIG. 24 (B), the total load on the aggregation day “10/3” is “21327 kg”, and the total load on the original day “10/5” is “16505 kg”.

In FIG. 24 (C), the total amount of the delivery information of the cargoes of the bases other than the consolidation base 6 is transferred from the aggregation date “10/3” to the original date “10/5” by the cargo adjustment unit 45. Shows the load. By moving in the reverse direction, the total load on the aggregation day "10/3" is "19416 kg", and the total load on the original day "10/5" is "18416 kg".

FIG. 24 (D) shows changes in the total amount of cargo in FIGS. 24 (A), 24 (B), and 24 (C) for each scheduled delivery date. On the consolidation date "10/3", the total load increased after the consolidation, and the total load decreased to almost the same amount as after the leveling due to the reverse movement. In addition, on the original day "10/5", the total cargo amount decreased after the consolidation, and the total cargo amount increased to almost the same amount as the leveled total cargo amount due to the reverse movement.

Such adjustments may reduce the total travel distance of the truck without compromising the results of the load leveling process.

Next, regarding the result of the delivery planning process by the delivery planning unit 46, the difference in CO2 emissions between the case where the present embodiment is not applied and the case where the present embodiment is used will be described with reference to FIGS. 25 and 26.

FIG. 25 is a diagram showing an example of the total load amount for each base depending on whether or not the present embodiment is applied. FIG. 25 (A) is a table showing the difference in delivery schedule between the case where this embodiment is not applied (FIG. 2) and the case where this embodiment is applied (FIG. 5).

With reference to FIG. 25 (A), on the scheduled delivery date “10/3”, there is a difference in the total amount of cargo delivered to the bases d1, d2, d3, d4, d6, and d7 depending on whether or not this embodiment is applied. Can be seen. However, there is no increase or decrease in the delivery destination bases on the scheduled delivery date "10/3".

On the scheduled delivery date "10/5", there is a difference in the total amount of cargo delivered to the bases d1, d2, d3, d4, d6, and d7 depending on whether or not this embodiment is applied. In particular, there is no load to be delivered at the bases d2 and d4. There are bases where the load exists without the application of this embodiment, and there are bases where the load does not exist with the application of this embodiment.

Regarding such a difference, from FIG. 25B, a case where the load is distributed to two trucks and the delivery order is determined so that the total travel distance on the day is shortened in the route diagram K1 will be described with reference to FIG. .. The problem of solving the shortest total distance traveled is generally treated as a CVRP (Capacitated Vehicle Routing Problem) problem.

FIG. 26 is a diagram showing an example of CO2 emissions based on a delivery plan depending on whether or not this embodiment is applied. FIG. 26A shows the delivery plans 93a and 93b of the delivery dates “10/3” and “10/5” according to the application of this embodiment, respectively. In FIG. 26 (A), delivery plans 93a and 93b have items such as delivery date, truck, and delivery order. The two trucks are represented by A and B, and the delivery order in which the total travel distance of the two trucks is the shortest is indicated by the base ID. It shall be started from the base d0 corresponding to the distribution center 1c and returned to the base d0.

The delivery order is different in the delivery plan 93b due to the change of the delivery destination base from the delivery plan 93a (consolidation and reverse movement of the packages to be delivered).

The total travel distance is calculated for each of the delivery plans 93a and 93b, and the result of calculating the CO2 emission amount is shown in FIG. 26 (B). With reference to FIG. 26B, in the calculation result 95a without application of this embodiment, the total travel distance of the trucks A and B on the delivery dates “10/3” and “10/5” is “172.56”. Yes, it shows that the CO2 emission is "0.141".

In the calculation result 95b with the application of this embodiment, the total travel distance of the trucks A and B on the delivery dates "10/3" and "10/5" is "169.03", and the CO2 emission amount is "0. It shows that it is 137 ”.

From these, it can be seen that when the present embodiment is applied, it has the effect of shortening the total travel distance and reducing CO2 emissions.

Next, various processes by the delivery management unit 40 will be described with a flowchart. FIG. 27 is a flowchart for explaining an outline of the delivery management process by the delivery management unit. In FIG. 27, the delivery management unit 40 updates the order information DB 31, the base information DB 32, and the distance information DB, and calls each processing unit in order according to the procedure (step S10).

The delivery management unit 40 first causes the load leveling unit 41 to perform a load leveling process for leveling the load (step S11). Then, the delivery management unit 40 causes the aggregation base selection unit 42 to perform the aggregation base selection process for selecting the aggregation base 6. (Step S12).

Next, the delivery management unit 40 causes the aggregation date selection unit 43 to select the aggregation date and perform the aggregation date selection process for aggregating the cargo (step S13). The aggregation date selection unit 43 selects the aggregation date, aggregates the load on the aggregation date selected by the aggregation execution unit 44, and further the load amount adjustment unit 45, and causes the load amount to be adjusted.

Then, the delivery management unit 40 causes the delivery planning unit 46 to perform a delivery planning process for creating a delivery plan (step S16). The delivery management unit 40 determines whether or not the specified number of times has been repeatedly executed (step S17). If the specified number of times has not been reached (No in step S17), the delivery management unit 40 returns to step S11 and repeats the above-described processing. On the other hand, when the specified number of times is reached (Yes in step S17), the delivery management unit 40 ends this delivery management process.

FIG. 28 is a flowchart for explaining an outline of the load leveling process by the load leveling unit. In FIG. 28, the load leveling unit 41 acquires the delivery destination base ID, the load amount, the deliverable date, and the delivery date of the load to be delivered from the order information DB 31 (step S1101).

The load leveling unit 41 calculates the deliverable date for each load from the acquired deliverable date and delivery date (step S1102). The load leveling unit 41 performs load leveling that adjusts the scheduled delivery date for each load so that the difference between the maximum amount and the minimum amount of the total daily load is small (step S1103).

Then, the load leveling unit 41 saves the result of the load leveling in the load leveling result DB 34 (step S1104), and ends the load leveling process.

FIG. 29 is a flowchart for explaining an outline of the aggregation base selection process by the aggregation base selection unit. In FIG. 29, the aggregation base selection unit 42 acquires the base ID of the delivery destination from the base information DB, and acquires the distance information between the bases from the distance information DB 33 (step S1201).

The aggregation base selection unit 42 determines whether or not the aggregation base 6 has been selected in the past and the base ID and the distance information are not updated (step S1202). When the aggregation base has been selected and the base ID and the distance information have not been updated (Yes in step S1202), the aggregation base selection unit 42 ends the aggregation base selection process. In the aggregation base selection process, it is necessary to update the aggregation base 6 when the base ID is newly increased or decreased. In such a case, the process of selecting the aggregation base 6 is performed again.

When the aggregation base is not selected and the base ID or distance information is updated (No in step S1202), the aggregation base selection unit 42 selects the base located in the west of the route map K1 as the starting point. The starting input route is set to the west from the starting point (step S1203). If the longitudes of multiple bases are the same, the northmost base may be the starting point. The orientation may be appropriately set by the user.

The aggregation base selection unit 42 selects the route at the closest angle clockwise from the input route among the routes exiting the selected base, and sets the base ahead of the route as the next selection point until the operation returns to the start point. It is repeated sequentially (step S1204). Select the leftmost route in sequence, go around and return to the starting point. The aggregation base selection unit 42 extracts a list of bases passed through in the process of step S1204 as a circulation list L of the outermost bases on the route map K1 (step S1205). The circulation list L is a list in which the base IDs that identify the sequentially selected bases are recorded.

Then, the aggregation base selection unit 42 sequentially extracts the bases M from the circulation list L of the bases extracted in the process of step S1205 (step S1206), and the extracted bases M and the adjacent bases M in the circulation list L are on the route map K1. The outermost two bases N and O are taken out (step S1207). Specifically, the aggregation base selection unit 42 reads out the base IDs in order according to the circulation list L, and further acquires two base IDs before and after the read base ID in the circulation list L. Here, it is only necessary to find a case where a route exists between adjacent bases.

The aggregation base selection unit 42 determines whether or not there is a route connecting the two bases N and O (step S1208). If the route does not exist (No in step S1208), the aggregation base selection unit 42 proceeds to step S1210. On the other hand, when the route exists (Yes in step S1208), the aggregation base selection unit 42 adds the base M as the aggregation base to the base list P (step S1209), and proceeds to step S1210.

The aggregation base selection unit 42 determines whether or not all the bases have been completed (step S1210). When there is an unprocessed base (No in step S1210), the aggregation base selection unit 42 returns to step S1206 and repeats the same processing as described above.

On the other hand, when all the bases are completed (Yes in step S1210), the aggregation base selection unit 42 saves the base list P in the aggregation base DB35 (step S1211), and ends the aggregation base selection process.

FIG. 30 is a diagram for explaining an example of the processing in steps S1203 and S1204 of FIG. 29. In FIG. 30, the aggregation base selection unit 42 refers to the base information DB 32, sets the base d9 located at the westmost point on the route map K1 as a start point (step S1203), and then performs the process in step S1204 of FIG. I do.

The aggregation base selection unit 42 uses the straight line to the west as the input route to the base d9 as the starting point (step S1211).

The aggregation base selection unit 42 calculates the angle of each route with respect to the input route, and selects the route having the closest clockwise angle from the input route (step S1212). The aggregation base selection unit 42 refers to the distance information DB 33 and confirms the existence of three routes d6, d7, and d8 in which routes exist from the base d9 at the starting point. The aggregation base selection unit 42 calculates the angle with respect to the input route of each of the three routes clockwise with reference to the base information DB 32, and selects the route having the smallest angle. The aggregation base selection unit 42 sets the base d8 ahead of the route selected in step 1212 as the next selection point (step S1213).

The aggregation base selection unit 42 selects the route having the smallest angle from the reference route as the next route by performing the same processing as in step S1212 with reference to the route selected in step S1212 (step S1214). The aggregation base selection unit 42 refers to the distance information DB 33 and confirms the existence of two routes, the bases d6 and d7, where the routes exist from the base d8 at the selected point. The aggregation base selection unit 42 calculates the angle with respect to the input route of each of the two routes clockwise with reference to the base information DB 32, and selects the route having the smallest angle. The aggregation base selection unit 42 sets the base d6 ahead of the route selected in step 1214 as the next selection point (step S1215).

By repeating the same process for the selected points selected in order, the process goes around to the starting point base d9 (step S1216). By going around to the base d9 of the starting point, the outer circumference 5 is obtained.

In the above process, the aggregation base selection unit 42 generates a circulation list L showing the bases d9, d8, d6, d5, d4, d4, d2, d1, d0, d10, and d7 that have passed through (step S1217). Next to base d7 is base 9. The circulation list L indicates the outermost base on the route map K1.

The method of calculating the angle of the path in steps S1212, S1214 and the like will be described. FIG. 31 is a diagram for explaining a method of calculating the angle of the path. In FIG. 31, a method of calculating the angle of the route from the base d3 to the base d4 will be described by taking the base d3 and the base d4 of the route diagram K1 as an example.

When the latitude is X, the latitude is Y, and the positions of the base d3 and the base d4 are represented by XY coordinates, the base d3 is (139.60, 35.56) and the base d4 is (139.64, 35. 59).

Find the difference between the X coordinates of the base d3 and the base d4. That is, the difference in the X coordinates is obtained by subtracting the X coordinate of the base d3 from the X coordinate of the base d4 to obtain 139.64-139.60 = 0.004 and obtain the coordinate difference x. The difference in the Y coordinate is 35.59-35.56 = 0.003 by subtracting the Y coordinate of the base d3 from the Y coordinate of the base d4, and the coordinate difference is y.

The angle t with respect to the X coordinate is obtained from the coordinate difference x and the coordinate difference y.

= arctangent (y / | x |)
= arctangent (0.03 / | 0.04 |)
= 36.9 °
Here, when x is negative, it is subtracted from 180 °.

FIG. 32 is a diagram for explaining an example of selecting an aggregation base. In FIG. 32, the aggregation base selection unit 42 searches the circulation list L from right to left for the base d0 as the starting base, and identifies the selection point and the two bases adjacent to the selection point in order from the base d0. ..

Case (I) is a case where the base d2 is a selection point, the bases d1 and the base d4 are adjacent bases, and the selection point (d2) is located outside. With reference to the distance information DB 33, since the distance "8.64" is set in the route corresponding to the straight line connecting the base d1 and the base d4, there is a route connecting the base d1 and the base d4. In this case, the base d2 is located outside the straight line connecting the base d1 and the base d4.

Case (II) is a case where the base d3 is a selection point, the base d4 and the base d5 are adjacent bases, and the selection point (d3) is located inside. With reference to the distance information DB 33, the distance is not set in the route corresponding to the straight line connecting the base d4 and the base d5. Therefore, the base d3 is not selected as the centralized base 6.

If a route exists between the base d5 and the base d4, the route will be the outermost base and the base d3 will not be an outer base along the outer circumference 5. In the case where the outer bases are inside the straight line connecting the adjacent bases as in case (II), there is no route between the adjacent bases.

Case (III) is a case where the base d5 is the selected base, the bases d3 and the base d6 are adjacent bases, and exception handling is applied to the selected point (d5). With reference to the distance information DB 33, the distance is not set in the route corresponding to the straight line connecting the base d3 and the base d6.

In this case, the base d5 is located on the outermost side of the straight line connecting the base d3 and the base d6, but if there is no route connecting the base d3 and the base d6, the passage of the base d5 cannot be skipped. When moving between the base d3 and the base d6, the base d5 must be passed through the base d5, so the base d5 is not included in the centralized base 6.

As described above, it can be seen that whether or not the bases located on the outer periphery are centralized bases can be determined by determining whether or not there is a route directly connecting the adjacent bases (step S1208 in FIG. 29).

FIG. 33 is a diagram for explaining the aggregation date selection process by the aggregation date selection unit. In FIG. 33, the aggregation date selection unit 43 shows a list A showing delivery information indicating a scheduled delivery date, a delivery destination base ID, a load amount, and a deliverable date for each load after the delivery leveling from the load leveling result DB 34. (Step S1301). Further, the aggregation date selection unit 43 acquires the location list P of the aggregation base ID from the aggregation base DB 35 (step S1302).

Then, the aggregation date selection unit 43 sequentially extracts the daily list B from the list A of the delivery information for each shipment after the delivery leveling (step S1303), and uses the extracted daily list B to set the delivery destination. The number of aggregation bases 6 among the bases is counted (step S1304).

The aggregation date selection unit 43 determines whether or not the number of aggregation bases 6 is equal to or greater than the threshold value C (step S1305). When the number of aggregation bases 6 is less than the threshold value C (No in step S1305), the aggregation date selection unit 43 returns to step S1303 and repeats the same processing as described above.

On the other hand, when the number of aggregation bases 6 is equal to or greater than the threshold value C (Yes in step S1305), the aggregation date selection unit 43 sets the date of the list B for each extracted day as the aggregation date and aggregates it in the aggregation execution unit 44. The execution process is performed (step S1306).

When the aggregation execution process is completed, the aggregation date selection unit 43 determines whether or not the aggregation is completed for all days (step S1307). If it is not completed (No in step S1307), the aggregation date selection unit 43 returns to step S1303 and repeats the same process as described above.

When finished (Yes in step S1307), the aggregation date selection unit 43 saves the aggregation result in the aggregation result DB 36 (step S1308), and ends the aggregation date selection process.

FIG. 34 is a flowchart for explaining the aggregation execution process by the aggregation execution unit. In FIG. 34, the aggregation execution unit 44 acquires as a list A showing delivery information indicating the scheduled delivery date, the delivery destination base ID, the quantity, and the deliverable date for each shipment after the delivery leveling (step S1401).

The aggregation execution unit 44 acquires the base list P of the aggregation base ID (step S1402), and also acquires the aggregation date D and the daily list B of the aggregation date D (step S1403).

The base list P of the aggregation base ID may be given from the aggregation date selection unit 43 or may be acquired from the aggregation base DB 35. The aggregation date D is given by the aggregation date selection unit 43. The daily list B may be given by the aggregation date selection unit 43, or by using the aggregation date D to acquire a record of the scheduled delivery date that matches the aggregation date D from the load leveling result DB 34. , The daily list B of the aggregation date D may be acquired.

The aggregation execution unit 44 sequentially extracts the daily list E for the scheduled delivery dates other than the aggregation date D from the list A of the delivery information for each shipment after the delivery leveling (step S1404). Then, the aggregation execution unit 44 refers to the extracted daily list E, and refers to the delivery destination base ID that can change all the delivery information to the aggregation date D among the delivery destination base IDs that match the aggregation base ID. , All the delivery information is extracted as list F (step S1405).

The aggregation execution unit 44 totals the shipments for each shipment shown in the list F to calculate the total shipment (step S1406), and the aggregation date D, the scheduled delivery date of the list E, and the total shipment of the extracted list F. The amount and the amount are set in the load amount adjustment information, the load amount adjustment unit 45 is notified, and the load amount adjustment process is performed (step S1407).

When the load adjustment process is completed, the aggregation execution unit 44 displays a list G indicating delivery information for each package for which the scheduled delivery date is changed from the aggregation date D to the original date of the daily list E from the aggregation execution unit 45. Acquire and calculate the total load (step S1408). List G is a list showing delivery information for each load after adjusting the load amount by the reverse movement of the load amount adjusting unit 45.

The aggregation execution unit 44 determines whether or not the absolute value of the difference between the total load of the list F calculated in step S1406 and the total load of the list G calculated in step S1408 is equal to or less than the threshold value H (step S1409). ). When the absolute value of the difference is larger than the threshold value H (No in step S1409), the aggregation execution unit 44 returns to step S1404 and repeats the same processing as described above.

On the other hand, when the absolute value of the difference is equal to or less than the threshold value H (Yes in step S1409), the aggregation execution unit 44 sets the lists A and B based on the lists F and G regarding the cargo to be changed from the scheduled delivery date to the aggregation date D. , And E are updated (step S1410), and it is determined whether or not all the scheduled delivery dates have been completed (step S1411). When there is an unprocessed scheduled delivery date (No in step S1411), the aggregation execution unit 44 returns to step S1404 and repeats the same processing as described above.

On the other hand, when all the scheduled delivery dates are completed (Yes in step S1411), the aggregation execution unit 44 ends this aggregation execution process.

A function as described with reference to FIG. 34 may be added to the aggregation execution process by the aggregation execution unit 44. The additional function is a function of adjusting the total load amount of the list F calculated in step S1406 and causing the load amount adjusting unit 45 to perform the load amount adjustment process.

FIG. 35 is a flowchart for explaining an additional function of the aggregate execution process. In FIG. 35, it is shown from step S1407 of FIG. 34, and steps S1401 to S1406 before that are omitted. The detailed description of the steps described in FIG. 34 will be omitted.

In step S1409 of FIG. 35, when the absolute value of the difference is larger than the threshold value H (No in step S1409), the aggregation execution unit 44 performs the processing S1420 of the additional function. In the processing S1420 of the additional function, a process for aggregating a part of the shipments of all the delivery destinations specified in the list F is performed instead of aggregating the packages. When the delivery of the load to two or more aggregation bases 6 is scheduled, the condition of the threshold value H in step S1409 may be satisfied by reducing the number of aggregation bases 6 to be aggregated.

In the process S1420 of the additional function, the aggregation execution unit 44 determines whether or not the list F includes two or more delivery destination base IDs (step S1421).

When the list F does not include two or more delivery destination base IDs (No in step S1421), the aggregation execution unit 44 returns to step S1404 in FIG. 34 and repeats the same processing as described above. In this case, since it is not possible to reduce the number of aggregation bases 6 to be aggregated on the aggregation date D, the aggregation of cargo to the aggregation base 6 on the scheduled delivery date related to List F is abandoned.

On the other hand, when the list F includes two or more delivery destination base IDs (Yes in step S1421), the aggregation execution unit 44 calculates the total load amount for each aggregation base 6 for the list F (step S1422). The aggregation execution unit 44 totals the load amount for each delivery destination base ID with respect to the list F indicating the delivery information of the cargo to one or more aggregation bases 6.

The aggregation execution unit 44 deletes the delivery information of the delivery destination having the smallest total load from the list F (step S1423), updates the load adjustment information with the total load of the list F (step S1424), and steps S1407. Return to and perform the same processing as described above. By deleting all delivery information from the list F for the base ID of the delivery destination having the smallest total cargo amount, the amount of cargo to be aggregated is adjusted by reducing the number of aggregation bases 6 to be aggregated on the aggregation date D.

There are several possible variations in the method of reducing the number of consolidation bases 6 to be consolidated on the consolidation date D. As an example, the delivery destination with the largest total load, the delivery destination selected at random, and the like may be reduced. Further, the reduction method of the aggregation base 6 to be aggregated on the aggregation date D is not limited to these.

FIG. 36 is a diagram for explaining a load amount adjusting process by the load amount adjusting unit. In FIG. 36, the load adjustment unit 45 acquires the aggregation date D and the daily list B of the aggregation date D (step S1501). The aggregation date D is acquired from the load amount adjustment information given by the aggregation execution unit 44. The daily list B of the aggregation date D may be given by the aggregation execution unit 44, or the aggregation date D is used to acquire the record of the scheduled delivery date that matches the aggregation date D from the load leveling result DB 34. By doing so, the daily list B of the aggregation date D may be acquired.

The load adjustment unit 45 sets the scheduled delivery date of the daily list E showing the delivery information of the scheduled delivery dates other than the aggregation date D to the original date I (step S1502). The scheduled delivery date of the daily list E is acquired from the load adjustment information given by the aggregation execution unit 44.

Further, the load amount adjusting unit 45 acquires the total load amount of the list F of the loads to be aggregated (step S1503). The total cargo amount in the list F indicates the total cargo amount for consolidating the cargo scheduled to be delivered to one or more aggregation bases 6 on the aggregation date D, and is acquired from the cargo amount adjustment information given by the aggregation execution unit 44.

Next, the load adjustment unit 45 lists the delivery information of the load of the list B on the aggregation date D, whose delivery destination is not the aggregation base 6 and which can be changed to the original date I of the reverse movement destination. Extracted as (step S1504). The load adjusting unit 45 sorts the list J in ascending order of the load, accumulates the load from the beginning, and ends immediately after the total load in the list F is exceeded (step S1505).

Then, the load adjusting unit 45 selects the one having the smaller absolute value of the difference from the total load in list F from the total load immediately before and immediately after exceeding the total load in list F, and combines the loads. Is extracted (step S1506). The load amount adjusting unit 45 returns the combination having the smallest absolute value of the difference from the total load amount of the list F as the list G to the aggregation execution unit 44 (step S1507), and ends this load amount adjustment process.

The aggregation result DB 36 is output to the storage unit 130 so that the total movement distance of the truck in the predetermined period can be shortened by performing the aggregation and the reverse movement of the cargo during the scheduled delivery destination date within the predetermined period. In this embodiment, the delivery planning unit 46 performs the delivery planning process based on the aggregation result DB 36.

FIG. 37 is a diagram for explaining the delivery planning process by the delivery planning unit. In FIG. 27, the delivery planning unit 46 acquires the delivery destination base ID from the base information DB 32 and acquires the distance information between the bases from the distance information DB (step S1601). In addition, the delivery planning unit 46 acquires the delivery destination base ID, the scheduled delivery date, and the amount of the cargo after aggregation from the aggregation result DB 36 (step S1602).

The delivery planning unit 46 sorts the delivery information of the cargo by truck on a daily basis, and optimizes the delivery plan to determine the delivery order and route so that the total travel distance delivered by all the trucks is shortened (step S1603).

After that, the delivery planning unit 46 saves the result of the delivery plan optimization in the delivery plan DB 37 (step S1604), and ends the delivery plan process.

As described above, in this embodiment, as shown in FIG. 5, after the load leveling process in step A, the aggregation process devised by the inventor or the like is performed, and then the result of the aggregation process (aggregation result). DB36) is used to perform the delivery planning process in step B.

With such a processing configuration, the total travel distance of the truck can be minimized as a whole in the target period (predetermined period) of the load leveling process, and the CO2 emission amount can be further reduced.

The present invention is not limited to the specifically disclosed examples, and major modifications and modifications can be made without departing from the scope of claims.

The following additional notes will be further disclosed with respect to the embodiments including the above embodiments.
(Appendix 1)
In the route map showing the route from the reference base that starts the delivery of cargo to the reference base via multiple bases of the delivery destination, the base that is a detour on the outermost route is selected, and the selected base is specified. Set the base ID to be used as the aggregate base ID and store it in the storage unit.
With reference to the daily delivery information in which the amount of cargo is leveled in a predetermined period stored in advance in the storage unit, the first scheduled delivery date of the delivery information of the cargo including the aggregation base ID stored in the storage unit is set. The number of aggregation base IDs is changed to the second scheduled delivery date of the first threshold value or more,
Of the base IDs common to the delivery information on the second scheduled delivery date and the delivery information on the first scheduled delivery date, the second delivery of the delivery information that specifies one or more base IDs different from the aggregated base ID. A delivery plan creation program that causes a computer to perform a process of changing the scheduled date to the first scheduled delivery date.
(Appendix 2)
On the computer
Among the outermost routes in the route map, a base located in a predetermined direction is selected as a starting point, and among the routes exiting from the starting point, the route having the smallest angle with respect to the directional direction is selected and selected. The next bases connected by the route are specified, and the bases that are the starting points and the base IDs of the bases specified in order from the starting point are recorded in the specified order to create a circulation list.
The first base ID is selected in order from the created circulation list, two second base IDs before and after the selected first base ID are acquired from the circulation list, and are specified by the acquired second base ID. The delivery plan creation program according to Appendix 1, which causes a computer to perform a process of determining that the selected first base ID is the aggregate base ID and storing it in the storage unit when there is a route connecting the two bases. ..
(Appendix 3)
On the computer
Among the daily delivery information stored in advance in the storage unit, the second scheduled delivery date in which the number of aggregated base IDs stored in the storage unit is equal to or greater than the first threshold value is selected.
Using the delivery information on the first scheduled delivery date other than the second scheduled delivery date, the first total cargo amount to be delivered to at least one or more centralized base IDs is calculated.
Of the delivery information on the first scheduled delivery date, the load amount for each load delivered to the base ID common to the delivery information on the second scheduled delivery date is the second total load corresponding to the first total load amount. Accumulate up to the amount
The delivery plan creation program according to Appendix 2, which performs a process of changing the second scheduled delivery date of the delivery information for each shipment that has reached the second total load amount to the first scheduled delivery date.
(Appendix 4)
On the computer
When the absolute value of the difference between the first total cargo amount and the second total cargo amount is larger than the second threshold value, the total cargo amount for each aggregation base ID using the delivery information on the first scheduled delivery date. Is calculated and
The delivery plan creation program according to Appendix 3, wherein the delivery information of the aggregation base ID, which has the smallest total cargo amount, is deleted from the delivery information on the first scheduled delivery date.
(Appendix 5)
On the computer
Creation of the delivery plan according to Appendix 3 or 4 in which the process of optimizing the delivery plan is performed by finding the route that minimizes the total travel distance required for delivery of the cargo based on the daily delivery information and the number of trucks. program.
(Appendix 6)
On the computer
By using the delivery information of a plurality of scheduled delivery dates including the first scheduled delivery date and the second scheduled delivery date and changing the scheduled delivery date of the delivery information in the predetermined period, the total shipment for each day is changed. The delivery plan creation program according to any one of Appendix 1 to 5, which causes a process of leveling the amount.
(Appendix 7)
In the route map showing the route from the reference base that starts the delivery of cargo to the reference base via multiple bases of the delivery destination, the base that is a detour on the outermost route is selected, and the selected base is specified. Set the base ID to be used as the aggregate base ID and store it in the storage unit.
The first scheduled delivery date of the delivery information of the cargo including the aggregation base ID stored in the storage unit is set by referring to the daily delivery information in which the cargo amount is leveled in the predetermined period stored in the storage unit in advance. The number of aggregation base IDs is changed to the second scheduled delivery date of the first threshold value or more,
Of the base IDs common to the delivery information on the second scheduled delivery date and the delivery information on the first scheduled delivery date, the second delivery of the delivery information that specifies one or more base IDs different from the aggregated base ID. A delivery plan creation process in which a computer performs a process of changing the scheduled date to the first scheduled delivery date.
(Appendix 8)
Select a detour on the outermost route in the route map showing the route from the reference base that starts the delivery of cargo to the reference base via multiple bases of the delivery destination, and identify the selected base. The centralized base selection department that sets the base ID to be used as the aggregated base ID and stores it in the storage unit,
The first scheduled delivery date of the delivery information of the cargo including the aggregation base ID stored in the storage unit is set by referring to the daily delivery information in which the cargo amount is leveled in the predetermined period stored in the storage unit in advance. The aggregation unit that changes the number of aggregation base IDs to the second scheduled delivery date of the first threshold value or more, and
Of the base IDs common to the delivery information on the second scheduled delivery date and the delivery information on the first scheduled delivery date, the second delivery of the delivery information that specifies one or more base IDs different from the aggregated base ID. A delivery plan creation device in which a computer performs a load adjustment unit that changes the scheduled date to the first scheduled delivery date.

11 CPU
12 Main storage device 13 Auxiliary storage device 14 Input device 15 Display device 17 Communication I / F
18 Drive device 19 Storage medium 31 Order information DB
32 Base information DB
33 Distance information DB
34 Load leveling result DB
35 Aggregation base DB
36 Aggregation result DB
37 Delivery plan DB
40 Delivery management department 41 Load leveling department 42 Aggregation base selection department 43 Aggregation date selection department 44 Aggregation execution department 45 Load adjustment department 46 Delivery planning department 100 Delivery plan creation device

Claims (6)

Select a detour on the outermost route in the route map showing the route from the reference base that starts the delivery of cargo to the reference base via multiple bases of the delivery destination, and identify the selected base. Set the base ID to be used as the aggregate base ID and store it in the storage unit.
The first scheduled delivery date of the delivery information of the cargo including the aggregation base ID stored in the storage unit is set by referring to the daily delivery information in which the cargo amount is leveled in the predetermined period stored in the storage unit in advance. The number of aggregation base IDs is changed to the second scheduled delivery date of the first threshold value or more,
Of the base IDs common to the delivery information on the second scheduled delivery date and the delivery information on the first scheduled delivery date, the second delivery of the delivery information that specifies one or more base IDs different from the aggregated base ID. A delivery plan creation program that causes a computer to perform a process of changing the scheduled date to the first scheduled delivery date. On the computer
Among the outermost routes in the route map, a base located in a predetermined direction is selected as a starting point, and among the routes exiting from the starting point, the route having the smallest angle with respect to the directional direction is selected and selected. The next bases connected by the route are specified, and the bases that are the starting points and the base IDs of the bases specified in order from the starting point are recorded in the specified order to create a circulation list.
The first base ID is selected in order from the created circulation list, two second base IDs before and after the selected first base ID are acquired from the circulation list, and are specified by the acquired second base ID. The delivery plan creation according to claim 1, wherein when there is a route connecting two bases, the selected first base ID is determined to be the aggregate base ID and the computer performs a process of storing the selected first base ID in the storage unit. program. On the computer
Among the daily delivery information stored in advance in the storage unit, the second scheduled delivery date in which the number of aggregated base IDs stored in the storage unit is equal to or greater than the first threshold value is selected.
Using the delivery information on the first scheduled delivery date other than the second scheduled delivery date, the first total cargo amount to be delivered to at least one or more centralized base IDs is calculated.
Of the delivery information on the second scheduled delivery date, the second total cargo amount, which is the total load amount of the cargo delivered to the bases other than the centralized base ID, is calculated so as to correspond to the first total cargo amount. ,
The delivery plan creation program according to claim 2, wherein a process of changing the second scheduled delivery date of the delivery information for each shipment that has reached the second total load amount to the first scheduled delivery date is performed. On the computer
When the absolute value of the difference between the first total cargo amount and the second total cargo amount is larger than the second threshold value, the total cargo amount for each aggregation base ID using the delivery information on the first scheduled delivery date. Is calculated and
A claim for excluding the delivery information of the aggregation base ID, which has the smallest total cargo amount, from the integration target of the first total cargo amount, and performing a process of updating the value of the first total cargo amount. The delivery plan creation program described in item 3. In the route map showing the route from the reference base that starts the delivery of cargo to the reference base via multiple bases of the delivery destination, the base that is a detour on the outermost route is selected, and the selected base is specified. Set the base ID to be used as the aggregate base ID and store it in the storage unit.
With reference to the daily delivery information in which the amount of cargo is leveled in a predetermined period stored in advance in the storage unit, the first scheduled delivery date of the delivery information of the cargo including the aggregation base ID stored in the storage unit is set. The number of aggregation base IDs is changed to the second scheduled delivery date of the first threshold value or more,
Of the base IDs common to the delivery information on the second scheduled delivery date and the delivery information on the first scheduled delivery date, the second delivery of the delivery information that specifies one or more base IDs different from the aggregated base ID. A delivery plan creation process in which a computer performs a process of changing the scheduled date to the first scheduled delivery date. Select a detour on the outermost route in the route map showing the route from the reference base that starts the delivery of cargo to the reference base via multiple bases of the delivery destination, and identify the selected base. The centralized base selection department that sets the base ID to be used as the aggregated base ID and stores it in the storage unit,
The first scheduled delivery date of the delivery information of the cargo including the aggregation base ID stored in the storage unit is set by referring to the daily delivery information in which the cargo amount is leveled in the predetermined period stored in the storage unit in advance. The aggregation unit that changes the number of aggregation base IDs to the second scheduled delivery date of the first threshold value or more, and
Of the base IDs common to the delivery information on the second scheduled delivery date and the delivery information on the first scheduled delivery date, the second delivery of the delivery information that specifies one or more base IDs different from the aggregated base ID. A delivery plan creation device in which a computer performs a load adjustment unit that changes the scheduled date to the first scheduled delivery date.

Images