Information processing program, information processing method and information processing device

Abstract

To reduce costs.SOLUTION: An information processing device 100 acquires one or more pieces of first route information 110. The information processing equipment 100 generates second route information 120 based upon the one or more acquired pieces of first route information 110 to set a route information group including at least some of the one or more acquired pieces of first route information 110 and the generated second route information 120. The second route information 120 is different from any of the one or more pieces of first route information 110. The information processing device 100 creates, based upon the set route information group, a plan 130 of this time defining a route in which a plurality of moving bodies each visit two or more nodes of a plurality of nodes so that the first route information 110 is used preferentially to the second route information 120.SELECTED DRAWING: Figure 1

Description

[Technical field]

[0001] The present invention relates to an information processing program, an information processing method, and an information processing device. [Background technology]

[0002] Conventionally, in the logistics industry, a driver of a delivery vehicle performs delivery work every day according to route information that specifies what type of delivery vehicle will visit which one or more points, in what order, and when, and what parcels will be collected or delivered at each point. For example, a driver of a delivery vehicle may wish to perform delivery work according to fixed route information throughout a certain period of time, rather than route information that changes from day to day.

[0003] Prior art includes, for example, a technique for comparing fuel consumption or CO2 emissions in sailing between a location as a ship's location and a departure port as a transportation request, and formulating an optimal ship allocation plan. Also, for example, a technique for deriving candidate routes for shuttle service based on one or more selected past non-shuttle service requests. Also, for example, a technique for displaying a route for equipment from a desired starting point to a desired final destination. Also, for example, a technique for providing at least a portion of a route from a first location to a second location to a delivery mechanism. [Prior art documents] [Patent documents]

[0004] [Patent Document 1] JP 2020-024751 A [Patent Document 2] Special Publication No. 2020-522064 [Patent Document 3] US Patent Application Publication No. 2016 / 0335593 [Patent Document 4] US Patent Application Publication No. 2014 / 0358703 Summary of the Invention [Problem to be solved by the invention]

[0005] However, the conventional technology has a problem of increasing the cost of delivery work. The cost of delivery work includes, for example, monetary cost, time cost, equipment cost, and human cost. For example, with only fixed route information, it is difficult to efficiently collect or deliver parcels in accordance with changes in the amount of parcels collected or delivered each day, and this problem is likely to lead to an increase in the cost of delivery work.

[0006] In one aspect, the present invention aims to reduce costs. [Means for solving the problem]

[0007] According to one embodiment, an information processing program, an information processing method, and an information processing device are proposed that acquire one or more pieces of first route information each defining at least a first route among a first route that travels around any two or more nodes of a plurality of nodes, a time limit for travelling around at least one of the two or more nodes, and a type of moving body that travels around the two or more nodes, and generate second route information different from any of the one or more pieces of first route information based on the one or more first route information, and defining at least a second route among a second route that travels around any two or more nodes of the plurality of nodes, a time limit for travelling around at least one of the two or more nodes, and a type of moving body that travels around the two or more nodes, thereby setting a route information group including at least any of the one or more pieces of first route information and the second route information, and creating a plan for each of a plurality of moving bodies defining a route that travels around any two or more nodes of the plurality of nodes based on the route information group, so that the first route information is used in preference to the second route information. Effect of the Invention

[0008] According to one aspect, it is possible to reduce costs. [Brief description of the drawings]

[0009] [Figure 1] FIG. 1 is a diagram illustrating an example of an information processing method according to an embodiment. [Diagram 2] FIG. 2 is an explanatory diagram illustrating an example of an information processing system 200. As shown in FIG. [Diagram 3] FIG. 3 is a block diagram showing an example of a hardware configuration of the information processing device 100. As shown in FIG. [Figure 4] FIG. 4 is a block diagram showing an example of a functional configuration of the information processing device 100. As shown in FIG. [Diagram 5] FIG. 5 is a block diagram showing a specific example of the functional configuration of the information processing device 100. As shown in FIG. [Figure 6] FIG. 6 is an explanatory diagram (part 1) showing an example of the operation of the information processing device 100. [Figure 7] FIG. 7 is an explanatory diagram (part 2) showing an example of the operation of the information processing device 100. [Figure 8] FIG. 8 is an explanatory diagram (part 1) showing an example of the effect. [Figure 9] FIG. 9 is an explanatory diagram (part 2) showing one example of the effect. [Figure 10] FIG. 10 is a flowchart illustrating an example of an overall processing procedure. [Figure 11] FIG. 11 is a flowchart illustrating an example of an update process procedure. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0010] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, an embodiment of an information processing program, an information processing method, and an information processing device according to the present invention will be described in detail with reference to the drawings.

[0011] (An example of an information processing method according to an embodiment) 1 is an explanatory diagram showing an example of an information processing method according to an embodiment. The information processing device 100 is a computer for reducing costs involved in delivery work. The information processing device 100 is, for example, a server or a PC (Personal Computer).

[0012] A delivery operation, in the field of logistics, is an operation of collecting or delivering one or more packages to one or more locations among a plurality of locations using a delivery vehicle. Conventionally, a driver drives a delivery vehicle and performs daily delivery operations according to route information that specifies which type of delivery vehicle will visit which one or more locations among a plurality of locations, in what order and when, and which packages will be collected or delivered at each location.

[0013] The multiple locations include, for example, locations that are fixed throughout a certain period of time from which packages are picked up or delivered on a daily basis. The fixed locations are, for example, convenience stores, supermarkets, or warehouses. The multiple locations include, for example, temporary locations from which packages are picked up or delivered that vary from day to day. The temporary locations are, for example, residences. The multiple locations may vary from day to day.

[0014] Here, for example, a driver may wish to perform delivery work according to fixed route information throughout a certain period of time, rather than different route information for each day. Specifically, a driver may wish to reduce physical or psychological workload by driving the same type of delivery vehicle along the same route every day to perform delivery work.

[0015] However, conventionally, there is a problem in that the cost of the delivery work increases. The cost of the delivery work includes, for example, monetary cost, time cost, equipment cost, and human cost.

[0016] For example, it is possible that multiple drivers each drive a delivery vehicle and perform delivery work according to only fixed route information every day. In this case, it is difficult to efficiently collect or deliver packages in accordance with changes in the daily collection or delivery volume of packages, and there is a problem that the cost of the delivery work is likely to increase.

[0017] Specifically, when the amount of collected or delivered parcels on a certain day is relatively small, a situation may occur in which one of the delivery vehicles travels between some of the locations without carrying any parcels, which may result in a decrease in delivery efficiency. Also, specifically, when the amount of collected or delivered parcels on a certain day is relatively small, parcels that can be loaded collectively onto one delivery vehicle may end up being distributed and loaded onto two delivery vehicles, which may result in a decrease in delivery efficiency. Also, specifically, when the amount of collected or delivered parcels on a certain day is relatively large, it may be that delivery work is not completed appropriately if only fixed route information is followed every day.

[0018] For example, when there is a temporary location specific to a certain day for collecting or delivering packages, it is considered that the delivery work will not be completed appropriately if only the daily fixed route information is followed. Here, for example, when temporary route information different from the daily fixed route information is generated so as to collect or deliver packages to a temporary location, there is a problem that it is difficult to appropriately generate the temporary route information while suppressing an increase in the cost of the delivery work.

[0019] Therefore, in this embodiment, an information processing method that can reduce costs will be described. For example, according to this embodiment, it is possible to reduce costs involved in delivery work while utilizing fixed route information every day.

[0020] In Fig. 1, an information processing device 100 stores a graph 101 including a plurality of nodes each representing a different location, with the nodes connected by edges. The edges indicate that a mobile object can move between the locations represented by the different nodes. The mobile object is, for example, a delivery vehicle. The delivery vehicle is, for example, a large truck, a medium-sized truck, or a small truck. The delivery vehicle may be, for example, a passenger car or a motorcycle.

[0021] The multiple nodes include a node representing a point corresponding to a logistics base called a depot. A logistics base can be, for example, a starting point or an arrival point of a mobile object. The multiple nodes include a node representing a point other than a logistics base that corresponds to a route destination for picking up or delivering a package. A route destination can be, for example, a relay point of the mobile object.

[0022] The information processing device 100 receives a processing request requesting the creation of a plan that specifies a route for each of a plurality of moving objects to visit two or more of a plurality of nodes. The plan is information for enabling the delivery operation to be performed. The plan includes a plurality of pieces of route information to be used when performing the delivery operation.

[0023] A delivery operation involves multiple mobile objects each visiting two or more of a plurality of nodes to collect or deliver parcels. The delivery operation includes delivery work for each driver. The route information specifies, for example, at least a route for visiting two or more of a plurality of nodes, a time limit for visiting at least one of the two or more nodes, and a type of mobile object for visiting the two or more nodes.

[0024] The information processing device 100, for example, acquires a processing request by receiving it from another computer. The information processing device 100 may acquire a processing request by accepting input of the processing request based on an operational input by a user, for example. In response to the processing request, the information processing device 100 creates a current plan 130 as shown below. The current plan 130 is, for example, a plan for making it possible to carry out the delivery work on the day.

[0025] (1-1) The information processing device 100 acquires one or more pieces of first route information 110. The first route information 110 specifies at least the first route among, for example, a first route that travels around two or more nodes among a plurality of nodes, a time limit for travelling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes. The time limit is, for example, a deadline for the moving object to arrive at the node or a deadline for the moving object to depart from the node. The type of moving object is, for example, a large truck, a medium truck, or a small truck. The first route information 110 is, for example, fixed route information that is preferred by the driver. The first route information 110 is, specifically, route information that has been used in past plans. The first route information 110 specifies, specifically, a route that the moving object travels around in a delivery operation, indicates a time limit for the moving object to travel around the route, and a condition for the moving object that travels around, and specifies how the driver will carry out the delivery operation.

