Computer-readable recording medium storing information processing program, information processing method and information processing device

Abstract

Disclosed are a computer-readable recording medium in which an information processing program is stored, an information processing method, and an information processing apparatus. A medium storing a program that causes a computer to perform the following processes: designating delivery of a parcel from a first site to a second site by a first moving body in a first plan; designating a third site, in which delivery of the parcel from the first site to the third site can be assigned to the second mobile body in the first plan, and in which delivery of the parcel from the third site to the second site can be assigned to the third mobile body in the first plan; and creating a second plan by replacing delivery of the parcel from the first site to the second site by the first moving body with delivery of the parcel from the first site to the third site by the second moving body and delivery of the parcel from the third site to the second site by the third moving body.

Description

Technical Field

[0001] The embodiments discussed herein relate to a non-transitory computer-readable recording medium storing an information processing program, an information processing method, and an information processing apparatus. Background Art

[0002] Distribution includes single transport in which a single package is handled by a moving body such as a single truck and relay transport in which a plurality of moving bodies handle a single package with a relay point as a boundary. For example, in the case of transporting a package from point A to point C via point B as a relay point, the same moving body transports the package between point A and point B and between point B and point C in a single transport. On the other hand, in relay transport, the moving body that transports the package between point A and point B is different from the moving body that transports the package between point B and point C. The introduction of relay transport has been initiated due to the demand for shortening working hours, etc.

[0003] In such relay transportation, when a mobile body is used to deliver packages between two stations including a relay point, there is a distribution planning problem for relay transportation, that is, which package is assigned to which mobile body to deliver all packages within a predetermined time. Usually, the solution space of the distribution planning problem is completely represented by the allocation combination of packages and mobile bodies. However, when relay transportation is considered, the solution space expands exponentially. Therefore, for the distribution planning problem of relay transportation, it is difficult to use a general method for solving the distribution planning problem. Therefore, in the distribution planning problem of relay transportation, as a realistic solution method, a heuristic method is often used for repeated processing to change and evaluate part of the delivery route while changing the part to be changed.

[0004] Furthermore, in the real world, there is a demand to reduce the total number of moving bodies in parcel transportation management, etc., for reasons such as a demand to shorten working hours or reduce costs. As a technology for service reduction, there is a service reduction determination technology that determines whether service reduction can be performed based on whether the allocation can satisfy a constraint condition such as a maximum load amount or a delivery deadline of a moving body, in a case where a parcel allocated to a service reduction target moving body is allocated to another moving body.

[0005] As technologies regarding relay transportation, there are the following technologies. For example, a technology has been proposed for storing candidates for transportation routes connecting relay stations that satisfy constraint conditions regarding logistics such as the number of connections or the connection method as transportation route patterns, and searching for routes with reference to the stored transportation route patterns when searching for transportation routes. In addition, a technology has been proposed for setting a plurality of relay station candidates, and determining a relay station using an index representing the degree of conditions included in the work before delivering a package at the relay station candidate. In addition, a technology has been proposed for performing a search by relaxing the conditions of edges connected to important nodes in a forward search from a source node and a backward search from a target node in the calculation of a moving cost in relay transportation.

[0006] Japanese Laid-Open Patent Publication No. 08-235263, Japanese Laid-Open Patent Publication No. 2022-138271, and US Patent Application Publication No. 2011 / 0251789 are disclosed as related arts. Summary of the invention

[0007] Technical issues

[0008] However, in a typical service reduction determination technique, a single transport that is a service reduction target is replaced with another single transport, and service reduction using relay transport is not considered. Although the use of relay points is considered when implementing service reduction, even if a typical service reduction determination technique is directly applied, it is difficult to appropriately determine service reduction through relay transport, and it is difficult to achieve efficient distribution.

[0009] Furthermore, any of the techniques for searching routes by storing transport route patterns that satisfy constraint conditions, the techniques for determining relay stations using indexes, and the techniques for performing searches by relaxing the conditions of edges connected to important nodes do not determine whether service reduction can be performed using relay transport. Therefore, with any of the techniques, it is difficult to appropriately determine service reduction by relay transport, and it is difficult to achieve efficient delivery.

[0010] The disclosed technology has been made in view of the above-mentioned contents, and an object of the disclosed technology is to provide an information processing program, an information processing method, and an information processing device that realize efficient delivery.

[0011] Solution to the problem

[0012] According to one aspect of the present embodiment, a non-transitory computer-readable recording medium is provided, which stores an information processing program for causing a computer to execute processing, the processing including: specifying that a package is delivered from a first station to a second station by a first mobile body in a first delivery plan; specifying a third station in addition to the first station and the second station, and wherein the delivery of the package from the first station to the third station can be assigned to the second mobile body included in the first delivery plan, and wherein the delivery of the package from the third station to the second station can be assigned to the third mobile body included in the first delivery plan; and creating a second delivery plan by replacing the delivery of the package from the first station to the second station by the first mobile body with the delivery of the package from the first station to the third station by the second mobile body and the delivery of the package from the third station to the second station by the third mobile body.

[0013] Advantageous Effects of the Invention

