JP6587304B2 - Information processing device - Google Patents

Description

  The present invention relates to an information processing apparatus.

Conventionally, there is a high demand for a method for efficiently carrying out physical distribution, and many techniques have been proposed for that purpose (see, for example, Patent Document 1).
According to the technique described in Patent Document 1 described above, it is possible to smoothly operate the package logistics system and to notify the user's inquiry of the package transportation status (current position, etc.). For this reason, it is very useful when performing a service such as delivering an article to a user.

JP 2007-334901 A

However, for example, when performing a service for keeping an article such as a tire from a user, it is difficult to efficiently operate the service simply by notifying the user of the state of transportation of the luggage.
In such a case, it is necessary for the user to efficiently deliver the article to the service provider and to receive the article efficiently.
In particular, if an article that the user desires to deliver is a heavy article such as a tire, the article is often stored once in a warehouse or the like, and it is necessary to take a complicated route.

  The present invention has been made in view of such a situation, and is a technique that can sequentially determine the optimal route of a moving body that transports an article and efficiently operate a service for keeping the article from a user. The purpose is to provide.

In order to achieve the above object, an information processing apparatus of one embodiment of the present invention provides:
A transportation that transports one or more articles via a route including at least one base and one warehouse among a plurality of bases that receive or deliver goods to the user and a plurality of warehouses that store the goods An information processing apparatus for planning a body schedule,
Base information acquisition means for acquiring base information including the amount of articles in and out per predetermined unit time for each of the plurality of bases, and a warehouse for acquiring warehouse information including availability for a predetermined unit time for each of the plurality of warehouses Information acquisition means;
Route determining means for determining a route on which each of the one or more moving bodies moves based on the base information for each of the plurality of bases and warehouse information for each of the plurality of warehouses;
Is provided.

  ADVANTAGE OF THE INVENTION According to this invention, the technique which can determine the optimal route | route of a mobile body sequentially and can operate efficiently the service etc. which leave goods from a user can be provided.

It is a block diagram which shows the structure of the information processing system which concerns on one Embodiment of this invention. It is a block diagram which shows the hardware constitutions of the server of one Embodiment of this invention among the information processing systems of FIG. It is a functional block diagram which shows the functional structural example of the server of FIG. 2, a base terminal, a warehouse terminal, and a user terminal. It is a figure which shows the specific example of the result of the route determination process which the server of FIG. 3 performs. It is a figure which shows an example of the screen which displays the usage information displayed on the user terminal of FIG. It is a flowchart explaining the flow of the route determination process which the server of FIG. 3 performs. 5 is a diagram illustrating an application example of route determination processing executed by the server in FIG. 3, and is a diagram illustrating an example different from the example in FIG. 4. FIG. 4 is a diagram illustrating an example of an image in which base information of each base K is displayed within each predetermined period in the route determination process executed by the server of FIG. 3. It is a figure which shows an example of the warehouse list utilized at the time of route determination in the tire custody route determination process which the server of FIG. 3 performs. FIG. 4 is a diagram illustrating an example of a result when the number of trucks is one in the tire deposit route determination process executed by the server of FIG. 3. FIG. 4 is a diagram illustrating an example of a result when there are two trucks in the tire deposit route determination process executed by the server of FIG. 3.

  Hereinafter, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 shows the configuration of an information processing system according to an embodiment of the present invention.

The information processing system shown in FIG. 1 is applied when providing the following service.
In other words, the service to which the information processing system according to the present invention is applied is a service for keeping an article such as a user's tire for a certain period of time, in other words, a predetermined article is delivered to an arbitrary base, and the predetermined article is transferred to an arbitrary base. It is a service that can be picked up at.
Although the article is not particularly limited, for convenience of explanation, the following explanation will be made assuming that the article is a tire. In this case, the base is a place such as a dealer or a gas station where tires can be temporarily stored for several days.
The tire delivered to the base by the user is transported to and stored in an arbitrary warehouse, and when the user wishes to pick up, the tire is transported from the warehouse to an arbitrary base and is picked up by the user at the base.
The user can take the tire at the same location as the location where the article was delivered, but can also take the tire at a different location.
A person in charge of transporting goods travels a predetermined route including one or more bases and one or more warehouses using a predetermined moving body (in the following example, a truck) and carries one or more tires. These tires are loaded and unloaded.
The information processing system of the present embodiment can determine the optimum route that the truck should take under such a service.