[0026] (1-2) The information processing device 100 generates second route information 120 based on the acquired one or more pieces of first route information 110, thereby setting a route information group including at least one of the acquired one or more pieces of first route information 110 and the generated second route information 120. The second route information 120 is route information different from any one or more pieces of first route information 110. The second route information 120 specifies at least the second route among, for example, a second route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes.

[0027] The second route information 120 is specifically route information that defines at least a second route that is the same as a first route defined by any of the one or more pieces of first route information 110 and is different from any of the one or more pieces of first route information 110. The second route information 120 may be specifically route information that defines at least a second route that is different from any of the first routes defined by each of the one or more pieces of first route information 110 and is different from any of the one or more pieces of first route information 110. The second route information 120 specifically specifies a route that a mobile object travels in a delivery operation, indicates a time limit when the mobile object travels the route, and indicates conditions for the traveling mobile object, and defines how the driver performs the delivery operation.

[0028] (1-3) The information processing device 100 creates the current plan 130 based on the set route information group so as to preferentially use the first route information 110 over the second route information 120. The current plan 130 specifies a route for each of a plurality of moving objects to travel around any two or more nodes among a plurality of nodes.

[0029] The information processing device 100, for example, sets a weight for cost when using the second route information 120 to a value greater than the weight for cost when using the first route information 110, and then sets an objective function that calculates a weighted sum of costs. The information processing device 100, for example, sets a route selection problem for selecting route information to be used for the current plan 130 from a group of route information so as to minimize the value of the set objective function. The information processing device 100 creates the current plan 130 by, for example, solving the set route selection problem.

[0030] Thereby, the information processing device 100 can create the current plan 130 and can execute the current delivery operation. At this time, the information processing device 100 can create the current plan 130 so that the first route information 110 is used preferentially over the second route information 120. The information processing device 100 can improve the probability that the driver executes the delivery operation according to the first route information 110, not the second route information 120. Therefore, the information processing device 100 can reduce the workload on the driver. In addition, the information processing device 100 can create the current plan 130 so that the second route information 120 is used in addition to the first route information 110, taking into account the weighted sum of the costs. Therefore, the information processing device 100 can reduce the cost of the delivery operation.

[0031] Here, the case where the functions of the information processing device 100 are realized by a single computer has been described, but the present invention is not limited to this. For example, the functions of the information processing device 100 may be realized by cooperation of a plurality of computers. For example, the functions of the information processing device 100 may be realized on the cloud.

[0032] (An example of the information processing system 200) Next, an example of an information processing system 200 to which the information processing device 100 shown in FIG. 1 is applied will be described with reference to FIG.

[0033] 2 is an explanatory diagram showing an example of an information processing system 200. In FIG. 2, the information processing system 200 includes an information processing device 100 and one or more client devices 201.

[0034] In the information processing system 200, the information processing device 100 and the client device 201 are connected via a wired or wireless network 210. The network 210 is, for example, a local area network (LAN), a wide area network (WAN), or the Internet.

[0035] The information processing device 100 is a computer for creating a plan to enable delivery operations. The information processing device 100 stores a graph including a plurality of nodes each representing a different location and in which the nodes are connected by edges. For example, the information processing device 100 receives and stores the graph from the client device 201. The information processing device 100 may store the graph by accepting input of the graph based on, for example, an operational input by a user.

[0036] The information processing device 100 acquires a processing request requesting creation of a plan that specifies a route for each of a plurality of moving objects to visit any two or more of a plurality of nodes. The plan is, for example, information that enables a delivery operation to be performed. For example, the information processing device 100 acquires the processing request by receiving it from the client device 201. For example, the information processing device 100 may acquire the processing request by accepting input of the processing request based on an operational input by a user.

[0037] The information processing device 100 acquires one or more pieces of fixed route information. The fixed route information corresponds to the first route information described above. The fixed route information specifies at least a fixed route among, for example, a fixed route that travels around two or more nodes among a plurality of nodes, a time limit for travelling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes. The time limit is, for example, a deadline for the moving object to arrive at the node, or a deadline for the moving object to depart from the node. The type of moving object is, for example, a large truck, a medium truck, or a small truck. The fixed route is, for example, a route that the driver has traveled by driving a truck in the past. For this reason, the fixed route is, for example, a route that is predicted to impose a small physical or mental workload on the driver when traveling. The fixed route may be a desired route specified by the driver. The fixed route information is, for example, route information that specifies a fixed route that is preferred by the driver. Specifically, the fixed route information is route information that has been used in past plans. Specifically, the fixed route information specifies a route along which a mobile object travels in a delivery operation, indicates time restrictions for the mobile object to travel along the route, and conditions for the mobile object to travel, and specifies how the driver will carry out the delivery operation. The information processing device 100 acquires one or more pieces of fixed route information by receiving the information from the client device 201, for example. The information processing device 100 may acquire one or more pieces of fixed route information by accepting input of one or more pieces of fixed route information based on an operational input by a user, for example.

[0038] The information processing device 100 generates derived route information or temporary route information based on the acquired one or more fixed route information, thereby setting a route information group including at least one of the acquired one or more fixed route information and the generated derived route information or temporary route information. The derived route information is route information different from any of the one or more fixed route information. The derived route information specifies at least a derived route among, for example, a derived route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of a moving object that travels around the two or more nodes. The derived route information is specifically route information different from any of the one or more fixed route information that specifies at least a derived route that is the same as a fixed route specified by any of the one or more fixed route information. The derived route information specifically specifies a route that a moving object travels around in a delivery operation, indicates a time limit when the moving object travels around the route, and indicates conditions for the traveling moving object, and specifies how the driver performs the delivery operation.

[0039] The temporary route information is route information different from any of one or more fixed route information. The temporary route information specifies at least a temporary route among, for example, a temporary route that travels around two or more nodes among a plurality of nodes, a time limit for travelling around at least one of the two or more nodes, and a type of a moving object that travels around the two or more nodes. The temporary route information is specifically route information that specifies at least a temporary route different from any of the fixed routes specified by each of the one or more fixed route information, and is different from any of the one or more fixed route information. Specifically, the temporary route information specifies a route that a moving object travels around in a delivery operation, indicates a time limit for the moving object to travel around the route, and indicates conditions for the moving object that travels around, and specifies how the driver performs the delivery operation.

[0040] The information processing device 100 prepares, for example, an empty route information group. The information processing device 100 acquires a plurality of initial route information and registers it in the route information group. The initial route information specifies at least an initial route among, for example, an initial route that travels around two or more nodes among a plurality of nodes, a time limit for travelling around at least one of the two or more nodes, and a type of a moving object that travels around the two or more nodes. Specifically, the initial route information specifies an initial route that departs from a node representing a logistics base, passes through one of nodes representing relay points, and arrives at a node representing a logistics base. Specifically, the initial route information specifies a route that a moving object travels around in a delivery operation, indicates a time limit for the moving object to travel around the route, and indicates conditions for the traveling moving object, and specifies how the driver will carry out the delivery operation. The information processing device 100 acquires, for example, initial route information corresponding to each of the plurality of points other than the logistics base. Specifically, the information processing device 100 acquires a plurality of pieces of initial route information by generating initial route information corresponding to each of the plurality of points other than the logistics base, among the plurality of points, based on the graph.

[0041] The information processing device 100 sets a final route information set by repeatedly performing a series of processes of setting a reduced cost minimization problem for an optimal solution of a dual problem of a relaxed problem of a route selection problem for a route information set and updating the route information set. The final route information set preferably includes, for example, at least one of one or more fixed route information, and derived route information or temporary route information.

[0042] The series of processes includes a process of setting a reduced cost optimization problem for an optimal solution of a dual problem of a relaxed problem of a route selection problem for a current route information set. The series of processes includes a process of updating the current route information set by adding fixed route information with a negative reduced cost to the current route information set based on the set reduced cost minimization problem, for example, if there is fixed route information with a negative reduced cost among one or more fixed route information.

[0043] The series of processes includes, for example, a process of updating the current route information group by generating derived route information with a negative reduced cost and adding it to the current route information group if there is no fixed route information with a negative reduced cost based on the set reduced cost minimization problem.The series of processes includes, for example, a process of updating the current route information group by generating temporary route information with a negative reduced cost and adding it to the current route information group if there is no derived route information with a negative reduced cost based on the set reduced cost minimization problem.

[0044] The information processing device 100 creates a current plan based on the set final route information group so that fixed route information is used with priority over derived route information and temporary route information. The information processing device 100 creates a current plan based on the set final route information group so that fixed route information is used with priority over derived route information and derived route information is used with priority over temporary route information.

[0045] For example, the information processing device 100 sets the weight for the cost when the derived route information is used to a value larger than the weight for the cost when the fixed route information is used. For example, the information processing device 100 sets the weight for the cost when the temporary route information is used to a value larger than the weight for the cost when the derived route information is used. For example, the information processing device 100 sets an objective function that calculates a weighted sum of costs.

[0046] The information processing device 100 sets a route selection problem for selecting route information to be used for the current plan from a final group of route information so as to minimize the value of a set objective function, for example. The information processing device 100 creates the current plan by, for example, solving the set route selection problem. The information processing device 100 transmits the created current plan to the client device 201. The information processing device 100 is, for example, a server or a PC.

[0047] The client device 201 is a computer for supporting delivery operations. The client device 201 generates a graph based on a user's operational input and transmits it to the information processing device 100. The client device 201 generates one or more pieces of fixed route information based on, for example, a user's operational input and transmits it to the information processing device 100.

[0048] The client device 201 generates a processing request based on, for example, an operational input by a user, and transmits the request to the information processing device 100. The client device 201 receives the current plan from the information processing device 100. The client device 201 outputs the current plan so that the user can refer to it. The client device 201 is, for example, a PC, a tablet terminal, or a smartphone.

