Computer-readable recording medium, information processing method, and information processing apparatus

Abstract

The invention discloses a computer-readable recording medium, an information processing method, and an information processing apparatus. A recording medium storing a program for causing a computer to execute: obtaining first path information defining at least a first path passing through a node, a time limit to travel to the node, and a first path among types of moving objects; generating second path information based on the first path information, and setting a path information group including the first path information and the second path information, the second path information being different from any of the first path information, and defining at least a second path passing through the nodes, a time limit to travel to at least one of the nodes, and a second path in the type of the moving object; and creating a plan defining a path for each moving object to travel to the node on the basis of the group of path information such that the first path information is preferentially used compared to the second path information.

Description

Technical Field

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

[0002] In the logistics industry, drivers of delivery vehicles used to perform delivery operations every day according to route information, which defines which type of delivery vehicle will visit which one or more stations at what time and in what order, and which items will be collected or delivered at each station. For example, there are cases where the driver of a delivery vehicle desires to perform delivery operations according to route information that is fixed within a certain period of time rather than route information that changes every day.

[0003] As a related technology, for example, there is a technology for making an optimal ship allocation plan by performing a comparison of fuel consumption or CO2 emissions when a ship sails between a location where the ship exists and a departure port as a transportation request site. For example, there is a technology for deriving candidate routes for a shuttle service based on one or more of the selected historical non-shuttle service requests. For example, there is a technology for displaying a route for equipment from a desired departure place to a desired terminal destination. For example, there is a technology for providing at least a portion of a route from a first location to a second location to a distribution mechanism.

[0004] As related technologies, Japanese Laid-Open Patent Publication No. 2020-024751, Japanese National Publication No. 2020-522064 of International Patent Application, and US Patent Application Publication Nos. 2016 / 0335593 and 2014 / 0358703 are disclosed. Summary of the invention

[0005] Technical issues

[0006] However, the related art has a problem that the related art leads to an increase in the cost of distribution operations. The cost of distribution operations includes, for example, financial cost, time cost, equipment cost, labor cost, etc. For example, using only fixed path information, there is a problem that it is difficult to efficiently collect or distribute items according to changes in the daily collection volume of items, the daily distribution volume of items, etc., and the related art often leads to an increase in the cost of distribution operations.

[0007] According to one aspect, the present disclosure aims to reduce costs.

[0008] Solution to the problem

[0009] According to one aspect of the embodiment, there is provided a recording medium storing an information processing program, the information processing program being used to cause a computer to execute processing, the processing comprising: obtaining one or more first path information, each of the one or more first path information including at least a first path among the following parameters, the first path being a path passing through two or more nodes among a plurality of nodes, the parameters including: the first path, a time limit for traveling to at least one of the two or more nodes, and a type of a mobile object traveling to the two or more nodes; generating second path information based on the one or more first path information, and thereby setting a path information group including the second path information and at least one of the one or more first path information, the second path information being different from any of the one or more first path information and at least defining a second path among the following: the second path, the time limit for traveling to at least one of the two or more nodes among the plurality of nodes, and a type of a mobile object traveling to the two or more nodes, wherein the second path passes through the two or more nodes; and creating a plan defining a path for each of the plurality of mobile objects to travel to the two or more nodes among the plurality of nodes based on the path information group, so that the first path information is used preferentially over the second path information.

[0010] Advantageous Effects of the Invention

[0011] According to one aspect, costs can be reduced. BRIEF DESCRIPTION OF THE DRAWINGS

[0012] Figure 1 is an explanatory diagram showing one example of an information processing method according to an embodiment;

[0013] Figure 2 is an explanatory diagram showing an example of an information processing system;

[0014] Figure 3 is a block diagram showing an example of a hardware configuration of an information processing apparatus;

[0015] Figure 4 is a block diagram showing an example of a functional configuration of an information processing apparatus;

[0016] Figure 5 is a block diagram showing a specific example of the functional configuration of an information processing apparatus;

[0017] Figure 6 is an explanatory diagram showing an example of the operation of the information processing apparatus (Part 1);

[0018] Figure 7 is an explanatory diagram showing an example of the operation of the information processing apparatus (Part 2);

[0019] Figure 8 is an explanatory diagram showing an example of the effect (Part 1);

[0020] Fig. 9 is an explanatory diagram showing an example of the effect (Part 2);

[0021] Fig.10 is a flowchart showing an example of the overall processing procedure; and

[0022] Fig.11 is a flowchart illustrating an example of an update processing procedure. DETAILED DESCRIPTION

[0023] Hereinafter, embodiments of an information processing program, an information processing method, and an information processing device according to the present disclosure will be described in detail with reference to the accompanying drawings.

[0024] (Example of Information Processing Method According to Embodiment)

[0025] Figure 1 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 the cost of a delivery operation. For example, the information processing device 100 is a server, a personal computer (PC), or the like.

[0026] A distribution operation is an operation related to the field of logistics, and is an operation of collecting or delivering one or more items to each of one or more of a plurality of stations via a distribution vehicle. In the related art, a driver drives a distribution vehicle and performs distribution operations every day according to route information, which defines which type of distribution vehicle will visit which one or more of a plurality of stations at what time and in what order, and which items will be collected or delivered at each station.

[0027] For example, the plurality of sites include sites that are fixed within a certain period of time and are the target of daily item delivery or collection. Fixed sites include, for example, convenience stores, supermarkets, warehouses, etc. The plurality of sites include, for example, temporary sites that change every day and are the target of item delivery or collection. Temporary sites are, for example, residences, etc. The plurality of sites may be different every day.

[0028] For example, there are cases where a driver desires to perform delivery work according to route information that is fixed within a certain period of time rather than route information that changes every day. For example, there are cases where a driver desires to reduce physical or mental labor burden by performing delivery work while driving the same type of delivery vehicle on the same route every day.

[0029] However, in the related art, there is a problem that this leads to an increase in the cost of the delivery work. The cost of the delivery work includes, for example, financial cost, time cost, equipment cost, manpower cost, etc.

[0030] For example, it is conceivable that a plurality of drivers each drive a delivery vehicle according to the same fixed route information every day and perform delivery operations. In this case, there is a problem that it is difficult to efficiently collect or deliver items according to changes in the amount of items collected or delivered every day, and this situation easily leads to an increase in the cost of the delivery operation.

[0031] For example, when the amount of collected or delivered articles on a certain day is relatively small, it is conceivable that a situation occurs in which one of the delivery vehicles travels between two of the sites without loading articles, and this leads to a decrease in delivery efficiency. For example, when the amount of collected or delivered articles on a certain day is relatively small, it is conceivable that an amount of articles that can be loaded all at once on one delivery vehicle is loaded on two delivery vehicles in a distributed manner, and this leads to a decrease in delivery efficiency. For example, when the amount of collected or delivered articles on a certain day is relatively large, it is conceivable that a situation occurs in which, if a delivery operation is performed only based on path information that is fixed to be the same every day, the delivery operation cannot be properly completed.

[0032] For example, when a temporary station unique to a certain day appears as a target for collecting or delivering an item, it is conceivable that if the delivery work is performed only based on the route information that is fixed to be the same every day, the delivery work cannot be properly completed. For example, in the case where temporary route information different from the route information that is fixed to be the same every day is generated to collect an item from a temporary station or to deliver an item to a temporary station, 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.

[0033] Therefore, in this embodiment, an information processing method that can reduce costs is described. For example, according to this embodiment, the cost of delivery work can be reduced while using the same route information fixed every day.

[0034] exist Figure 1 In the example, the information processing device 100 stores a graph 101 including a plurality of nodes representing different sites respectively and wherein the nodes are linked to each other by edges. Each edge indicates that a mobile object can move between sites 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, a small truck, etc. The delivery vehicle can be, for example, a passenger car, a motorcycle, etc.

[0035] The plurality of nodes include nodes representing sites corresponding to logistics centers called warehouses. The logistics centers may be, for example, departure points or arrival points of mobile objects. The plurality of nodes include nodes representing sites corresponding to travel destinations other than logistics centers as targets for collecting or distributing items. For example, the travel destinations may be relay points of mobile objects.

[0036] The information processing device 100 obtains a processing request for creating a plan that defines a path for each of a plurality of mobile objects to travel to two or more of a plurality of nodes. For example, the information processing device 100 receives a signal indicating the processing request via a communication network such as the Internet. The plan is information that enables a delivery operation to be performed. The plan includes a plurality of path information to be used when performing the delivery operation.

[0037] The delivery operation is an operation in which each of the plurality of mobile objects travels to two or more of the plurality of nodes to collect or deliver items. The delivery operation includes the delivery work of each driver. For example, the path information defines at least a path as follows: the path, a time limit for traveling to at least one of the two or more nodes of the plurality of nodes, and a type of the mobile object traveling to the two or more nodes, wherein the path passes through the two or more nodes.

[0038] For example, the information processing device 100 obtains the processing request by receiving the processing request from another computer. For example, the information processing device 100 can obtain the processing request by receiving an input of the processing request based on the operation input of the user. The information processing device 100 creates the current plan 130 described below in response to the processing request. The current plan 130 is, for example, a plan that enables the delivery operation of the current date to be performed.

