WO2021106977A1

WO2021106977A1 - Transportation route determination method, computer program, and transportation route determination device

Info

Publication number: WO2021106977A1
Application number: PCT/JP2020/043936
Authority: WO
Inventors: 道酒井; 富生大堀
Original assignee: 公立大学法人滋賀県立大学; 株式会社ＡｉｒＢｕｓｉｎｅｓｓＣｌｕｂ
Priority date: 2019-11-28
Filing date: 2020-11-26
Publication date: 2021-06-03
Also published as: JPWO2021106977A1

Abstract

Provided are a transportation route determination method, a computer program, and a transportation route determination device with which the transportation route for a logistics member is optimized. A transportation route determination method for sequentially selecting transportation bases through which transportation equipment for transporting an article passes, and determining a transportation route from a collection location to a delivery location for the article, wherein the transportation route determination method includes: a simulation step for repeating, until transportation of the article to the delivery location is complete, a selection process for sequentially making a probabilistic selection of a transportation base or a delivery location for the transportation equipment to next pass through from a transportation base or a collection location; a step for calculating a prescribed evaluation quantity for the transportation route obtained in the simulation step; and a step for determining a transportation route, on the basis of the prescribed evaluation quantity, from among a plurality of transportation routes obtained by repeating the simulation step and the step for calculating a prescribed evaluation quantity within a prescribed range.

Description

Transport route determination method, computer program, and transport route determination device

The present invention provides a transport route determination method, a computer program, and a transport route that optimizes the transport route of a physical distribution member on which articles such as pallets, small containers, or cardboard boxes are loaded in order to improve the distribution efficiency of the articles. Regarding the decision device.

In order to improve the efficiency of the entire physical distribution, not only the goods but also the pallets, small containers (folding containers), cardboard boxes, and other physical distribution members on which the goods are loaded, and the optimum route of the transportation equipment on which the physical distribution members are loaded are optimized. It is necessary to change.

Patent Documents

1 and 2 propose to optimize the movement of goods in the backbone (trunk line) of physical distribution by sharing the loading platform of transportation equipment in pallet units.

It is necessary to deliver the goods transported by trunk line in each area. Methods for setting routes for delivery have been previously proposed. Patent Document 3 discloses a method for solving a delivery planning problem assuming that a loaded load is transported in one travel of one transport vehicle from a delivery base to a delivery destination. Patent Document 3 uses a plurality of delivery vehicles to deliver a cargo from a distribution base to a plurality of delivery destinations, and a delivery plan is made by a different algorithm so that the mileage to the route returning to the original base is the shortest. The creation is repeated, and the plan with the shortest total mileage is selected.

Patent Document 4 discloses a method using an insertion method in which a delivery destination is inserted into a tentatively determined delivery route and the step of selecting the route having the shortest mileage is repeated. Patent Document 4 provides a provisional solution in which a customer is inserted in the middle under the constraint condition that the upper limit of the traveling time and the maximum load capacity of the vehicle are not exceeded on a closed route that goes around a plurality of delivery destinations from the distribution base. Generate and reduce mileage or mileage.

Patent No. 6362229 Patent No. 6362240 Japanese Unexamined Patent Publication No. 2001-188984 Japanese Unexamined Patent Publication No. 2015-038429

The inventors examined the optimization disclosed in

Patent Documents

1 and 2 in detail and came up with a method for finding the optimum solution.

In any of the methods for setting the delivery route from the base to the delivery destination as disclosed in

Patent Documents

3 and 4, each transport vehicle loads and delivers the cargo to the delivery destination. The transportation vehicle does not assume that the parcel loaded at the delivery base will be transshipped to another vehicle on the way. Since the vehicle loads each package to the delivery destination, the load rate of the vehicle's package decreases each time the package is unloaded on the way, and it is difficult to derive the optimum delivery plan.

An object of the present invention is to provide a transportation route determination method, a computer program, and a transportation route determination device that optimize the transportation route of a physical distribution member.

The transportation route determination method of the embodiment of the present disclosure is a transportation route determination method for determining a transportation route from a collection point to a distribution point of the article by sequentially selecting a transportation base through which the transportation equipment for transporting the article passes. Therefore, a simulation in which the transportation equipment repeats a selection process of sequentially and probabilistically selecting a transportation base or a distribution point to be passed through from a transportation base or a collection point until the transportation of the goods to the delivery point is completed. Among a plurality of transport routes obtained by repeating the process, the step of calculating a predetermined evaluation amount for the transport route obtained in the simulation step, and the simulation step and the calculation step of the predetermined evaluation amount within a predetermined range. Therefore, the step of determining the transportation route based on the predetermined evaluation amount is included.

The transportation route determination method according to the embodiment of the present disclosure includes a plurality of collection and delivery points for collecting and delivering articles, and a plurality of member accommodating portions for transporting the articles and accommodating distribution members for accommodating the articles. It is a transportation route determination method for determining a route of a transportation device between points including a plurality of transportation bases through which a transportation device having a provided loading platform passes, and is a method of determining the type of goods to be loaded on the distribution member and the number of distribution members. And the process of acquiring the information on the collection and delivery point where the goods are collected and delivered, the collection and delivery point or the transportation base which is the final destination of the goods, and the desired arrival time information on the destination. The number of transportation equipment required for each region, and the transportation route within the region, are calculated by simulation based on a mathematical model that includes a probabilistic selection process using random numbers when selecting one from multiple options for transit points. The process of deriving, the process of memorizing the number of transportation devices for each derived area, and the process of memorizing the transportation route within the area, the transportation route stored in the storage unit based on the acquired information, and the new calculation. The process of selecting any partial route of the derived transportation route and determining the transportation route for each of the transportation devices is included.

The computer program of the embodiment of the present disclosure causes a computer to execute a process of sequentially selecting a transportation base through which a transportation device for transporting an article passes and determining a transportation route from a collection point to the distribution point of the article. In a computer program, the computer is subjected to a selection process of sequentially and probabilistically selecting a transportation base or a distribution point through which the transportation equipment passes from a transportation base or a collection point to the delivery point of the article. A simulation step that repeats until the transportation is completed, a step of calculating a predetermined evaluation amount for the transportation route obtained in the simulation step, and a step of calculating the simulation step and the predetermined evaluation amount are repeated within a predetermined range. The step of determining the transportation route based on the predetermined evaluation amount is executed from the plurality of transportation routes.

The transport route determining device according to the embodiment of the present disclosure is a transport route determining device that determines a transport route from a collection point to a distribution point of the article by sequentially selecting a transport base through which the transport device for transporting the article passes. Therefore, a simulation in which the transportation equipment repeats a selection process of sequentially and probabilistically selecting a transportation base or a distribution point to be passed through from a transportation base or a collection point until the transportation of the goods to the delivery point is completed. It is obtained by repeating the execution unit that executes the process, the calculation unit that calculates a predetermined evaluation amount for the transportation route obtained in the simulation process, and the simulation process and the calculation process of the predetermined evaluation amount within a predetermined range. A determination unit for determining a transportation route based on the predetermined evaluation amount from a plurality of transportation routes is provided.

In the transportation route determination method of the present disclosure, the required number of transportation devices can be obtained as the optimum number of agents by setting the transportation equipment as an agent based on agent-based modeling and simulating the agents with conditions. It is possible. In this respect, agent-based modeling is useful in solving logistics problems.

In the transportation route determination method of the present disclosure, the number of transportation equipment required for each region and the transportation route are optimized by executing a simulation by an agent-based model according to the situation in each step step by step by a mathematical model. To. If it can be assumed that one distribution member (for example, a pallet) is transported by sharing the transportation equipment, that is, by connecting, an optimum solution can be obtained.

It is also possible to combine the optimal solution as a partial route for each region and determine the entire route.

In the agent-based modeling of the transportation route determination method of the present disclosure, the steps of sequentially and probabilistically selecting the waypoints from the collection point to the transportation destination of the goods are repeated until a plurality of goods have been transported to the transportation destination. To. The calculated transportation route is evaluated with a predetermined evaluation amount.

The predetermined evaluation amount includes the time required to complete transportation, the number of steps required, the total distance traveled by the transportation equipment, the required number of movements, the estimated emission amount of carbon dioxide due to the movement of the transportation equipment, and the cost required for transportation. It may be a value calculated from any one or a plurality of combinations, or a plurality of combinations.

Within the predetermined range, the number of obtained transportation routes is within the upper limit of the number of predetermined transportation routes, or the calculation time of the simulation process and the process of calculating the evaluation amount is the predetermined calculation time. It may be within the upper limit.

The simulation step may be executed on the condition that the transportation equipment moves to a predetermined collection point when all the articles to be loaded are delivered.

The simulation step may be executed with the probability of selecting a transportation base or a distribution point in the selection process being a pre-weighted probability.

The simulation is performed under the conditions that the article is a plurality of types of articles, the transport device is permitted to load the plurality of types of articles, and the plurality of types of articles are permitted to be loaded or unloaded at a transportation base. The process may be performed.

In the agent-based modeling of the transportation route determination method of the present disclosure, in the process of repeating the selection process in the simulation step, a numerical value related to the evaluation amount is calculated, and the numerical value sets a preset termination condition of the calculation process. If so, the simulation process may be terminated.

In the process of repeating the selection process, the progress rate until the completion of transportation is calculated, and the state is the same as the progress rate in the transportation route determined to be optimal based on the predetermined evaluation amount among the already obtained transportation routes. The censoring condition may be that the predetermined index exceeds the reference value for comparison.

The predetermined index includes the time required for transportation to the progress rate, the number of steps required, the distance traveled by the transportation equipment to the progress rate, the number of movements of the transportation equipment to the progress rate, and the estimation of carbon dioxide to the progress rate. It may be the amount of emissions or the cost of transportation.

By interrupting when it is judged that there is no prospect, the possibility of reaching the optimum route calculation at an earlier time increases.

In the transportation route determination method of the present disclosure, the conditions of the transportation equipment are set as the preconditions of the simulation process, the conditions of the transportation equipment are changed, the simulation process is executed, and the conditions of the transportation equipment are different. The optimum transportation route and the conditions of the transportation equipment may be determined based on the predetermined evaluation amount for the transportation route obtained by the execution simulation step.