[0049] Here, the case where the information processing device 100 is a computer different from the client device 201 has been described, but this is not limited thereto. For example, the information processing device 100 may have a function as the client device 201 and may also operate as the client device 201.

[0050] (Example of hardware configuration of information processing device 100) Next, an example of the hardware configuration of the information processing device 100 will be described with reference to FIG.

[0051] Fig. 3 is a block diagram showing an example of a hardware configuration of the information processing device 100. In Fig. 3, the information processing device 100 has a CPU (Central Processing Unit) 301, a memory 302, a network I / F (Interface) 303, a recording medium I / F 304, and a recording medium 305. In addition, each component is connected to each other via a bus 300.

[0052] Here, the CPU 301 is responsible for the overall control of the information processing device 100. The memory 302 has, for example, a read only memory (ROM), a random access memory (RAM), and a flash ROM. Specifically, for example, the flash ROM and the ROM store various programs, and the RAM is used as a work area for the CPU 301. The programs stored in the memory 302 are loaded into the CPU 301, causing the CPU 301 to execute the coded processes.

[0053] The network I / F 303 is connected to the network 210 through a communication line, and is connected to other computers via the network 210. The network I / F 303 manages an internal interface with the network 210, and controls input and output of data from other computers. The network I / F 303 is, for example, a modem or a LAN adapter.

[0054] The recording medium I / F 304 controls reading / writing data from / to the recording medium 305 under the control of the CPU 301. The recording medium I / F 304 is, for example, a disk drive, a solid state drive (SSD), a universal serial bus (USB) port, etc. The recording medium 305 is a non-volatile memory that stores data written under the control of the recording medium I / F 304. The recording medium 305 is, for example, a disk, a semiconductor memory, a USB memory, etc. The recording medium 305 may be detachable from the information processing device 100.

[0055] In addition to the above-mentioned components, the information processing device 100 may have, for example, a keyboard, a mouse, a display, a printer, a scanner, a microphone, a speaker, etc. Furthermore, the information processing device 100 may have a plurality of recording medium I / Fs 304 and recording media 305. Furthermore, the information processing device 100 may not have the recording medium I / Fs 304 and the recording media 305.

[0056] (Example of Hardware Configuration of Client Device 201) Specifically, an example of the hardware configuration of the client device 201 is similar to the example of the hardware configuration of the information processing device 100 shown in FIG. 3, and therefore a description thereof will be omitted.

[0057] (An example of a functional configuration of the information processing device 100) Next, an example of a functional configuration of the information processing device 100 will be described with reference to FIG.

[0058] 4 is a block diagram showing an example of a functional configuration of the information processing device 100. The information processing device 100 includes a storage unit 400, an acquisition unit 401, a setting unit 402, a creation unit 403, and an output unit 404.

[0059] The storage unit 400 is realized by, for example, a storage area such as the memory 302 or the recording medium 305 shown in Fig. 3. In the following, a case where the storage unit 400 is included in the information processing device 100 will be described, but this is not limiting. For example, the storage unit 400 may be included in a device different from the information processing device 100, and the stored contents of the storage unit 400 may be accessible from the information processing device 100.

[0060] The acquiring unit 401 to the output unit 404 function as an example of a control unit. Specifically, the acquiring unit 401 to the output unit 404 realize their functions by, for example, causing the CPU 301 to execute a program stored in a storage area such as the memory 302 or the recording medium 305 shown in Fig. 3, or by the network I / F 303. The processing results of each functional unit are stored in, for example, a storage area such as the memory 302 or the recording medium 305 shown in Fig. 3.

[0061] The storage unit 400 stores various information that is referred to or updated in the processing of each functional unit. The storage unit 400 stores, for example, a graph including a plurality of nodes each representing a different location and connecting the nodes with edges. The graph represents an area in which a delivery operation is performed. The delivery operation includes a delivery operation by a driver in which each of a plurality of mobile objects travels to any two or more of the plurality of nodes to pick up or deliver packages.

[0062] An edge indicates that a mobile object can move between points represented by different nodes. The mobile object is, for example, a delivery vehicle. The delivery vehicle is, for example, a large truck, a medium truck, or a small truck. The delivery vehicle may be, for example, a passenger car or a motorcycle. The multiple nodes include a node representing a point corresponding to a logistics base called a depot. The logistics base may be, for example, a starting point or an arrival point of the mobile object. The multiple nodes include a node representing a point other than the logistics base that corresponds to a destination to which a package is to be collected or delivered. The destination may be, for example, a relay point of the mobile object. The graph is acquired by, for example, the acquisition unit 401.

[0063] The storage unit 400 stores, for example, a group of route information. The group of route information includes, for example, one or more pieces of route information. The route information can be used when performing a delivery operation. The route information specifies at least a route among, for example, a route that travels around two or more nodes among a plurality of nodes, a time limit for travelling around at least one of the two or more nodes, and a type of mobile object that travels around the two or more nodes. The time limit is, for example, a limit on the time at which the mobile object arrives at the node, or a limit on the time at which the mobile object departs from the node. The limit on the time at which the mobile object arrives at the node indicates, for example, when the mobile object should arrive at the node before, or when the mobile object should arrive at the node after. The limit on the time at which the mobile object departs from the node indicates, for example, when the mobile object should depart from the node before, or when the mobile object should depart from the node after. The type of mobile object is, for example, a large truck, a medium-sized truck, or a small truck. The route information can be included in a plan that enables, for example, a delivery operation. The plan specifies a route for each of a plurality of moving objects to visit two or more of a plurality of nodes by, for example, one or more pieces of route information. The route information group is updated by, for example, the acquisition unit 401, the setting unit 402, or the creation unit 403.

[0064] The storage unit 400 stores, for example, one or more pieces of first route information. The first route information specifies at least the first route among, for example, a first route that travels around two or more nodes among a plurality of nodes, a time limit for travelling around at least one of the two or more nodes, and a type of a moving object that travels around the two or more nodes. The first route information is, for example, fixed route information that is preferred by the driver. The fixed route information is, specifically, route information that is considered to impose a relatively small workload on the driver when performing delivery work according to the route information. The fixed route information is, specifically, route information that the driver has referred to in the past and is familiar with. The fixed route information may be, specifically, route information specified by the driver. The first route information specifies, specifically, a route that the moving object travels around in delivery work, indicates a time limit for the moving object to travel around the route, and a condition for the moving object that travels around, and specifies how the driver performs the delivery work. The first route information may be added to the route information group. The first route information is, for example, acquired by the acquisition unit 401.

[0065] The acquisition unit 401 acquires various information used for processing by each functional unit. The acquisition unit 401 stores the acquired various information in the storage unit 400 or outputs it to each functional unit. The acquisition unit 401 may also output the various information stored in the storage unit 400 to each functional unit. The acquisition unit 401 acquires various information based on, for example, an operation input by a user. The acquisition unit 401 may receive various information from, for example, a device different from the information processing device 100.

[0066] The acquiring unit 401 acquires, for example, a graph. Specifically, the acquiring unit 401 acquires the graph by receiving it from another computer. The other computer is, for example, the client device 201. Specifically, the acquiring unit 401 may acquire the graph by accepting an input of the graph based on an operation input by a user.

[0067] The acquisition unit 401 acquires, for example, a processing request for creating a current plan. Specifically, the acquisition unit 401 acquires the processing request by receiving it from another computer. The other computer is, for example, the client device 201. Specifically, the acquisition unit 401 may acquire the processing request by accepting input of the processing request based on an operation input by a user.

[0068] The acquisition unit 401 acquires, for example, one or more pieces of first route information. Specifically, the acquisition unit 401 acquires the one or more pieces of first route information by receiving the one or more pieces of first route information from another computer. The other computer is, for example, the client device 201. Specifically, the acquisition unit 401 may acquire the one or more pieces of first route information by accepting an input of the one or more pieces of first route information based on an operation input by a user.

[0069] For example, when the setting unit 402 does not generate one or more pieces of initial route information, the acquisition unit 401 acquires one or more pieces of initial route information and adds them to the route information group, thereby updating the route information group to an initial state. The initial state is, for example, a state including one or more initial routes to enable the setting unit 402 to set a reduced cost minimization problem and enable the creation unit 403 to solve a route selection problem. The initial route information specifies at least an initial route among, for example, an initial route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of mobile object that travels around the two or more nodes. Specifically, the initial route information specifies an initial route that departs from a node representing a logistics base, passes through one of nodes representing relay points, and arrives at a node representing a logistics base. Specifically, the initial route information specifies a route that a mobile object travels around in a delivery operation, indicates a time limit when the mobile object travels around the route, and indicates conditions for the mobile object that travels around, and specifies how the driver will carry out the delivery operation. The one or more pieces of initial route information are, for example, initial route information corresponding to each of the multiple points other than the logistics base. More specifically, the acquiring unit 401 acquires the one or more pieces of initial route information by receiving it from another computer. The other computer is, for example, the client device 201. More specifically, the acquiring unit 401 may acquire the one or more pieces of initial route information by accepting an input of the one or more pieces of initial route information based on an operation input by a user.

[0070] The acquiring unit 401 may receive a start trigger for starting processing of any of the functional units. The start trigger may be, for example, a predetermined operational input by a user. The start trigger may be, for example, reception of predetermined information from another computer. The start trigger may be, for example, output of predetermined information by any of the functional units. Specifically, the acquiring unit 401 receives the acquisition of a processing request as a start trigger for starting processing by the setting unit 402 and the creating unit 403.

[0071] The setting unit 402 generates second route information different from any of the one or more pieces of first route information based on the one or more pieces of acquired first route information, thereby setting a final route information group including at least one of the one or more pieces of first route information and the second route information. The second route information specifies at least the second route among, for example, a second route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes.