[0039] (1-1) The information processing device 100 obtains one or more first path information 110. For example, the first path information 110 (i.e., each of the one or more first path information 110) defines at least a first path, which is a path passing through two or more nodes among a plurality of nodes. In addition, the first path information 110 may include a time limit for traveling to at least one of the two or more nodes and a type of a mobile object traveling to the two or more nodes. That is, the first path information 110 includes at least the first path in parameters such as the first path, the time limit, and the type of the mobile object. The time limit is, for example, a deadline for the mobile object to arrive at the node, a deadline for the mobile object to leave the node, etc. The type of the mobile object is, for example, one of a large truck, a medium truck, and a small truck. The first path information 110 is, for example, fixed path information preferred by the driver. The first path information 110 is, for example, path information used in past plans. For example, the first path information 110 specifies a path for a mobile object to travel in a distribution operation, indicates a time limit and a condition for the mobile object in travel when the mobile object travels on the path, and defines how the driver performs the distribution operation.

[0040] (1-2) The information processing device 100 generates the second path information 120 based on the one or more first path information 110 obtained, and thereby sets a path information group including the generated second path information 120 and at least one first path information among the one or more first path information 110 obtained. The second path information 120 is path information different from any first path information among the one or more first path information 110. For example, the second path information 120 defines at least a second path passing through two or more nodes among the plurality of nodes. In addition, the second path information 120 may include a time limit for traveling to at least one of the two or more nodes and a type of a mobile object traveling to the two or more nodes. That is, the second path information 120 includes at least the second path in parameters such as the second path, the time limit, and the type of the mobile object.

[0041] For example, the second path information 120 may be path information that defines at least a second path that is the same as a first path defined by one of the one or more first path information 110 and is different from the one or more first path information 110 in the type of the mobile object. For example, the second path defined in the second path information 120 may be a path that is different from any path in the one or more first path information 110. For example, the second path information may be different from the one or more first path information 110 in parameters such as the type of the mobile object. For example, the second path information 120 specifies a path that the mobile object travels in the delivery operation, indicates a time limit and condition of the mobile object in the case where the mobile object travels on the path, and defines how the driver performs the delivery operation.

[0042] (1-3) The information processing device 100 creates the current plan 130 based on the set path information group so as to use the first path information 110 preferentially over the second path information 120. The current plan 130 defines a path for each of the plurality of mobile objects to travel to two or more of the plurality of nodes.

[0043] For example, the information processing device 100 sets the weight of the cost in the case of using the second path information 120 to a value greater than the weight of the cost in the case of using the first path information 110, and then sets an objective function for calculating the weighted sum of the costs. For example, the information processing device 100 sets a path selection problem in which path information to be used in the current plan 130 is selected from the path information group so that the value of the set objective function is minimized. For example, the information processing device 100 creates the current plan 130 by solving the set path selection problem.

[0044] Thus, the information processing device 100 can create the current plan 130 and enable the current delivery operation to be performed. In this case, the information processing device 100 can create the current plan 130 so that the first path information 110 is used preferentially compared to the second path information 120. The information processing device 100 can increase the probability that the driver performs the delivery operation according to the first path information 110 instead of the second path information 120. Therefore, the information processing device 100 can reduce the driver's work burden. Considering the weighted sum of costs, the information processing device 100 can create the current plan 130 in a manner that uses the second path information 120 in addition to the first path information 110. Therefore, the information processing device 100 can reduce the cost of the delivery operation.

[0045] Although the case where the functions as the information processing device 100 are implemented by a single computer has been described, the embodiments are not limited to this case. For example, there may be a case where the functions as the information processing device 100 are implemented by cooperation of a plurality of computers. For example, there may be a case where the functions as the information processing device 100 are implemented on the cloud.

[0046] (Example of Information Processing System 200)

[0047] Next, we will use Figure 2 To illustrate the application Figure 1 An example of an information processing system 200 is shown in FIG. 1 .

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

[0049] In the information processing system 200, the information processing apparatus 100 and each client apparatus 201 are coupled to each other via a wired or wireless network 210. The network 210 is, for example, a local area network (LAN), a wide area network (WAN), the Internet, or the like.

[0050] The information processing device 100 is a computer for creating a plan that enables the execution of a delivery operation. The information processing device 100 stores a graph including a plurality of nodes that respectively represent different sites and in which the nodes are linked by edges. For example, the information processing device 100 receives a graph from the client device 201 and stores the graph. For example, the information processing device 100 can store the graph by receiving an input of the graph based on an operation input of a user.

[0051] The information processing device 100 obtains a processing request for creating a plan that defines a path for each of a plurality of mobile objects to travel to 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 obtains the processing request by receiving the processing request from the client device 201. For example, the information processing device 100 can obtain the processing request by receiving an input of the processing request based on an operation input by a user.

[0052] The information processing device 100 obtains one or more fixed path information. The fixed path information (i.e., each fixed path information in the one or more fixed path information) corresponds to the example of the first path information described above. For example, the fixed path information at least defines a fixed path passing through two or more nodes of a plurality of nodes. In addition, the fixed path information may include a time limit for traveling to at least one of the two or more nodes and a type of mobile object traveling to the two or more nodes. That is, the fixed path information at least includes a fixed path in parameters such as a fixed path, a time limit, and a type of mobile object. The time limit is, for example, a deadline for the mobile object to arrive at a node, a deadline for the mobile object to leave a node, etc. The type of mobile object is, for example, one of a large truck, a medium truck, and a small truck. For example, a fixed path is a driving path that a driver has experienced traveling by driving a truck in the past. Therefore, a fixed path is, for example, a driving path that is expected to have a small workload of physical or mental strength in the driver's travel. The fixed path may be an expected driving path specified by the driver. The fixed path information is, for example, path information defining a fixed path preferred by the driver. The fixed path information is, for example, path information used in past plans. For example, the fixed path information specifies the path that the mobile object travels in the delivery work, indicates the time limit and condition of the mobile object in the case where the mobile object travels on the path, and defines how the driver performs the delivery work. For example, the information processing device 100 obtains one or more fixed path information by receiving one or more fixed path information from the client device 201. For example, the information processing device 100 can obtain one or more fixed path information by receiving an input of one or more fixed path information based on the operation input of the user.

[0053] The information processing device 100 generates derived path information or temporary path information based on the one or more fixed path information obtained, and thereby sets a path information group including the derived path information or temporary path information and at least one fixed path information of the one or more fixed path information obtained. The derived path information is path information different from any fixed path information in the one or more fixed path information. For example, the derived path information at least defines a derived path in the following parameters, such as the derived path, the time limit for traveling to at least one of two or more nodes among the multiple nodes, and the type of the mobile object traveling to the two or more nodes, and the derived path passes through the two or more nodes. For example, the derived path information may be path information that at least defines a derived path that is the same as a fixed path defined by one of the one or more fixed path information and is different from the one or more fixed path information in the type of the mobile object. For example, the derived path defined in the derived path information may be a path different from any path in the one or more fixed path information. For example, the derived route information specifies the route that the mobile object travels in the delivery work, indicates time limits and conditions for the mobile object in traveling if the mobile object travels on the route, and defines how the driver performs the delivery work.

[0054] Temporary path information is path information that is different from any fixed path information in one or more fixed path information. For example, the temporary path information defines at least a temporary path in the following parameters, such as the temporary path, the time limit for traveling to at least one of two or more nodes among the multiple nodes, and the type of the mobile object traveling to the two or more nodes, and the temporary path passes through the two or more nodes. Temporary path information is, for example, path information that at least defines a temporary path that is different from any fixed path in the fixed paths defined by one or more fixed path information, respectively, and is different from any fixed path information in one or more fixed path information. For example, the temporary path information specifies the path that the mobile object travels in the distribution operation, indicates the time limit and conditions of the mobile object in the case where the mobile object travels on the path, and defines how the driver performs the distribution operation.

[0055] For example, the information processing device 100 prepares an empty path information group. The information processing device 100 obtains a plurality of initial path information and registers the initial path information in the path information group. For example, the initial path information defines at least an initial path as follows: the initial path, a time limit for traveling to at least one of two or more nodes among a plurality of nodes, and a type of a mobile object traveling to the two or more nodes, and the initial path passes through two or more nodes. For example, the initial path information defines an initial path starting from a node representing a logistics center, passing through one of the nodes representing a relay point, and arriving at a node representing a logistics center. For example, the initial path information specifies a path for a mobile object to travel in a distribution operation, indicates a time limit and condition for a mobile object in travel when the mobile object travels on the path, and defines how a driver performs a distribution operation. For example, the information processing device 100 obtains initial path information corresponding to each of a plurality of sites other than a logistics center. For example, the information processing device 100 obtains a plurality of initial path information by generating a plurality of initial path information corresponding to a plurality of sites other than a logistics center, respectively, based on a graph.

[0056] For example, the information processing device 100 sets the final path information group by repeatedly performing the following series of processes: setting a reduced cost minimization problem for the optimal solution of the dual problem of the relaxation problem of the path selection problem for the path information group, and updating the path information group. For example, the final path information group preferably includes the derived path information or the temporary path information and at least one of the one or more fixed path information.

[0057] A series of processes includes a process of setting a cost reduction optimization problem for an optimal solution of a dual problem of a relaxed problem of a path selection problem of a current path information group. For example, a series of processes includes a process of updating a current path information group by adding the fixed path information to the current path information group when there is fixed path information with a negative reduced cost in one or more fixed path information based on the set cost reduction minimization problem.