The condition of the transport equipment is the number of the transport equipment, and the predetermined evaluation amount does not decrease even if the condition is changed by increasing the number of the transport equipment by 1 and the number of the transport equipment is increased. The minimum value of transport equipment may be determined as the number of transport equipment.

In the transportation route determination method of the present disclosure, the plurality of articles are selected differently from the next selection point in the stored transportation route in the step of probabilistically selecting from the stage of the waypoint. A new transportation route of the transportation equipment may be calculated repeatedly until the transportation to the transportation destination is completed.

When learning to calculate the minimum or shortest route from the route with the minimum number of movements or the shortest movement distance already memorized, a local solution may occur, so mutation is caused by a different selection. , The optimum solution may be derived.

The transport route determination method of the embodiment of the present disclosure uses the number of transport devices and a part or all of the transport routes stored in the storage unit previously derived by the calculation, and may be used for the calculation. Good.

The transportation route determination method according to the embodiment of the present disclosure is stored in the storage unit when the number of transportation devices and a part or all of the transportation routes are stored in the storage unit in advance by the calculation. Only the part corresponding to the type of goods, the number of pallets, the collection / delivery point, and the difference from the destination, which are the conditions for deriving the transportation route, is the new derivation target, and the result of the new derivation and the storage unit are described. It may be integrated with the derivation result stored in.

In the transportation route determination method of the present disclosure, the transportation route determination may be used without executing the determination of the transportation route from the initial state by using the number of transportation routes and the transportation route stored in the calculation up to that point. The calculation may be started from the waypoint of the transportation route obtained by the calculation in the past. The learning effect can be obtained by selecting a transportation route with a smaller number of movements and a shorter movement distance.

According to the present disclosure, when the number of distribution materials transported from each collection and delivery site, the type of goods loaded, the target collection and delivery place as the arrival point of the goods, and the required arrival time information are specified, each The optimum transportation route for distribution materials is derived.

It is a schematic diagram of the distribution system of this disclosure. It is a schematic diagram which shows an example of the transportation equipment. It is a schematic diagram which shows an example of the transportation equipment. It is a block diagram which shows the structure of the transportation route determination apparatus. It is a figure which shows the content example of the information stored in the distribution DB. It is a flowchart which shows an example of the transportation route determination processing procedure executed by the transportation route determination apparatus. It is a flowchart which shows an example of the transportation route determination processing procedure executed by the transportation route determination apparatus. It is a flowchart which shows an example of the arithmetic processing of a transportation route. It is explanatory drawing of the rough route in the process of S401. It is a flowchart which shows an example of the processing procedure of a route calculation. It is a flowchart which shows an example of the processing procedure of a route calculation. It is a schematic diagram of the solution search process by agent-based modeling. It is a flowchart which shows another example of the processing procedure of a route calculation. It is a flowchart which shows another example of the processing procedure of a route calculation. It is explanatory drawing of the derivation process of the optimum solution in Example 1. FIG. It is explanatory drawing of the derivation process of the solution in Example 2. It is explanatory drawing of the derivation process of the solution in Example 3. FIG. It is explanatory drawing of the derivation process of the solution in Example 4. FIG. It is a graph which shows the result of a simulation. It is a graph which shows the result of a simulation. It is a graph which shows the result of a simulation. It is a graph which shows the result of a simulation. It is a bar graph showing the result of the simulation. It is explanatory drawing of the derivation process of the solution in Example 5. It is explanatory drawing of the derivation process of the solution in Example 6. It is explanatory drawing of the derivation process of the solution in Example 7. It is a schematic diagram of the transportation route obtained by agent-based modeling. It is a schematic diagram of the transportation route obtained by agent-based modeling. It is a schematic diagram of the transportation route obtained by agent-based modeling. It is a schematic diagram of the transportation route obtained by agent-based modeling. It is a schematic diagram of the transportation route obtained by agent-based modeling. It is a schematic diagram of the transportation route obtained by agent-based modeling. It is a flowchart which shows an example of the processing procedure of the route calculation in the modification. It is a flowchart which shows an example of the processing procedure of the route calculation in the modification. An example of the contents of a transportation network with a distance is shown. It is a schematic diagram of the presence / absence judgment of the prospect based on the progress rate. It is explanatory drawing of the derivation process of the solution in Example 8. It is explanatory drawing of the derivation process of the solution in Example 9. It is a graph which shows the effect of shortening the calculation time by the judgment of a prospect.

The present disclosure will be specifically described with reference to the drawings showing the embodiments thereof. In the following embodiment, a physical distribution system to which the transportation route determination method of the present disclosure is applied will be described.

FIG. 1 is a schematic diagram of the distribution system 100 of the present disclosure. The distribution system 100 includes a transportation device 1 for transporting goods, for example, agricultural products, a base center (base) 2 which is a transfer center where the transportation device 1 stops, a collection / delivery center 3 which is a distribution center for collecting and delivering goods, and a control center 400. And include. The distribution system 100 is operated based on the route information determined by the transportation route determination device 4. The transportation route determination device 4 can be connected to the transportation device 1, the device in the base center 2, and the device in the collection / delivery center 3 by communication. Further, the transportation route determination device 4 can be connected to the terminal device 5 used by the operator of the producer or the manufacturer, the base center 2 and the collection / delivery center 3.

Transport equipment 1 is a vehicle such as a transport truck, a train, a transport aircraft, or a ship. The transport device 1 may be a transport robot that travels by automatic operation.

The base center 2 is a transit center provided on a so-called trunk line in logistics, and is installed at a place that serves as a base for transportation equipment 1, such as an interchange (IC) in a port, an airport, a freight station, or a road network. The base center 2 is provided, for example, at predetermined distances. The base center 2 is provided with a group of devices that accept the receipt of the transportation device 1 at the base center 2 and carry out / carry in the pallet P from the transportation device 1, and a base controller 20 that controls the device group. The base controller 20 can be connected to the transportation route determination device 4 by communication, and controls the device group based on the instruction from the transportation route determination device 4.

In the distribution system centered on the base center 2, the transportation target is loaded on the distribution material and transported. Specifically, the physical distribution members are the pallet P and the small container C. In the following description, the description will be focused on the pallet P, but the small container C may be treated in the same manner. Further, the distribution member may be a flexible container, a so-called flexible container, an iron container, or a cardboard box. In addition, bags, plates, and box materials used for placing and accommodating goods in physical distribution are included in physical distribution members.

The pallet center 22 should be installed side by side in the base center 2. Pallets P are collected and delivered at the pallet center 22. The pallet center 22 is provided with a pallet controller 23 that controls a device for loading and unloading the pallet P. The pallet controller 23 can be connected to the transportation route determination device 4 by communication, and controls the device group based on the instruction from the transportation route determination device 4.

The collection and delivery center 3 collects the goods to be transported from the producer or manufacturer's base and transports them to the base center 2, or conversely, receives and stores the cargo from the base center 2 and stores the end user. It is a base for transporting goods to. The collection and delivery center 3 corresponds to a wholesale or distribution center. A plurality of collection and delivery centers 3 may be provided for the base center 2. The collection and delivery center 3 may be managed by a consignee who is a retailer. When the collection / delivery center 3 collects the goods to be transported to the base center 2, the goods may be loaded on the pallet P at the collection / delivery center 3. The collection and delivery center 3 is equipped with a collection and delivery site device 30 that receives instructions from the transportation route determination device 4. The collection / delivery site device 30 accepts the input of the shipping goods and the pallet P from the operator at the collection / delivery center 3, and receives the input of the arriving goods. The collection / delivery device 30 corresponds to the correspondence between the pallet identification information of the pallet P on which the goods to be shipped are loaded and the identification information of the goods, and the pallet identification information of the arrived goods and the pallets P on which the goods are loaded. The correspondence is memorized and transmitted to the transportation route determination device 4.

As will be described later, in the distribution system 100 of the present disclosure, transportation is not completed from the departure point where the same transportation device 1 collects the goods to the arrival point where the goods are delivered, but the goods are a plurality of goods. It may be transported so as to transfer to the transportation device 1. That is, the transportation device 1 is allowed to load and unload goods at the transit point. Under such conditions, in the distribution system 100 of the present disclosure, it is determined by simulating how the transportation device 1 and the pallet P on which the articles are loaded are optimally moved. The transportation route is transportation on a trunk line such as an expressway, an air route, or a railroad connecting a plurality of base centers 2, and until or after the arrival of the pallet P at the base center 2 in the area including the collection point or the distribution point. The transportation in the area is determined by classifying it hierarchically. Transportation on the trunk line is optimized by allowing loading and unloading at the base center 2 existing on the trunk line as disclosed in

Patent Documents

1 and 2. For transportation in the area, the base center 2 existing in the area under the condition that the pallet P, which has a collection point and a distribution point in the area, is also transported without going through the main line, and loading and unloading is permitted at the waypoint of the pallet P. And the collection / delivery center 3 is used as a collection point or a distribution point (collection / delivery point), and the routes of the transportation equipment 1 and the pallet P are determined respectively.

There is one or more base centers 2 in the area, and there are a plurality of collection and delivery centers 3 (see FIG. 8). The area is not limited to the administrative division, but is defined to be divided into arbitrary units, and is stored in the latitude / longitude information, the identification data of the base center 2 and the collection / delivery center 3, and the identification data of the area to which the area belongs. Regions may overlap. The collection and delivery center 3 may belong to different areas. The base center 2 and the collection / delivery center 3 are both collection points and distribution points for transportation within the area (corresponding to "collection / delivery points"). When the pallet P included in the target area and whose delivery point is a certain collection / delivery center 3 is transported from another area via the trunk line and unloaded at the base center 2, the base center 2 transports the pallet P within the target area. It is a collection point for the device 1. For the pallet P that is collected at a certain collection / delivery center 3 in the target area and transported to another area via the main line, the base center 2 is treated as a distribution point in the target area. Each of the plurality of collection and delivery centers 3 in the area is both a collection point and a distribution point. Any collection and delivery center 3 may function only as a collection point, and similarly any other collection and delivery center 3 may function only as a collection point.