[0014] In one aspect, the present embodiment can achieve efficient delivery. BRIEF DESCRIPTION OF THE DRAWINGS

[0015] Figure 1 is a block diagram of an information processing apparatus according to an embodiment;

[0016] Figure 2 is a diagram for describing a relay candidate table;

[0017] Figure 3 is a diagram showing an overview of allocation determination processing performed by a service reduction processing unit;

[0018] Figure 4 (i.e., Figure 4A and Figure 4B ) is a flowchart of a service reduction determination process performed by an information processing device according to an embodiment;

[0019] Figure 5 is a diagram showing an example of a result of service reduction by an information processing device according to an embodiment;

[0020] Figure 6 is a diagram showing the effect of zooming out in the case of using a relay candidate table; and

[0021] Figure 7 It is a hardware configuration diagram of an information processing device. DETAILED DESCRIPTION

[0022] Hereinafter, embodiments of the information processing program, information processing method, and information processing device disclosed in the present application will be described in detail with reference to the accompanying drawings. Note that the following embodiments do not limit the information processing program, information processing method, and information processing device disclosed in the present application.

[0023] [First embodiment]

[0024] Figure 1 1 is a block diagram of an information processing device according to an embodiment. The information processing device 1 according to the present embodiment creates a new delivery plan in which the transportation of a package by a mobile body specified in a predetermined delivery plan is replaced with relay transportation by other mobile bodies, and the number of services of the mobile bodies is reduced. Hereinafter, the details of the information processing device 1 will be described. In the following description, a truck will be described as an example of a mobile body. Figure 1 As shown, the information processing apparatus 1 includes an input unit 11 , a service reduction processing unit 12 , an output unit 13 , a relay candidate table creation unit 14 , and a data storage unit 15 .

[0025] The input unit 11 includes a keyboard, a mouse, and the like. The user inputs information to the information processing device 1 using the input unit 11. For example, the user inputs station information 151, travel time information 152, executable solutions 153, and a package list 154 using the input unit 11, and the station information 151, travel time information 152, executable solutions 153, and package list 154 are stored in the data storage unit 15. In addition, the user inputs information about a truck to be a service reduction target using the input unit 11. Hereinafter, a truck to be a service reduction target is referred to as a "service reduction target truck."

[0026] In the station information 151, information about stations that are loading or unloading locations of trucks includes package pickup locations, delivery locations, package delivery and receiving locations, etc., which can be used when creating a delivery plan. The station may also include gas stations, truck stops, etc. that can be used as relay stations in addition to offices. For example, in the case of Japanese delivery, stations throughout Japan are registered in the station information 151.

[0027] The general travel time between the stations is registered in the travel time information 152. The travel time is calculated based on, for example, an average value of past statistical information, etc. The travel time for all combinations of two stations is registered in the travel time information 152.

[0028] Executable solution 153 is an example of a delivery plan that can be executed and can be appropriately derived according to the availability of trucks, package volume, etc., and is a delivery plan for completing the delivery of all given packages. For executable solution 153, an actual operational delivery plan can be used.

[0029] The package list 154 is information associated with information about a truck that delivers the package in the executable solution 153 and two stations that are the start and end points of the delivery by the truck for all packages to be delivered. That is, in the package list 154, all packages to be delivered between specific stations by a specific truck are registered in association with information about the specific truck and the specific two stations.

[0030] The data storage unit 15 is a storage device for storing data. The data storage unit 15 stores and saves the station information 151 , the travel time information 152 , the executable solution 153 , and the package list 154 input by the user using the input unit 11 .

[0031] Before creating a new delivery plan due to service reduction, the relay candidate table creation unit 14 performs the following processing in advance: The relay candidate table creation unit 14 acquires the station information 151 and the travel time information 152 from the data storage unit 15 . Figure 2 is a diagram used to describe the relay candidate table. Figure 2 As shown, the relay candidate table creation unit 14 creates the relay candidate table 140 based on the station information 151 and the travel time information 152 .

[0032] Hereinafter, a specific example of creating the relay candidate table 140 by the relay candidate table creating unit 14 will be described. Here, a site set including all sites registered in the site information 151 is set to N. Then, any two sites among the sites are represented as site i and site j∈N.

[0033] The relay candidate table creation unit 14 acquires two sites i and j from the site information 151. Then, the relay candidate table creation unit 14 sets the site i as the starting point and the site j as the end point, and selects one site k∈N from the site information 151 to form a route from the site i to the site j with the site k as a relay.

[0034] Next, the relay candidate table creation unit 14 acquires Mij, which is the travel time from the station i to the station j, from the travel time information 152. Furthermore, the relay candidate table creation unit 14 acquires Mik, which is the travel time from the station i to the station k, and Mkj, which is the travel time from the station k to the station j, from the travel time information 152. Then, the relay candidate table creation unit 14 calculates the difference between the travel time in the case where relay transportation is not performed and the travel time in the case where relay transportation is performed as Mik+Mkj-Mij.