[0058] For example, a series of processes includes a process of updating the current path information group by generating derived path information with a negative reduced cost and adding the derived path information to the current path information group when there is no fixed path information with a negative reduced cost based on the set reduced cost minimization problem. For example, a series of processes includes a process of updating the current path information group by generating temporary path information with a negative reduced cost and adding the temporary path information to the current path information group when there is no derived path information with a negative reduced cost based on the set reduced cost minimization problem.

[0059] The information processing device 100 creates a current plan based on the set final path information group so that the fixed path information is used preferentially over the derived path information and the temporary path information. The information processing device 100 creates a current plan based on the set final path information group so that the fixed path information is used preferentially over the derived path information and the derived path information is used preferentially over the temporary path information.

[0060] For example, the information processing device 100 sets the weight of the cost in the case of using the derived path information to a value greater than the weight of the cost in the case of using the fixed path information. For example, the information processing device 100 sets the weight of the cost in the case of using the temporary path information to a value greater than the weight of the cost in the case of using the derived path information. For example, the information processing device 100 sets an objective function for calculating the weighted sum of the costs.

[0061] For example, the information processing device 100 sets a path selection problem in which path information to be used in the current plan is selected from the final path information group so that the value of the set objective function is minimized. For example, the information processing device 100 creates the current plan by solving the set path selection problem. The information processing device 100 sends the created current plan to the client device 201. For example, the information processing device 100 is a server, a PC, etc.

[0062] The client device 201 is a computer for supporting delivery operations. The client device 201 generates a chart based on the user's operation input and sends the chart to the information processing device 100. For example, the client device 201 generates one or more fixed route information based on the user's operation input and sends one or more fixed route information to the information processing device 100.

[0063] For example, the client device 201 generates a processing request based on the user's operation input and sends the processing 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 the current plan. For example, the client device 201 is a PC, a tablet terminal, a smart phone, etc.

[0064] Although the case where the information processing apparatus 100 is a computer different from the client apparatus 201 has been described, the embodiment is not limited to this case. For example, there may be a case where the information processing apparatus 100 has a function as the client apparatus 201 and also operates as the client apparatus 201.

[0065] (Hardware Configuration Example of Information Processing Device 100)

[0066] Next, we will use Figure 3 A hardware configuration example of the information processing apparatus 100 will be described.

[0067] Figure 3 is a block diagram showing an example of the hardware configuration of the information processing apparatus 100. Figure 3 In FIG. 1 , the information processing apparatus 100 includes a central processing unit (CPU) 301 , a memory 302 , a network interface (I / F) 303 , a recording medium I / F 304 , and a recording medium 305 . These components are coupled to each other via a bus 300 .

[0068] The CPU 301 is responsible for the control of the entire information processing apparatus 100. For example, the memory 302 includes a read-only memory (ROM), a random access memory (RAM), a flash ROM, etc. For example, the flash ROM and the ROM store various programs, and the RAM is used as a work area of ​​the CPU 301. The program stored in the memory 302 is loaded by the CPU 301, and causes the CPU 301 to perform encoding processing.

[0069] The network I / F 303 is coupled to the network 210 through a communication line, and is coupled to another computer via the network 210. The network I / F 303 serves as an interface between the network 210 and the inside of the information processing apparatus 100, and controls input of data from another computer and output of data to another computer. For example, the network I / F 303 is a modem, a LAN adapter, or the like.

[0070] The recording medium I / F 304 controls reading and writing of data from and to the recording medium 305 according to the control of the CPU 301. For example, the recording medium I / F 304 is a disk drive, a solid state drive (SSD), a universal serial bus (USB) port, etc. The recording medium 305 is a nonvolatile memory that stores data written under the control of the recording medium I / F 304. For example, the recording medium 305 is a disk, a semiconductor memory, a USB memory, etc. The recording medium 305 can be removably attached to the information processing apparatus 100.

[0071] In addition to the above components, the information processing apparatus 100 may include, for example, a keyboard, a mouse, a display, a printer, a scanner, a microphone, a speaker, etc. The information processing apparatus 100 may include a plurality of recording medium I / Fs 304 and a plurality of recording media 305. The information processing apparatus 100 may not include the recording medium I / F 304 or the recording medium 305.

[0072] (Hardware Configuration Example of Client Device 201)

[0073] Since the hardware configuration example of the client device 201 is similar to Figure 3This is just an example of the hardware configuration of the information processing apparatus 100 shown, and thus a description thereof will be omitted.

[0074] (Example of Functional Configuration of Information Processing Device 100)

[0075] Next, we will use Figure 4 An example of the functional configuration of the information processing apparatus 100 will be described.

[0076] Figure 4 4 is a block diagram showing an example of a functional configuration of the information processing apparatus 100. The information processing apparatus 100 includes a storage unit 400, an obtaining unit 401, a setting unit 402, a creating unit 403, and an output unit 404.

[0077] For example, the storage unit 400 is composed of Figure 3 The storage unit 400 is implemented by a storage area of ​​the memory 302, the recording medium 305, etc. shown in FIG. 1 . Although the case where the storage unit 400 is included in the information processing device 100 is described below, the embodiment is not limited to this case. For example, there may be a case where the storage unit 400 is included in a device different from the information processing device 100 and the information processing device 100 can refer to the storage content of the storage unit 400.

[0078] The obtaining unit 401 to the output unit 404 are used as an example of a control unit. For example, the functions of the obtaining unit 401 to the output unit 404 are performed by causing the CPU 301 to execute Figure 3 The processing result of each functional unit is stored in the program stored in the storage area of ​​the memory 302, recording medium 305, etc., or by using the network I / F 303. For example, the processing result of each functional unit is stored in Figure 3 In the storage area of ​​the memory 302, recording medium 305, etc. shown.

[0079] The storage unit 400 stores various types of information to be referenced or updated in the processing of each functional unit. For example, the storage unit 400 stores a graph including a plurality of nodes representing different sites respectively and in which the nodes are linked to each other by edges. The graph indicates an area in which a delivery operation is to be performed. The delivery operation includes a delivery operation of a driver in which each of a plurality of mobile objects travels to two or more of a plurality of nodes to collect or deliver items.

[0080] Each edge indicates that a mobile object can move between sites 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, a small truck, etc. The delivery vehicle can be, for example, a passenger car, a motorcycle, etc. The plurality of nodes include nodes representing sites corresponding to a logistics center called a warehouse. The logistics center can be, for example, a departure point or an arrival point of the mobile object. The plurality of nodes include nodes representing sites corresponding to a travel destination other than the logistics center that is a target for collecting or delivering items. For example, the travel destination can be a relay point of the mobile object. For example, the graph is obtained by the obtaining unit 401.

[0081] The storage unit 400 stores, for example, a path information group. The path information group includes, for example, one or more path information. When performing a distribution operation, the path information can be used. For example, the path information at least defines the path as follows: the path, the time limit for traveling to at least one of two or more nodes among a plurality of nodes, and the type of the mobile object traveling to the two or more nodes, and the path passes through the two or more nodes. The time limit is, for example, a limit on the time point at which the mobile object arrives at the node, a limit on the time point at which the mobile object leaves the node, etc. The limit on the time point at which the mobile object arrives at the node, for example, indicates the time before which the mobile object is to arrive at the node or the time after which the mobile object is to arrive at the node. The limit on the time point at which the mobile object leaves the node, for example, indicates the time before which the mobile object is to leave the node or the time after which the mobile object is to leave the node. The type of the mobile object is, for example, one of a large truck, a medium truck, and a small truck. The path information may be included in a plan that enables, for example, the distribution operation to be performed. The plan defines, for example, the path for each of the plurality of mobile objects to travel to two or more nodes among the plurality of nodes by using one or more path information. For example, the path information group is updated by the obtaining unit 401 , the setting unit 402 , or the creating unit 403 .

[0082] The storage unit 400 stores, for example, one or more first path information. For example, the first path information defines at least the first path as follows: the first path, the time limit for traveling to at least one of two or more nodes among the multiple nodes, and the type of the mobile object traveling to the two or more nodes, and the first path passes through the two or more nodes. The first path information is, for example, fixed path information preferred by the driver. The fixed path information is, for example, path information in which the driver's workload is considered to be relatively small when performing a distribution operation according to the path information. The fixed path information is, for example, path information that the driver has referred to in the past and is familiar to the driver. The fixed path information can be, for example, path information specified by the driver. For example, the first path information specifies the path that the mobile object travels in the distribution operation, represents the time limit and conditions of the mobile object in the case where the mobile object travels on the path, and defines how the driver performs the distribution operation. The first path information can be added to the path information group. The first path information is, for example, obtained by the obtaining unit 401.

[0083] The obtaining unit 401 obtains various types of information used in the processing of each functional unit. The obtaining unit 401 stores the obtained various types of information in the storage unit 400, or outputs the obtained various types of information to each functional unit. The obtaining unit 401 may output various types of information stored in the storage unit 400 to each functional unit. For example, the obtaining unit 401 obtains various types of information based on the operation input of the user. For example, the obtaining unit 401 may receive various types of information from a device different from the information processing device 100.

[0084] The acquisition unit 401 acquires, for example, a chart. For example, the acquisition unit 401 acquires the chart by receiving the chart from another computer. The other computer is, for example, the client device 201 or the like. For example, the acquisition unit 401 may acquire the chart by receiving an input of the chart based on an operation input by a user.

[0085] The obtaining unit 401 obtains, for example, a processing request for creating a current plan. For example, the obtaining unit 401 obtains the processing request by receiving the processing request from another computer. The other computer is, for example, the client device 201. For example, the obtaining unit 401 can obtain the processing request by receiving an input of the processing request based on an operation input of a user.