As shown in FIG. 1, the information processing system according to the present embodiment includes a server 1 managed by the above-described service provider and m sites (m is an arbitrary integer value of 1 or more) K-1 to K. Base stations 2-1 to 2-m used by the base manager in each of -m and warehouses S-1 to S-n in n places (n is one or more arbitrary integer values different from m) User terminals used by each of the warehouse terminals 3-1 to 3-n used by the warehouse manager and each of l users (l is an arbitrary integer value greater than or equal to m and n). 4-1 to 4-p.
The server 1, each of the base terminals 2-1 to 2-m, each of the warehouse terminals 3-1 to 3-n, and the user terminals 4-1 to 4-p are connected via a predetermined network N such as the Internet. Are connected to each other.

Hereinafter, when it is not necessary to individually distinguish each of the base terminals 2-1 to 2-m, they are collectively referred to as “base terminal 2”.
Further, hereinafter, when it is not necessary to individually distinguish each of the warehouse terminals 3-1 to 3-n, they are collectively referred to as “a warehouse terminal 3”.
Then, hereinafter, when it is not necessary to individually distinguish each of the user terminals 4-1 to 4-p, these are collectively referred to as “user terminal 4”.
Similarly, hereinafter, when it is not necessary to individually distinguish the bases K-1 to K-m, they are collectively referred to as “base K”, and the warehouses S-1 to Sn are individually distinguished. When it is not necessary to do so, these are collectively referred to as “warehouse S”.

  FIG. 2 is a block diagram showing a hardware configuration of the server 1 in the information processing system of FIG.

  The server 1 includes a CPU (Central Processing Unit) 11, a ROM (Read Only Memory) 12, a RAM (Random Access Memory) 13, a bus 14, an input / output interface 15, an output unit 16, an input unit 17, A storage unit 18, a communication unit 19, and a drive 20.

The CPU 11 executes various processes according to a program recorded in the ROM 12 or a program loaded from the storage unit 18 to the RAM 13.
The RAM 13 appropriately stores data necessary for the CPU 11 to execute various processes.

  The CPU 11, ROM 12, and RAM 13 are connected to each other via a bus 14. An input / output interface 15 is also connected to the bus 14. An output unit 16, an input unit 17, a storage unit 18, a communication unit 19, and a drive 20 are connected to the input / output interface 15.

The output unit 16 includes various liquid crystal displays and the like, and outputs various information.
The input unit 17 is composed of various hardware leads and the like, and inputs various information.
The storage unit 18 includes a hard disk, a DRAM (Dynamic Random Access Memory), and the like, and stores various data.
The communication unit 19 controls communication with other devices (in the example of FIG. 1, the base terminal 2, the warehouse terminal 3, the user terminal 4 and the like) via the network N including the Internet.

  The drive 20 is provided as necessary. A removable medium 21 composed of a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is appropriately attached to the drive 20. The program read from the removable medium 21 by the drive 20 is installed in the storage unit 18 as necessary. The removable medium 21 can also store various data stored in the storage unit 18 in the same manner as the storage unit 18.

  Since the configuration of the base terminal 2, the warehouse terminal 3, and the user terminal 4 is basically the same as the configuration of the server 1, their description is omitted here.

  The following series of processes (hereinafter referred to as “route determination process”) are performed in cooperation with various hardware and various software of the server 1, the base terminal 2, the warehouse terminal 3, and the user terminal 4 in FIG. ) Can be executed.

That is, each of the base terminals 2-1 to 2-m acquires information such as tire access information to each of the bases K-1 to K-m every unit time (for example, one day), and Send to 1.
Information obtained from such a base K, for example, position information of the base K, information by time zone of scheduled storage of tires per unit time (for example, one day), tire delivery schedule for each unit time (for example, one day) Information such as time zone information is collectively referred to as “base information” hereinafter.
The server 1 acquires base information from each of the base terminals 2-1 to 2-m every unit time (for example, one day).

Each of the warehouse terminals 3-1 to 3-n acquires information such as tire entry / exit information to each of the warehouses S- 1 to S-n for each unit time (for example, one day) and sends it to the server 1. And send.
Information obtained from such a warehouse S, for example, location information of the warehouse S, information by time zone of the scheduled arrival of tires per unit time (for example, one day), and scheduled delivery of tires per unit time (for example, one day) Hereinafter, information such as time zone information is collectively referred to as “warehouse information”.
The server 1 acquires warehouse information from each of the warehouse terminals 3-1 to 3-n every unit time (for example, one day).

When the server 1 acquires the base information from each of the base terminals 2-1 to 2-m and the warehouse information from each of the warehouse terminals 3-1 to 3-n, the server 1 obtains 1 An optimum route (hereinafter referred to as “optimum route”) for carrying the tires by one or more trucks is determined.
In addition, the optimal route said here is determined from the information of a fixed area (for example, Yamanashi Prefecture etc.).