[0035] Then, in the case where the calculated difference is equal to or less than a predetermined relay point candidate threshold, the relay candidate table creation unit 14 sets the site k as a relay point candidate between the sites including the sites i and j. That is, if the time required for relay transportation using the site k as a relay point is not equal to or greater than the relay point candidate threshold compared to the time required for a single transportation from the site i to the site j, the relay candidate table creation unit 14 sets the site k as a relay point candidate.

[0036] As the relay point candidate threshold increases, the number of sites that can be set as relay point candidates increases, and the degree of freedom of the delivery plan increases. However, there is a possibility that the delivery time increases. Conversely, as the relay point candidate threshold decreases, the number of sites that can be set as relay point candidates decreases, and the degree of freedom of the delivery plan decreases. However, the delivery time can be suppressed to be shorter.

[0037] The relay candidate table creation unit 14 determines whether all stations except stations i and j are set as relay point candidates between stations including stations i and j. Then, the relay candidate table creation unit 14 sorts the stations set as relay point candidates between stations including stations i and j in ascending order of travel time, and registers the stations in the relay candidate table 140.

[0038] The relay candidate table creation unit 14 extracts relay point candidates as described above for all combinations of two sites included in the sites registered in the site information 151, and registers the relay point candidates in the relay candidate table 140. Figure 2 The relay candidate table 140 shown here. Here, the relay candidate table creation unit 14 may use the relay point candidates when the site i is set as the start point and the site j is set as the end point as the relay point candidates when the site j is set as the start point and the site i is set as the end point.

[0039] For example, in the case of delivery in Japan, the relay candidate table creation unit 14 sets a combination such as "from Tokyo to Osaka" or "from Yokohama to Hakodate" as Figure 2 The combination of the starting point and the ending point shown is registered in the relay candidate table 140. Then, the relay candidate table creation unit 14 extracts Aichi, Shizuoka, etc. as relay point candidates for "from Tokyo to Osaka", and sets Aichi, Shizuoka, etc. as Figure 2 The relay point candidates shown are registered in the relay candidate table 140. In addition, the relay candidate table creation unit 14 extracts Mito, Sendai, etc. as relay point candidates for "from Yokohama to Hakodate", and sets Mito, Sendai, etc. as Figure 2The relay point candidates shown are registered in the relay candidate table 140 .

[0040] Thereafter, the relay candidate table creation unit 14 outputs the created relay candidate table 140 to the service reduction processing unit 12. However, the relay candidate table creation unit 14 may store the created relay candidate table 140 in the data storage unit 15, and the service reduction processing unit 12 may acquire the relay candidate table 140 stored in the data storage unit 15.

[0041] Here, the relay point that can distribute the packages of the service reduction target truck to other trucks corresponds to an example of "third station", and the relay point candidates correspond to an example of "candidates of the third station". That is, the relay candidate table creation unit 14 lists the candidates of the third station.

[0042] return Figure 1 , the description will continue. The service reduction processing unit 12 receives an input of designation of a service reduction target truck from the input unit 11. In addition, the service reduction processing unit 12 acquires an executable solution 153 and a package list 154 from the data storage unit 15. In addition, the service reduction processing unit 12 receives an input of a relay candidate table 140 from the relay candidate table creation unit 14.

[0043] Next, the service reduction processing unit 12 acquires a target package list, which is a list of packages to be processed by the service reduction target truck in the executable solution 153, from the package list 154. Here, the executable solution 153 corresponds to an example of the "first delivery plan". In addition, the service reduction target truck corresponds to an example of the "first moving body". In addition, the station set as the starting point for delivering the package by the service reduction target truck corresponds to the "first station", and the station set as the end point corresponds to the "second station". That is, the service reduction processing unit 12 specifies that the package is delivered from the first station to the second station by the first moving body in the first delivery plan.

[0044] Then, the service reduction processing unit 12 performs allocation determination processing to determine whether each package registered in the target package list can be allocated to other trucks using relay transportation. Hereinafter, packages determined to be rearranged to other trucks are described as "rearranged packages".

[0045] Figure 3 2 is a diagram showing an overview of the allocation determination process performed by the service reduction processing unit. Figure 3 A case is shown where the truck 200 that performs delivery from the station i to the station j as the original route of the package is a service reduction target truck.

[0046] For example, the service reduction processing unit 12 obtains the relay point candidate L between the stations i and j from the relay candidate table 140.ij [0] to L ij [α]. Then, for example, the service reduction processing unit 12 performs a ij [0] to L ij The relay point candidate L in [α] ij [1], specifies the candidate relay point L to which the relocated packages can be assigned from site i ij [1] of the delivery truck 201. In addition, the service reduction processing unit 12 specifies the relay point candidate L to which the relocated package can be assigned. ij [1] Truck 202 delivering to station j.

[0047] Then, the service reduction processing unit 12 determines to use the relay point candidate L ij [1] The rearranged packages are allocated to trucks 201 and 202 as relay points, and new package routes are determined for the rearranged packages. In the case where the rearranged packages can be allocated to the other two trucks via the relay points for all packages to be delivered by the service reduction target truck, the service reduction processing unit 12 determines that the number of service reduction target trucks can be reduced.