[0086] The obtaining unit 401 obtains, for example, one or more first path information. For example, the obtaining unit 401 obtains the one or more first path information by receiving the one or more first path information from another computer. The other computer is, for example, the client device 201, etc. For example, the obtaining unit 401 can obtain the one or more first path information by receiving an input of the one or more first path information based on the operation input of the user.

[0087] For example, in the case where the setting unit 402 does not generate one or more initial path information, the obtaining unit 401 obtains one or more initial path information, and adds one or more initial path information to the path information group to update the path information group to the initial state. The initial state is, for example, a state in which the path information group includes one or more initial paths so that the setting unit 402 can set the cost minimization problem and the creation unit 403 can solve the path selection problem. For example, the initial path information at least defines the initial path as follows: the initial path, the time limit for traveling to at least one of two or more nodes among the multiple nodes, and the type of the mobile object traveling to the two or more nodes, and the initial path passes through two or more nodes. For example, the initial path information defines an initial path starting from a node representing a logistics center, passing through one of the nodes representing a relay point, and arriving at a node representing a logistics center. For example, the initial path information specifies the path that the mobile object travels in the distribution operation, indicates the time limit and conditions of the mobile object in the case where the mobile object travels on the path, and defines how the driver performs the distribution operation. The one or more initial path information is, for example, initial path information corresponding to each of the multiple sites except the logistics center. For example, the obtaining unit 401 obtains the one or more initial path information by receiving the one or more initial path information from another computer. The other computer is, for example, the client device 201. For example, the obtaining unit 401 can obtain the one or more initial path information by receiving an input of the one or more initial path information based on the operation input of the user.

[0088] The obtaining unit 401 can obtain a start trigger for starting the processing of any of the functional units. The start trigger is, for example, a predetermined operation input by a user. The start trigger can be, for example, receiving predetermined information from another computer. The start trigger can be, for example, outputting predetermined information by any of the functional units. For example, the obtaining unit 401 receives the acquisition of the processing request as a start trigger for starting the processing by the setting unit 402 and the creating unit 403.

[0089] The setting unit 402 generates second path information different from any first path information among the one or more first path information obtained based on the one or more first path information obtained, and thereby sets a final path information group including the generated second path information and at least one first path information among the one or more first path information. For example, the second path information defines at least a second path as follows: the second path, a time limit for traveling to at least one of two or more nodes among the plurality of nodes, and a type of a mobile object traveling to the two or more nodes, and the second path passes through the two or more nodes.

[0090] The second path information is, for example, derived path information. The derived path information is, for example, path information that at least defines a second path that is the same as a first path defined by one of the one or more first path information and is different from any of the one or more first path information. The second path information may be, for example, temporary path information. The temporary path information is, for example, path information that at least defines a second path that is different from any of the first paths defined by the one or more first path information, respectively, and is different from any of the one or more first path information. For example, the second path information specifies a path that a mobile object travels in a distribution operation, indicates time limits and conditions for the mobile object in motion when the mobile object travels on the path, and defines how the driver performs the distribution operation.

[0091] For example, in the case where the obtaining unit 401 does not obtain one or more initial path information, the setting unit 402 obtains one or more initial path information by generating one or more initial path information, and adds the one or more initial path information to the path information group to update the path information group to the initial state. For example, for each of the multiple sites except the logistics center, the setting unit 402 generates initial path information that defines a path that passes through at least the site based on a graph by referring to the storage unit 400, thereby obtaining one or more initial path information. Thus, the setting unit 402 can add the minimum number of (i.e., one or more) initial paths that allow the setting to reduce the cost minimization problem and allow the path selection problem to be solved in the creation unit 403 to the path information group.

[0092] The setting unit 402 sets the final path information group by repeatedly performing the following series of processes until a predetermined condition is met: the optimal solution of the dual problem of the relaxation problem of the path selection problem of the path information group is set to minimize the reduced cost, and the current path information group is updated. For example, the final path information group preferably includes the second path information and at least one of the one or more first path information. The predetermined condition is, for example, a condition that neither the first path information with a negative reduced cost nor the second path information with a negative reduced cost exists. The predetermined condition can be, for example, a condition that a series of processes have been executed a predetermined number of times. The predetermined condition can be, for example, a condition that a predetermined time period has passed after the first execution of the series of processes.

[0093] For example, the setting unit 402 sets a reduced cost minimization problem for the optimal solution of the dual problem of the relaxed problem of the path selection problem of the current path information group. For example, based on the set reduced cost minimization problem, the setting unit 402 searches for first path information with a negative reduced cost in the obtained one or more first path information. For example, if the result of searching for the first path information is that there is first path information with a negative reduced cost, the setting unit 402 updates the current path information group by adding the first path information to the current path information group.

[0094] For example, in the case where the result of searching the first path information is that there is no first path information with a negative reduced cost, the setting unit 402 determines whether there is the second path information by searching for the second path information with a negative reduced cost based on the set reduced cost minimization problem. For example, in the case where there is second path information with a negative reduced cost, the setting unit 402 generates the second path information with a negative reduced cost, and adds the generated second path information to the current path information group to update the current path information group.

[0095] For example, in the case where there is no first path information with a negative reduced cost, the setting unit 402 determines whether the derived path information exists by searching for derived path information that will become second path information with a negative reduced cost based on the set reduced cost minimization problem. The derived path information is, for example, path information that at least defines a second path that is the same as a first path defined by one of the one or more first path information. For example, in the case where the derived path information exists, the setting unit 402 generates the derived path information as the second path information with a negative reduced cost, and adds the generated derived path information to the current path information group to update the current path information group.

[0096] For example, in the absence of the derived path information, the setting unit 402 determines whether the temporary path information exists by searching for temporary path information that will become the second path information with a negative reduced cost based on the set reduced cost minimization problem. The temporary path information is, for example, path information that at least defines a second path that is different from any first path in the first paths respectively defined by one or more first path information. For example, in the presence of the temporary path information, the setting unit 402 generates the temporary path information as the second path information with a negative reduced cost, and adds the generated temporary path information to the current path information group to update the current path information group. The information processing device 100 can set a final path information group including the second path information and at least one of the one or more first path information.

[0097] The creation unit 403 creates the current plan based on the final path information group set by the setting unit 402 so that the first path information is used preferentially over the second path information. For example, the creation unit 403 sets the weight of the cost in the case of using the second path information to a value greater than the weight of the cost in the case of using the first path information, and then sets an objective function indicating the weighted sum of the costs. For example, the weight is specified in advance by the user. For example, the creation unit 403 creates the current plan by solving a path selection problem in which the path information to be used in the current plan is selected from the final path information group so that the value indicated by the objective function is minimized.

[0098] For example, the creation unit 403 may create the current plan based on the final path information group set in the setting unit 402, so that the fixed path information is used preferentially over the derived path information and the derived path information is used preferentially over the temporary path information. For example, the creation unit 403 sets the weight of the cost in the case of using the derived path information to a value greater than the weight of the cost in the case of using the fixed path information. For example, the creation unit 403 sets the weight of the cost in the case of using the temporary path information to a value greater than the weight of the cost in the case of using the derived path information. For example, the creation unit 403 sets the objective function for calculating the weighted sum of the costs based on the set weights. For example, the creation unit 403 creates the current plan by solving a path selection problem in which the path information to be used in the current plan is selected from the final path information group so that the value indicated by the objective function is minimized.

[0099] Thus, the creation unit 403 can create the current plan and enable the current delivery operation to be performed. In this case, the creation unit 403 can create the current plan in a manner that uses the first path information in preference to the second path information, and increases the probability that the driver performs the delivery operation according to the first path information rather than the second path information. Therefore, the creation unit 403 can reduce the driver's workload. Considering the weighted sum of costs, the creation unit 403 can create the current plan in a manner that uses the second path information in addition to the first path information. Therefore, the creation unit 403 can reduce the cost of the delivery operation.

[0100] The output unit 404 outputs the processing result of at least one of the functional units. The output form is, for example, displaying the processing result on a display, outputting the processing result to a printer for printing, sending the processing result to an external device via the network I / F 303, or storing the processing result in the storage area of ​​the memory 302 or the recording medium 305. Thus, the output unit 404 can notify the user of the processing result of at least one of the functional units, and improve the convenience of the information processing device 100.

[0101] The output unit 404 outputs, for example, the current plan created by the creation unit 403. For example, the output unit 404 sends the current plan created by the creation unit 403 to another computer. The other computer is, for example, the client device 201. For example, the output unit 404 can output the current plan created by the creation unit 403 so that the user can refer to the current plan. Thus, the output unit 404 can make the current plan created by the creation unit 403 available outside the information processing device 100.

[0102] (Specific Example of Functional Configuration of Information Processing Device 100)

[0103] Next, use Figure 5 A specific example of the functional configuration of the information processing apparatus 100 will be described.

[0104] Figure 5 is a block diagram showing a specific example of the functional configuration of the information processing apparatus 100. Figure 5 In the embodiment, it is expected that the information processing device 100 creates a plan for appropriately collecting or distributing a plurality of items via a plurality of mobile objects by solving a path selection problem in which one or more path information is selected from a path information group so as to satisfy various conditions described below. The path information indicates at least a path, a visit time of each node on the path, and a type of truck. The mobile object is, for example, a large truck, a medium truck, a small truck, etc.