The transportation route determination device 4 sequentially acquires the position of the transportation device 1, and sequentially collects the information of the pallet P housed in the transportation device 1 and the information of the pallet P waiting to be shipped at the collection / delivery center 3. The transportation route determination device 4 includes the position sequentially acquired from the transportation device 1, the position information including the existence position of each pallet P, the destination information of the collection / delivery center 3 to which each pallet P should be delivered, and the time to be delivered. From the information, the movement route of the pallet P and the transportation route of the transportation device 1 are sequentially determined.

The transportation route determination device 4 instructs the transportation equipment 1 to stop at the base center 2 based on the determined transportation routes of the transportation equipment 1 and the movement route of the pallet P. The transportation route determination device 4 instructs the base center 2 the pallet P to be carried out from the arriving transportation equipment 1 and the pallet P to be carried into the transportation equipment 1. Based on the determined transportation route and movement route, the transportation route determining device 4 instructs each center of the pallet P to be shipped from the collection / delivery center 3 and the pallet center 22, and sends the pallet P to be carried out to the transportation equipment 1. Instruct.

In the present disclosure, a process in which the transport route determining device 4 sequentially optimizes the movement route of the pallet P and the transport route of the transport device 1 from the information of the goods to be transported, the position information of the transport device 1, and the like will be described. ..

Palette P will be explained. The pallet P is a physical distribution member having a size of 90 cm square like a pallet widely used in a physical distribution field, and is more preferably made of resin. The pallet P may be made of various other materials such as wood, stainless steel, and corrugated cardboard, and may be provided with a lift hole suitable for transportation by a forklift. As the pallet P, it is preferable to use a pallet made of a material that conforms to import / export regulations. A tag storing pallet identification information is attached to the pallet P. The tag is preferably a wireless tag using RFID or the like.

In the tag, the palette identification information of the palette P given in advance is readable and stored by the wireless reader. Although the pallet identification information of the pallet P in the tag is not rewritable, the tag can be written with information of one or more articles loaded on the pallet P by the writer. The goods information includes the type and item of the goods, the weight, the date of collection, the delivery number of the goods, the base identification information of the base center 2 that has recently passed through, the base center 2 of the destination, the consignee information, the sender information, etc. Is. It may be a predetermined medium on which a one-dimensional code or a two-dimensional code corresponding to the palette identification information of the palette P given in advance instead of the tag is printed. A one-dimensional code or a two-dimensional code may be printed on the tag. The information of the article is stored in association with the pallet identification information on the transportation route determining device 4 side.

The transportation device 1 is a transport truck in the present embodiment. 2A and 2B are schematic views showing an example of the transportation device 1. FIG. 2A shows an example of a loading platform having a side-opening door, and FIG. 2B shows an example of a loading platform having a rear door. In both cases of the examples shown in FIGS. 2A and 2B, the transportation device 1 is provided with a pallet frame 11 inside the loading platform in order to transport articles in units of pallets P. Specifically, the pallet frame 11 is a stand that divides the loading platform from the floor surface to the ceiling in half in two upper and lower stages. The loading platform has an internal dimension that allows two pallets P to be juxtaposed in the vehicle width direction. The accommodation position of the pallet P can be specified by the top and bottom and the left and right divided by the pallet frame 11.

As shown in FIG. 2B, the pallet frame 11 may have a configuration in which the entire pallet frame 11 can be pulled out from the rear door of the loading platform. In this case, if the pallet frame 11 is considered as a huge pallet, the pallet frame 11 is also managed in a nested state in which a plurality of pallets P are loaded on the pallets as distribution members and a plurality of small containers C are loaded on each of the pallets P. It is also possible to do. The pallet frame 11 may be in the shape of a plate laid on the floor surface of the loading platform, instead of being divided into two stages as shown in FIGS. 2A and 2B.

When the transportation device 1 is a vehicle such as a train, a transport aircraft, or a ship, a large container having the same structure as the loading platform portion of FIG. 2A or FIG. 2B may be used, and the large container may be configured to include the pallet frame 11.

The transportation device 1 includes a reader that reads pallet identification information from the tags of the on-board unit 10 and the pallet P. The on-board unit 10 has a GPS receiver, sequentially acquires the position information of the transportation device 1, and transmits the position information to the transportation route determination device 4. When the pallet P is carried into the loading platform of the transportation device 1, the on-board unit 10 reads the pallet identification information from the tag of the pallet P with a reader. The pallet identification information of the pallet P being accommodated and the accommodation unit identification information for identifying the accommodation position in the pallet frame 11 are transmitted to the transportation route determination device 4 in association with the identification information of the transportation device 1 stored in advance. .. The on-board unit 10 reads the pallet identification information from the tag of the pallet P carried out from the loading platform of the transportation device 1 with a reader, and the pallet identification information of the pallet P carried out is stored in advance as the identification information of the transportation device 1. It is associated and transmitted to the transportation route determination device 4. The on-board unit 10 may notify the transport route determination device 4 that the pallet P to be carried out is to be carried out by associating it with the accommodating portion identification information of the accommodating portion in which the pallet P is accommodated.

FIG. 3 is a block diagram showing the configuration of the transportation route determination device 4. The transportation route determination device 4 is a server computer, and includes a processing unit 40, a storage unit 41, and a communication unit 42. The transport route determination device 4 may be configured not only by using one server computer (hardware) but also by distributing processing among a plurality of server computers, or a plurality of server computers virtually generated by a large computer. It may be one of (instances). The transportation route determination device 4 may execute the calculation by the quantum computer except for the processing of updating the information of the distribution DB 410 of the storage unit 41.

The processing unit 40 is a processor using a CPU (Central Processing Unit) or a GPU (Graphics Processing Unit). The processing unit 40 executes processing using the built-in memory such as ROM (Read Only Memory) and RAM (Random Access Memory). The processing unit 40 can sequentially acquire time information by the built-in timer.

The storage unit 41 includes a hard disk or a non-volatile storage medium such as an SSD (Solid State Drive). The storage unit 41 stores the computer program 40P. The storage unit 41 stores the model 4M. The processing unit 40 executes a process of deriving the optimum path by an operation described later using the model 4M based on the computer program 40P stored in the storage unit 41.

A Web server program is stored in the storage unit 41, and the processing unit 40 exerts a Web server function, and the terminal device 5 may accept a request for sharing the loading platform of the transportation device 1 or the like by the Web server function. ..

A distribution DB (DataBase) 410 is constructed in the storage unit 41 or an external storage device. The processing unit 40 can read and write to the physical distribution DB 410 by the database operation module. For example, user information 411, first pallet information 412, second pallet information 413, and transportation equipment information 414 are stored in the distribution DB 410, as will be described later.

The communication unit 42 realizes communication on the public communication network N1 or the carrier network N2. The processing unit 40 can transmit and receive information to and from the terminal device 5 via the public communication network N1 or the carrier network N2 by the communication unit 42. Further, the processing unit 40 can transmit / receive information to / from the in-vehicle device mounted on the transportation device 1 via the carrier network N2 by the communication unit 42. The processing unit 40 can be communicated with the base controller 20 of the base center 2 and the collection / delivery site device 30 of the collection / delivery center 3 via the public communication network N1, the carrier network N2, or a dedicated line by the communication unit 42.

FIG. 4 is a diagram showing an example of the contents of the information stored in the distribution DB 410. As shown in FIG. 4, in the distribution DB 410, as the first pallet information 412, the identification information given to each base center 2, the pallet center 22, the collection / delivery center 3, and the production base is associated with each place. The pallet identification information of the pallet P that should exist is sequentially stored.

In the physical distribution DB 410, as the second pallet information 413, device identification information for identifying the transportation device 1 on which the pallet P is loaded and information on the articles loaded on the pallet P are stored in association with the pallet identification information. Has been done. The information on the goods may be the container identification information of the small container C or other distribution member loaded on the pallet P. The information on the goods may include information on the transportation number, information for identifying the shipper and the consignee, and information on the weight of the pallet P including the goods.

The distribution DB 410 includes the transportation device information 414, which is associated with the device identification information that identifies the transportation device 1, and includes the position information (latitude and longitude) of the transportation device 1, the departure point, the destination, and the waypoint with time. Information and pallet identification information of the loaded pallet P are stored.

The transportation route determination device 4 configured in this way is the distribution DB 410 based on the information obtained from the in-vehicle device 10 by moving the transportation device 1, the shipping of the goods, and the location information of the goods obtained from the base center 2 and the collection / delivery center 3. Is updated sequentially. The transportation route determination device 4 determines the movement routes of the transportation equipment 1 and the pallet P of the transportation equipment 1 together with the update of the distribution DB 410, and based on this, transports, carries in, and transports the transportation equipment 1, the base center 2, and the collection and delivery center 3. Control carry-out.

In the following description, the pallet P is loaded with one or a plurality of articles of the same type that should arrive at the same time zone at the collection and delivery center 3 with the same final destination. It is assumed that there is. In the following description, the pallet may be another physical distribution member for accommodating the article, the article itself, or a group of articles in which a plurality of articles are put together.

5 and 6 are flowcharts showing an example of a transportation route determination processing procedure executed by the transportation route determination device 4.

The transportation route determination device 4 sorts pallet information including the destination of the pallet P to be shipped, the desired arrival time, etc. for each area to which the collection / delivery center 3 to which the pallet P is collected / delivered belongs (S101).

The processing unit 40 selects one area (S102). In the process of S102, the base center 2 may be selected.

The processing unit 40 is based on the pallet information for each pallet P sorted in the processing of S101, the number of a plurality of pallets P shipped from the base center 2 selected in the processing of S102, and the collection / delivery center which is the destination of each pallet P. 3 or the base center 2, the desired arrival time of each pallet is acquired in association with the pallet identification information of each pallet P (S103). The processing of S103 corresponds to the "acquisition unit".

The processing unit 40 executes an operation for deriving the transportation route of the transportation device 1 using the information of the pallet P acquired in the processing of S103 (S104). Details of the derivation of the transport route of the transport device 1 in the processing of S104 will be described later. The process of S104 corresponds to the "deriving unit".