[0072] The second route information is specifically derived route information. The derived route information is, for example, route information that defines at least a second route that is the same as a first route defined by any of the one or more pieces of first route information and is different from any of the one or more pieces of first route information. The second route information may be specifically temporary route information. The temporary route information is, for example, route information that defines at least a second route that is different from any of the first routes defined by each of the one or more pieces of first route information and is different from any of the one or more pieces of first route information. The second route information specifically specifies a route along which a mobile object travels in a delivery operation, indicates time restrictions for the mobile object when traveling along the route, and indicates conditions for the traveling mobile object, and specifies how the driver performs the delivery operation.

[0073] For example, when the acquisition unit 401 does not acquire one or more pieces of initial route information, the setting unit 402 acquires the one or more pieces of initial route information by generating the one or more pieces of initial route information and adds the information to the route information group, thereby updating the route information group to an initial state. Specifically, the setting unit 402 acquires one or more pieces of initial route information by generating, for each of a plurality of points other than the logistics base, based on the graph, with reference to the storage unit 400. This enables the setting unit 402 to set a reduced cost minimization problem, and enables the creation unit 403 to add, to the route information group, one or more minimum initial routes that enable the route selection problem to be solved.

[0074] The setting unit 402 sets a reduced cost minimization problem for an optimal solution of a dual problem of a relaxed problem of a route selection problem for a route information group, and updates the current route information group. The setter 402 sets a final route information group by repeatedly performing a series of processes until a predetermined condition is satisfied. The final route information group preferably includes, for example, at least one of one or more first route information and second route information. The predetermined condition is, for example, that both the first route information with a negative reduced cost and the second route information with a negative reduced cost no longer exist. The predetermined condition may be, for example, that a series of processes is performed a predetermined number of times. The predetermined condition may be, for example, that a predetermined time has elapsed since the series of processes was first performed.

[0075] The setting unit 402 sets, for example, a reduced cost minimization problem for an optimal solution of a dual problem of a relaxed problem of a route selection problem for the current route information group. The setting unit 402 searches for first route information having a negative reduced cost among one or more acquired first route information based on, for example, the set reduced cost minimization problem. For example, if there is first route information having a negative reduced cost as a result of searching for first route information, the setting unit 402 updates the current route information group by adding the first route information to the current route information group.

[0076] For example, if the first route information with a negative reduced cost is not present as a result of searching for the first route information, the setting unit 402 searches for second route information with a negative reduced cost based on the set reduced cost minimization problem to determine whether the second route information exists. For example, if the second route information with a negative reduced cost exists, the setting unit 402 generates second route information with a negative reduced cost and adds it to the current route information set, thereby updating the current route information set.

[0077] Specifically, if there is no first route information with a negative reduced cost, the setting unit 402 searches for derived route information that is the second route information with a negative reduced cost based on the set reduced cost minimization problem, thereby determining whether or not the derived route information exists. The derived route information is, for example, route information that specifies at least a second route that is the same as a first route specified by any one or more pieces of first route information. For example, if there is derived route information, the setting unit 402 generates the derived route information as the second route information with a negative reduced cost, and adds it to the current route information group, thereby updating the current route information group.

[0078] Specifically, if the derived route information does not exist, the setting unit 402 searches for temporary route information that is the second route information with a negative reduced cost based on the set reduced cost minimization problem, thereby determining whether or not the temporary route information exists. The temporary route information is, for example, route information that defines at least a second route different from any of the first routes defined by each of one or more pieces of first route information. For example, if the temporary route information exists, the setting unit 402 generates the temporary route information as the second route information with a negative reduced cost, and adds it to the current route information group, thereby updating the current route information group. In this way, the information processing device 100 can set a final route information group including at least one of one or more pieces of first route information and the second route information.

[0079] The creation unit 403 creates the current plan based on the final route information group set by the setting unit 402 so as to use the first route information in preference to the second route information. For example, the creation unit 403 sets a weight for the cost when the second route information is used to a value greater than the weight for the cost when the first route information is used, and then sets an objective function that represents a weighted sum of the costs. The weight is, for example, designated in advance by a user. The creation unit 403 creates the current plan by solving a route selection problem that selects route information to be used for the current plan from the final route information group so as to minimize a value represented by the objective function.

[0080] The creation unit 403 may create the current plan based on the final route information group set by the setting unit 402, for example, so that fixed route information is used with priority over derived route information and derived route information is used with priority over temporary route information. Specifically, the creation unit 403 sets a weight for cost when derived route information is used to a value greater than a weight for cost when fixed route information is used. Specifically, the creation unit 403 sets a weight for cost when temporary route information is used to a value greater than a weight for cost when derived route information is used. Specifically, the creation unit 403 sets an objective function that calculates a weighted sum of costs based on the set weight. Specifically, the creation unit 403 creates the current plan by solving a route selection problem of selecting route information to be used for the current plan from the final route information group so as to minimize a value represented by the objective function.

[0081] This allows the creation unit 403 to create the current plan and make it possible to carry out the current delivery operation. At this time, the creation unit 403 can create the current plan so that the first route information is used preferentially over the second route information, and the probability that the driver will carry out the delivery operation according to the first route information rather than the second route information can be improved. Therefore, the creation unit 403 can reduce the workload on the driver. In addition, the creation unit 403 can create the current plan so that the second route information is used in addition to the first route information, taking into account the weighted sum of costs. Therefore, the creation unit 403 can reduce the cost of the delivery operation.

[0082] The output unit 404 outputs the processing result of at least one of the functional units. The output format is, for example, display on a display, printout on a printer, transmission to an external device via the network I / F 303, or storage in a storage area such as the memory 302 or the recording medium 305. In this way, the output unit 404 can notify the user of the processing result of at least one of the functional units, thereby improving the convenience of the information processing device 100.

[0083] The output unit 404 outputs, for example, the current plan created by the creation unit 403. Specifically, the output unit 404 transmits the current plan created by the creation unit 403 to another computer. The other computer is, for example, the client device 201. Specifically, the output unit 404 may output the current plan created by the creation unit 403 so that the user can refer to it. In this way, the output unit 404 can make the current plan created by the creation unit 403 available externally.

[0084] (Specific example of functional configuration of information processing device 100) Next, a specific example of the functional configuration of the information processing device 100 will be described with reference to FIG.

[0085] Fig. 5 is a block diagram showing a specific example of the functional configuration of the information processing device 100. In Fig. 5, it is desired that the information processing device 100 creates a plan for appropriately collecting or delivering a plurality of packages via a plurality of moving objects by solving a route selection problem for selecting one or more pieces of route information from a group of route information so as to satisfy various preconditions shown below. The route information indicates at least a route, a visiting time of each node on the route, and a type of truck. Here, the moving object is, for example, a large truck, a medium-sized truck, or a small truck.

[0086] One of the assumptions is, for example, that a truck departing from a node representing a logistics base travels around several nodes and returns to the node representing the logistics base. The nodes that the truck travels around are, for example, nodes representing convenience stores, supermarkets, warehouses, etc. The visiting order in which the truck travels around two or more nodes is the route. One of the assumptions is, for example, that there are multiple types of trucks with different capacities and costs. One of the assumptions is, for example, that the nodes that the truck can travel around depend on the type of truck. One of the assumptions is, for example, that there is an upper limit on the number of trucks that can be used for each type of truck. One of the assumptions is, for example, that each truck collects or delivers parcels at the nodes that it has traveled around. Any truck may collect and deliver parcels at any of the same nodes.

[0087] One of the assumptions is that, for example, for each package, there exists a node that collects the package and a node that delivers the package. The package is transported, for example, from a node that represents a logistics base to a node that represents a non-logistics base. The package is transported, for example, from a node that represents a non-logistics base to a node that represents a logistics base. The package is transported, for example, from a node that represents a non-logistics base to a node that represents a logistics base.

[0088] One of the assumptions is, for example, that a size is set for each piece of luggage. One of the assumptions is, for example, that luggage is loaded onto each truck within the capacity of the truck. One of the assumptions is, for example, that a priority is set for each piece of luggage. One of the assumptions is, for example, that each truck preferentially loads luggage with a higher priority. One of the assumptions is, for example, that whether or not each piece of luggage can be divided is set for each piece of luggage.

[0089] One of the assumptions is that, for example, a collection time frame and a delivery time frame are set for each package. The collection time frame [a, b] indicates that if a truck arrives at a node to collect a package before time a, the truck will wait until time a and collect the package by time b. The delivery time frame [c, d] indicates that if a truck arrives at a node to deliver a package before time c, the truck will wait until time c and deliver the package by time d.

[0090] One of the assumptions is, for example, that a truck cannot move between nodes that are not connected by an edge. One of the assumptions is, for example, that an upper limit on the total travel time of a truck is set for each truck type. One of the assumptions is, for example, that a truck always performs at least one of pickup and delivery at a node that does not represent a logistics base. One of the assumptions is, for example, that for each truck type, the delivery cost for a truck is defined by a weighted sum based on a step function, a fixed cost, and a travel time. The step function depends on the travel time of the truck.

[0091] One of the assumptions is, for example, that delivery or collection to the same node is performed every day. Another of the assumptions is, for example, that one or more pieces of fixed route information that are preferable for the driver are set. The fixed route information represents at least the route, the visiting time of each node on the route, and the type of truck. Each piece of fixed route information may be selected in the route selection problem. One of the assumptions is, for example, that when fixed route information is not selected in the route selection problem, it is preferable to select derived route information different from the fixed route information, which represents at least the same route as the fixed route information.

[0092] Specifically, it is desirable for the information processing device 100 to create a plan that can assign route information to each of multiple trucks to satisfy various assumptions, properly collect or deliver all packages, and minimize total delivery costs.