[0105] For example, one of the conditions is that a truck starting from a node representing a logistics center travels to several nodes and returns to a node representing a logistics center. The nodes to which the truck travels are, for example, nodes representing convenience stores, supermarkets, warehouses, etc. The access order of a truck traveling to two or more nodes is a path. For example, one of the conditions is that there are multiple types of trucks with different capacities and costs. For example, one of the conditions is that the nodes to which a truck can travel depends on the type of truck. For example, one of the conditions is that for each type of truck, there is an upper limit on the number of available trucks. For example, one of the conditions is that each truck collects items from the node to which it travels or delivers items to the node to which it travels. Any truck in the truck can collect and deliver items at the same node as any node in the node.

[0106] For example, one of the conditions is that for each item, there is a node from which the item is collected and a node to which the item is delivered. For example, an item is transported from a node representing a logistics center to a node representing a site other than a logistics center. For example, an item is transported from a node representing a site other than a logistics center to a node representing a logistics center. For example, an item is transported from a node representing a site other than a logistics center to a node representing a site other than a logistics center.

[0107] For example, one of the conditions is to set a size for each item. For example, one of the conditions is to load items onto each truck within the truck's load capacity. For example, one of the conditions is to set a priority for each item. For example, one of the conditions is to load items with a high priority onto each truck first. For example, one of the conditions is to set whether the item is divisible for each item.

[0108] For example, one of the conditions is to set a collection time frame and a delivery time frame for each item. The collection time frame [a, b] indicates that when a truck arrives at an item collection node before time a, the truck waits until time a and collects the item by time b. The delivery time frame [c, d] indicates that when a truck arrives at an item delivery node before time c, the truck waits until time c and delivers the item by time d.

[0109] For example, one of the conditions is that a truck cannot move between nodes that are not linked to each other by edges. For example, one of the conditions is that for each type of truck, an upper limit is set on the total travel time of the truck. For example, one of the conditions is that the truck must perform at least one of collection and distribution at a node representing a site other than a logistics center. For example, one of the conditions is that for each type of truck, the distribution cost of the truck is defined by a weighted sum based on a step function, a fixed cost, and the travel time. The step function depends on the travel time of the truck.

[0110] For example, one of the conditions is that the delivery or collection of the same node is performed every day. For example, one of the conditions is that one or more fixed path information preferred by the driver is set. The fixed path information at least indicates the path, the visit time of each node on the path, and the type of truck. One of the multiple fixed path information can be selected in the path selection problem. For example, one of the conditions is that, in the case where the fixed path information is not selected in the path selection problem, it is preferred to select the derived path information that at least indicates the same path as the path indicated by the fixed path information and is different from the fixed path information.

[0111] For example, the information processing device 100 desirably creates a plan that enables all items to be appropriately collected or delivered and minimizes the total delivery cost by assigning path information to each of a plurality of trucks so that each of various conditions is satisfied.

[0112] The information processing device 100 includes a vehicle routing problem (VRP) data storage unit 511, an initial path generation unit 512, a solution parameter storage unit 513, a path generation unit 514, and a path set storage unit 515. The information processing device 100 also includes a path selection problem solving unit 516 and an output data generation unit 517. The path generation unit 514 includes a dual problem solving unit 521, a cost reduction minimization problem solving unit 522, and a termination determination unit 523.

[0113] The VRP data storage unit 511 obtains VRP data and stores the VRP data in the input data 501. The VRP data defines the above-mentioned various conditions. The VRP data includes, for example, item data, node data, delivery vehicle data, and fixed path information. The item data indicates the node from which the item is collected and the node to which the item is delivered. The item data indicates whether the item is divisible. The item data indicates the priority of the item. The item data indicates the collection time frame and the delivery time frame of the item.

[0114] The node data indicates a node representing a logistics center. The node data indicates the travel time between nodes. The node data indicates the edges coupling the nodes. The distribution vehicle data indicates the load capacity of the truck. The distribution vehicle data indicates the upper limit of the number of available trucks for each type of truck. For each type of truck, the distribution vehicle data indicates the nodes to which the truck can travel. For each type of truck, the distribution vehicle data indicates the upper limit of the total travel time of the truck. For each type of truck, the distribution vehicle data indicates a step function for defining the distribution cost of the truck. For each type of truck, the distribution vehicle data indicates a fixed cost for defining the distribution cost of the truck. The fixed path information indicates at least the path, the visit time of each node on the path, and the type of truck. The VRP data storage unit 511 provides the VRP data to the initial path generation unit 512, the path generation unit 514, and the path selection problem solving unit 516.

[0115] The initial path generation unit 512 obtains VRP data. The initial path generation unit 512 generates initial path information defining a path passing through each node among nodes representing sites other than the logistics center based on the VRP data. For example, the initial path information defines a path starting from a node representing a logistics center, passing through nodes representing sites other than the logistics center, and arriving at a node representing the logistics center. The initial path generation unit 512 provides the generated initial path information to the path set storage unit 515.

[0116] The solution parameter storage unit 513 obtains and stores the solution parameters in the input data 501. The solution parameters include a penalty coefficient for each path information in the fixed path information, the derived path information, and the temporary path information. The derived path information indicates at least the path, the access time of each node on the path, and the type of truck. The derived path information is path information indicating the same path as the path indicated by one of the one or more fixed path information and different from any fixed path information in the one or more fixed path information. The derived path information is different from any fixed path information in the one or more fixed path information at least in the access time of each node on the path or the type of truck. The temporary path information indicates at least the path, the access time of each node on the path, and the type of truck. The temporary path information is path information different from any fixed path information in the one or more fixed path information.

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

[0118] The path generation unit 514 obtains the VRP data and activates the dual problem solving unit 521, the cost reduction minimization problem solving unit 522, and the termination determination unit 523. The dual problem solving unit 521 sets the dual problem of the linear relaxation problem of the path selection problem for the latest path information group. The dual problem solving unit 521 calculates the optimal solution of the set dual problem. The dual problem solving unit 521 provides the optimal solution of the set dual problem to the cost reduction minimization problem solving unit 522.

[0119] The cost reduction minimization problem solving unit 522 sets a cost reduction minimization problem for the optimal solution of the dual problem. The cost reduction minimization problem solving unit 522 searches for fixed path information, derived path information, or temporary path information as path information with negative reduced cost by solving the cost reduction minimization problem for the optimal solution of the dual problem. In the case where the cost reduction minimization problem solving unit 522 generates fixed path information, derived path information, or temporary path information as path information with negative reduced cost through search, the cost reduction minimization problem solving unit 522 adds the path information with negative reduced cost to the latest path information group, thereby updating the latest path information group. The cost reduction minimization problem solving unit 522 provides the latest path information group to the path set storage unit 515. The cost reduction minimization problem solving unit 522 provides information on whether path information with negative reduced cost is generated to the termination determination unit 523.

[0120] In the case where path information having a negative reduced cost is not generated in the reduced cost minimization problem solving unit 522, the termination determination unit 523 activates the path selection problem solving unit 516. When the time from the activation exceeds the time limit, the termination determination unit 523 activates the path selection problem solving unit 516. When path information having a negative reduced cost is generated in the reduced cost minimization problem solving unit 522 before the time from the activation exceeds the time limit, the termination determination unit 523 activates the dual problem solving unit 521 again.

[0121] The path set storage unit 515 stores the path information group. The path set storage unit 515 receives the initial path information from the initial path generation unit 512 and adds the initial path information to the path information group. The path set storage unit 515 obtains the latest path information group from the cost minimization problem solving unit 522 and stores the latest path information group. The path set storage unit 515 provides the latest path information group to the path selection problem solving unit 516.

[0122] The routing problem solving unit 516 obtains VRP data. The routing problem solving unit 516 obtains solution parameters. The routing problem solving unit 516 obtains the latest routing information group. The routing problem solving unit 516 sets a routing problem for selecting a plurality of routing information to be used in the current plan from the latest routing information group by setting an objective function corresponding to the total delivery cost based on the VRP data and the solution parameters.

[0123] The delivery cost of the path r (r∈R) indicated by the path information is assumed to be c r R is a set of paths r. For example, the total delivery cost is defined by the following formula (1). In formula (1), x r ∈Z is an integer variable. The number of times path r is used in the current plan is given by x r express.

[0124]

[0125] The path selection problem solving unit 516 sets a penalty coefficient p(r) for the path r indicated by the path information so that the fixed path information is preferentially selected relative to the derived path information and the derived path information is preferentially selected relative to the temporary path information, and applies the penalty coefficient p(r) to the above equation (1). For example, the penalty coefficient p(r) is defined by the following equation (2). In equation (2), λ is satisfied. 2 ≥λ 1 >1.

[0126]

[0127] For example, the routing problem solving unit 516 sets the following equation (3) obtained by applying the above equation (2) to the above equation (1) as the objective function. Thus, the routing problem solving unit 516 can allow the current plan to be created so that the total delivery cost is reduced, and the fixed path information is preferentially selected over the derived path information, and the derived path information is preferentially selected over the temporary path information.

[0128]

[0129] The path selection problem solving unit 516 solves the set path selection problem to select a plurality of path information to be used in the current plan so as to minimize the value of the objective function, and creates a current plan including the selected plurality of path information. The path selection problem solving unit 516 provides the created current plan to the output data generating unit 517.