The user terminal 4 presents to the user information (hereinafter referred to as “use information”) as to whether or not the tire custody service is possible.
Specifically, for example, “usage information” is information such as whether or not a user can deliver a tire in a certain time zone at a certain base K, and allows the user to take a tire in a certain time zone at a certain base K. Whether or not.
This usage information is generated by the server 1 based on the availability information of each base K and each warehouse S per unit time (for example, one day) when the above-mentioned optimum route is determined.

Such a series of processes is a route determination process.
In order to realize this route determination process, the server 1, the base terminal 2, the warehouse terminal 3, and the user terminal 4 have a functional configuration as shown in FIG.
FIG. 3 is a functional block diagram illustrating a functional configuration example of the server 1, the base terminal 2, the warehouse terminal 3, and the user terminal 4 of FIG.

In the CPU 40 of the base terminal 2, the base information management unit 50 and the base information transmission control unit 51 function.
In the CPU 60 of the warehouse terminal 3, a warehouse information management unit 70 and a warehouse information transmission control unit 71 function.
In the CPU 11 of the server 1, a base information acquisition unit 80, a warehouse information acquisition unit 81, a route determination unit 82, a usage information request acquisition unit 83, and a usage information notification unit 84 function.
In the CPU 102 of the user terminal 4, a usage information request reception unit 120, a usage information request transmission control unit 121, a usage information acquisition unit 122, and a usage information presentation unit 123 function.

The base information management unit 50 of the base terminal 2-K (K is an arbitrary integer value from 1 to m) includes the tire input / output amount per unit time (for example, one day) for the base KK. Obtain and manage information.
The site information transmission control unit 51 executes control for transmitting the site information managed by the site information management unit 50 to the server 1 via the communication unit 41 every unit time (for example, one day).

The warehouse information management unit 70 of the warehouse terminal 3-L (L is an arbitrary integer value from 1 to n) acquires warehouse information including availability per unit time (for example, one day) for the warehouse SL. And manage.
The warehouse information transmission control unit 71 executes control for transmitting the base information acquired by the warehouse information management unit 70 to the server 1 via the communication unit 61 every unit time (for example, one day).

The usage information request receiving unit 120 of the user terminal 4 receives a usage information request from the user via the touch operation input unit 100.
The usage information request transmission control unit 121 executes control for transmitting the usage information request received by the usage information request reception unit 120 to the server 1 via the communication unit 103.
The server 1 transmits usage information determined based on the optimum route to the user terminal 4.
Then, the usage information acquisition unit 122 acquires the usage information transmitted from the server 1.
And the usage information presentation part 123 is shown to a user by performing control which displays the usage information acquired by the usage information acquisition part 122 on the display part 101. FIG.

The site information acquisition unit 80 of the server 1 acquires site information including the amount of tires entered and exited per unit time (for example, one day) for each of the plurality of sites K-1 to K-m. That is, each time base information is transmitted from a predetermined base terminal 2, the base information acquisition unit 80 acquires the base information.
Moreover, the warehouse information acquisition part 81 acquires the warehouse information containing the empty condition per predetermined unit time (for example, 1 day) for every some warehouse S-1 thru | or Sn. That is, each time warehouse information is transmitted from a predetermined warehouse terminal 3, the warehouse information acquisition unit 81 acquires the warehouse information.

The route determination unit 82 is based on the base information for each of the plurality of bases K-1 to K-m and the warehouse information for each of the plurality of warehouses S-1 to Sn for each unit time (for example, one day). The optimum route is determined as the route along which each of the one or more tracks moves.
The route determination unit 82 also generates usage information based on the optimum route.

The usage information request acquisition unit 83 acquires a usage information request transmitted from the user terminal 4.
When the usage information request acquisition unit 83 acquires the usage information request, the usage information notification unit 84 requests the usage information generated by the route determination unit 82 via the communication unit 19. The user terminal 4 is notified.

FIG. 4 is a diagram illustrating a specific example of a result of route determination processing executed by the server 1 of FIG.
In the example of FIG. 4, the optimal route in the predetermined range (for example, Yamanashi Prefecture) including the dealer base KA, the dealer base KB, the gas station base KGS, the warehouse Sa, the warehouse Sb, and the warehouse Sc. The state of the decision is shown.

In the example of FIG. 4, the base terminal 2 of the base KA transmits to the server 1 base information A indicating that there is a plan to collect the tire T1 in the next unit time (for example, one day). The base terminal 2 of the base KB transmits base information B indicating that the tire is not picked up and received in the next unit time (for example, one day) to the server 1. The base terminal 2 of the base KC transmits base information GS indicating that there is a plan to deliver the tire T2 in the next unit time (for example, one day) to the server 1.
The site information acquisition unit 80 (FIG. 3) of the server 1 acquires each of these site information A, B, and GS via the communication unit 19.