[0048] Hereinafter, the allocation determination processing performed by the service reduction processing unit 12 will be described in more detail. The service reduction processing unit 12 acquires a relay point candidate set between two stations where the rearranged packages are delivered by the service reduction target truck from the relay candidate table 140. Then, the service reduction processing unit 12 selects a relay point candidate from the relay point candidate set.

[0049] Next, the service reduction processing unit 12 divides the route between the two stations for delivering the rearranged package into a first half route from the station serving as the starting point of the route to the selected relay point candidate and a second half route from the selected relay point candidate to the station serving as the end point of the route. Hereinafter, the service reduction processing unit 12 processes the delivery of the rearranged package in the first half route and the delivery of the rearranged package in the second half route as independent deliveries. That is, it can be said that the service reduction processing unit 12 processes the rearranged package in the first half route and the rearranged package in the second half route as different packages.

[0050] Next, the service reduction processing unit 12 generates a truck list in the first half route, which is a list of allocation candidate trucks as candidates to which the delivery of the rearranged packages in the first half route is allocated. In addition, the service reduction processing unit 12 generates a truck list in the second half route, which is a list of allocation candidate trucks in the second half route. The service reduction processing unit 12 sorts the order of the trucks so that the truck to be allocated with priority is set higher in both the truck list of the first half route and the truck list of the second half route.

[0051] Here, an example of a method for extracting candidate trucks for allocation and for prioritizing candidate trucks for allocation will be described. The service reduction processing unit 12 extracts trucks that pass through a station used as a starting point for delivery of rearranged packages in the first half route or the second half route in the executable solution 153 and a station used as a terminal for delivery of rearranged packages as a first group of trucks that can be candidates for allocation from the trucks included in the executable solution 153. That is, the first group of trucks is a group of trucks that can allocate rearranged packages without adding routes. In addition, the service reduction processing unit 12 extracts a truck that passes through one of the stations used as a starting point for delivery of rearranged packages or a station used as a terminal for delivery of rearranged packages in the executable solution 153 from the trucks included in the executable solution 153 as a second group of trucks that can be candidates for allocation. That is, the second group of trucks is a group of trucks that can allocate rearranged packages by adding routes.

[0052] Then, the service reduction processing unit 12 gives priority to assigning the rearranged packages to the first group of trucks over assigning the rearranged packages to the second group of trucks. Furthermore, the service reduction processing unit 12 gives priority to trucks in the first group of trucks that have a short travel time between a station serving as a starting point for delivery of the rearranged packages and a station serving as a terminal for delivery of the rearranged packages. Furthermore, with respect to the second group of trucks, in the case of adding a station to pass through the station serving as a starting point and the station serving as a terminal, the service reduction processing unit 12 adds the station to form the shortest route, and gives priority to trucks whose travel time increases as little as possible after adding the station.

[0053] For example, in the case of delivering the rearranged package from Tokyo to Osaka, the service reduction processing unit 12 extracts the trucks including the route from Tokyo to Osaka in the executable solution 153 as the first group of trucks. Furthermore, the service reduction processing unit 12 arranges the trucks from the beginning of the list in ascending order of the travel time between Tokyo and Osaka among the trucks including the route from Tokyo to Osaka in the executable solution 153.

[0054] Next, the service reduction processing unit 12 extracts the trucks including the route through Tokyo or Osaka in the executable solution 153 as the second group of trucks. Then, the service reduction processing unit 12 adds one of Tokyo or Osaka and each second group of trucks does not pass through the site to form the shortest route in the case of adding the site. For example, in the case where there is a truck traveling from Tokyo to Kyoto via Nagoya (Nagoya), in the case where the route from Tokyo to Kyoto via Nagoya and then via Osaka is the shortest route through Osaka, the service reduction processing unit 12 adds the Osaka site between Nagoya and Kyoto and changes the route. In addition, the service reduction processing unit 12 arranges the trucks after the first group of trucks in the list in ascending order of the increase in the driving time between the route before the change and the route after the change. For example, in the case where the Osaka site is added between Nagoya and Kyoto, the service reduction processing unit 12 calculates the increase in driving time by subtracting the driving time from Nagoya to Kyoto from the driving time from Nagoya to Kyoto via Osaka.

[0055] As described above, the service reduction processing unit 12 extracts and prioritizes the candidate trucks for allocation, and generates a list of trucks in the first half route and the second half route. Next, the service reduction processing unit 12 selects trucks one by one from the beginning of the list of trucks in the first half route. Then, the service reduction processing unit 12 determines whether the rearranged package can be allocated to the selected truck in the first half route.

[0056] Here, the service reduction processing unit 12 determines whether the rearranged package can be distributed based on a predetermined condition. The predetermined condition is, for example, a delivery time range or a loading amount of a truck. The delivery time range is determined when there is no inconsistency between the first half route and the second half route. For example, the service reduction processing unit 12 can determine the delivery time range in the first half route and the delivery time range in the second half route based on the average value of the delivery time range from the station used as the starting point of the rearranged package to the station used as the end point. Specifically, in the case where the delivery time range from the station used as the starting point to the station used as the end point is 9:00 to 24:00, the service reduction processing unit 12 can set the delivery time range of the first half route to 9:00 to 16:30, and set the delivery time range of the second half route to 16:30 to 24:00. However, the setting method of the time range is an example, and the service reduction processing unit 12 can also use other determination methods as long as it can be determined that there is no inconsistency between the delivery time of the first half route and the delivery time of the second half route.