The processing unit 40 transports the required number of transport devices to the selected base center 2 based on the required number of transport devices 1 and the number of accommodating sections, which are the calculation results of S104. The type, number, and number of pallet accommodating portions of the power pallets P are acquired and stored (S105). The process of S105 corresponds to the "storage unit".

The processing unit 40 identifies the transportation equipment 1 existing in or scheduled to arrive at the selected base center 2 from the acquired type and number of pallets P and the required number of pallet accommodating units (S106).

The processing unit 40 tentatively assigns the pallet identification information to the pallet accommodating unit of the loading platform of the transportation device 1 specified in the processing of S106, and stores the allocation (S107).

The processing unit 40 determines whether or not the processing of S103-S107 has been executed for all areas (S108).

When it is determined in the processing of S108 that the processing is not executed for all areas (S108: NO), the processing unit 40 returns the processing to S102.

When it is determined that the processing has been executed for all areas in the processing of S108 (S108: YES), the processing unit 40 selects the optimum transportation route for each area for each transportation device 1 and determines the entire transportation route. (S109). The processing unit 40 stores the determined transportation route in the storage unit 41 (S110). In the process of S109, the processing unit 40 may read the previously derived route from the storage unit 41. The process of S109 corresponds to the "decision unit".

The processing unit 40 determines the movement route of the pallet P for each pallet P, that is, the pallet accommodating unit of the transportation device 1 to be transferred to the destination (S111).

The processing unit 40 is based on the movement route of each pallet P, for each transportation device 1, the pallet identification information of the pallet P to be carried out at the base center 2 which is a transit point, and the storage unit in which the pallet P is housed. The storage unit identification information is listed (S112).

Based on the movement route of each pallet P, the processing unit 40 has pallet identification information of the pallet P to be carried in at the base center 2 which is a transit point for each transportation device 1, and a pallet accommodating unit in which the pallet P is to be accommodated. The accommodation unit identification information of the above is listed (S113).

The processing unit 40 outputs a list of the determined transportation route of the transportation equipment 1, the movement route of the pallet P, and the pallet P to be carried in / out at each base center 2 (S114). The processing unit 40 transmits an instruction to the on-board unit 10, the base controller 20, the collection / delivery site device 30, and the pallet controller 23 based on the output content (S115), and ends the processing.

FIG. 7 is a flowchart showing an example of the calculation process of the transportation route. The processing procedure shown in the flowchart of FIG. 7 corresponds to the details of the processing of S104 among the processing procedures shown in the flowcharts of FIGS. 5 and 6.

The processing unit 40 tentatively determines a rough route from the selected base center 2 to the final destination of the pallet P to be shipped as the movement route of the pallet P (S401). In the processing of S401, the processing unit 40 may determine based on the final destination, the collection / delivery center 3 or the base center 2, and the desired arrival time of the pallet P.

The rough route in the processing of S401 is the base center 2 corresponding to the boundary of each region and the final collection / delivery center 3 based on the route from the base center 2 of the starting point of each pallet P to the final destination. Including. FIG. 8 is an explanatory diagram of a rough route in the process of S401. FIG. 8 shows transit points for each of a plurality of regions straddling from the base center 2 at the departure point to the collection / delivery center 3 at the final destination. In the example of FIG. 8, the base center 2 is connected in a net shape. One pallet P departs from the base center 2 in Nagano prefecture and ends at the collection and delivery center 3 in Shiga prefecture. In this case, the processing unit 40 has a partial route that passes through the main line from the base center 2 in Nagano prefecture to the base center 2 in Gifu prefecture, and a partial route that passes through the main line from the base center 2 in Gifu prefecture to the base center 2 in Aichi prefecture. , A partial route through the main line from the base center 2 in Aichi prefecture to the base center 2 in Shiga prefecture, a partial route in the area from the base center 2 in Shiga prefecture to the final destination in Shiga prefecture, the collection and delivery center 3, and the thick line. Temporarily select and determine the rough route shown in.

The processing unit 40 executes S401 from the base center 2 in the selected area as the starting point for all the pallets P whose allocation to the transportation equipment is undecided. As a result, the entrance (departure point) and exit (destination) in the area (predetermined range) corresponding to each base center 2 for each pallet P are determined. The predetermined range may be set on the condition that, for example, the distance corresponds to the limitation of the continuous operation time of the driver of the transportation device 1 when traveling on the main line connecting the base center 2.

The processing unit 40 is included in the roughly determined route for each pallet P, and sets a waypoint (entrance) within the area of the selected base center 2 and a destination (exit) within the area. (S402). In the processing of S402, the estimated time of arrival at the destination in the area may be set as a condition. In the processing of S402, the size of the area becomes enormous as the amount of calculation increases in terms of the size of the system, so it is preferable to design it appropriately.

By the processing of S401 and S402, the number of pallets P existing at the entrance (departure point in the area) in the same time zone in the area corresponding to each base center 2 including the selected base center 2, within the area. The number of pallets P to be transported to each destination (micro destination) is determined. For example, if the selected base center 2 is the base center 2 in Shiga prefecture, 100 pallets P are gathered in H city, which is the entrance, and these 100 pallets P are distributed to a plurality of accumulation centers 3 in the area. , 50 pieces, 30 pieces, 10 pieces should be transported.

The processing unit 40 is the number of pallets P scheduled to depart from the selected base center 2 (departure point in the area), and the destination in the area of each pallet P (purpose in the area). On the condition of the arrival time to the ground), the transportation equipment 1 for transporting these is set to one or a plurality of agents, the number of vacant accommodations of the agents is set, and the route calculation based on the agent-based modeling is executed (S403). ). The route calculation of S403 may be to derive a transportation route for each region in advance and select an optimum route that meets the conditions from the transportation routes stored in the storage unit 41. The route calculation may be performed by using the transportation route derived for similar conditions as a partial route or from the beginning by a simulation step described later.

Based on the optimum solution derived in the processing of S403, the processing unit 40 accommodates the required number of transport devices 1, the number of accommodating units required for each transport device (the number of pallets P to be accommodated), and the number of accommodating units. The type of the power pallet P and the partial transportation route of each transportation device in the area centered on the selected base center 2 are output (S404), and the processing is returned to S105 in the flowchart of FIG.

The processing unit 40 that executes the route calculation of S403 shifts from a state in which one or a plurality of agents exist in a certain base center 2 or an accumulation center 3 to a state in which the next base center 2 or the accumulation center 3 is selected and moved. And execute a simulation that transitions step by step. 9 and 10 are flowcharts showing an example of the route calculation processing procedure.

The processing unit 40 defines a transportation network in the area where the adjacent base center 2 or the accumulation center 3 in the area including the selected base center 2 is a node and the route between the nodes is an edge (S301). In the process of S301, the processing unit 40 may read out the network defined in advance. In the processing of S301, the processing unit 40 does not have to have a distance element at the edge between each node.

The processing unit 40 sets the number of transportation devices 1 to the initial value (S302). The processing unit 40 treats the set number of transportation devices 1 as agents and executes the following processing.

The processing unit 40 sets the existing position of the agent, the arrangement of the palette P on the node, and the number of steps in the initial state (S303). In the process of S303, the processing unit 40 associates the agent with the node of the departure point. In the processing of S303, the processing unit 40 sets the number of pallets P existing at the departure point (base center 2) and the number of pallets P required for the node 1 corresponding to the collection / delivery center 3. In the processing of S303, the processing unit 40 may set a supply point (one of the collection and delivery points) of the pallet P.

In the case where the processing unit 40 repeatedly executes the following processing and the pallet P existing at the starting point becomes the minimum number of steps and the minimum number of steps until the distribution to the destination in the area is completed. Find the route.

The processing unit 40 acquires the number of pallets P (loaded pallets P) associated with the agent (S304). The processing unit 40 acquires the number of palettes P existing in the node where the agent is located (S305). The processing unit 40 determines and stores the number of pallets P to be stacked at the node where the agent is located (S306).

In the processing of S306, if the node in which the agent exists is the departure point, the processing unit 40 loads the pallet P existing in the departure place so as to fill the vacant storage part of the transportation device 1 which is the agent. To decide. If the node in which the agent exists is a waypoint or a destination, the processing unit 40 compares the number of pallets P accommodated in the accommodating unit with the number of pallets P required for the node, and is required for the node. The number of pallets P to be loaded and unloaded is determined so as to reduce the remaining number of pallets P.

The processing unit 40 probabilistically selects the edge to the adjacent node to proceed (S307).

In the processing of S307, the processing unit 40 basically stochastically selects by a random number (solution A). As will be described later, it may be selected with a probability based on the weight for the node to proceed to the next, or when the number of pallets (loading number) associated with the agent becomes zero, the starting point (or supply point). ) May be conditionally selected (Solution B). The processing unit 40 may learn the weighting coefficient for selecting a node by reinforcement learning that gives a reward such as loading efficiency each time one step is advanced (solution C). In this case, the processing unit 40 is more likely to reach the optimum solution sooner. The processing unit 40 may change the parameter (for example, probability) by one significantly like any other mutation (solution D). This reduces the likelihood of falling into a local solution.

The processing unit 40 calculates the number of palettes P existing in the destination node moved via the selected edge (S308). In the processing of S308, the processing unit 40 calculates the total of the number of pallets P existing in the node before the movement of the agent and the number associated with the agent.

The processing unit 40 adds and stores the number of steps in which the agent state changes (S309), stores the identification data of the node to which the agent moves, and stores the number of palettes P in each node (S310). In the processing of S310, the processing unit 40 may store the identification data and the number of pallets of each node in association with the number of steps.

The processing unit 40 determines whether or not the delivery within the transportation network is completed based on the number of pallets P in each node (S311).

If it is determined that the delivery has not been completed (S311: NO), the processing unit 40 returns the processing to S304.

When it is determined that the delivery is completed (S311: YES), the processing unit 40 stores the history (transport route) and the number of steps of the node identification data that the agent has passed through (S312).

The simulation process corresponds to the period from the initial state set in the process of S303 to the time when the process of S311 determines YES and the transportation is completed.