In the example of FIG. 4, the warehouse terminal 3 of the warehouse Sa transmits to the server 1 warehouse information a indicating that there is no space in the next unit time (for example, one day). The warehouse terminal 3 of the warehouse Sb transmits to the server 1 warehouse information b indicating that there is no space in the next unit time (for example, one day). The warehouse terminal 3 of the warehouse Sc transmits base information GS indicating that there is a plan to deliver the tire T2 in the next unit time (for example, one day) to the server 1.
The warehouse information acquisition unit 81 (FIG. 3) of the server 1 acquires each of these warehouse information a, b, and c via the communication unit 19.

The route determination unit 82 (FIG. 3) of the server 1 makes the route shown in FIG. 4 to the next unit time (for example, 1) based on the base information A, B, GS and the warehouse information a, b, c. (Day) is determined as the optimum route of the track M1.
In other words, the optimal route is that the truck M1 first loads the tire T1 at the base KA, transports it to the warehouse Sb, and then loads the tire T2 at the warehouse Sb, and then transports it to the base TKG. Determined as root.

Then, the route determination unit 82 determines usage information as shown in FIG. 5 based on the optimal route determined in this way.
FIG. 5 is a diagram illustrating an example of a screen presenting usage information displayed on the user terminal in FIG. 3.

As shown in FIG. 5, usage information that indicates whether or not a tire can be delivered and whether or not a tire can be received in the next unit time (for example, today) for each location K is displayed on the user terminal. 4 is displayed on the display unit 101 (FIG. 3).
Specifically, for example, on the screen 101 showing the usage information in the example of FIG. 4, for each site K, an area 201 indicating a time zone in which the user can receive a tire and a user can deliver the tire. An area 202 indicating a time zone is displayed.

For example, at the base KA, the tire can be delivered with a margin in the time zone from 13:00 to 16:00, and the tire can be slightly delivered in the time zone from 10:00 to 13:00. Can be easily recognized.
Further, in the example of FIG. 4, the user can also reserve a tire by pressing a reservation button displayed on the right side of the area 201 in a time zone in which delivery is possible.

Similarly, for example, the user can easily receive a tire at the base KA between 13:00 and 16:00, and can easily recognize that the tire cannot be received at other times.
Therefore, the user can make a reservation to receive the tire by pressing the reservation button displayed on the right side in the time zone from 13:00 to 16:00 that can be received.

  In this way, when a user wants to deliver or receive a tire, the user can easily and immediately know the location where the tire can be delivered and the location where the tire can be received. You can also make a reservation.

Next, a route determination process executed by the server 1 having the functional configuration of FIG. 3 will be described with reference to FIG.
FIG. 6 is a flowchart illustrating the flow of route determination processing executed by the server 1.

In step S1, the site information acquisition unit 80 determines whether site information has been transmitted.
If the base information is not transmitted from any of the base terminals 2-1 to 2-m, it is determined as NO in Step S1, and the process proceeds to Step S3.
On the other hand, if the base information is transmitted from the base terminal 2-K (K is any integer value from 1 to m), it is determined as YES in Step S1, and the processing is performed in Step S2. Proceed to
In step S2, the site information acquisition unit 80 acquires site information from the site terminal 2-K.

In step S3, the warehouse information acquisition unit 81 determines whether warehouse information has been transmitted.
If warehouse information is not transmitted from any of the warehouse terminals 3-1 to 3-n, it is determined as NO in Step S3, and the process returns to Step S1.
On the other hand, if warehouse information has been transmitted from the warehouse terminal 3-L (L is any integer value from 1 to n), it is determined as YES in step S3, and the process proceeds to step S4. Proceed to
In step S4, the warehouse information acquisition unit 81 acquires warehouse information from the warehouse terminal 3-L.

In step S5, the route determination unit 82 determines whether or not a predetermined time (for example, unit time such as one day) has elapsed.
If the predetermined time has not elapsed, it is determined as NO in Step S5, and the process returns to Step S1. That is, until the predetermined time elapses, the loop processing of steps S1 to S5 is repeated, and the base information from each base K and the warehouse information from each warehouse S are acquired.
When the predetermined time has elapsed, YES is determined in step S5, and the process proceeds to step S6.

  In step S6, the route determination unit 82 determines the optimum route of the truck that transports the tire from the base information acquired in step S2 and the warehouse information acquired in step S4 in steps S2 and S4.