[0057] In the case where it is difficult to assign the rearranged package to the selected truck in the first half route, the service reduction processing unit 12 selects the next truck in the first half route from the list of trucks in the first half route. Thereafter, the service reduction processing unit 12 repeats the determination as to whether the rearranged package in the first half route can be assigned to the selected truck.

[0058] On the other hand, in the case where the rearranged packages can be assigned to the selected trucks in the first half of the route, the service reduction processing unit 12 selects trucks one by one from the beginning of the truck list in the second half of the route.

[0059] Then, similarly to the case of the first half route, the service reduction processing unit 12 determines whether the rearranged packages can be allocated to the selected truck in the second half route. In the case where the rearranged packages can be allocated to the selected truck in the second half route, the service reduction processing unit 12 determines that the rearranged packages of the service reduction target truck can be allocated to the truck for which allocation is determined for each of the first half route and the second half route.

[0060] On the other hand, in the case where it is difficult to allocate the rearranged package to the selected truck in the second half of the route, the service reduction processing unit 12 repeatedly specifies a truck to which the rearranged package can be allocated from the trucks registered in the truck list in the second half of the route. In the case where the rearranged package cannot be allocated to any truck in the truck list in the second half of the route, the service reduction processing unit 12 selects the next truck from the truck list in the first half of the route to allocate the rearranged package, and accordingly determines to allocate the rearranged package to the truck in the second half of the route.

[0061] In the case where the trucks for the first half route and the second half route of the rearranged packages to which the service reduction target truck is assigned are not found, the service reduction processing unit 12 determines that it is difficult to reduce the service quantity of the service reduction target truck. Then, the service reduction processing unit 12 notifies the output unit 13 that it is difficult to reduce the service quantity of the service reduction target truck, and ends the allocation determination processing.

[0062] On the other hand, when the trucks for the first and second half routes of the rearranged package to which the service reduction target truck is assigned are found, the service reduction processing unit 12 determines to perform rearranged package assignment on the next package in the package list 154 .

[0063] In the case where all the packages registered in the target package list can be allocated to other trucks, the service reduction processing unit 12 determines to reduce the service quantity of the service reduction target truck. Then, a distribution plan is created to distribute the delivery of each package delivered by the service reduction target truck to other trucks determined as the distribution destination. Thereafter, the service reduction processing unit 12 notifies the output unit 13 of the new distribution plan in which the service quantity of the service reduction target truck can be reduced and the quantity of the service reduction target truck is reduced.

[0064] Here, the delivery of the rearranged packages in the first half of the route corresponds to an example of “delivery of packages from the first station to the third station.” Furthermore, the delivery of the rearranged packages in the second half of the route corresponds to an example of “delivery of packages from the third station to the second station.” Furthermore, the trucks assigned with the rearranged packages in the first half of the route correspond to an example of “the second moving body,” and the trucks assigned with the rearranged packages in the second half of the route correspond to an example of “the third moving body.”

[0065] That is, the service reduction processing unit 12 specifies a third station, wherein the delivery of the package from the first station to the third station can be assigned to the second moving body included in the first delivery plan and the delivery of the package from the third station to the second station can be assigned to the third moving body included in the first delivery plan. In addition, the service reduction processing unit 12 creates a second delivery plan by replacing the delivery of the package from the first station to the second station by the first moving body with the delivery of the package from the first station to the third station by the second moving body and the delivery of the package from the third station to the second station by the third moving body.

[0066] In addition, the service reduction processing unit 12 according to the present embodiment uses a second moving body including at least the first station or the third station or a combination of the first station and the third station in the delivery route in the first delivery plan, and a third moving body including at least the third station or the second station or a combination of the third station and the second station in the delivery route in the first delivery plan to specify the third station.

[0067] return Figure 1 , the description will continue. The output unit 13 receives a notification indicating that it is difficult to reduce the service quantity of the service reduction target truck or a notification indicating that the service quantity of the service reduction target truck can be reduced and a new delivery plan in which the number of the service reduction target trucks is reduced from the service reduction processing unit 12. Then, the output unit 13 notifies the user of the service reduction determination result by outputting and displaying a notification indicating that it is difficult to reduce the service quantity of the service reduction target truck or a notification indicating that the service quantity of the service reduction target truck can be reduced and a new delivery plan in which the number of the service reduction target trucks is reduced on a monitor or the like.

[0068] Figure 4 (i.e., Figure 4A and Figure 4B ) is a flowchart of a service reduction determination process performed by an information processing device according to an embodiment. Next, the flow of a service reduction determination process performed by an information processing device 1 according to an embodiment will be described with reference to FIG.

[0069] The service reduction processing unit 12 receives input of information about a truck to be a service reduction target from the input unit 11 (step S1). Then, the service reduction processing unit 12 acquires the executable solution 153 and the package list 154 from the data storage unit 15. In addition, the service reduction processing unit 12 receives input of the relay candidate table 140 from the relay candidate table creation unit 14.