[0130] The output data generating unit 517 obtains the current plan. The output data generating unit 517 generates output data 502 based on the current plan. The output data 502 indicates the current plan. The output data 502 includes a path information list in which identification information for identifying each of the plurality of path information forming the current plan is recorded. The output data 502 includes a plurality of path information forming the current plan.

[0131] The output data 502 includes, for example, the type of path information. The type indicates whether the path information is fixed path information, derived path information, or temporary path information. The output data 502 includes, for example, a specified vehicle type. The specified vehicle type indicates the type of truck indicated by the path information. The output data 502 includes, for example, the visit order of each node on the path. The visit order indicates the path indicated by the path information.

[0132] The output data 502 includes, for example, the access time of each node on the path. The output data 502 includes, for example, the item quantity data at each node on the path. Thus, the information processing device 100 can create a current plan so that the driver's workload is reduced and the total delivery cost of the delivery operation is reduced, and enables the current delivery operation to be performed.

[0133] (Example of Operation of Information Processing Device 100)

[0134] The following will use Figure 6 and Figure 7 An example of the operation of the information processing apparatus 100 will be described.

[0135] Figure 6 to Figure 7 is an explanatory diagram showing an example of the operation of the information processing apparatus 100. Figure 6 and Figure 7 In the example shown, the derived route information is route information that has the same access order as the fixed route information and is different from the fixed route information in at least one of access time and designated vehicle type. For example, the derived route information has the effect of helping to reduce the driver's workload due to its similarity to the fixed route information, has the property of being easy to handle daily changes in the amount of goods due to its difference from the fixed route information, and has the effect of helping to reduce the total delivery cost.

[0136] Temporary route information is route information that is different from fixed route information and derived route information. Temporary route information is route information that has a different access order from fixed route information. Since the access order of temporary route information is independent of fixed route information, temporary route information has the property of being easy to handle daily changes in the amount of items, and has the effect of helping to reduce the total delivery cost.

[0137] In the following description, path information is represented by r. A path information group is represented by R. An item is represented by i. A group of items i is represented by T. The size of item i (i∈T) is represented by b. i The type of truck is denoted by t. The set of trucks of type t is denoted by U. The number of available trucks of type t belonging to U is denoted by m. t Whether the route information r includes the type of truck t is determined by d tr For example, d tr It is defined by the following equation (4). Fixed path information is represented by f. A set of fixed path information is represented by F. Whether path information r is fixed path information f is represented by g fr For example, g fr It is defined by the following formula (5). The number of times the path information r is used in the current plan is given by x r express.

[0138]

[0139]

[0140] As described above, when the information processing device 100 creates the current plan, the information processing device 100 preferably selects the fixed path information in preference to the derived path information and in preference to the temporary path information. Therefore, the information processing device 100 sets a path selection problem by setting the objective function shown in the following equation (6) and the constraints shown in the following equations (7) to (10), in which a plurality of path information to be used in the current plan is selected from the path information group. The following equation (6) corresponds to the above equation (3).

[0141]

[0142]

[0143]

[0144]

[0145]

[0146] The objective function indicates a value that is a target to be minimized. Due to the coefficient p(r), the value indicated by the objective function when using the derived path information is greater than the value indicated by the objective function when using the fixed path information. As shown in the above formula (3), due to the coefficient p(r), the value indicated by the objective function when using the temporary path information is greater than the value indicated by the objective function when using the derived path information.

[0147] Therefore, in minimizing the value indicated by the objective function, the information processing device 100 can be made more likely to give priority to the fixed path information over the derived path information, and give priority to the derived path information over the temporary path information. Thus, the information processing device 100 can set the path selection problem so that the total delivery cost is reduced, and the fixed path information is given priority over the derived path information, and the derived path information is given priority over the temporary path information.

[0148] The information processing device 100 sets the path information group R to be referred to in the path selection problem according to the column generation method. In the column generation method, the path information group R is set by repeatedly generating a unit process of the path information r. (1) For example, the information processing device 100 sets the path information group R to an initial state. (2) For example, the information processing device 100 solves the dual problem of the linear relaxation problem of the path selection problem for the current path information group R by using a solver of the dual problem, and thereby calculates the optimal solution of the dual problem.

[0149] (3) For example, the information processing device 100 solves the reduced cost minimization problem of the dual problem based on the optimal solution of the dual problem by using a solver of the reduced cost minimization problem, and thereby calculates the solution to the reduced cost minimization problem. (4) When the reduced cost of the calculated solution is negative, the information processing device 100 adds the path information corresponding to the solution to the path information group R, and returns to the processing of (2) above. The processing of (2) to (4) above corresponds to the unit processing described above. When the reduced cost of the calculated solution is not negative, the information processing device 100 determines the current path information group R as the final path information group R to be referenced in the path selection problem.

[0150] 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 spent on calculating the optimal solution of the cost reduction minimization problem may increase, the information processing device 100 preferably solves the cost reduction minimization problem through local search and calculates the local solution of the cost reduction minimization problem.

[0151] Since the relaxation of the path selection problem is to remove each variable x in the path selection problem rThe relaxed problem is obtained by the integer constraint of the following equation (11) and the constraints of the following equations (12) to (15). The relaxed problem is a linear programming problem. The dual problem is defined for the linear programming problem. The dual problem of the relaxed problem is defined by the objective function of the following equation (16) and the constraints of the following equations (17) to (20).

[0152]

[0153]

[0154]

[0155]

[0156]

[0157]

[0158]

[0159]

[0160]

[0161]

[0162] Assume that the optimal solution of the dual problem in the repeated unit processing in the column generation method is (y*, z*, w*). In this case, the cost reduction minimization problem is defined by the following items: a variable r indicating the path information, a variable a being the size of the item i to be transported in the path information r, ～ i , a 0-1 variable d that takes the value 1 if the route information r includes the type of truck t ～ t , a 0-1 variable g that takes the value 1 when the path information r is a fixed path f ～ f , the objective function of the following equation (21), the constraints based on the above various conditions, and the constraints of the following equations (22) to (24). For convenience, in some cases, the characters with "~" at the top are represented as "characters ～ ”.

[0163]

[0164]

[0165]

[0166]

[0167] For example, the information processing device 100 implements the above-mentioned processing of (2) to (4) by performing the processing of (a) to (c) described below, and processes the unit processing. (a) For example, the information processing device 100 performs a local search for all fixed path information allocation items. For example, in the case where the information processing device 100 finds fixed path information with a negative reduction cost, the information processing device 100 updates the current path information group R by adding the fixed path information with a negative reduction cost to the current path information group R, and terminates one execution of the above-mentioned unit processing. For example, in the case where the information processing device 100 does not find fixed path information with a negative reduction cost, the information processing device 100 proceeds to the processing of (b).

[0168] (b) For example, the information processing device 100 performs a local search for generating derived path information for all fixed path information. For example, in the case where the information processing device 100 finds derived path information with a negative reduced cost, the information processing device 100 updates the current path information group R by adding the derived path information with a negative reduced cost to the current path information group R, and terminates one execution of the above-mentioned unit processing. For example, in the case where the information processing device 100 does not find derived path information with a negative reduced cost, the information processing device 100 proceeds to the processing of (c).

[0169] (c) For example, the information processing device 100 performs a local search to generate temporary path information. For example, in the case where the information processing device 100 finds temporary path information with a negative reduced cost, the information processing device 100 updates the current path information group R by adding the temporary path information with a negative reduced cost to the current path information group R, and terminates one execution of the above-mentioned unit processing. For example, in the case where the information processing device 100 does not find temporary path information with a negative reduced cost, the information processing device 100 determines the current path information group R as the final path information group R, and terminates the unit processing.

[0170] Thus, the information processing device 100 can determine the final path information group R. The information processing device 100 can reduce the processing time and processing load spent compared to the processing time and processing load spent to determine the final path information group R when checking all the fixed path information, derived path information, and temporary path information for each unit processing. The information processing device 100 can check the fixed path information, derived path information, and temporary path information in descending order of priority for each unit processing. Thus, it is possible to make it more likely that the information processing device 100 will appropriately determine the final path information group R while reducing the processing load and processing time.

[0171] A specific example of the above-mentioned processing (a) to (c) is described. 0 represents the initial path information. N represents the set of additional nodes. (A) The information processing device 100 sets r:=r 0 (B) The information processing device 100 sets a path information group R', in which a task is assigned to the path information r. For example, the task is to transport an item. The information processing device 100 specifies in R' the path information r' (r'∈R) that satisfies the constraint conditions as the above conditions and in which the value indicated by the objective function g() of the cost minimization problem is minimized.

[0172] (C) When the additional node set is not empty, the information processing device 100 performs the processing of (C-1) to (C-3) described below on the node v (v∈N). (C-1) The information processing device 100 specifies a new path information r obtained by adding the node v to the access order of the path information r. v (C-2) The information processing device 100 specifies the path information group R' v , where for path information r v Assign a task. The information processing device 100 is in R' v The path information r' which satisfies the constraint conditions as the above conditions and in which the value indicated by the objective function g() of the cost minimization problem is minimized is specified in v (r' v ∈R). (C-3) When g(r')>g(r' v ), the information processing device 100 sets r':=r' v .

[0173] (D) When g(r)<g(r') is satisfied, the information processing device 100 outputs the path information r as a solution to the cost minimization problem. (E) When g(r)<g(r') is not satisfied, the information processing device 100 returns to the process of (B). Thus, the information processing device 100 can output the path information r as a solution to the cost minimization problem and make the path information group R updateable.