As mentioned above, although embodiment of this invention was described, this invention is not restricted to embodiment mentioned above.
In addition, the effects described in the present embodiment are merely a list of the most preferable effects resulting from the present invention, and the effects of the present invention are not limited to those described in the present embodiment.

  For example, the route determination method related to the route determination process described above is not particularly limited to the above-described embodiment. Therefore, a method different from the method exemplified in the above embodiment will be described below with reference to FIGS.

However, in order to clarify the difference from the technique exemplified in the above-described embodiment, the following description will be made with the numbers of bases and warehouses being matched as shown in FIG.
FIG. 7 shows an application example of the route determination process executed by the server of FIG. 3, and is a diagram showing an example different from the example of FIG.
In the example of FIG. 7, the optimum route in a predetermined range (for example, Yamanashi Prefecture) including a dealer base KD, a dealer base KE, a gas station base KF, a warehouse Sd, a warehouse Se, and a warehouse Sf. A route determination process is applied for the determination. In order to distinguish the route determination process described in the example of FIG. 7 from the above-described one, in particular, it is hereinafter referred to as “tire deposit route determination process”.
Also, like the other examples described above. Hereinafter, when it is not necessary to individually distinguish the base KD, the base KE, and the base KF, they are collectively referred to as “base K”, and the warehouse Sd, the warehouse Se, and the warehouse Sf are individually distinguished. When it is not necessary to do so, these are collectively referred to as “warehouse S”.

FIG. 8 is a diagram illustrating an example of an image in which the base information of each base K is displayed within a predetermined period in the tire deposit route determination process executed by the server 1 of FIG.
In the example of FIG. 8, information about “base name”, “period”, and “quantity” is displayed for each base K as base information.
Specifically, one predetermined line corresponds to the base information of one predetermined base K.
That is, the name of the base K corresponding to the one row is displayed in the item “base name”. For example, “base KD” is displayed in the first column of “base name”. That is, the one line is the base information of “base KD”.
In the “period” item, a period of storage of the tires deposited in each base K (generally, storage in the warehouse S) is displayed. For example, “2017/09/01 to 2018/08/31” is displayed in the first column of “period”. That is, the storage period of the tires deposited at the base KD in the warehouse S is “2017/09/01 to 2018/08/31”.
In the item “quantity”, the quantity of tires deposited at each base K is displayed. In the first column of “Quantity”, “40 sets” is displayed. That is, the number of tires deposited at the base KD is “40 sets”.
In correspondence with the example of FIG. 6 described above, the processing result of step S2 is displayed in the image of FIG.
Therefore, a person who desires to determine a route (for example, a service provider who manages the server 1) clicks a software button on the lower right side of FIG. When pressed, step S4 is executed, the warehouse information is acquired, and the image shown in FIG. 9 is displayed.

FIG. 9 is a diagram showing an example of a warehouse list used at the time of route determination in the tire deposit route determination processing executed by the server 1 of FIG.
In the example of FIG. 9, “warehouse name”, “empty number”, “postal code”, “address”, and “distance” information are displayed for each base K as information regarding the warehouse S.
In other words, an example of a list of various information related to one or more warehouses S that can be a storage destination based on the base information of FIG. 8 is the warehouse list shown in FIG. That is, the processing result of step S4 in FIG. 6 is displayed as a warehouse list.
Specifically, one predetermined line corresponds to the warehouse information of one predetermined warehouse S. Then, for each base K, the warehouse information of each of one or more warehouses S that are candidates for the storage destination is displayed. That is, candidates for storage destinations of tires deposited at the base KD are the warehouse Sd, the warehouse Se, and the warehouse Sf.
In the item “warehouse name”, the name of the warehouse S corresponding to the one row is displayed. “Warehouse Sd” is displayed in the first column of the “warehouse name” of the base KD. That is, in the row, it is understood that one of tire storage destination candidates as viewed from the base KD is “warehouse Sd”.
In the item “Number of available”, the number (number of available) of tires that can be stored in the warehouse S corresponding to the one row in the period of FIG. 8 described above is displayed. “300 sets” is displayed in one row of the warehouse Sd of the base KD. That is, it can be understood that the number of tires stored in the base KD that can be stored in the warehouse Sd during the period 2017/09/01 to 2018/08/31 (empty number) is “300 sets”.
In the “zip code” item, the zip code of the warehouse S corresponding to the one row is displayed. “400-0851” is displayed in one row of the warehouse Sd of the base KD. That is, it can be seen that the postal code of the warehouse Sd is “400-0851”.
In the “address” item, the address of the warehouse S corresponding to the one row is displayed. One line of the warehouse Sd of the base KD displays “1 Yuda, Kofu City, Yamanashi Prefecture”. That is, it can be understood that the address of the warehouse Sd is “1 Yuda, Kofu City, Yamanashi Prefecture”.
In the “distance” item, the distance from the base K to the warehouse S corresponding to the one row is displayed. “5 km” is displayed in one row of the warehouse Sd of the base KD. That is, it can be seen that the distance between the base KD and the warehouse Sd is “5 km”.
As described above, the processing result of step S4 is displayed in the image of FIG. 8 when corresponding to the example of FIG.
Therefore, a software user who wants to determine the route (for example, a service provider who manages the server 1) clicks the software button with the “optimum custody” displayed in the lower right of FIG. 9 with the mouse (input unit 16). When the button is pressed, the process of step S6 is executed, and an optimum route is determined as a route for transporting tires from each base K to one or more optimum warehouses S. A specific example of this optimum route will be described with reference to FIG. 10 and subsequent drawings.