[0070] Next, the service reduction processing unit 12 acquires a target package list which is a list of packages handled by the service reduction target truck from the package list 154 (step S2).

[0071] Next, the service reduction processing unit 12 selects an unselected package from the packages registered in the target package list as a package to be rearranged (step S3).

[0072] The service reduction processing unit 12 acquires a set of relay point candidates between two sites where the parcel to be rearranged is delivered by the service reduction target truck from the relay candidate table 140 (step S4).

[0073] Next, the service reduction processing unit 12 selects one relay point candidate from the unselected relay point candidates included in the relay point candidate set in the sorted order (step S5).

[0074] Next, the service reduction processing unit 12 divides the route between the two stations delivering the rearranged packages into a first half route and a second half route, and divides the rearranged packages into packages in the first half route and packages in the second half route (step S6).

[0075] Next, the service reduction processing unit 12 generates a truck list in the first half route, which is a list of allocation candidate trucks that are candidates for the allocation destination of the rearranged packages with respect to the first half route. In addition, the service reduction processing unit 12 generates a truck list in the second half route, which is a list of allocation candidate trucks with respect to the second half route (step S7). Here, the service reduction processing unit 12 sorts the trucks so that the trucks with priority allocation are set higher in both the truck list of the first half route and the truck list of the second half route.

[0076] Next, the service reduction processing unit 12 selects an unselected truck according to the sort order of the truck list in the first half of the route (step S8).

[0077] Then, the service reduction processing unit 12 determines whether the rearranged packages in the first half of the route can be assigned to the selected truck based on the previously given conditions (step S9).

[0078] In the case where it is difficult to allocate the rearranged packages in the first half of the route to the selected truck (step S9: No), the service reduction processing unit 12 determines whether the determination of whether the rearranged packages in the first half of the route can be allocated is completed for all trucks in the truck list in the first half of the route (step S10). In the case where there are remaining trucks in the truck list in the first half of the route for which it has not been determined whether the rearranged packages in the first half of the route can be allocated (step S10: No), the service reduction processing unit 12 returns to step S8.

[0079] On the other hand, in the case where determination as to whether the rearranged package in the first half route can be allocated is finished for all trucks in the truck list in the first half route (step S10 : Yes), the service reduction processing unit 12 proceeds to step S14 .

[0080] On the other hand, in the case where the rearranged packages in the first half route can be assigned to the selected truck (step S9: Yes), the service reduction processing unit 12 selects an unselected truck in the sorted order of the truck list in the second half route (step S11).

[0081] Then, the service reduction processing unit 12 determines whether the rearranged packages in the second half of the route can be assigned to the selected truck based on the previously given conditions (step S12).

[0082] In the case where it is difficult to allocate the rearranged packages in the second half of the route to the selected truck (step S12: No), the service reduction processing unit 12 determines whether the determination of whether the rearranged packages in the second half of the route can be allocated is completed for all trucks in the truck list in the second half of the route (step S13). In the case where there are remaining trucks in the truck list in the second half of the route for which it has not been determined whether the rearranged packages in the second half of the route can be allocated (step S13: No), the service reduction processing unit 12 returns to step S11.

[0083] On the other hand, in the case where the determination as to whether the rearranged package in the second half route can be allocated is finished for all trucks in the truck list in the second half route (step S13: Yes), the service reduction processing unit 12 proceeds to step S14.

[0084] Thereafter, the service reduction processing unit 12 determines whether the determination of whether each package of the service reduction target truck can be allocated is completed for all relay points (step S14). In the case where there are remaining relay points for which it has not been determined whether each package of the service reduction target truck can be allocated (step S14: No), the service reduction processing unit 12 returns to step S5.

[0085] On the other hand, in the case where the determination of whether to allocate each package of the service reduction target truck is completed for all relay points (step S14: Yes), the service reduction processing unit 12 determines that it is difficult to reduce the service quantity of the service reduction target truck (step S15). Then, the service reduction processing unit 12 proceeds to step S18.

[0086] On the other hand, if the rearranged packages in the second half of the route can be allocated to the selected truck (step S12: Yes), the service reduction processing unit 12 determines whether the determination on the allocation to other trucks is completed for all packages in the target package list (step S16). If there are remaining packages in the target package list whose allocation to other trucks has not yet been determined (step S16: No), the service reduction processing unit 12 returns to step S3.

[0087] On the other hand, in the case where the determination on the allocation to other trucks is completed for all the packages in the target package list (step S16: Yes), the service reduction processing unit 12 determines to reduce the service number of the service reduction target truck. In addition, the service reduction processing unit 12 allocates each package delivered by the service reduction target truck to the other trucks determined as the delivery destination, and determines a new delivery path (step S17). Then, the service reduction processing unit 12 creates a delivery plan using the new delivery path obtained by reducing the number of service reduction target trucks.

[0088] Thereafter, the service reduction processing unit 12 notifies the user of the determination result indicating whether the service quantity of the service reduction target truck can be reduced (step S18) via the output unit 13. In the case of being notified that the service quantity of the service reduction target truck can be reduced, the service reduction processing unit 12 provides the user with a delivery plan using a new delivery path obtained by reducing the quantity of the service reduction target truck.