[0093] Here, the information processing device 100 includes a VRP (Vehicle Routing Problem) data storage unit 511, an initial route generation unit 512, a solution parameter storage unit 513, a route generation unit 514, and a route set storage unit 515. The information processing device 100 further includes a route selection problem solving unit 516 and an output data generation unit 517. The route generation unit 514 includes a dual problem solving unit 521, a reduced cost minimization problem solving unit 522, and a termination determination unit 523.

[0094] The VRP data storage unit 511 acquires and stores VPR data from the input data 501. The VPR data defines the various assumptions described above. The VRP data includes, for example, parcel data, node data, delivery vehicle data, and fixed route information. The parcel data indicates a node that collects parcels and a node that delivers the parcels. The parcel data indicates whether the parcels can be divided. The parcel data indicates the priority of the parcel. The parcel data indicates the collection time frame and the delivery time frame of the parcel.

[0095] The node data represents nodes that represent logistics bases. The node data represents travel times between nodes. The node data represents edges that connect between nodes. The delivery vehicle data represents truck capacity. The delivery vehicle data represents the upper limit of the number of trucks that can be used for each type of truck. The delivery vehicle data represents the nodes that a truck can travel to for each type of truck. The delivery vehicle data represents the upper limit of the total travel time of a truck for each type of truck. The delivery vehicle data represents a step function used to define the delivery cost of a truck for each type of truck. The delivery vehicle data represents a fixed cost used to define the delivery cost of a truck for each type of truck. The fixed route information represents at least a route, a visit time of each node on the route, and a type of truck. The VRP data storage unit 511 provides the VRP data to the initial route generation unit 512, the route generation unit 514, and the route selection problem solving unit 516.

[0096] The initial route generating unit 512 acquires VRP data. Based on the VRP data, the initial route generating unit 512 generates initial route information that specifies a route that travels around each node other than a logistics base. The initial route information specifies, for example, a route that starts from a node that represents a logistics base, travels around nodes other than the logistics base, and arrives at a node that represents a logistics base. The initial route generating unit 512 provides the generated initial route information to the route set storage unit 515.

[0097] The solution-finding parameter storage unit 513 acquires and stores solution-finding parameters from the input data 501. The solution-finding parameters include penalty coefficients for each of the fixed route information, derived route information, and temporary route information. The derived route information represents at least a route, a visiting time of each node on the route, and a type of truck. The derived route information represents a route identical to any of the one or more pieces of fixed route information, but is different from any of the one or more pieces of fixed route information. The derived route information is different from any of the one or more pieces of fixed route information in at least the visiting time of each node on the route or the type of truck. The temporary route information represents at least a route, a visiting time of each node on the route, and a type of truck. The temporary route information is route information different from any of the one or more pieces of fixed route information.

[0098] The solution-finding parameters include route generation parameters. The route generation parameters include a time limit indicating an allowable upper limit of the time required for route generation. The route generation parameters include parameters related to a solver for solving the dual problem. The solution-finding parameters include route selection parameters. The route selection parameters include a time limit indicating an allowable upper limit of the time required for route selection. The route selection parameters include parameters related to a solver for solving the route selection problem. The solution-finding parameter storage unit 513 provides the solution-finding parameters to route selection problem solving unit 516, dual problem solving unit 521, and termination determination unit 523.

[0099] The route generation unit 514 acquires the VRP data, and starts a dual problem solving unit 521, a reduced cost minimization problem solving unit 522, and a termination determination unit 523. The dual problem solving unit 521 sets a dual problem of a linear relaxation problem of a route selection problem for the latest route information group. The dual problem solving unit 521 calculates an optimal solution of the set dual problem. The dual problem solving unit 521 provides the optimal solution of the set dual problem to the reduced cost minimization problem solving unit 522.

[0100] The reduced cost minimization problem solving unit 522 sets a reduced cost minimization problem for the optimal solution of the dual problem. The reduced cost minimization problem solving unit 522 searches for fixed route information, derived route information, or temporary route information as route information with a negative reduced cost by solving the reduced cost minimization problem for the optimal solution of the dual problem. When the reduced cost minimization problem solving unit 522 generates fixed route information, derived route information, or temporary route information as route information with a negative reduced cost by the search, the reduced cost minimization problem solving unit 522 adds the route information with a negative reduced cost to the latest route information group, thereby updating the latest route information group. The reduced cost minimization problem solving unit 522 provides the latest route information group to the route set storage unit 515. The reduced cost minimization problem solving unit 522 provides the end determination unit 523 with information on whether or not the reduced cost minimization problem solving unit 522 has generated route information with a negative reduced cost.

[0101] If the reduced cost minimization problem solving unit 522 has not generated route information with a negative reduced cost, the termination determination unit 523 starts the route selection problem solving unit 516. If the time limit has elapsed since startup, the termination determination unit 523 starts the route selection problem solving unit 516. If the reduced cost minimization problem solving unit 522 generated route information with a negative reduced cost before the time limit has elapsed since startup, the termination determination unit 523 starts the dual problem solving unit 521 again.

[0102] The route set storage unit 515 stores route information groups. The route set storage unit 515 receives initial route information from the initial route generation unit 512 and adds it to the route information group. The route set storage unit 515 acquires and stores the latest route information group from the reduced cost minimization problem solving unit 522. The route set storage unit 515 provides the latest route information group to the route selection problem solving unit 516.

[0103] The route selection problem solving unit 516 acquires VRP data. The route selection problem solving unit 516 acquires solution parameters. The route selection problem solving unit 516 acquires the latest route information group. The route selection problem solving unit 516 sets an objective function corresponding to the total delivery cost from the latest route information group based on the VRP data and the solution parameters, and sets a route selection problem for selecting multiple route information to be used in the current plan.

[0104] Here, the delivery cost of the route r∈R represented by the route information is c r Let R be the set of routes r. The total delivery cost is specifically defined by the following formula (1): x r ∈Z is an integer variable. x r represents the number of times route r is used in this plan.

[0105]

number

[0106] The route selection problem solving unit 516 sets a penalty coefficient p(r) for the route r represented by the route information so that fixed route information is selected with priority over derived route information, and derived route information is selected with priority over temporary route information, and applies the penalty coefficient p(r) to the above formula (1). Specifically, the penalty coefficient p(r) is defined by the following formula (2). λ2≧λ1>1.

[0107]

number

[0108] Specifically, the route selection problem solving unit 516 sets the following formula (3) obtained by applying the above formula (2) to the above formula (1) as an objective function. This enables the route selection problem solving unit 516 to create a current plan that selects fixed route information with priority over derived route information, selects derived route information with priority over temporary route information, and reduces the total delivery cost.

[0109]

number

[0110] The route selection problem solving unit 516 selects multiple pieces of route information to be used in the current plan so as to minimize the value of the objective function by solving the set route selection problem, and creates the current plan including the selected multiple pieces of route information. The route selection problem solving unit 516 provides the created current plan to the output data generating unit 517.

[0111] The output data generation unit 517 acquires the current plan. The output data generation unit 517 generates output data 502 based on the current plan. The output data 502 represents the current plan. The output data 502 includes a route information list in which identification information for identifying each of a plurality of pieces of route information forming the current plan is recorded. The output data 502 includes a plurality of pieces of route information forming the current plan.

[0112] The output data 502 includes, for example, a type of route information. The type indicates whether the route information is fixed route information, derived route information, or temporary route information. The output data 502 includes, for example, an assigned vehicle type. The assigned vehicle type indicates the type of truck represented by the route information. The output data 502 includes, for example, a visiting order of each node on the route. The visiting order indicates the route represented by the route information.

[0113] The output data 502 includes, for example, the visiting time of each node on the route. The output data 502 includes, for example, the baggage amount data at each node on the route. This allows the information processing device 100 to create the current plan so as to reduce the workload on the driver and the total delivery cost for the delivery work, and to make it possible to carry out the current delivery work.

[0114] (An example of the operation of the information processing device 100) Next, an example of the operation of the information processing device 100 will be described with reference to FIGS.

[0115] 6 and 7 are explanatory diagrams showing an example of the operation of the information processing device 100. In the examples of Fig. 6 and Fig. 7, the derived route information is route information in which the visiting order is the same as that of the fixed route information, and at least one of the visiting time and the assigned vehicle type is different from that of the fixed route information. Specifically, the derived route information has a role of contributing to reducing the workload of the driver due to its similarity to the fixed route information, and has a property of easily responding to daily changes in the amount of luggage due to its difference from the fixed route information, and has a role of contributing to reducing the total delivery cost.

[0116] The temporary route information is route information different from both the fixed route information and the derived route information. The temporary route information is route information in which the visiting order differs from that of the fixed route information. Since the visiting order of the temporary route information does not depend on the fixed route information, the temporary route information has a property of being easily responsive to changes in the daily volume of packages, and plays a role in contributing to the reduction of the total delivery cost.

[0117] In the following description, r represents route information. R represents a set of route information. i represents a package. T represents a set of packages i. i represents the size of the parcel i∈T. t represents the type of truck. U represents the set of truck types t. m t represents the number of available tracks of type t∈U. d tr indicates whether the route information r includes the truck type t. trSpecifically, is defined by the following formula (4). f represents fixed route information. F represents a set of fixed route information. g fr indicates whether the route information r is fixed route information f. fr Specifically, x is defined by the following formula (5). r represents the number of times that route information r is used in the current plan.

[0118]

number

[0119]

number

[0120] As described above, when creating the current plan, the information processing device 100 preferably selects fixed route information in preference to derived route information, and selects derived route information in preference to temporary route information. Therefore, the information processing device 100 sets a route selection problem for selecting multiple pieces of route information to be used for the current plan from a group of route information by setting an objective function shown in the following formula (6) and constraint conditions shown in the following formulas (7) to (10). The following formula (6) corresponds to the above formula (3).