FIG. 10 is a diagram illustrating an example of a result when the number of trucks is one in the tire deposit route determination process executed by the server 1 of FIG.
Specifically, FIG. 10 shows a single truck transporting tires deposited from each base K (base KD, base KE, base KF) to each target warehouse S (warehouse Sd, warehouse Se, warehouse Sf). It is a figure which shows an example of determination of the optimal route in the case of doing.
That is, in the example of FIG. 10, a route in which one truck circulates from the base KF → the warehouse Sf → the base KE → the warehouse Se → the base KD → the warehouse Sd is displayed as the optimum route. That is, the optimum route for depositing tires based on the conditions set in FIG. 9 and the like indicates that the route travels from the base KF → the warehouse Sf → the base KE → the warehouse Se → the base KD → the warehouse Sd.

Specifically, for example, according to the method for determining the optimum route in this example, first, the warehouse S of the shortest distance is determined as the storage location of the tire for each base K. That is, as shown in FIG. 9, the respective routes of the base KD → the warehouse Sd, the base KE → the warehouse Se, and the base KF → the warehouse Sf (these routes are hereinafter referred to as “unit routes”) are determined.
Next, the order of the unit routes is determined based on the positional relationship of these unit routes. In this example, as shown in FIG. 10, the unit route of the base KF → the warehouse Sf is determined first, the base KE = the warehouse Se is determined second, and the base KD → the warehouse Sd is third. It is determined.
These unit routes are connected in the determined order, whereby the optimum route is determined. That is, in this example, as described above, a route in which one truck circulates from the base KF → the warehouse Sf → the base KE → the warehouse Se → the base KD → the warehouse Sd is determined as the optimum route.

  If there is no problem with the route determined in this way, a person who desires route determination (for example, a service provider who manages the server 1) displays software indicating “setting completed” in the lower right of FIG. The button is clicked (pressed) with the mouse (input unit 16). Then, the tire deposit route determination process ends, and the actual route is determined.

Further, the method for determining the optimum route for depositing tires according to the present embodiment can be applied to a case where there are a plurality of trucks as shown in FIG.
FIG. 11 is a diagram illustrating an example of a result when there are two trucks in the tire deposit route determination process executed by the server of FIG. 3.

Specifically, FIG. 11 shows two trucks transporting tires deposited from each base K (base KD, base KE, base KF) to each target warehouse S (warehouse Sd, warehouse Se, warehouse Sf). It is a figure which shows an example of determination of the optimal route in the case of doing.
Specifically, FIG. 11 shows two trucks transporting tires deposited from each base K (base KD, base KE, base KF) to each target warehouse S (warehouse Sd, warehouse Se, warehouse Sf). It is a figure which shows an example of determination of the optimal route in the case of doing.
That is, in the example of FIG. 11, a route in which one of the two trucks circulates from the base KF → the warehouse Sf → the base KE → the warehouse Se is displayed. In addition, a route in which the other one of the two trucks patrols from the base KD to the warehouse Sd is displayed.
In other words, based on the conditions set in FIG. 9 and the like, the optimum route for depositing tires is that one truck patrols from base KF ⇒ warehouse Sf ⇒ base KE ⇒ warehouse Se, and the other single truck This indicates that the route travels from the base KD to the warehouse Sd.