[0089] Here, in the above description, the information processing device 1 achieves service reduction by replacing a single transport of a package using a single route by a service reduction target truck with relay transport that performs delivery using two trucks and two routes. By summarizing this, the information processing device 1 can replace a single transport of a package using a single route by a service reduction target truck with relay transport that performs delivery using multiple trucks (three or more trucks) and using multiple routes.

[0090] For example, the information processing device 1 may perform allocation to three or more trucks and divide a single route into a plurality of routes by recursively repeating the process for creating a relay delivery route by dividing a single route into two routes described above.

[0091] A specific example will be illustrated and described. The function for dividing a single route for delivering package α from site i to site j into a route for delivering package β from site i to site k and a route for delivering package β from site i to site k is set to g(α,i,j)=(β,i,k)(γ,k,j). Here, a case where one route in a single route is divided into three routes using three trucks will be described. The information processing device 1 performs the processing represented by g(α,i,j)=(β,i,k)(γ,k,j), and divides one route into two routes using two trucks. Next, the information processing device 1 can divide the original single route into three routes using three trucks by performing the processing represented by the function g again on one of the packages β or γ.

[0092] In this way, when considering the service reduction of a single transportation of a service reduction target truck, the information processing device 1 can replace the single transportation with relay transportation using one or more and an appropriate number of relay points, and can create a new delivery route by determining whether the service quantity of the service reduction target truck can be reduced.

[0093] Figure 5 is a diagram showing an example of a result of service reduction by an information processing device according to an embodiment. Here, Figure 5 Results of a case where numerical experiments are performed on problem settings #1 to #5 in order to transfer packages handled by a service reduction target truck to other trucks to perform service reduction and reduce the total number of used trucks are shown.

[0094] In the case where the number of target trucks in the executable solution in problem setting #1 is 137 and the information processing device 1 according to the present embodiment is used, the number of services reduced is 56. On the other hand, in the method of replacing with a single transport, the number of services reduced is 11. In addition, in the case where the number of target trucks in the executable solution in problem setting #2 is 101 and the information processing device 1 according to the present embodiment is used, the number of services reduced is 26. On the other hand, in the method of replacing with a single transport, the number of services reduced is six. In addition, in the case where the number of target trucks in the executable solution in problem setting #3 is 77 and the information processing device 1 according to the present embodiment is used, the number of services reduced is 20. On the other hand, in the method of replacing with a single transport, the number of services reduced is 20. In addition, in the case where the number of target trucks in the executable solution in problem setting #4 is 104 and the information processing device 1 according to the present embodiment is used, the number of services reduced is 50. On the other hand, in the method of replacing with a single transport, the number of services reduced is 32. Furthermore, in the case where the number of target trucks in the executable solution in problem setting #5 is 178 and the information processing device 1 according to the present embodiment is used, the reduced number of services is 13. On the other hand, in the method of replacing with a single transport, the reduced number of services is two.

[0095] In this way, in the case of distributing packages delivered by a service reduction target truck to other trucks, it can be confirmed that the performance of the information processing device 1 that performs distribution using relay transport is equal to or higher than the performance under the same service reduction condition compared to the method of replacing it with a single transport.

[0096] Figure 6 is a diagram showing the effect of reduction when the relay candidate table is used. Figure 6 In the example, using relay point candidates indicates a result in a case where the relay candidate table 140 is used, and not using indicates a result in a case where the relay candidate table 140 is not used. Figure 6 The time in represents the elapsed time until the service reduction is finally determined. In this case, use Figure 5 Numerical experiments were performed on problem settings #1 to #5 in .

[0097] In problem setting #1, the number of services reduced when the relay candidate table 140 is used is 56, and the time is 641 seconds, while the number of services reduced when the relay candidate table 140 is not used is 56, and the time is 1283 seconds. In addition, in problem setting #2, the number of services reduced when the relay candidate table 140 is used is 26, and the time is 133 seconds, while the number of services reduced when the relay candidate table 140 is not used is 26, and the time is 351 seconds. In addition, in problem setting #3, the number of services reduced when the relay candidate table 140 is used is 20, and the time is 80 seconds, while the number of services reduced when the relay candidate table 140 is not used is 21, and the time is 477 seconds. In addition, in problem setting #4, the number of services reduced when the relay candidate table 140 is used is 50, and the time is 301 seconds, while the number of services reduced when the relay candidate table 140 is not used is 69, and the time is 530 seconds. Furthermore, in problem setting #5, the number of service reductions in the case of using the relay candidate table 140 is 13 and the time is 272 seconds, while the number of service reductions in the case of not using the relay candidate table 140 is 15 and the time is 1064 seconds.

[0098] In this way, in the case where the parcels delivered by the service reduction target truck are allocated to relay transportation and the service quantity is reduced, the information processing device 1 basically achieves substantially equal service reduction regardless of whether the relay candidate table 140 is used. However, as in problem setting #4, by using the relay candidate table 140, there are cases where a certain degree of difference in the service reduction quantity is generated. Then, by using the relay candidate table 140, the information processing device 1 is able to reduce the solution time to about 1 / 6 to 1 / 2 while ensuring the same or higher performance regarding service reduction.