[0174] For example, in the process of (a), the information processing device 100 sets each fixed path information to r 0 , the additional node set N is usually set to an empty set, and the above-mentioned processes (A) to (E) are performed. Thus, the information processing device 100 can specify the fixed path information as a solution to the cost minimization problem.

[0175] For example, in the process of (b), the information processing device 100 sets the derived path information indicating the type t of the truck and indicating the same access order as the access order in the fixed path information i as r for each fixed path information i and each truck type t. 0 . For example, in the process of (b), the information processing device 100 generally sets the additional node set N to an empty set. Then, for example, in the process of (b), the information processing device 100 performs the processes of (A) to (E) above. Thus, the information processing device 100 can specify the derived path information as a solution to the cost minimization problem.

[0176] For example, in the process of (c), the information processing device 100 specifies an access sequence starting from the node representing the logistics center, passing through the node v, and returning to the node representing the logistics center for each node v indicating a site other than the logistics center and each truck type t. For example, in the process of (c), the information processing device 100 sets the temporary path information indicating the specified access sequence and indicating the type t of the truck to r 0 . For example, the information processing device 100 sets the additional node set N to a node set that collects nodes representing sites other than the logistics center. Then, for example, the information processing device 100 performs the processing of (A) to (E) above. Thereby, the information processing device 100 can specify the temporary path information as a solution to the cost minimization problem.

[0177] Although it has been described that the information processing device 100 does not have to check all the fixed path information, derived path information, and temporary path information for each unit process, the embodiments are not limited to this case. For example, there may be a case where the information processing device 100 checks all the fixed path information, derived path information, and temporary path information for each unit process, finds appropriate path information with a negative reduction cost, and determines the final path information group R. Figure 6 , and an example of a plan actually created by the information processing device 100 will be described.

[0178] Figure 6 The graph 600 in FIG. 1 shows 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 path information. Therefore, the information processing device 100 can reduce the workload of the driver.

[0179] Figure 6Graph 610 in FIG. 610 shows a plan created by the information processing device 100 for the next day. As shown in graph 610, the information processing device 100 can create a plan using fixed path information. Therefore, the information processing device 100 can reduce the workload of the driver. As shown in graph 610, when there is an item that cannot be delivered to one of the nodes using only fixed path information, the information processing device 100 can create a plan so that temporary path information is used. Therefore, the information processing device 100 can achieve appropriate delivery of items to the nodes.

[0180] Figure 6 The chart 620 in FIG. 1 shows a plan created by the information processing device 100 for the third day. As shown in the chart 620, the information processing device 100 can create a plan using the derived path information having the same access order as the access order of the fixed path information. Thus, the information processing device 100 can reduce the workload of the driver while enabling the items to be properly delivered to the nodes. Figure 7 , and an example of a plan created by a method of the related art will be described.

[0181] The method of the related art is a method of creating a plan where fixed route information does not exist but new route information is generated without limiting the order of visits per day, the type of truck, and the like. Figure 7 The graph 700 in FIG. 1 shows a schedule created for the first day by the method of the related art. As shown in the graph 700 , it is assumed that the method of the related art creates the same schedule as the schedule of the information processing device 100 .

[0182] Figure 7 Graph 710 in FIG. 7 shows a plan created for the second day by the method of the related art. As shown in graph 710, the method of the related art sometimes creates a plan for the second day by generating new path information in which the access order is different from the access order of the path information used in the plan created for the first day. Therefore, in the method of the related art, it is difficult to reduce the workload of the driver.

[0183] Figure 7 Graph 720 in FIG. 7 shows a plan created for the third day by the method of the related art. As shown in graph 720, the method of the related art sometimes creates a plan for the third day by generating new path information in which the access order is different from the access order in the path information used in the plan created for the first day and the path information used in the plan created for the second day. Therefore, in the method of the related art, it is difficult to reduce the workload of the driver.

[0184] (Examples of Effects Produced by Information Processing Device 100)

[0185] Next, by using Figure 8 and Fig. 9 An example of the effect produced by the information processing apparatus 100 will be described.

[0186] Figure 8 and Fig. 9 is an explanatory diagram showing an example of the effect. Figure 8 and Fig. 9 In the example of , the information processing device 100 is applied to the distribution situation. The distribution situation is defined by the distribution data of a specific area for seven days. Assume that the number of nodes related to the specific area is 34. Assume that the number of items is about 300 per day. Here, 119 fixed path information is prepared in advance. The penalty coefficient λ 1 is 1.3. Penalty coefficient λ 2 is 1.5. Continue to describe Figure 8 Description.

[0187] Figure 8 Table 800 shows a plan created by the information processing device 100 for each day. "Name" is an instance name for identifying a plan. The instance name indicates the number of days of the plan. "Cost" indicates the total delivery cost excluding penalties. "Penalty" indicates the total penalty associated with derived path information and temporary path information. "#(Fixed)" indicates the number of fixed path information used in the plan. "#(Derived)" indicates the number of derived path information used in the plan. "#(Temporary)" indicates the number of temporary path information used in the plan.

[0188] As shown in Table 800, the information processing device 100 can create a plan for each day so that the fixed path information is used most frequently, followed by the derived path information and the temporary path information. As shown in Table 800, the information processing device 100 can use the fixed path information and the derived path information for about 90% of the path information used in the plan. Thus, the information processing device 100 can make the visit sequence of the truck less likely to change every day and reduce the workload of the driver. Next, continue to describe the Fig. 9 Description.

[0189] Fig. 9 Table 900 in shows the total delivery cost excluding penalty in the corresponding plan for seven days created for each of the case where fixed route information exists and the case where fixed route information does not exist. The upper limit of the processing time for creating a plan is assumed to be 3600 seconds.

[0190] As shown in Table 900, even if fixed path information exists, it tends not to have an adverse effect on the total delivery cost. As shown in Table 900, on some days, the total delivery cost when fixed path information exists is lower than the total delivery cost when fixed path information does not exist. Since there is an upper limit to the processing time for creating a plan, it is considered that there is a situation where it is easier to create a preferred plan when fixed path information exists than when the fixed path information does not exist. 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 of the driver.

[0191] (Overall processing process)

[0192] Next, we will use Fig.10 An example of the overall processing procedure performed by the information processing device 100 is described below. The overall processing is performed by, for example, Figure 3 The CPU 301, memory 302, storage area of ​​a recording medium 305, etc., and network I / F 303 are shown to realize the above-mentioned.

[0193] Fig.10 is a flowchart showing an example of the overall processing procedure. Fig.10 In step S1001 , the information processing device 100 generates one or more pieces of initial path information and registers the generated initial path information in the path information group R. Next, the information processing device 100 proceeds to the process of step S1002 .

[0194] In step S1002, the information processing device 100 calculates the optimal solution of the dual problem of the linear relaxation problem of the path selection problem for the path information group R (step S1002). Next, the information processing device 100 performs Fig.11 The updated process described later in the process is used to solve the reduced cost minimization problem for the optimal solution of the calculated dual problem (step S1003).

[0195] The information processing device 100 determines whether the path information with a negative reduction cost is generated (step S1004). In the case where the path information with a negative reduction cost is generated (step S1004: Yes), the information processing device 100 proceeds to the process of step S1005. However, in the case where the path information with a negative reduction cost is not generated (step S1004: No), the information processing device 100 proceeds to the process of step S1006.

[0196] In step S1005, the information processing apparatus 100 determines whether the time limit has been exceeded (step S1005). In the case where the time limit has been exceeded (step S1005: Yes), the information processing apparatus 100 proceeds to the process of step S1006. However, in the case where the time limit has not been exceeded (step S1005: No), the information processing apparatus 100 returns to the process of step S1002.

[0197] In step S1006, the information processing apparatus 100 selects one or more pieces of path information from the path information group R by solving a path selection problem for the path information group R (step S1006). Then, the information processing apparatus 100 terminates the overall processing.

[0198] (Update Process)

[0199] Next, use Fig.11 An example of the update process performed by the information processing device 100 is described below. The update process is performed by, for example, Figure 3 The CPU 301, memory 302, storage area of ​​a recording medium 305, etc., and network I / F 303 are shown to realize the above-mentioned.

[0200] Fig.11 is a flowchart showing an example of an update processing procedure. Fig.11 In the embodiment, the information processing device 100 sets a reduced cost minimization problem for an optimal solution to the dual problem (step S1101). The information processing device 100 refers to the reduced cost minimization problem and searches for fixed path information having a negative reduced cost in one or more fixed path information based on one or more fixed path information (step S1102).

[0201] The information processing device 100 determines whether fixed path information with a negative reduced cost is generated by the search (step S1103). In the case where fixed path information with a negative reduced cost is generated (step S1103: Yes), the information processing device 100 proceeds to the process of step S1108. However, in the case where fixed path information with a negative reduced cost is not generated (step S1103: No), the information processing device 100 proceeds to the process of step S1104.

[0202] In step S1104, the information processing device 100 refers to the reduced cost minimization problem, and searches for derived path information with a negative reduced cost based on one or more fixed path information (step S1104). The information processing device 100 determines whether derived path information with a negative reduced cost is generated by the search (step S1105). In the case where derived path information with a negative reduced cost is generated (step S1105: Yes), the information processing device 100 proceeds to the processing of step S1108. On the other hand, in the case where derived path information with a negative reduced cost is not generated (step S1105: No), the information processing device 100 proceeds to the processing of step S1106.