[0121]

number

[0122]

number

[0123]

number

[0124]

number

[0125]

number

[0126] The objective function represents the value to be minimized. The value represented by the objective function is larger when derived route information is used than when fixed route information is used due to the coefficient p(r). As shown in the above formula (3), the value represented by the objective function is larger when temporary route information is used than when derived route information is used due to the coefficient p(r).

[0127] Therefore, when minimizing the value represented by the objective function, the information processing device 100 can easily select fixed route information in preference to derived route information, and can easily select derived route information in preference to temporary route information. As a result, the information processing device 100 can set a route selection problem so as to select fixed route information in preference to derived route information, and to select derived route information in preference to temporary route information, and to reduce the total delivery cost.

[0128] The information processing device 100 sets a route information group R to be referenced in the route selection problem according to the column generation method. The column generation method sets the route information group R by repeating a unit process that generates route information r. (1) The information processing device 100 sets the route information group R to an initial state, for example. (2) The information processing device 100 calculates an optimal solution to the dual problem by solving the dual problem of a linear relaxation problem of the route selection problem for the current route information group R, for example, using a dual problem solving solver.

[0129] (3) The information processing device 100 calculates a solution to the reduced cost minimization problem by solving the reduced cost minimization problem for the dual problem based on the optimal solution of the dual problem, for example, using a solution solver for the reduced cost minimization problem. (4) If the reduced cost of the calculated solution is negative, the information processing device 100 adds route information corresponding to the solution to the route information group R and returns to the process of (2) above. The processes of (2) to (4) above correspond to the unit process described above. If the reduced cost of the calculated solution is not negative, the information processing device 100 determines the current route information group R as the final route information R to be referenced in the route selection problem.

[0130] Here, since the dual problem is a linear programming problem, the information processing device 100 can calculate the optimal solution of the dual problem at a relatively high speed. Since the processing time required for calculating the optimal solution of the reduced cost minimization problem tends to increase, it is preferable that the information processing device 100 solves the reduced cost minimization problem by a local search and calculates a local solution of the reduced cost minimization problem.

[0131] The relaxation problem of the routing problem is r Since the relaxation problem is obtained by removing the integer constraints in the above equations, it is defined by the objective function in the following equation (11) and the constraint conditions in the following equations (12) to (15). The relaxation problem is a linear programming problem. A dual problem is defined for the linear programming problem. The dual problem for the relaxation problem is defined by the objective function in the following equation (16) and the constraint conditions in the following equations (17) to (20).

[0132]

number

[0133]

number

[0134]

number

[0135]

number

[0136]

number

[0137]

number

[0138]

number

[0139]

number

[0140]

number

[0141]

number