[0099] As described above, the information processing device according to the present embodiment divides a single delivery route of a package to be delivered by a predetermined truck into two or more delivery routes, and allocates the delivery of the package in each of the corresponding delivery routes to other trucks to perform replacement with relay transportation. Therefore, the service reduction of relay transportation can be easily and appropriately determined, and efficient delivery can be achieved.

[0100] In addition, in the present embodiment, although the single transport is replaced with the relay transport and the service reduction is performed, for some packages of the truck with a large load of packages, the packages can be distributed by replacing the single transport with the relay transport of other trucks. By such use, the information processing device according to the present embodiment can help balance the maximum load of the truck.

[0101] (Hardware Configuration)

[0102] Figure 7 is a hardware configuration diagram of an information processing device. Figure 7 An example of a hardware configuration for realizing each function of the information processing apparatus 1 is described.

[0103] like Figure 7 As shown, for example, the information processing device 1 includes a central processing unit (CPU) 91, a memory 92, a hard disk 93, an input device 94, an output device 95, and a network interface 96. The CPU 91 is coupled to the memory 92, the hard disk 93, the input device 94, the output device 95, and the network interface 96 via a bus.

[0104] The input device 94 is, for example, a keyboard, a mouse, etc. The input device 94 implements Figure 1 The output device 95 is, for example, a monitor. The output device 95 implements Figure 1 The function of the output unit 13 is shown.

[0105] The network interface 96 is an interface for communication between the information processing device 1 and an external device.

[0106] The hard disk 93 is an auxiliary storage device. Figure 1 The functions of the data storage unit 15 are shown. In addition, the hard disk 93 stores various programs including a program for realizing the functions of the service reduction processing unit 12 and the relay candidate table creation unit 14.

[0107] The memory 92 is a main storage device. For example, a dynamic random access memory (DRAM) can be used as the memory 92.

[0108] The CPU 91 reads various programs from the hard disk 93 and loads the programs into the memory 92 to execute the programs. Figure 1 The functions of the service reduction processing unit 12 and the relay candidate table creation unit 14 are shown.

Claims

1. A non-transitory computer-readable recording medium storing an information processing program for causing a computer to execute a process, the process comprising: Specifying a first delivery plan in which a first moving body delivers a package from a first station to a second station; specifying a third station other than the first station and the second station, wherein delivery of the package from the first station to the third station can be assigned to a second moving body included in the first delivery plan, and wherein delivery of the package from the third station to the second station can be assigned to a third moving body included in the first delivery plan; as well as A second delivery plan is created by replacing delivery of the package from the first station to the second station by the first moving body with delivery of the package from the first station to the third station by the second moving body and delivery of the package from the third station to the second station by the third moving body.

2. The non-transitory computer-readable recording medium of claim 1, the processing further comprising: generating a list indicating candidates for the third site, wherein: The process of specifying the third station includes the following process: specifying, from the candidates registered in the list, a third station in which the delivery of the package from the first station to the third station can be assigned to the second moving body and the delivery of the package from the third station to the second station can be assigned to the third moving body.

3. The non-transitory computer-readable recording medium according to claim 1, wherein: In the case where there are a plurality of parcels to be delivered by the first moving body, Designating the third site includes designating the third site for each package, and Creating the second delivery plan replaces the delivery of each package.

4. The non-transitory computer-readable recording medium according to claim 1, wherein: Specify the third site to use the following: the second moving body, wherein the delivery route of the second moving body in the first delivery plan includes at least the first station or the third station or a combination of the first station and the third station, and The third moving body includes at least the third station or the second station or a combination of the third station and the second station in the delivery route of the third moving body in the first delivery plan.

5. An information processing method implemented by a computer, the information processing method comprising: Specifying a first delivery plan in which a first moving body delivers a package from a first station to a second station; specifying a third station other than the first station and the second station, wherein delivery of the package from the first station to the third station can be assigned to a second moving body included in the first delivery plan, and wherein delivery of the package from the third station to the second station can be assigned to a third moving body included in the first delivery plan; as well as A second delivery plan is created by replacing delivery of the package from the first station to the second station by the first moving body with delivery of the package from the first station to the third station by the second moving body and delivery of the package from the third station to the second station by the third moving body.

6. An information processing device, comprising: A service reduction processing unit, the service reduction processing unit being configured to perform a process, the process comprising: Specifying a first delivery plan in which a first moving body delivers a package from a first station to a second station; specifying a third station other than the first station and the second station, wherein delivery of the package from the first station to the third station can be assigned to a second moving body included in the first delivery plan, and wherein delivery of the package from the third station to the second station can be assigned to a third moving body included in the first delivery plan; and creating a second delivery plan by replacing delivery of the package from the first station to the second station by the first moving body with delivery of the package from the first station to the third station by the second moving body and delivery of the package from the third station to the second station by the third moving body, and An output unit is configured to output the second delivery plan generated by the service reduction processing unit.

Images