The processing unit 40 determines whether or not the processing of S304-S312 has been executed a predetermined number of times or more (S313). The determination process of S313 corresponds to whether or not the simulation process is repeated within a predetermined range. In the determination process of S313, it may be determined whether or not the process of S304-S312 has reached the upper limit of the predetermined calculation time. When it is determined that the number of times is less than the predetermined number (S313: NO), the processing unit 40 returns the processing to S303. The processing of S313 may be whether or not it is determined that the optimum solution has been obtained, not a predetermined number of times.

When it is determined that the execution has been performed a predetermined number of times or more (S313: YES), the processing unit 40 determines whether or not all the changes in the number of the transportation devices 1 have been completed for the transportation network defined in S301 (S314). ). When it is determined that the change in the number of the transport devices 1 is not completed (S314: NO), the processing unit 40 changes the number of agents (transport devices 1) (S315) and returns the process to S303. In S315, the processing unit 40 increases the number of agents by one. In S315, the processing unit 40 may increase or decrease the number of agents and change the initial position of the agents.

When it is determined that the change in the number of the transportation devices 1 has been completed for the transportation network defined in S301 (S314: YES), the processing unit 40 has the transportation route with the minimum number of steps in the predetermined number of times. Is extracted (S316). The processing unit 40 stores the extracted transportation route as an optimum solution (S317), and ends the route calculation process. The processing of S316 and S317 corresponds to the step of determining the transportation route based on a predetermined evaluation amount (here, the required number of steps). In the processing of S316, the processing unit 40 may determine the number of agents (transport equipment 1) when the minimum number of steps of the transportation route is calculated as well as the minimum number of transportation routes as the optimum number. Good.

By the processing shown in the flowcharts of FIGS. 9 and 10, all patterns of the transportation route are stored in the defined network. It is also possible to calculate the average value of the number of steps of all transportation routes for the same network. In addition, by storing all transportation routes, it is not necessary to calculate from scratch for the same transportation network.

In this way, the processing unit 40 derives the optimum solution in the network defined for each region centering on the base center 2 by agent-based modeling. In the flowcharts of FIGS. 9 and 10, the processing unit 40 does not execute the processing of S303-S313 after returning to the initial state in S303 each time, but the periphery of the transportation route having the minimum number of steps obtained in the past calculation. You may search with. In this case, the processing unit 40 sets the position of the agent and the arrangement of the pallets in the middle of the transportation routes with the minimum number of steps, executes the processing of S304-S312, and attempts to calculate the transportation route with the minimum number of steps. (Learning). At this time, the processing unit 40 executes the processing of S304-S312 from a state in the middle of another transportation route instead of the transportation route having the minimum number of steps like mutation, and confirms whether or not the local solution has been reached. Treatment should be added (mutation).

When the transportation network defined in the processing of S301 of the processing procedure shown in the flowcharts of FIGS. 9 and 10 is common to the transportation network of the transportation route derived by the past processing, the processing unit 40 has the derived transportation. A route may be used. In this case, instead of repeating all the processes of S302-S312, the process of S304-S312 may be executed by reading out the transportation route of the minimum step already derived and changing a part of the transport route. Further, the processing unit 40 may derive only the portion corresponding to the difference from the previously derived transportation route by applying it to S303-S312.

Further, the processing unit 40 may execute the processing procedures shown in the flowcharts of FIGS. 9 and 10 in advance under various conditions, store them, and use them. Specifically, in S403 in the flowchart of FIG. 7, the processing unit 40 determines the number of pallets P scheduled to depart from the selected base center 2 (departure point in the area) determined by the processing of S401 and S402. It is preferable to select the optimum route already sought for the conditions that match the conditions of the destination (must arrive at the destination in the area) in the area of each pallet P. This greatly reduces the calculation time. Further, only the difference may be derived by executing the processing of the flowcharts of FIGS. 9 and 10 as described above. Whether or not the conditions match each other may be determined by treating each condition as a vector and extracting the shortest path of the condition closer to the statistical distance or the Euclidean distance.

FIG. 11 is a schematic diagram of the solution search process by agent-based modeling. Basically, when the processing unit 40 performs a random search in the selection process of S307 described above, the solution A is obtained with an equal probability in space. When the condition is set, it is obtained as the solution B in the reduced space. By learning, the optimal solution can converge to the global minimum value, solution C. By changing the parameters corresponding to the mutation, it is possible to correct from the local solution D to the space containing the global solution.

In the processing procedure shown in the flowcharts of FIGS. 9 and 10, in S316, the processing unit 40 selected the transportation route having the minimum number of steps as the optimum transportation route under the condition (number of agents). However, the optimum transportation route is not limited to the minimum number of steps, but is used to estimate the time required to complete transportation, the total travel distance (variation example described later), the total number of travels, the estimated amount of carbon dioxide emissions, or the cost of transportation. It may be selected based on. Alternatively, it may be evaluated whether or not it is optimal based on one or a plurality of calculated values derived based on those values.

12 and 13 are flowcharts showing another example of the route calculation processing procedure. The processing unit 40 of the transportation route determination device 4 specifies the transportation network to be calculated for the route (S501). In S501, the transportation network is defined as a network in which a transportation base and a collection / delivery point (base center 2, accumulation center 3, etc.) are nodes, and a route between the nodes is an edge.

The processing unit 40 sets information on goods and transportation equipment (S502). In S502, the processing unit 40 sets information on the article name, quantity, weight of the article to be transported, the occupied volume / volume in the packed state at the time of transportation, the divisible unit, the shipper, or the packing style as the information of the article. To do. The information of the goods is the information for identifying the pick-up point (name, identification information, etc.) at which the goods are shipped, the information for identifying the delivery point of the transportation destination, the departure time of the pick-up point, and the delivery point of the goods. Set the designated arrival time (or the allowable arrival time zone).

In S502, the processing unit 40 sets the type and number of equipment such as trucks and cargo ships, and the existing location in the initial state of the simulation to be executed below, as information on the transportation equipment for transporting the goods. The processing unit 40 sets information such as the volume of the accommodating unit, the loadable weight, and the identification information of the accommodating position of each of the transportation devices. Even if the information on the transportation equipment is set under the conditions of the route that can be passed, the maximum speed when operating a specific route, the cruising distance that can be traveled without refueling, and the distance that corresponds to the limit of the driver's continuous operation time. Good.

The information of the goods to be set may be the information that can be obtained from the transportation plan of the goods to be actually transported. The information on the transportation equipment set in the same manner may be information that can be obtained from the current information on the actual transportation equipment.

The processing unit 40 sets the initial conditions on the transportation network specified in the processing of S501, the delivery completion condition, and the termination condition of the calculation processing (S503). The initial conditions include the positions of the article and the transportation equipment 1 in the initial state of the simulation process. The delivery completion condition includes information that the goods should be present at which point (delivery point) by when. The discontinuation condition of the calculation process is a judgment condition for interrupting the calculation because the optimum transportation route solution cannot be obtained even if the calculation is continued in the middle of the route calculation.

The processing unit 40 selects the next node to which the transportation device 1 moves, and calculates the state in the next step (S504). In the processing of S504, if there is an article to be transported at the node where a specific transportation device 1 is located and there is a vacancy in the storage portion of the transportation device 1, the article is loaded, and then on the transportation network. Includes the process of probabilistically selecting the edge to the node of the next movement point. Details of the selection process will be shown in Examples described later. When the distance information is added to the edge, the distance added to the edge may be added each time the edge is advanced in one step. In S504, when the transportation device 1 moves to the next node, the node is the delivery point of the article from the article information, and if there is an undelivered article at the delivery point, the processing unit 40 The state in the next step is calculated assuming that the load has been unloaded. Even if the next node is not the distribution point, the processing unit 40 calculates the state as if the parcel was unloaded when the transshipment is specified by the condition that the transshipment of the parcel is permitted.

The processing unit 40 determines whether or not the state after one step in the processing of S504 satisfies the delivery completion condition or the discontinuation condition (S505). When the processing unit 40 determines that either the delivery condition or the discontinuation condition is satisfied (S505: YES), the delivery is completed, or there is no possibility of finding the optimum route (discontinuation). The repetition of the calculation of S504 under the set initial conditions is completed.

If it is determined in S505 that neither the delivery condition nor the censoring condition is satisfied (S505: NO), the calculation process of S504 is performed until it is determined that the delivery is completed or there is no possibility of finding the optimum route. repeat.

After the repetition of the calculation of S504 is completed, if it is determined that the delivery is completed (S506: YES), the predetermined evaluation amount is calculated from the movement information of all the goods and the transportation equipment 1 (S507). The evaluation amount in S507 includes the number of steps required to complete delivery (corresponding to time), the total distance traveled by the transportation equipment 1, the total number of movements, the estimated carbon dioxide emissions of the transportation equipment 1, and the cost (cost, etc.) required for transportation. May be used as an index. A value calculated from a plurality of combinations of these indexes may be used as the evaluation amount. A plurality of evaluation quantities may be calculated, and which evaluation quantity may be selected and used may be determined.

After the repetition of the calculation process of S504 is completed, if it is not determined that the delivery is completed (S506: NO), that is, if it is determined that the censoring condition is satisfied, the processing unit 40 omits the processing of S507. Then, the process proceeds to the next S508.

By the above processing from S502 to S507, one transportation route and evaluation amount are calculated for the target transportation network. The processing unit 40 determines whether or not the resources required for the route calculation up to that point are within a predetermined range (S508). When it is determined that the value is within the predetermined range (S508: YES), the processing unit 40 returns the processing to S503 and repeats the same route calculation (S503-S507) to further calculate a new transportation route. Within the predetermined range, for example, the number of obtained transportation routes (number of calculations) is within the upper limit of the planned number of transportation routes, or the calculation time of the simulation process and the evaluation amount calculation process is predetermined. It must be within the upper limit of the calculation time.

When it is determined that the value is not within the predetermined range (S508: NO), the processing unit 40 compares the evaluation amounts calculated for each of the obtained transportation routes, and compares the evaluation amount calculated for each of the obtained transportation routes, and the transportation route of the transportation device 1 having the optimum evaluation amount Is selected (S509).

The processing unit 40 determines the movement route of the article (pallet P) in the selected transportation route (which transportation equipment 1 was loaded on) and the transportation route of each transportation equipment 1 (S510).