[0142] In the unit process of iterating through the column generation method, the optimal solution to the dual problem is (y * ,z * ,w * In this case, the reduced cost minimization problem is solved by solving the variable r that represents the route information and the variable a that represents the size of the cargo i to be transported on the route information r. ~ i and a 0-1 variable d that is 1 when the route information r is the type of truck t. ~ t and a 0-1 variable g that is 1 when the route information r is a fixed route f. ~ fIt is defined by the objective function of the following formula (21), the constraint conditions related to the various premises described above, and the constraint conditions of the following formulas (22) to (24). Here, for convenience, the letters with ~ at the top are referred to as "letters". ~ " may be written as ".

[0143]

number

[0144]

number

[0145]

number

[0146]

number

[0147] Specifically, the information processing device 100 realizes the above processes (2) to (4) by the following processes (a) to (c), and corresponds to the unit processing. (a) Specifically, the information processing device 100 performs a local search for all fixed route information to allocate luggage. Specifically, when the information processing device 100 finds fixed route information with a negative reduced cost, it adds the fixed route information with a negative reduced cost to the current route information set R, thereby updating the current route information set R, and ends one round of the above-mentioned unit processing. Specifically, when the information processing device 100 does not find fixed route information with a negative reduced cost, it proceeds to the process of (b).

[0148] (b) The information processing device 100 specifically performs a local search to generate derived route information for all fixed route information. Specifically, when the information processing device 100 finds derived route information with a negative reduced cost, the information processing device 100 adds the derived route information with a negative reduced cost to the current route information set R, thereby updating the current route information set R, and ends one round of the above-mentioned unit processing. Specifically, when the information processing device 100 does not find derived route information with a negative reduced cost, the information processing device 100 proceeds to processing (c).

[0149] (c) The information processing device 100 specifically performs a local search to generate temporary route information. Specifically, when the information processing device 100 finds temporary route information whose reduced cost is negative, the information processing device 100 adds the temporary route information whose reduced cost is negative to the current route information set R, thereby updating the current route information set R, and ends one round of the above-mentioned unit processing. Specifically, when the information processing device 100 does not find temporary route information whose reduced cost is negative, the information processing device 100 determines the current route information set R as the final route information set R, and ends the unit processing.

[0150] This allows the information processing device 100 to determine the final route information group R. The information processing device 100 can reduce the processing load and processing time required when determining the final route information group R, compared to a case where fixed route information, derived route information, and temporary route information are all considered for each unit process. The information processing device 100 can consider fixed route information, derived route information, and temporary route information in descending order of priority for each unit process. Therefore, the information processing device 100 can easily appropriately determine the final route information group R while reducing the processing load and processing time.

[0151] Here, specific examples of the processes (a) to (c) above will be described. In the following description, r0 represents initial route information. N represents an additional node set. (A) The information processing apparatus 100 sets r := r0. (B) The information processing apparatus 100 sets a route information group R' in which one task is assigned to the route information r. The task is, for example, to carry a load. The information processing apparatus 100 specifies a route information r' ∈ R that satisfies the above-described prerequisite constraint conditions and for which the value represented by the objective function g() of the reduced cost minimization problem is minimized among R'.

[0152] (C) When the additional node set is not empty, the information processing apparatus 100 performs the following processes (C-1) to (C-3) on the node v ∈ N. (C-1) The information processing apparatus 100 specifies a new route information r obtained by adding the node v in the visit order of the route information r. v (C-2) The information processing apparatus 100 specifies a route information group R' in which one task is assigned to the route information r v . The information processing apparatus 100 specifies a route information r' ∈ R that satisfies the above-described prerequisite constraint conditions and for which the value represented by the objective function g() of the reduced cost minimization problem is minimized among R'. v (C-3) If g(r') > g(r' v ), the information processing apparatus 100 sets r' := r' v . v v

[0153] (D) If g(r) < g(r'), the information processing apparatus 100 outputs the route information r as the solution of the reduced cost minimization problem. (E) If g(r) < g(r') does not hold, the information processing apparatus 100 returns to the process of (B). Thereby, the information processing apparatus 100 can output the route information r that is the solution of the reduced cost minimization problem and can update the route information group R.

[0154] In the process (a), specifically, the information processing device 100 sets each fixed route information to r0, always sets the additional node set N to an empty set, and performs the processes (A) to (E) above. This allows the information processing device 100 to identify fixed route information that is a solution to the reduced cost minimization problem.

[0155] Furthermore, in the process of (b), specifically, the information processing device 100 sets, for each fixed route information i and each truck type t, derived route information that represents the same visiting order as the fixed route information i and that represents the truck type t to r0. In the process of (b), specifically, the information processing device 100 always sets the additional node set N to an empty set. Thereafter, in the process of (b), specifically, the information processing device 100 performs the above processes (A) to (E). In this way, the information processing device 100 can identify derived route information that is a solution to the reduced cost minimization problem.

[0156] Furthermore, in the process (c), the information processing device 100 specifically identifies a visiting order from a node representing a logistics base via node v and returning to a node representing a logistics base for each node v representing a node other than a logistics base and for each truck type t. In the process (c), the information processing device 100 specifically sets temporary route information representing the identified visiting order and truck type t to r0. The information processing device 100 specifically sets an additional node set N to a node set that collects nodes representing nodes other than logistics bases. Thereafter, the information processing device 100 specifically performs the processes (A) to (E) above. This allows the information processing device 100 to identify temporary route information that is a solution to the reduced cost minimization problem.

[0157] Here, the case where the information processing device 100 does not need to consider all of the fixed route information, derived route information, and temporary route information for each unit process has been described, but this is not limited to the above. For example, the information processing device 100 may consider all of the fixed route information, derived route information, and temporary route information for each unit process, find appropriate route information with a negative reduced cost, and determine the final route information group R. Here, moving to the description of FIG. 6, an example of a plan actually created by the information processing device 100 will be described.

[0158] 6 represents a plan created by the information processing device 100 for the first day. As shown in the graph 600, the information processing device 100 can create a plan using fixed route information. Therefore, the information processing device 100 can reduce the workload on the driver.

[0159] Moreover, graph 610 in FIG. 6 represents a plan created by the information processing device 100 for the second day. As shown in graph 610, the information processing device 100 can create a plan using fixed route information. Therefore, the information processing device 100 can reduce the workload on the driver. As shown in graph 610, the information processing device 100 can create a plan to use temporary route information when there is a package that cannot be delivered to any node using only fixed route information. Therefore, the information processing device 100 can make it possible to appropriately deliver the package to the node.

[0160] Moreover, graph 620 in Fig. 6 represents a plan created by the information processing device 100 for the third day. As shown in graph 620, the information processing device 100 can create a plan using derived route information that has a common visiting order with fixed route information. Therefore, the information processing device 100 can reduce the workload on the driver while enabling packages to be appropriately delivered to nodes. Next, moving to the explanation of Fig. 7, an example of a plan created by a conventional method will be explained.

[0161] The conventional method is a method in which there is no fixed route information, and new route information is generated every day without restrictions on the visiting order, the type of truck, etc., and a plan is created. Graph 700 in Fig. 7 shows a plan created by the conventional method for the first day. As shown in graph 700, it is assumed that the conventional method created the same plan as the information processing device 100.

[0162] 7 represents a plan created for the second day by the conventional method. As shown in graph 710, the conventional method may create a plan for the second day by generating new route information that does not share the same visiting order as the route information used in the plan created for the first day. For this reason, it is difficult to reduce the workload on the driver with the conventional method.

[0163] 7 represents a plan created for the third day by the conventional method. As shown in graph 720, the conventional method may create a plan for the third day by generating new route information whose visiting order is not common to the route information used in the plan created for the first day and the route information used in the plan created for the second day. For this reason, it is difficult to reduce the workload on the driver with the conventional method.

[0164] (One example of the effect of the information processing device 100) Next, an example of an effect achieved by the information processing device 100 will be described with reference to FIGS.

[0165] 8 and 9 are explanatory diagrams showing an example of the effect. In the example of FIG. 8 and FIG. 9, the information processing device 100 is applied to a logistics project. The logistics project is defined by seven days' worth of delivery data for a specific area. It is assumed that the number of nodes related to the specific area is 34. It is assumed that the number of packages is about 300 per day. 119 pieces of fixed route information are prepared in advance. The penalty coefficient λ1=1.3. The penalty coefficient λ2=1.5. Now, we move on to the explanation of FIG. 8.

[0166] Table 800 in FIG. 8 represents a plan created by information processing device 100 for each day. name is an instance name that identifies the plan. The instance name indicates which day the plan is for. cost represents the total delivery cost not including penalties. penalty represents the total penalty related to derived route information and temporary route information. #(fixed) represents the number of fixed route information used in the plan. #(derived) represents the number of derived route information used in the plan. #(temporary) represents the number of temporary route information used in the plan.

[0167] The information processing device 100 can create a plan for each day so that the frequency of use of fixed route information / derived route information / temporary route information increases in that order, as shown in table 800. Also, as shown in table 800, the information processing device 100 can employ fixed route information and derived route information for about 90% of the route information used in the plan. This allows the information processing device 100 to make it difficult for the order of visits by trucks to change from day to day, thereby reducing the workload on the driver. Next, we move on to the explanation of FIG. 9.

[0168] Table 900 in Fig. 9 shows the total delivery cost not including penalties for each of the seven-day plans created when fixed route information exists and when fixed route information does not exist. The upper limit of the processing time for creating a plan is set to 3600 seconds.

[0169] As shown in table 900, the presence of fixed route information does not tend to have a negative impact on the total delivery cost. Also, as shown in table 900, on some days, the total delivery cost may be smaller when fixed route information is present than when fixed route information is not present. Since there is an upper limit on the processing time when creating a plan, it is considered that there are situations in which it is easier to create a preferable plan when fixed route information is present than when fixed route information is not present. As shown in tables 800 and 900, the information processing device 100 can create an appropriate plan to reduce the total delivery cost while reducing the workload on the driver.

[0170] (Overall processing procedure) Next, an example of an overall processing procedure executed by the information processing device 100 will be described with reference to Fig. 10. The overall processing is realized by, for example, the CPU 301, storage areas such as the memory 302 and the recording medium 305, and the network I / F 303 shown in Fig. 3.

[0171] 10 is a flowchart showing an example of an overall processing procedure. In FIG 10, the information processing device 100 generates one or more pieces of initial route information and registers them in a route information group R (step S1001). Next, the information processing device 100 proceeds to processing in step S1002.

[0172] In step S1002, the information processing device 100 calculates an optimal solution of a dual problem of a linear relaxation problem of a route selection problem for the route information group R (step S1002). Next, the information processing device 100 executes an update process described later in FIG. 51 to solve a reduced cost minimization problem for the calculated optimal solution of the dual problem (step S1003).

[0173] Then, the information processing device 100 judges whether or not route information with a negative reduced cost has been generated (step S1004). If route information with a negative reduced cost has been generated (step S1004: Yes), the information processing device 100 proceeds to processing of step S1005. On the other hand, if route information with a negative reduced cost has not been generated (step S1004: No), the information processing device 100 proceeds to processing of step S1006.

[0174] In step S1005, the information processing device 100 determines whether the time limit has been exceeded (step S1005). If the time limit has been exceeded (step S1005: Yes), the information processing device 100 proceeds to the process of step S1006. On the other hand, if the time limit has not been exceeded (step S1005: No), the information processing device 100 returns to the process of step S1002.

[0175] In step S1006, the information processing device 100 selects one or more pieces of route information from the route information group R by solving a route selection problem for the route information group R (step S1006). Then, the information processing device 100 ends the entire process.

[0176] (Update procedure) Next, an example of an update process procedure executed by the information processing device 100 will be described with reference to Fig. 11. The update process is realized by, for example, the CPU 301, storage areas such as the memory 302 and the recording medium 305, and the network I / F 303 shown in Fig. 3.

[0177] Fig. 11 is a flowchart showing an example of an update process procedure. In Fig. 11, the information processing device 100 sets a reduced cost minimization problem for an optimal solution of a dual problem (step S1101). Next, the information processing device 100 refers to the reduced cost minimization problem and searches for fixed route information with a negative reduced cost from among one or more pieces of fixed route information based on one or more pieces of fixed route information (step S1102).

[0178] Then, the information processing device 100 judges whether or not fixed route information with a negative reduced cost has been generated by the search (step S1103). If fixed route information with a negative reduced cost has been generated (step S1103: Yes), the information processing device 100 proceeds to processing of step S1108. On the other hand, if fixed route information with a negative reduced cost has not been generated (step S1103: No), the information processing device 100 proceeds to processing of step S1104.

[0179] In step S1104, the information processing device 100 refers to the reduced cost minimization problem and searches for derived route information with a negative reduced cost based on one or more fixed route information (step S1104). Then, the information processing device 100 determines whether derived route information with a negative reduced cost has been generated by the search (step S1105). If derived route information with a negative reduced cost has been generated (step S1105: Yes), the information processing device 100 proceeds to processing of step S1108. On the other hand, if derived route information with a negative reduced cost has not been generated (step S1105: No), the information processing device 100 proceeds to processing of step S1106.

[0180] In step S1106, the information processing device 100 refers to the reduced cost minimization problem and searches for temporary route information with a negative reduced cost based on one or more fixed route information (step S1106). Then, the information processing device 100 determines whether or not temporary route information with a negative reduced cost has been generated by the search (step S1107). If temporary route information with a negative reduced cost has been generated (step S1107: Yes), the information processing device 100 proceeds to processing in step S1108. On the other hand, if fixed route information with a negative reduced cost has not been generated (step S1107: No), the information processing device 100 ends the update processing.

[0181] In step S1108, the information processing device 100 adds the route information with a negative reduced cost to the route information group R (step S1108). Then, the information processing device 100 ends the update process. Here, the information processing device 100 may change the order of the processes of some steps in the flowcharts of Figs. 10 and 11 and execute them. Furthermore, the information processing device 100 may omit the processes of some steps in the flowcharts of Figs. 10 and 11.

[0182] As described above, the information processing device 100 can acquire one or more pieces of first route information. The information processing device 100 can set a route information group including at least one of the one or more pieces of first route information and the generated second route information by generating second route information different from any of the one or more pieces of first route information based on the one or more pieces of first route information. The information processing device 100 can create a plan that specifies a route for each of a plurality of moving bodies to travel around two or more nodes among a plurality of nodes so that the first route information is used preferentially over the second route information based on the set route information group. This allows the information processing device 100 to reduce the workload of the person who executes the plan. The information processing device 100 can reduce the cost required to execute the plan.

[0183] According to the information processing device 100, the weighting for the cost when the second route information is used can be set to a value larger than the weighting for the cost when the first route information is used. According to the information processing device 100, a plan can be created by solving a route selection problem for selecting route information to be used in the plan from a group of route information so as to minimize the weighted sum of costs. This allows the information processing device 100 to create a plan that uses the first route information preferentially over the second route information. Therefore, the information processing device 100 can reduce the workload of the person who executes the plan.

[0184] According to the information processing device 100, the route information group can be set to include one or more initial route information in an initial state. According to the information processing device 100, a reduced cost minimization problem for an optimal solution of a dual problem of a relaxed problem of a route selection problem for the route information group can be set. According to the information processing device 100, a series of processes can be repeatedly performed based on the set reduced cost minimization problem. According to the information processing device 100, if there is first route information with a negative reduced cost among one or more first route information acquired in the series of processes, the first route information can be added to the route information group. According to the information processing device 100, if there is no first route information with a negative reduced cost in the series of processes, the second route information with a negative reduced cost can be generated and added to the route information group. Thereby, the information processing device 100 can set an appropriate route information group. The information processing device 100 can reduce the processing time required for setting the route information group.

[0185] According to the information processing device 100, by searching for second route information with a negative reduced cost that specifies at least a second route that is the same as a first route specified by any one of one or more pieces of first route information, it is possible to generate second route information with a negative reduced cost. This allows the information processing device 100 to generate route information with a relatively high degree of freedom. Therefore, the information processing device 100 can easily reduce the cost of the plan while reducing the workload of the person who executes the plan.

[0186] According to the information processing device 100, by searching for second route information with a negative reduced cost that defines at least a second route different from any of the first routes defined by one or more pieces of first route information, it is possible to generate second route information with a negative reduced cost. This allows the information processing device 100 to generate route information with a relatively high degree of freedom. Therefore, the information processing device 100 can easily reduce the cost required for planning.

[0187] According to the information processing device 100, a series of processes can be repeatedly performed until both the first route information with a negative reduced cost and the second route information with a negative reduced cost no longer exist. This allows the information processing device 100 to set an appropriate set of route information.

[0188] According to the information processing device 100, it is possible to generate, as the second route information, route information that defines at least a second route that is the same as a first route defined by any of the one or more pieces of first route information and is different from any of the one or more pieces of first route information. This allows the information processing device 100 to generate route information with a relatively high degree of freedom. Therefore, the information processing device 100 can easily reduce the cost of the plan while reducing the workload of the person who executes the plan.

[0189] According to the information processing device 100, it is possible to generate, as the second route information, route information that defines at least a second route that is different from any of the first routes defined by each of the one or more pieces of first route information and is different from any of the one or more pieces of first route information. This allows the information processing device 100 to generate route information with a relatively high degree of freedom. Therefore, the information processing device 100 can easily reduce the cost required for planning.

[0190] The information processing method described in this embodiment can be realized by executing a prepared program on a computer such as a PC or a workstation. The information processing program described in this embodiment is recorded on a computer-readable recording medium, and is executed by being read from the recording medium by the computer. The recording medium may be a hard disk, a flexible disk, a CD (Compact Disc)-ROM, an MO (Magneto Optical disc), a DVD (Digital Versatile Disc), or the like. The information processing program described in this embodiment may also be distributed via a network such as the Internet.

[0191] The following supplementary notes are further disclosed regarding the above-described embodiment.

[0192] (Supplementary Note 1) Acquire one or more pieces of first route information that at least define a first route among a first route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes; generating second route information different from any of the one or more pieces of first route information, based on the one or more pieces of first route information, the second route being defined by at least one of a second route travelling around two or more nodes among the plurality of nodes, a time limit for travelling around at least any of the two or more nodes, and a type of moving body travelling around the two or more nodes, thereby setting a route information group including at least any of the one or more pieces of first route information and the second route information; creating a plan that specifies a route for each of a plurality of moving objects to visit two or more of the plurality of nodes, based on the group of route information, so that the first route information is used preferentially over the second route information; An information processing program that causes a computer to execute a process.

[0193] (Appendix 2) The process for creating the above is as follows: The information processing program according to claim 1, characterized in that the plan is created by solving a route selection problem of selecting route information to be used for the plan from the group of route information so as to minimize a weighted sum of costs, after setting a weight for cost when using the second route information to a value greater than a weight for cost when using the first route information.

[0194] (Additional Note 3) The route information group includes, in an initial state, one or more pieces of initial route information; The setting process includes: The information processing program according to claim 2, characterized in that the route information group including at least any one of the one or more first route information and the second route information is set by repeatedly performing a series of processes in which, based on a reduced cost minimization problem for an optimal solution of a dual problem of a relaxed problem of the route selection problem for the route information group, if there is any first route information with a negative reduced cost among the one or more first route information, the first route information is added to the route information group, and if there is no first route information with a negative reduced cost, second route information with a negative reduced cost is generated and added to the route information group.

[0195] (Appendix 4) The setting process is The information processing program according to claim 3, characterized in that if there is no first route information with a negative reduced cost based on the reduced cost minimization problem, a search is made for second route information with a negative reduced cost that specifies at least a second route that is identical to a first route specified by any of the one or more first route information, thereby generating second route information with a negative reduced cost and adding it to the route information group.

[0196] (Appendix 5) The setting process is as follows: The information processing program according to claim 3 or 4, characterized in that if there is no first route information with a negative reduced cost based on the reduced cost minimization problem, a search is made for second route information with a negative reduced cost that specifies at least a second route different from any of the first routes specified by each of the one or more first route information, thereby generating second route information with a negative reduced cost and adding it to the route information group.

[0197] (Appendix 6) The setting process is The information processing program according to claim 3, further comprising: repeating the above series of processes until both first route information having a negative reduced cost and second route information having a negative reduced cost no longer exist.

[0198] (Appendix 7) The information processing program according to appendix 1, characterized in that the second route information is route information different from any of the one or more pieces of first route information, and specifies at least a second route that is identical to a first route specified by any of the one or more pieces of first route information.

[0199] (Appendix 8) The information processing program according to appendix 1, characterized in that the second route information is route information different from any of the one or more pieces of first route information, and specifies at least a second route different from any of the first routes specified by each of the one or more pieces of first route information.

[0200] (Appendix 9) Acquire one or more pieces of first route information that at least define the first route among a first route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes; generating second route information different from any of the one or more pieces of first route information, based on the one or more pieces of first route information, the second route being defined by at least one of a second route travelling around two or more nodes among the plurality of nodes, a time limit for travelling around at least any of the two or more nodes, and a type of moving body travelling around the two or more nodes, thereby setting a route information group including at least any of the one or more pieces of first route information and the second route information; creating a plan that specifies a route for each of a plurality of moving objects to visit two or more of the plurality of nodes, based on the group of route information, so that the first route information is used preferentially over the second route information; An information processing method characterized in that the processing is executed by a computer.

[0201] (Supplementary Note 10) Acquire one or more pieces of first route information that at least defines the first route among a first route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes; generating second route information different from any of the one or more pieces of first route information, based on the one or more pieces of first route information, the second route being defined by at least one of a second route travelling around two or more nodes among the plurality of nodes, a time limit for travelling around at least any of the two or more nodes, and a type of moving body travelling around the two or more nodes, thereby setting a route information group including at least any of the one or more pieces of first route information and the second route information; creating a plan that specifies a route for each of a plurality of moving objects to visit two or more of the plurality of nodes, based on the group of route information, so that the first route information is used preferentially over the second route information; An information processing device comprising a control unit. [Explanation of symbols]

[0202] 100 Information processing device 101,600,610,620,700,710,720 Graph 110 First Route Information 120 Second Route Information 130 Plan 200 Information Processing Systems 201 Client device 210 Network 300 Bus 301 CPU 302 Memory 303 Network Interface 304 Recording media I / F 305 Recording media 400 Storage section 401 Acquisition Department 402 Settings 403 Creation Department 404 Output section 501 Input Data 502 Output Data 511 VRP data storage unit 512 Initial Route Generation Unit 513 Solution Parameter Memory Unit 514 Route Generation Unit 515 Route set memory unit 516 Route Selection Problem Solving Unit 517 Output Data Generation Unit 521 Dual problem solving part 522 Contracted cost minimization problem solving part 523 End Judgment Unit 800,900 tables

Claims

1. acquiring one or more pieces of first route information that define at least the first route among a first route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes; generating second route information different from any of the one or more pieces of first route information, based on the one or more pieces of first route information, the second route being defined by at least one of a second route travelling around two or more nodes among the plurality of nodes, a time limit for travelling around at least any of the two or more nodes, and a type of moving body travelling around the two or more nodes, thereby setting a route information group including at least any of the one or more pieces of first route information and the second route information; creating a plan that specifies a route for each of a plurality of moving objects to visit two or more of the plurality of nodes based on the group of route information, so that the first route information is used preferentially over the second route information; An information processing program that causes a computer to execute a process.

2. The creating process includes:

2. The information processing program according to claim 1, further comprising: setting a weight for cost when using the second route information to a value greater than a weight for cost when using the first route information; and creating the plan by solving a route selection problem for selecting route information to be used for the plan from the group of route information so as to minimize a weighted sum of costs.

3. The route information group includes, in an initial state, one or more pieces of initial route information; The setting process includes:

3. The information processing program according to claim 2, further comprising: repeating a series of processes in which, based on a reduced cost minimization problem for an optimal solution of a dual problem of a relaxed problem of the route selection problem for the route information group, if there is any first route information among the one or more first route information with a negative reduced cost, the first route information is added to the route information group; and if there is no first route information with a negative reduced cost, second route information with a negative reduced cost is generated and added to the route information group. The information processing program according to claim 2, further comprising:

4. The setting process includes:

4. The information processing program according to claim 3, characterized in that if there is no first route information with a negative reduced cost based on the reduced cost minimization problem, a search is made for second route information with a negative reduced cost that defines at least a second route that is identical to a first route defined by any of the one or more first route information, thereby generating second route information with a negative reduced cost and adding it to the route information group.

5. The setting process includes:

5. The information processing program according to claim 3, further comprising: searching for second route information having a negative reduced cost that defines at least a second route different from any of the first routes defined by each of the one or more first route information if there is no first route information having a negative reduced cost based on the reduced cost minimization problem; generating second route information having a negative reduced cost; and adding the second route information to the route information group.

6. The setting process includes:

4. The information processing program according to claim 3, further comprising: repeating the series of processes until both first route information having a negative reduced cost and second route information having a negative reduced cost no longer exist.

7. acquiring one or more pieces of first route information that define at least the first route among a first route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes; generating second route information different from any of the one or more pieces of first route information, based on the one or more pieces of first route information, the second route being defined by at least one of a second route travelling around two or more nodes among the plurality of nodes, a time limit for travelling around at least any of the two or more nodes, and a type of moving body travelling around the two or more nodes, thereby setting a route information group including at least any of the one or more pieces of first route information and the second route information; creating a plan that specifies a route for each of a plurality of moving objects to visit two or more of the plurality of nodes based on the group of route information, so that the first route information is used preferentially over the second route information; An information processing method characterized in that the processing is executed by a computer.

8. acquiring one or more pieces of first route information that define at least the first route among a first route that travels around two or more nodes among a plurality of nodes, a time limit for traveling around at least one of the two or more nodes, and a type of moving object that travels around the two or more nodes; generating second route information different from any of the one or more pieces of first route information, based on the one or more pieces of first route information, the second route being defined by at least one of a second route travelling around two or more nodes among the plurality of nodes, a time limit for travelling around at least any of the two or more nodes, and a type of moving body travelling around the two or more nodes, thereby setting a route information group including at least any of the one or more pieces of first route information and the second route information; creating a plan that specifies a route for each of a plurality of moving objects to visit two or more of the plurality of nodes based on the group of route information, so that the first route information is used preferentially over the second route information; An information processing device comprising a control unit.

Images