First, the unit route from each base K to the warehouse S is determined in the same manner as in the case of one unit in FIG.
Next, it is determined which track is responsible for which unit route. In the example of FIG. 11, the unit route of the base KF → the warehouse Sf and the unit route of the base KE → the warehouse Se are determined as the charge of the first truck. On the other hand, the unit route of base KD⇒warehouse Sd is determined as the charge of the second truck.
Based on the positional relationship of these unit routes, the order of the unit routes is determined for each track. In this example, as shown in FIG. 11, for the first truck, the unit route of the base KF → the warehouse Sf is determined first, and the base KE → the warehouse Se is determined second. On the other hand, for the second truck, the base KD⇒the warehouse Sd is determined first.
These unit routes are connected to each track in the determined order, whereby the optimum route is determined for each track. That is, in this example, as described above, the first truck patrols from the base KF → the warehouse Sf → the base KE → the warehouse Se, and the second truck patrols from the base KD → the warehouse Sd. The route to be determined is determined as the optimum route.

  If there is no problem with the route determined in this way (for example, a service provider who manages the server 1) who desires route determination, a software button displaying “setting complete” at the lower right of FIG. Is clicked (pressed) with the mouse (input unit 16). Then, the tire deposit route determination process ends, and the actual route is determined.

In the above-described embodiment, the tire is used as the article and the truck is used as the moving body for transporting the article. However, these are only examples for explanation, and the invention is not particularly limited thereto.
For example, the article delivered by the user may be any article such as a figurine or furniture as long as the object of the invention is achieved.
In addition, for example, any transportation vehicle such as a motorcycle or a passenger car may be used as the moving body for transporting the article. In other words, the provider of this service adopts not only trucks but also other moving bodies, that is, moving bodies including airplanes and ships, etc., and determines the optimum route including not only land routes but also air routes and sea routes. It is good also as what can be performed. Furthermore, the provider of this service can determine the optimum route for any mobile object regardless of whether it is for business use or private use.

In the above-described embodiment, the route determining unit 82 determines the route and the usage information are not particularly defined, but any method can be used.
That is, any means or algorithm can be used within the scope for achieving the object of the present invention.

In the above-described embodiment, the optimum route is determined in consideration of only the base information and the warehouse information. However, the moving distance of the moving body may be further considered.
That is, the route determination unit 82 may determine a route along which each of the one or more moving bodies moves based on the distance between two points of each of the plurality of bases and the plurality of warehouses.
This makes it possible to determine the optimal route of the moving object and the user usage information with higher accuracy.

In the above-described embodiment, the optimum route is determined without considering the season and weather information. However, the season and weather information may be further considered.
This makes it possible to determine the optimal route of the moving object and the user usage information with higher accuracy.

In the above-described embodiment, the optimum route is determined without considering the information on whether or not to acquire the mobile body to be used and the information on the lending form (rent etc.). Information on the form (rent etc.) may be further considered.
This makes it possible to determine the optimum route of the moving object and the user usage information more practically.

In the above-described embodiment, the optimum route is determined without considering information on the number and capacity of moving bodies to be used. However, information on the number and capacity of moving bodies to be used may be further considered.
This makes it possible to determine the optimal route of the moving object and the user usage information with higher accuracy.

In the above-described embodiment (particularly, FIG. 8), “base name”, “period”, and “quantity” are employed as the base information. However, the present invention is not limited to this.
For example, various conditions such as the type of article to be deposited may be adopted as part of the base information.

In the above-described embodiment (particularly FIG. 9), information on “warehouse name”, “number of vacancy”, “postal code”, “address”, and “distance” is adopted as the warehouse information. It is not limited to.
For example, various conditions such as whether or not the temperature management of the warehouse S can be performed, distribution delivery date, distribution cost, past results (claims), and the like may be adopted as part of the base information.

In the above-described embodiment (particularly FIGS. 10 and 11), when determining the optimum route for optimum tire deposit, the optimum route is determined by using one or two trucks. It is not limited to.
In other words, the service provider may adopt an arbitrary number of tracks and determine the optimum route.
Furthermore, the provider of this service may adopt a track having an arbitrary attribute and determine the optimum route. Here, as the type of attribute, the load weight (4 tons, etc.), whether it is a truck owned by the provider of this service (in-house) or a truck of another company (registered in this service), etc. shall be adopted. Can do.

Moreover, in the above-mentioned embodiment, although the information processing apparatus of this invention was comprised by the server 1, the base terminal 2, the warehouse terminal 3, and the user terminal 4, it is only the illustration for achieving the objective of this invention. There is no particular limitation.
For example, a terminal of a mobile driver can be added to the configuration of the present invention as a mobile terminal.

  Each hardware configuration shown in FIG. 2 is merely an example for achieving the object of the present invention, and is not particularly limited.

  Further, the functional block diagram shown in FIG. 3 is merely an example, and is not particularly limited. That is, it is sufficient that the information processing apparatus has a function capable of executing the above-described series of processing as a whole, and what kind of functional block is used to realize this function is not particularly limited to the example of FIG. .