By the above processing, the optimum transportation route under the conditions of a specific transportation device 1 is determined. However, if the conditions of the transportation equipment 1 are small, particularly if the number of the transportation equipment 1 is small, the delivery of all the goods may not be completed within the set delivery time zone. Alternatively, even if the delivery is completed, there is a possibility that the evaluation amount is not within the desired range. Therefore, it is desirable to change the conditions of the transportation device 1 and repeat the above flow. Therefore, the processing unit 40 determines whether or not the improvement in the evaluation amount (increase in the evaluation amount) is small (the amount of increase is within a predetermined value) even if the number of the transportation devices 1 is increased (S511).

When it is determined that the improvement in the evaluation amount is not small (S511: NO), the processing unit 40 adds 1 to the number of the transportation devices 1 (S512), returns the processing to S502, and executes the processing of S502-S511. Is preferable.

When the above flow in which the conditions of the transportation device 1 are changed is repeated, the processing unit 40 performs the optimum transportation on the changed transportation route when the optimum evaluation amount before and after the change is improved (the evaluation value is increased). Determine as a route. If the evaluation amount does not change or deteriorates (evaluation value decreases) even if the conditions of the transportation device 1 are changed, the change is terminated without changing the conditions of the transportation device 1 (S512) (S511: YES). The number of transport devices 1 may be increased one by one, or the conditions of the transport devices 1 may be changed in other ways. For example, the processing unit 40 may change the position of the transportation device 1 in the initial state. In this case, the processing unit 40 may select the transportation route having the largest evaluation amount in the calculation for the predetermined number of conditions and decide not to change the conditions any more. Further, the number of transportation devices 1 owned by the business operator who actually operates the transportation route determination device 4 may be the upper limit. The number of transportation devices 1 operated (registered) in the target area may be the upper limit. The upper limit of the conditions to be set may be determined from the upper limit of the number of personnel involved in the operation.

When it is determined that the improvement in the evaluation amount is small (S511: YES), the processing unit 40 determines the final transportation route of the transportation equipment 1, the movement route of the article (pallet P), and the number of the transportation equipment 1. (S513), and the process is terminated.

The processing procedure of the route calculation shown in the flowcharts of FIGS. 9 and 10 (or FIGS. 12 and 13) will be described as examples with specific examples.

[Example 1]
In the first embodiment, in the above-mentioned selection process of S307, the node to proceed to the next is selected by a random number. FIG. 14 is an explanatory diagram of the process of deriving the optimum solution in the first embodiment. FIG. 14 shows a transportation network in an area defined with the target base center 2 as the base center 2 in H city and the base centers 2 in neighboring Y city, O city, and K city as nodes.

As shown in FIG. 14, the number of the plurality of pallets P shipped from the base center 2 in H city is, for example, 100, leaving 10 delivery destinations in H city, 50 in O city, and 50 in K city. It is assumed that there are 30 pieces and 10 pieces in Y city. If there is one transport device 1 with 20 empty pallet accommodating units that can be used to deliver these pallets P, agent-based modeling is perfect for transporting 90 pallets P to each destination. The solution is that when random movement is performed, it is necessary to move the edge back and forth at least 10 times. In addition, when selecting by random numbers, the average number of steps required to complete all deliveries was 21.7 steps.

[Example 2]
Example 2 is an initial state of arranging the same pallet P as in Example 1. However, in the second embodiment, in the above-mentioned selection process of S307, as a condition for selecting the node to proceed to the next, when the target pallet accommodating portion, which is a maximum of 20, is emptied, nothing is loaded. The condition is to return to H city without returning. FIG. 15 is an explanatory diagram of a solution derivation process in the second embodiment. In the example shown in FIG. 15, when the agent 1 is first located in the starting point H city, which of O city, K city, and Y city to proceed is selected by a random number. If the transportation device 1 is located in K city after the completion of one step, all the pallets P that have transported 20 pallets are loaded and unloaded in K city, so that they are emptied. Since there are conditions, the processing unit 40 inevitably selects H city from O city, H city, and Y city at the time of the next selection.

In Example 2, the average number of derived steps was 16.8 steps. Compared with the case of selecting by the perfect random number shown in FIG. 14, it can be seen that the number of steps can be calculated to be close to 10 steps of the optimum solution by setting the conditions, and the optimum solution can be reached sooner. ..

As shown in [Example 1] and [Example 2], it was found that the derivation of the optimum solution by agent-based modeling was successful in the region.

[Example 3]
In the third embodiment, the processing procedure shown in the flowcharts of FIGS. 9 and 10 is executed on the condition that 60 more pallets P carrying different types are present in different base centers 2. In the third embodiment, in the selection process of S307, the node to proceed to the next is selected by a random number.

FIG. 16 is an explanatory diagram of the solution derivation process in the third embodiment. In the example of FIG. 16, for the same transportation network as the example shown in FIG. 14, 100 pallets P are waiting to be shipped from the base center 2 of H city, and 10 pallets P are left in H city, and O city is left. 50 pieces will be shipped to K city, 30 pieces to K city, and 10 pieces to Y city. Furthermore, 60 pallets P carrying different types of goods are waiting to be shipped to K city, leaving 20 in K city, 30 in O city, 5 in H city, and 5 in Y city. It is a prerequisite to do.

Under the precondition shown in FIG. 16, when there is one transportation device 1 having 20 empty pallet accommodating units that can be used for delivery of these pallets P, agent-based modeling is performed to obtain 130 different types of 130 at each destination. It is understood that in order to transport the pallet P, it is necessary to go back and forth between the edges at least 15 times when the movement is completely random. In addition, when selecting by random numbers, the average number of steps required to complete all deliveries was 31.8 steps.

[Example 4]
The precondition of the fourth embodiment is the initial state of the arrangement of the same pallet P as that of the third embodiment. However, in the fourth embodiment, in the above-mentioned selection process of S307, as a condition for selecting the node to proceed to the next, when the target pallet accommodating portion, which is a maximum of 20, is emptied, nothing is loaded. Set to return to H city without. FIG. 17 is an explanatory diagram of a solution derivation process in the fourth embodiment. In the example shown in FIG. 17, when the agent 1 is first located in the starting point H city, which of O city, K city, and Y city to proceed is selected by a random number. If the transportation device 1 is located in K city after the completion of one step, all the pallets P that have transported 20 pallets are loaded and unloaded in K city, so that they are emptied. Since there are conditions, the processing unit 40 inevitably selects H city from O city, H city, and Y city at the time of the next selection.

In Example 4, the average number of derived steps was 28.8 steps. Compared with the case of selecting by the perfect random number shown in FIG. 16, it can be seen that the number of steps can be calculated to be close to 15 steps of the optimum solution by setting the conditions, and the optimum solution can be reached sooner. ..

18A, 18B, 19A and 19B are graphs showing the results of the simulation. The graph of FIG. 18A shows an example of the transition of the remaining amount according to the number of steps until the transportation of the pallet P for each destination is completed under the condition of the third embodiment shown in FIG. The graph of FIG. 18B shows an example of the transition of the remaining amount according to the number of steps until the transportation of the pallet P for each destination is completed under the condition of the fourth embodiment shown in FIG. The graph of FIG. 19A shows an example of the transition of the remaining amount according to the number of steps until the transportation of the pallet P is completed for each type under the condition of the third embodiment shown in FIG. The graph of FIG. 19B shows an example of the transition of the remaining amount according to the number of steps until the transportation of the pallet P is completed for each type under the conditions shown in FIG. As shown in FIGS. 18A, 18B, 19A and 19B, a transportation route with a minimum of 15 steps may be derived, and a transportation route with a maximum of 52 steps may be derived. As shown in FIGS. 18A, 18B, 19A and 19B, there may be a case where the transport device 1 consumes the number of steps without reducing the remaining amount.

FIG. 20 is a bar graph showing the results of the simulation. The graph of FIG. 20 shows the number of times the transport device 1 stops at each node (city) under the conditions of Example 3 or Example 4 shown in FIG. 16 or FIG. It can be seen that the transportation equipment 1 stops most frequently in the city H, which has a large number of pickups, regardless of whether the transportation is completed in the minimum step or the maximum step.

[Example 5]
The precondition of the fifth embodiment is the same arrangement of the pallets P as that of the third embodiment. That is, in the initial state, 100 pallets P of type Z exist in the base center 2 of H city, and 60 pallets P of type W exist in the base center 2 of K city. However, in the fifth embodiment, weighting is given to the selection of the node to proceed to the next in the selection process of S307 described above.

FIG. 21 is an explanatory diagram of the solution derivation process in the fifth embodiment. In the example of FIG. 21, the arrangement state of the transportation network and the pallet P is the same as the state of the third embodiment shown in FIG.

In the example of FIG. 21, when K city, O city, and Y city are selected as destinations from H city, K city is selected as 0.2, O city is selected as 0.5, and K city is selected as 0.3. Weighting is distributed. Similarly, when H city and K city are selected from Y city, a weight of 0.5 is given to each of H city and K city. Weights of 0.5 are also given from K city to Y city and O city, and K city to H city and O city to K city are not selected.

In the preconditions shown in FIG. 21 and the selection method of S307, when one transport device 1 having 20 empty pallet accommodating portions is used, it is necessary to transport the pallet P to each destination by agent-based modeling. The average number of steps was 27.7. In Example 3, which was not weighted, the average number of steps was 31.8.

[Example 6]
Example 6 is a combination of the conditions of Example 4 and Example 5. The precondition of the sixth embodiment is the same arrangement of the pallets P as that of the third embodiment. That is, in the initial state, 100 pallets P of type Z exist in the base center 2 of H city, and 60 pallets P of type W exist in the base center 2 of K city.

FIG. 22 is another explanatory diagram of the solution derivation process in the sixth embodiment. In the sixth embodiment, when the selection of the node to be proceeded in the above-mentioned processing of S307 is weighted and the maximum number of target pallet accommodating portions is emptied, nothing is done. The condition is to return to H city without loading.