[0203] In step S1106, the information processing device 100 refers to the reduced cost minimization problem, and searches for temporary path information with a negative reduced cost based on one or more fixed path information (step S1106). The information processing device 100 determines whether temporary path information with a negative reduced cost is generated by the search (step S1107). In the case where temporary path information with a negative reduced cost is generated (step S1107: Yes), the information processing device 100 proceeds to the processing of step S1108. However, in the case where temporary path information with a negative reduced cost is not generated (step S1107: No), the information processing device 100 terminates the update processing.

[0204] In step S1108, the information processing device 100 adds the path information with the negative reduction cost to the path information group R (step S1108). Then, the information processing device 100 terminates the update process. The information processing device 100 may change Fig.10 and Fig.11 The information processing apparatus 100 may skip the processing order of some steps in each of the steps in the flowchart and execute these steps. Fig.10 and Fig.11 The flowcharts are processed in some of the steps in each of the steps in the flowchart.

[0205] As described above, according to the information processing device 100, one or more first path information can be obtained. According to the information processing device 100, second path information different from any first path information in the one or more first path information is generated based on the one or more first path information, so that a path information group including the generated second path information and at least one first path information in the one or more first path information can be set. According to the information processing device 100, a plan defining a path for each of a plurality of mobile objects to travel to two or more of a plurality of nodes can be created based on the set path information group, so that the first path information is used preferentially compared to the second path information. Thereby, the information processing device 100 can reduce the workload of the executor of the execution plan. The information processing device 100 can reduce the cost of executing the plan.

[0206] According to the information processing device 100, the weight of the cost in the case of using the second path information can be set to a value greater than the weight of the cost in the case of using the first path information. According to the information processing device 100, a plan can be created by solving a path selection problem in which path information to be used in the plan is selected from the path information group so that the weighted sum of the costs is minimized. Thus, the information processing device 100 can create a plan in which the first path information is used preferentially compared to the second path information. Therefore, the information processing device 100 can reduce the workload of the executor of the execution of the plan.

[0207] According to the information processing device 100, a path information group can be set so that the path information group includes one or more initial path information in an initial state. According to the information processing device 100, a reduced cost minimization problem of the optimal solution of the dual problem of the relaxation problem of the path selection problem for the path 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, in a series of processes, in the case where there is first path information with a negative reduced cost in one or more first path information obtained, the first path information can be added to the path information group. According to the information processing device 100, in a series of processes, in the case where there is no first path information with a negative reduced cost, second path information with a negative reduced cost can be generated and added to the path information group. Thus, the information processing device 100 can set an appropriate path information group. The information processing device 100 can reduce the processing time spent on setting the path information group.

[0208] According to the information processing device 100, the second path information with a negative reduced cost can be generated by searching for the second path information with a negative reduced cost, the second path information with a negative reduced cost defining at least a second path that is the same as the first path defined by one of the one or more first path information. Thus, the information processing device 100 can generate the path information with a relatively high degree of freedom. Therefore, the information processing device 100 can help reduce the cost of the plan while reducing the workload of the executor of the plan.

[0209] According to the information processing device 100, the second path information with a negative reduced cost can be generated by searching for the second path information with a negative reduced cost, the second path information with a negative reduced cost defining at least a second path different from any first path among the first paths respectively defined by one or more first path information. Thus, the information processing device 100 can generate the path information with a relatively high degree of freedom. Therefore, the information processing device 100 can contribute to reducing the cost of the plan.

[0210] According to the information processing apparatus 100, a series of processes can be repeatedly performed until both the first path information with a negative reduction cost and the second path information with a negative reduction cost do not exist. Thus, the information processing apparatus 100 can set an appropriate path information group.

[0211] According to the information processing device 100, path information that defines at least a second path that is the same as a first path defined by one of the one or more first path information and is different from any of the one or more first path information can be generated as the second path information. Thus, the information processing device 100 can generate path information with a relatively high degree of freedom. Therefore, the information processing device 100 can contribute to reducing the cost of the plan while reducing the workload of the executor of the plan.

[0212] According to the information processing device 100, path information that defines at least a second path different from any first path in the first paths defined by one or more first path information and different from any first path information in one or more first path information can be generated as the second path information. Thus, the information processing device 100 can generate path information with a relatively high degree of freedom. Therefore, the information processing device 100 can contribute to reducing the cost of the plan.

[0213] The information processing method described in this embodiment can be implemented by causing a computer such as a PC or a workstation to execute a pre-prepared program. The information processing program described in this embodiment is recorded in a computer-readable recording medium and is executed by reading from the recording medium by a computer. The recording medium is a hard disk, a floppy disk, a compact disk (CD)-ROM, a magneto-optical (MO) disk, a digital versatile disk (DVD), etc. The information processing program described in this embodiment can be distributed via a network such as the Internet.

Claims

1. A non-transitory computer-readable recording medium storing an information processing program, the information processing program being used to cause a computer to execute a process, the process comprising: obtaining one or more first path information, each of the one or more first path information including at least a first path among the following parameters, wherein the first path is a path passing through two or more nodes among a plurality of nodes, and the parameters include: the first path, a time limit for traveling to at least one of the two or more nodes, and a type of a mobile object traveling to the two or more nodes; generating second path information based on the one or more first path information, and thereby setting a path information group including the second path information and at least one first path information among the one or more first path information, the second path information being different from any first path information among the one or more first path information and defining at least a second path among: the second path, a time limit for traveling to at least one of two or more of the plurality of nodes, and a type of a mobile object traveling to the two or more nodes, wherein the second path passes through the two or more nodes; and A plan defining a path for each of a plurality of mobile objects to travel to two or more of the plurality of nodes is created based on the path information group so that the first path information is used with priority over the second path information.

2. The non-transitory computer-readable recording medium according to claim 1, wherein Creating the plan includes setting the weight of the cost when using the second path information to a value greater than the weight of the cost when using the first path information, and then solving a path selection problem in which path information to be used in the plan is selected from the path information group so that the weighted sum of the costs is minimized.

3. The non-transitory computer-readable recording medium according to claim 2, wherein: The path information group includes one or more initial path information in an initial state, and Setting the path information group includes: setting the path information group including the second path information and at least one of the one or more first path information by repeatedly performing a series of processes based on a reduced cost minimization problem of an optimal solution to a dual problem of a relaxed problem of the path selection problem for the path information group, the series of processes including: in the case where there is the first path information with a negative reduced cost, adding the first path information with a negative reduced cost among the one or more first path information to the path information group, and in the case where there is no first path information with a negative reduced cost, generating the second path information with a negative reduced cost and adding the second path information with a negative reduced cost to the path information group.

4. The non-transitory computer-readable recording medium according to claim 3, wherein: Setting the path information group includes: generating the second path information with a negative reduced cost by searching for the second path information with a negative reduced cost when the first path information with a negative reduced cost does not exist based on the reduced cost minimization problem, the second path information with a negative reduced cost defining at least the same second path as the first path defined by one of the one or more first path information, and The generated second path information is added to the path information group.

5. The non-transitory computer-readable recording medium according to claim 3, wherein: Setting the path information group includes: generating the second path information with a negative reduced cost by searching for the second path information with a negative reduced cost when the first path information with a negative reduced cost does not exist based on the reduced cost minimization problem, the second path information with a negative reduced cost defining at least the second path different from any first path among the first paths respectively defined by the one or more first path information, and The generated second path information is added to the path information group.

6. The non-transitory computer-readable recording medium according to claim 3, wherein: Setting the path information group includes: The series of processes is repeatedly performed until both the first path information having a negative reduced cost and the second path information having a negative reduced cost do not exist.

7. An information processing method implemented by a computer, the information processing method comprising: obtaining one or more first path information, each of the one or more first path information including at least a first path among the following parameters, wherein the first path is a path passing through two or more nodes among a plurality of nodes, and the parameters include: the first path, a time limit for traveling to at least one of the two or more nodes, and a type of a mobile object traveling to the two or more nodes; generating second path information based on the one or more first path information, and thereby setting a path information group including the second path information and at least one first path information among the one or more first path information, the second path information being different from any first path information among the one or more first path information and defining at least a second path among: the second path, a time limit for traveling to at least one of two or more of the plurality of nodes, and a type of a mobile object traveling to the two or more nodes, wherein the second path passes through the two or more nodes; and A plan defining a path for each of a plurality of mobile objects to travel to two or more of the plurality of nodes is created based on the path information group so that the first path information is used with priority over the second path information.

8. An information processing device, comprising a control unit, the control unit being configured to perform a process, the process comprising: obtaining one or more first path information, each of the one or more first path information including at least a first path among the following parameters, wherein the first path is a path passing through two or more nodes among a plurality of nodes, and the parameters include: the first path, a time limit for traveling to at least one of the two or more nodes, and a type of a mobile object traveling to the two or more nodes; generating second path information based on the one or more first path information, and thereby setting a path information group including the second path information and at least one first path information among the one or more first path information, the second path information being different from any first path information among the one or more first path information and defining at least a second path among: the second path, a time limit for traveling to at least one of two or more of the plurality of nodes, and a type of a mobile object traveling to the two or more nodes, wherein the second path passes through the two or more nodes; and A plan defining a path for each of a plurality of mobile objects to travel to two or more of the plurality of nodes is created based on the path information group so that the first path information is used with priority over the second path information.

Images