Further, the location of the functional block is not limited to that shown in FIG. For example, at least a part of the functional blocks on the server 1 side may be provided on either the base terminal 2, the warehouse terminal 3, or the user terminal 4 or vice versa.
One functional block may be constituted by hardware alone or in combination with software alone.

  Moreover, although the base terminal 2, the warehouse terminal 3, and the user terminal 4 were comprised with the smart phone in the above-mentioned embodiment, it can also be comprised not only with a smart phone but with arbitrary apparatuses including a tablet and a future new device. .

When the processing of each functional block is executed by software, a program constituting the software is installed on a computer or the like from a network or a recording medium.
The computer may be a computer incorporated in dedicated hardware. The computer may be a computer capable of executing various functions by installing various programs, for example, a general-purpose smartphone or personal computer other than a server.

  A recording medium including such a program is not only constituted by a removable medium distributed separately from the apparatus main body in order to provide the program to each user, but also provided to each user in a state of being incorporated in the apparatus main body in advance. It is composed of a provided recording medium or the like.

  In the present specification, the steps for describing the program recorded on the recording medium are not limited to the processing performed in time series according to the order, but may be performed in parallel or individually even if not necessarily performed in time series. The process to be executed is also included.

In summary, the information processing apparatus to which the present invention is applied only needs to have the following configuration, and can take various embodiments.
That is, an information processing apparatus to which the present invention is applied
A transportation that transports one or more articles via a route including at least one base and one warehouse among a plurality of bases that receive or deliver goods to the user and a plurality of warehouses that store the goods An information processing apparatus for planning a body schedule,
For each of the plurality of bases, base information acquisition means (for example, the base information management unit 50 in FIG. 3) for acquiring base information including the amount of articles in and out per predetermined unit time, and for each of the plurality of warehouses, a predetermined unit time. Warehouse information acquisition means (for example, the warehouse information management unit 70 in FIG. 3) for acquiring warehouse information including the empty space
Based on the base information for each of the plurality of bases and warehouse information for each of the plurality of warehouses, route determination means for determining a route along which each of the one or more moving bodies moves (for example, route determination in FIG. 3). Part 82),
An information processing apparatus provided with
By applying such an information processing device, in the article custody service, etc., the optimum route of the mobile body is sequentially determined, and as a result, the service for custody of the article from the user can be efficiently operated. Can be provided.

  DESCRIPTION OF SYMBOLS 1 ... Server 2, 2-1 thru | or 2-m ... Base terminal 3, 3-1 thru | or 3-n ... Warehouse terminal, 4, 4-1 thru | or 4-p ... User terminal 11 ... CPU, 40 ... CPU, 50 ... site information management unit, 51 ... site information transmission control unit, 60 ... CPU, 70 ... warehouse information management unit, 71 ... -Warehouse information transmission control unit, 80 ... Base information acquisition unit, 81 ... Warehouse information acquisition unit, 82 ... Route determination unit, 83 ... Usage information request acquisition unit, 84 ... Usage information notification , 102... CPU, 120... Usage information request reception unit, 121... Usage information request transmission control unit, 122... Usage information acquisition unit, 123.

Claims (6)

A transportation that transports one or more articles via a route including at least one base and one warehouse among a plurality of bases that receive or deliver goods to the user and a plurality of warehouses that store the goods An information processing apparatus for planning a body schedule,
Base information acquisition means for acquiring base information including the amount of articles in and out per predetermined unit time for each of the plurality of bases, and a warehouse for acquiring warehouse information including availability for a predetermined unit time for each of the plurality of warehouses Information acquisition means;
Route determining means for determining a route on which each of the one or more moving bodies moves based on the base information for each of the plurality of bases and warehouse information for each of the plurality of warehouses;
An information processing apparatus comprising: The route determining means includes
Based on the distance between two points of each of the plurality of bases and the plurality of warehouses;
The information processing apparatus according to claim 1. The route determining means includes
A function of determining a route on which each of the one or more moving objects moves based on a season;
The information processing apparatus according to claim 1 or 2, further comprising: The route determining means includes
A function of determining a route along which each of the one or more of the moving bodies moves based on the form of acquisition or lending of the moving bodies;
The information processing apparatus according to claim 1, further comprising: The route determining means includes
A function of determining a route on which each of the one or more mobiles moves based on the number and capacity of the mobiles;
The information processing apparatus according to any one of claims 1 to 4, further comprising: The user
From among the plurality of bases, a base for delivering the article and a base for receiving the article can be set independently of each other, and after the route is determined by the route determination means, Presenting means for presenting the user with information on locations that can still be picked up or delivered,
The information processing apparatus according to claim 1, further comprising:

Images