In Example 6, the average number of steps required to transport the pallet P to each destination was 25.6 steps. As described above, Example 6 differs from Examples 3 to 5 in terms of selection in the process of S307. When a node is selected with a completely random probability (Example 3), the average number of steps is 31.8, and when it becomes empty (Example 4), the average number of steps is 28.8, and weighting is given. It was found that the average number of steps was reduced to 27.7 in (Example 5), and the average number of steps was reduced to 25.6 under the condition of weighting and emptying (Example 6).

[Example 7]
Example 7 shows an example in which two agents (transportation equipment 1) are used. FIG. 23 is another explanatory diagram of the solution derivation process in the seventh embodiment. In the example of FIG. 23, two transport devices 1 can be used under the same conditions as those of FIG. That is, in the seventh embodiment of FIG. 23, two agents (transportation equipment 1) are located in H city in the initial state, and 100 pallets P exist in H city, which is the starting point in the area.

Under the conditions shown in FIG. 23, when two transport devices 1 having 20 empty pallet accommodating units that can be used for delivering these pallets P are used, in order to transport the pallets P to each destination by agent-based modeling. , The average number of steps back and forth between edges is 13.6. In the case where the number of agents (transportation device 1) in FIG. 14 is one, the average number of steps is 21.7, so the average number of steps is reduced, but it is not less than half. Therefore, appropriate conditions are required.

24A-24F are schematic views of the transport route obtained by agent-based modeling of Example 7. 24A-24F show the progress of transportation. In Example 7, a simulation by agent-based modeling was performed with two agents, and a transportation route with an average of 13.6 steps was calculated. As an example of this, a transportation route for two transportation devices 1 as shown in FIGS. 24A to 24F was obtained.

Specifically, the transportation device 1 is from the city H where 100 pallets P are waiting to be shipped in FIG. 24A, and one transportation device 1 (X in FIGS. 24A to 24F) is in the process of FIG. 24B. Twenty pallets P were transported to K city and returned to H city in the process of FIG. 24C. This transport device 1 transports 20 pallets P to the city O in the process of FIG. 24D, and returns to the city H again in the process of FIG. 24E. This transport device 1 transports 20 pallets P to the city O in the process of FIG. 24F.

The other transport device 1 (Y in FIGS. 24A-24F) accommodates 20 pallets P from H city on the loading platform, 10 to Y city in the process of FIG. 24B, and K in the process of FIG. 24C. We are transporting 10 pallets P to the city. This transport device 1 returns to H city in the process of FIG. 24E via Y city in the process of FIG. 22D, and transports 10 pallets P to O city in the process of FIG. 24F.

In this way, the transport route determination device 4 applies agent-based modeling to the transport network in the area including the base center 2, and performs calculations based on a step-by-step mathematical model including random numbers, weights, or conditional stochastic processes. Can be used to derive the minimum number of steps. Then, the transportation route determination device 4 can partially select the optimum transportation route in the transportation network in the area and determine the optimum route from the first destination to the final destination.

Under the conditions shown in FIGS. 24A to 24F, it is necessary to perform a calculation for cooperation such as passing the pallet P between the two transport devices 1 at a waypoint.

(Modification example)
In the modified example, the distance between nodes is taken into consideration in the transportation network within the region. Further, in the modified example, the process of probabilistically moving the arrangement of the agent and the pallet P step by step from the initial state is repeated a predetermined number of times, and the route is better than the transportation route with the shortest number of steps so far. The search is terminated when the situation is such that it is unlikely that

25 and 26 are flowcharts showing an example of the processing procedure of the route calculation in the modified example. Of the processing procedures shown in the flowcharts of FIGS. 25 and 26, the procedures common to the procedures shown in the flowcharts of FIGS. 9 and 10 are designated by the same reference numerals and detailed description thereof will be omitted.

In the modified example, the processing unit 40 uses the adjacent base center 2 or the accumulation center centered on the selected base center 2 as nodes, the route between the nodes as an edge, and the distance information is associated with the edge in the area. Define a transportation network with distance (S321). FIG. 27 shows an example of the contents of a transportation network with a distance. Similar to FIG. 14, the network connects H city, O city, Y city and K city, but the distance between cities and the connection between cities are different from the network that does not consider the distance. Further, in the transportation network shown in FIG. 27, the pallets P are not first accumulated in H city, but are replenished from the production areas in the area. The production area is treated as the base center 2 where the pallets P are accumulated in the initial state in the transportation network in the area.

Returning to the flowcharts of FIGS. 25 and 26, the explanation will be continued. When the processing unit 40 calculates the number of palettes P existing in the node at the node to which the agent is moved (S308), not only the number of steps is added but also the distance associated with the moved edge is cumulatively moved. It is added and stored as a distance (S329).

When the processing unit 40 determines that the delivery within the transportation network is completed in the processing of S311 (S311: YES), the processing unit 40 determines the history (transportation route), the cumulative movement distance, and the number of steps of the node identification data that the agent has passed through. Remember (S332). As a result, the number of steps required to complete the delivery at each time, the moving distance, and the transportation route are stored.

When it is determined in the processing of S311 that the delivery within the transportation network is not completed (S311: NO), the processing unit 40 calculates the delivery progress rate in the entire transportation network (S333). In S333, the processing unit 40 calculates the ratio of the number of pallets P that have reached the destination in the area to the total number of pallets P as the progress rate. In the processing of S333, the processing unit 40 may calculate the progress rate as the ratio of the number of undelivered pallets P to the whole as the progress rate.

In the processing of S333, the processing unit 40 may derive a standard for determining the timing for determining whether or not the route being calculated in the processing of S336 described later is likely to derive the shortest route. Therefore, it is not limited to the progress rate, and may be the number of calculation steps or the time.

The processing unit 40 determines whether or not the progress rate calculated in the processing of S333 satisfies the condition (S334). In the process of S334, the processing unit 40 determines, for example, whether or not the progress rate (%) is a multiple of 10. In addition, if the number of calculation steps is replaced by the progress rate, it may be determined whether or not it is a multiple of 5, and if it is time, it may be determined by whether or not the elapsed time is a multiple of 5. May be good.

When it is determined that the condition is not satisfied in the processing of S334 (S334: NO), the processing unit 40 returns the processing to S304 and proceeds to the next step.

When it is determined in S334 that the condition is satisfied (S334: YES), the processing unit 40 stores the travel distance so far this time in association with the progress rate calculated in the processing of S333 (S335). The processing unit 40 gives the memorized movement distance and the transportation route of the shortest movement distance among the movement distances for which the calculation of the transportation routes is executed a plurality of times with the distance and the width in the progress rate calculated by the processing of S333. Compare (S336).

In the processing of S336, the processing unit 40 calculates, for example, as in the following equation (1). Assuming that the travel distance up to that point is k and the travel route at the progress rate (prog) of the shortest distance transportation route among the transportation routes obtained so far is kmin prog, the equation (1) is kprog <kmin prog + kmin. prog × (1-Progress rate (prog))… (1)
Is. FIG. 28 is a schematic diagram of the presence / absence judgment of the prospect based on the progress rate. In FIG. 28, the horizontal axis shows the cumulative movement distance, and the vertical axis shows the progress rate of transportation. The circles in FIG. 28 indicate the moving distances at each progress rate when the shortest distances in the transportation routes obtained so far are calculated. The X mark in FIG. 28 indicates a comparison value according to the progress rate for the movement distance at each progress rate of the shortest distance. The travel distance k10 when the progress rate is 10% is compared with 1.9 times the travel distance kmin 10 when the progress rate of the shortest transportation route is 10%. The travel distance k20 when the progress rate is 20% is compared with 1.8 times the travel distance kmin 20 when the progress rate of the shortest transportation route is 20%. When the progress rate is 90%, the travel distance k90 is compared with 1.1 times the travel distance kmin 90 at the progress rate of 90% of the shortest transportation route. When the travel distance k obtained so far is equal to or greater than the comparison value, it can be determined that there is no possibility that the transportation route having the shortest distance can be derived.

As a result of the comparison by the processing of S335, the processing unit 40 determines whether or not there is a possibility that the shortest distance transportation route can be derived by proceeding with the delivery simulation thereafter (S337). When it is determined that there is no possibility (S337: NO), the processing unit 40 ends the current calculation in the middle and proceeds to the processing to S313.

If it is determined in S337 that there is a possibility (S337: YES), the processing unit 40 continues the calculation and returns the processing to S304.

As a result, if it is unlikely that the shortest path will be derived even if the calculation is further advanced, the calculation can be interrupted and the calculation time can be shortened.

The processing procedure of the route calculation shown in the flowcharts of FIGS. 25 and 26 will be described as an embodiment with specific examples.

[Example 8]
In the eighth embodiment, the transport network with a distance shown in FIG. 27 is set as the initial state, the agent (transport device 1) is set to two, and the node to be next is selected by a random number in the selection process of S307. Shown. FIG. 29 is an explanatory diagram of the solution derivation process in the eighth embodiment. When selecting edges with random numbers, the average number of steps required to complete all deliveries was 107.5, and the average moving distance was 675.3.

[Example 9]
In the ninth embodiment, the transport network with a distance shown in FIG. 27 is set as the initial state, the agent (transport device 1) is set to two, and the node to be next is selected by a random number in the selection process of S307. When the maximum number of target pallet storage units is emptied, it is a condition that the vehicle returns to the base center 2 of the supply site without loading anything. FIG. 30 is an explanatory diagram of a solution derivation process in the ninth embodiment. When it was set to return to the base center 2 when it became empty, the average number of steps required to complete all deliveries was 80.9, and the average travel distance was 445.9. It was found that the travel distance was shorter than the result of Example 8 and the possibility of deriving the shortest route was increased under the condition of returning to the base center 2 when it became empty.

FIG. 31 is a graph showing the effect of shortening the calculation time by judging the prospect. The horizontal axis of the graph of FIG. 31 indicates the elapsed time from the start of the route calculation process, and the vertical axis indicates the shortest travel distance at each time point. The solid line shows the progress when the calculation is interrupted to return to the initial state and the calculation process is started when there is no prospect, that is, when the process procedure shown in the flowcharts of FIGS. 25 and 26 is executed. The broken line indicates the progress when the determination of the presence or absence of the prospect is not executed, that is, when the processing procedure shown in the flowcharts of FIGS. 9 and 10 is executed.

As shown in FIG. 31, the elapsed time until the shortest travel distance can be calculated is shorter in the modified example in which the determination of the presence or absence of a prospect is executed. That is, it can be seen that the processing unit 40 arrives at the optimum solution faster when the determination of whether or not there is a possibility is executed.

In this way, it becomes possible to calculate the optimum route in a transportation network with a distance faster.

The same method can be applied to the optimization of the loading stage of goods on the pallet P. In this case, it can be realized by replacing the above-mentioned pallet P with an article and the above-mentioned transportation device 1 with a pallet P.

In the present embodiment, the transportation route determination device 4 itself communicates with the on-board unit 10, the base controller 20 in the base center 2, and the collection / delivery site device 30 in the collection / delivery center 3 to collect information, and updates the distribution DB 410. However, processing including information update processing of the DB 410, reception from the terminal device 5, and communication with each communicable device is realized separately by the information management device, and the transportation route determination device 4 only determines the transportation route. It may be realized as a dedicated device for executing.

The embodiments disclosed as described above are exemplary in all respects and are not restrictive. The scope of the present invention is indicated by the claims and includes all modifications within the meaning and scope equivalent to the claims.

1 Transport equipment P pallet 4 Transport route determination device 40 Processing unit 41 Storage unit 410 Logistics DB
40P computer program

Claims

It is a transportation route determination method for determining a transportation route from a collection point to a distribution point of the goods by sequentially selecting a transportation base through which the transportation equipment for transporting the goods passes.
A simulation step in which the selection process of sequentially and probabilistically selecting a transportation base or a distribution point to which the transportation equipment passes from the transportation base or the collection point is repeated until the transportation of the goods to the distribution point is completed.
A step of calculating a predetermined evaluation amount for the transportation route obtained in the simulation step, and
A transportation route determination method including a step of determining a transportation route based on the predetermined evaluation amount from a plurality of transportation routes obtained by repeating the simulation step and the calculation process of the predetermined evaluation amount within a predetermined range. ..
The predetermined evaluation amount includes the time required to complete transportation, the number of steps required, the total distance traveled by the transportation equipment, the required number of movements, the estimated emission amount of carbon dioxide due to the movement of the transportation equipment, and the cost required for transportation. The transportation route determination method according to claim 1, which is a value calculated from any one or a plurality of combinations, or a plurality of combinations.
Within the predetermined range, the number of obtained transportation routes is within the upper limit of the number of predetermined transportation routes, or the calculation time of the simulation process and the process of calculating the evaluation amount is the predetermined calculation time. The transportation route determination method according to claim 1 or 2, which is within the upper limit.
The transportation according to any one of claims 1 to 3, wherein the simulation process is executed on condition that the transportation equipment moves to a predetermined collection point when all the articles to be loaded are delivered. Route determination method.
The transportation route according to any one of claims 1 to 4, wherein the probability of selecting a transportation base or a distribution point in the selection process is a pre-weighted probability, and the simulation process is executed. How to decide.
The simulation is performed under the conditions that the article is a plurality of types of articles, the transport device is permitted to load the plurality of types of articles, and the plurality of types of articles are permitted to be loaded or unloaded at a transportation base. The transportation route determination method according to any one of claims 1 to 5, wherein the process is executed.
In the process of repeating the selection process in the simulation step, a numerical value related to the evaluation amount is calculated.
The transportation route determination method according to any one of claims 1 to 6, wherein the simulation process is terminated when the numerical value satisfies a preset termination condition of the calculation process.
In the process of repeating the selection process, the progress rate until the completion of transportation is calculated, and the state is the same as the progress rate in the transportation route determined to be optimal based on the predetermined evaluation amount among the already obtained transportation routes. The transportation route determination method according to claim 7, wherein the discontinuation condition is that the predetermined index exceeds the reference value for comparison.
The predetermined index includes the time required for transportation to the progress rate, the number of steps required, the distance traveled by the transportation equipment to the progress rate, the number of movements of the transportation equipment to the progress rate, and the estimation of carbon dioxide to the progress rate. The transportation route determination method according to claim 8, which is the amount of emissions or the cost required for transportation.
The conditions of the transportation equipment are set as the preconditions of the simulation process, and the conditions are set.
By changing the conditions of the transportation equipment and executing the simulation process,
Any one of claims 1 to 9 that determines the optimum transport route and the conditions of the transport equipment based on the predetermined evaluation amount for the transport route obtained by the simulation process performed for different conditions of the transport equipment. The transportation route determination method according to item 1.
The condition of the transportation equipment is the number of the transportation equipment.
By increasing the number of transportation equipment by one, the conditions are changed.
The transportation route determination method according to claim 10, wherein the minimum value of the transportation equipment whose predetermined evaluation amount does not decrease even if the number of transportation equipment is increased is determined as the number of transportation equipment.
Multiple transportation via a plurality of collection and delivery points for collecting and delivering goods, and a transportation device having a loading platform provided with a plurality of member accommodating portions for accommodating the logistics members which are the transportation devices for transporting the articles. It is a transportation route determination method that determines the route of transportation equipment between points including bases.
Information on the types of goods to be loaded on the goods, the number of goods, the collection and delivery points where the goods are collected and delivered, and the collection and delivery points or transportation bases which are the final destinations of the goods, and the purpose. Processing to obtain desired arrival time information and information on the ground,
The number of transportation equipment required for each area including the above point and the transportation route within the area are based on a mathematical model that includes a probabilistic selection process using random numbers when selecting one from multiple options for transit points. Processing derived by simulation calculation,
Processing to memorize the number of derived transportation equipment for each region and the transportation route within the region, and
Based on the acquired information, a process of selecting a partial route of either the transportation route stored in the storage unit or the transportation route newly derived by calculation, and determining the transportation route for each of the transportation devices. Transportation route determination method including.
The transport route derived by the simulation calculation and stored in the storage unit is
The transportation route determination method according to claim 12, which is a transportation route determined based on the simulation step of any one of claims 1 to 11 and the step of calculating the evaluation amount.
A plurality of collection and delivery points for collecting and delivering goods, and a plurality of transportation bases via which the transportation equipment having a loading platform provided with a plurality of pallet storage units for accommodating the pallets for transporting the goods. It is a transportation route determination method that determines the route of transportation equipment between points including
The type of goods to be loaded on the pallet, the number of pallets, the collection / delivery point where the goods are collected and delivered, the information on the collection / delivery point or the transportation base which is the final destination of the goods, and the destination. Processing to get the desired arrival time information and
Based on the acquired information, the number of transportation equipment required for each area including the above point and the transportation route within the area are stochastically selected by random numbers when one is selected from multiple options of transit points. Processing derived by operations applying a mathematical model including processes,
Processing to memorize the number of derived transportation equipment for each region and the transportation route within the region, and
A transportation route determination method including a process of selecting a partial route of either a transportation route stored in a storage unit or a transportation route newly derived by calculation and determining a transportation route for each of the transportation devices.
The transportation route determination method according to claim 14, wherein the number of transportation devices and a part or all of the transportation routes stored in the storage unit previously derived by the calculation are used, and the transportation route is determined.
A computer program that causes a computer to execute a process of sequentially selecting a transportation base through which a transportation device for transporting goods passes and determining a transportation route from a collection point to a distribution point of the goods.
On the computer
A simulation step in which the selection process of sequentially and probabilistically selecting a transportation base or a distribution point to which the transportation equipment passes from the transportation base or the collection point is repeated until the transportation of the goods to the distribution point is completed.
A step of calculating a predetermined evaluation amount for the transportation route obtained in the simulation step, and
A computer program that executes a step of determining a transportation route based on the predetermined evaluation amount from a plurality of transportation routes obtained by repeating the simulation step and the calculation process of the predetermined evaluation amount within a predetermined range.
A plurality of collection and delivery points for collecting and delivering articles, and a plurality of transportation devices for transporting the articles and having a loading platform provided with a plurality of pallet accommodating units for accommodating the pallets. A computer program that executes the process of determining the route of transportation equipment between points including the transportation base of
On the computer
The type of goods to be loaded on the pallet, the number of pallets, the collection / delivery point where the goods are collected and delivered, the information on the collection / delivery point or the transportation base which is the final destination of the goods, and the destination. Get the desired arrival time information and
The number of transportation equipment required for each area including the above point and the transportation route within the area are based on a mathematical model that includes a probabilistic selection process using random numbers when selecting one from multiple options for transit points. Derived by simulation calculation,
Memorize the number of transportation equipment for each region and the transportation route within the region,
Based on the acquired information, a process of selecting a partial route of either the transportation route stored in the storage unit or the transportation route newly derived by calculation, and determining the transportation route for each of the transportation devices. A computer program that runs.
It is a transportation route determination device that determines a transportation route from a collection point to a distribution point of the goods by sequentially selecting a transportation base through which the transportation equipment for transporting the goods passes.
A simulation process is executed in which the selection process of sequentially and probabilistically selecting the transportation base or the distribution point to which the transportation equipment passes from the transportation base or the collection point is repeated until the transportation of the goods to the distribution point is completed. Execution part and
A calculation unit that calculates a predetermined evaluation amount for the transportation route obtained in the simulation step, and
A transportation route including a determination unit that determines a transportation route based on the predetermined evaluation amount from a plurality of transportation routes obtained by repeating the simulation step and the calculation process of the predetermined evaluation amount within a predetermined range. Decision device.
It is a transportation route determination device that determines the transportation route of the transportation equipment connecting the waypoints through which the transportation equipment for transporting a plurality of goods passes.
An acquisition unit that acquires information on the transportation destination of each article from the collection points of the plurality of articles in a predetermined range.
Based on the arrangement of the acquired goods within the predetermined range and the position of the transportation equipment, the probability of the route to the transit point, the collection point, or the transportation destination point through which the transportation equipment passes next is stochastic at each point. Selection part to select
A calculation unit that repeats the process of selecting stochastically until the transportation of the plurality of articles to the transportation destination is completed to calculate the transportation route of the transportation equipment.
Evaluation unit that calculates the evaluation amount for the calculated transportation route, and
A transportation route determination device including a determination unit that executes the calculation of the transportation route a plurality of times and selects and determines the transportation route based on the evaluation amount calculated for each time.