Patent Publication Number: US-2023133816-A1

Title: Information processing apparatus, information processing method, and computer program product

Description:
FIELD 
     Embodiments described herein relate generally to an information processing apparatus, an information processing method, and a computer program product. 
     BACKGROUND 
     A technique of automatically creating a load delivery plan for trucks or another kind of vehicles using a computer is available. Such a technique may deal with an enormous number of combinations of delivery routes with respect to a large number of locations including logistics centers, repositories and depositories that house goods and objects, and delivery destinations such as factories. 
     To calculate an efficient route from among such an enormous number of combinations of delivery routes using a computer, the computer is subjected to a large amount of computational load, and thus requires a large amount of computation time. Further, it may not be able to automatically calculate, for example, the optimal number of trucks or other vehicles to be used for delivery in a traditional manner. 
     SUMMARY 
     According to one embodiment, an information processing apparatus is provided. The information processing apparatus is used for delivery of a plurality of objects by a plurality of mobile structures among a plurality of logistics centers, a plurality of depositories, and a plurality of delivery destinations. The information processing apparatus includes processing circuitry. The processing circuitry is configured to compute, using a mathematical model, at least: the number of the plurality of mobile structures to be used for delivery of the plurality of objects; mobile-structure route information including logistics centers, depositories, and delivery destinations in which each of the plurality of mobile structures engages; a total volume of the objects that each of the plurality of mobile structures delivers; and a load handling time of each of the plurality of mobile structures, the load handling time corresponding to the mobile-structure route information. The mathematical model is to be given inputs of at least: location information of each of the plurality of logistics centers, the plurality of depositories, and the plurality of delivery destinations; delivery-object information including a quantity, a collecting location, and a delivery destination of each of the plurality of objects to be delivered per day; delivery-time information representing delivery times at two locations, selected from the plurality of logistics centers, the plurality of depositories, and the plurality of delivery destinations, on each permutational route; and maximum loading-capacity information of each of the plurality of mobile structures. The processing circuitry is configured to output the number of the plurality of mobile structures, the mobile-structure route information, the total volume, and the load handling time. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG.  1    illustrates an exemplary structure of an information processing apparatus according to an embodiment; 
         FIG.  2    illustrates exemplary location information as input information with respect to the information processing apparatus in an embodiment; 
         FIG.  3    illustrates exemplary delivery-object information as input information with respect to the information processing apparatus in an embodiment; 
         FIG.  4    illustrates exemplary delivery-time information as input information with respect to the information processing apparatus in an embodiment; 
         FIG.  5    is a flowchart illustrating exemplary information processing to be executed by the information processing apparatus in an embodiment; 
         FIG.  6    illustrates exemplary delivery routes of two or more trucks that the information processing apparatus outputs in an embodiment; 
         FIG.  7    illustrates exemplary delivery-route information representing a delivery route of each truck; 
         FIG.  8    illustrates exemplary delivery-plan information of a certain truck; 
         FIG.  9    illustrates a bar chart depicting a delivery time of each truck; 
         FIG.  10    illustrates a bar chart depicting a loading capacity of each truck; and 
         FIG.  11    illustrates exemplary delivery routes of two or more trucks as a comparative example. 
     
    
    
     DETAILED DESCRIPTION 
     Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings. Structures and elements and actions, results, and effects attained by such structures and elements are presented for illustrative purpose only. Such embodiments are attainable by structures and elements other than those described below. The embodiments can achieve at least one of various effects attained by the basic structures and elements and their derivative effects. 
       FIG.  1    illustrates an exemplary structure of an information processing system S including an information processing apparatus  1  and an exemplary hardware configuration of the information processing apparatus  1  according to one embodiment. As illustrated in  FIG.  1   , the information processing system S includes the information processing apparatus  1 , a display device  3 , and an input device  5 . 
     The display device  3  can be, for example, a display such as a liquid crystal display (LCD), a cathode ray tube (CRT), a plasma display panel (PDP), or an organic electro luminescence (EL). The display device  3  serves to display, in a given form, various kinds of information computed by the information processing apparatus  1 , under the control of the information processing apparatus  1 . 
     The input device  5  serves to receive various kinds of instructions and information inputs from the user. The input device  5  can be implemented by, for example, a trackball, a switch button, a mouse, a keyboard, a touch pad that allows the user to touch the operation surface for inputs, a touch screen as an integration of a display screen and a touch pad, a non-contact input circuit including an optical sensor, or an audio input circuit. 
     The information processing apparatus  1  has a same or like hardware configuration as a general computer. To deliver a plurality of objects by two or more mobile structures among two or more logistics centers, two or more depositories, and two or more delivery destinations, the information processing apparatus  1  performs delivery optimization using a mathematical model to compute the number of mobile structures to be used for the delivery, for example. The mathematical model and the delivery optimization will be described in detail later. 
     Herein, the two or more mobile structures that delivers two or more objects are defined to be trucks for the sake of specific explanation. In addition, the objects to be delivered can be any objects, however, they are defined to be mechanical components (hereinafter, also simply referred to as components) for the sake of specific explanation. 
     The logistics center refers to a place where objects to be delivered such as components are stored, and sorted and managed. The depository refers to a place or a store where objects to be delivered such as components are stored. The delivery destination refers to a place where objects such as components are to be delivered. Examples of the delivery destination includes a factory that receives delivery of components, for example, by truck to manufacture products, and an airport and a seaport from which components delivered by truck are carried to a remote location. Herein, the logistics centers, the depositories, and the delivery destinations may be each referred to as a site. 
     In some embodiments, the delivery of components require load handling in at least any of the sites as the logistics centers, the depositories, and the delivery destinations. Load handling refers to work including at least any of opening or closing of a truck box, a driver&#39;s walk to a reception or else in each location, a reception process, and loading or unloading of components with a lift, for example. Also, the trucks for use in delivery can be parked in any of the logistics centers, the depositories, and the delivery destinations as a garage. 
     The information processing apparatus  1  includes a processor  11 , a main storage  12 , an auxiliary storage  13 , a state measurement device  15 , a device interface  17 , and a network interface  19 . The processor  11 , the main storage  12 , the auxiliary storage  13 , the state measurement device  15 , the device interface  17 , and the network interface  19  are connected to one another via a bus B. 
     The processor  11  serves as processing circuitry that collectively controls the information processing apparatus  1 , and the display device  3  and the input device  5  connected to the information processing apparatus  1 . Specifically, examples of the processor  11  include an electronic circuit including a controller and a calculator of a computer, such as a central processing unit (CPU), a graphics processing unit (GPU), an application specific integrated circuit (ASIC), and a field programmable gate array (FPGA). The processor  11  may also be implemented by optical circuitry including an optical logical element. 
     The processor  11  further includes a computational function  110  and an output control function  112 . 
     The computational function  110  serves to receive a result of computation of the number of trucks to be used for delivery and other information from the state measurement device  15  to compute a delivery travel time and a loading capacity of each truck for the delivery from the result of computation. The computational function  110  is an exemplary computing unit. 
     The output control function  112  serves to cause the display device  3  through the device interface  17  to display the result of computation such as the number of trucks. The output control function  112  is an exemplary output. 
     The computational function  110  and the output control function  112  of the processor  11  are, for instance, in the form of computer executable program and stored in the main storage  12 . Specifically, the processor  11  reads and executes programs from the main storage  12  to implement the functions corresponding to the programs. In other words, after reading the respective programs, the processor  11  includes the computational function  110  and the output control function  112 , as illustrated inside the processor  11  of  FIG.  1   . Thus, the computational function  110  and the output control function  112  of the processor  11  are implemented by a classical logical computer (or classical Turing computer). 
     The main storage  12  serves to store therein commands to be executed by the processor  11  and various kinds of data, for example. The processor  11  reads information from the main storage  12 . 
     The auxiliary storage  13  represents storage other than the main storage  12 . 
     The main storage  12  and the auxiliary storage  13  represent any electronic components capable of storing electronic information. The main storage  12  and the auxiliary storage  13  may be semiconductor memories. The main storage  12  and the auxiliary storage  13  typically include a semiconductor memory device such as a random access memory (RAM) or a flash memory, a hard disk, or an optical disk. The main storage  12  and the auxiliary storage  13  may include a portable medium such as a universal serial bus (USB) drive or a digital versatile disk (DVD). 
     Specifically, the main storage  12  or the auxiliary storage  13  stores therein at least location information, delivery-object information, and delivery-time information. 
     Herein, the location information refers to information representing a location (e.g., latitude and longitude) of each of the two or more logistics centers, the two or more depositories, and the two or more delivery destinations. The delivery-object information refers to information including a quantity, a collecting location, and a delivery destination of each of objects to be delivered per day. The delivery-time information refers to information representing delivery times at two locations (sites), selected from the two or more logistics centers, the two or more depositories, and the two or more delivery destinations, on each permutational route. With respect to two selected sites A and B, the permutational route refers to two routes, i.e., a route A to B and a route B to A, set by permutation. 
       FIG.  2    illustrates exemplary location information stored in the main storage  12 . As illustrated in  FIG.  2   , the location information represents locations (addresses) of the respective logistics centers, depositories, and delivery destinations by latitude and longitude. The main storage  12  stores therein the location information in table format, for example, as illustrated in  FIG.  2   . Latitude and longitude are an example of the location information. The location information may be any information as long as it allows identification of the location of each logistics center, each depository, and each delivery destination. 
       FIG.  3    illustrates exemplary delivery-object information stored in the main storage  12 .  FIG.  3    depicts delivery-object information in table format as to delivery of each component from a logistics center A to a factory A in a given day, by way of example. The delivery-object information table shows “box volume”, “number of components per box”, “weight”, “number of boxes”, “volume per day”, “depository” as a collecting location, and “delivery destination” with respect to each component identified by “component number”. The box volume represents a volume of a box that accommodates components. The number of components per box represents the number of components in each box. The weight represents the weight of components to be delivered. The number of boxes represents the number of boxes containing the components to be delivered per day. The volume per day represents a volume of the number of boxes to be delivered per day. 
     By referring to the delivery-object information table, it is possible to calculate the total number of components, the total number of boxes, the total volume, and the total weight relative to components to be delivered from the logistics center A to the factory A in a given day. 
       FIG.  4    illustrates exemplary delivery-time information stored in the main storage  12 . As illustrated in  FIG.  4   , the delivery-time information represents a length of time taken for traveling on the permutational routes between two sites, selected from the two or more logistics centers, the two or more depositories, and the two or more delivery destinations. Note that in  FIG.  4    “LC” denotes logistics center, and “DP” denotes depository. 
     The state measurement device  15  is, for example, a quantum annealing computer and serves to perform delivery optimization using a mathematical model. The state measurement device  15  is an exemplary computing unit. 
     Herein, the delivery optimization refers to a process of computing at least the number of trucks to be used for delivery, mobile-structure route information, a total volume of components that each truck delivers, and a load handling time, using a mathematical model which is given inputs of at least the location information, the delivery-object information, the delivery-time information, and a maximum truck capacity. 
     The mobile-structure route information refers to information including logistics centers, depositories, and delivery destinations in which the two or more trucks individually engage. Specifically, the mobile-structure route information represents the logistics centers, depositories, and delivery destinations where the individual trucks have the components loaded or unloaded, and estimated times of arrival there in association with each other, and includes delivery routes of the individual trucks. The total volume of components that each truck delivers refers to, for example, a total volume of boxes to be loaded on each truck for delivery. The load handling time refers to information including at least a length of time required for handling load at the logistics centers, the depositories, and the delivery destinations according to the mobile-structure route information of each of the trucks. 
     The mathematical model for use in the delivery optimization (hereinafter, also referred to as delivery-optimization mathematical model) is now described. 
     The delivery-optimization mathematical model can be formulated by the following Expressions (1) to (6): 
     
       
         
           
             
               
                 
                   
                     min 
                     
                       
                         x 
                         
                           t 
                           , 
                           i 
                         
                       
                       ∈ 
                       
                         [ 
                         
                           0 
                           , 
                           1 
                         
                         ] 
                       
                     
                   
                   ( 
                   
                     
                       - 
                       
                         DH 
                         1 
                       
                     
                     + 
                     
                       TH 
                       2 
                     
                     + 
                     
                       LH 
                       3 
                     
                     + 
                     
                       LH 
                       4 
                     
                     - 
                     
                       
                         D 
                         n 
                       
                       ⁢ 
                       
                         H 
                         5 
                       
                     
                   
                   ) 
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   
                     H 
                     1 
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         , 
                         j 
                         , 
                         t 
                       
                     
                       
                     
                       
                         w 
                         ij 
                       
                       ⁢ 
                       
                         x 
                         
                           i 
                           , 
                           t 
                         
                       
                       ⁢ 
                       
                         x 
                         
                           j 
                           , 
                           
                             t 
                             + 
                             1 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   
                     H 
                     2 
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         , 
                         j 
                         , 
                         t 
                       
                     
                       
                     
                       
                         t 
                         ij 
                       
                       ⁢ 
                       
                         x 
                         
                           i 
                           , 
                           t 
                         
                       
                       ⁢ 
                       
                         x 
                         
                           j 
                           , 
                           
                             t 
                             + 
                             1 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   
                     H 
                     3 
                   
                   = 
                   
                     
                       ∑ 
                       t 
                     
                       
                     
                       
                         ( 
                         
                           1 
                           - 
                           
                             
                               ∑ 
                               i 
                             
                               
                             
                               x 
                               
                                 i 
                                 , 
                                 t 
                               
                             
                           
                         
                         ) 
                       
                       2 
                     
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   
                     H 
                     4 
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         , 
                         j 
                         , 
                         t 
                       
                     
                       
                     
                       
                         x 
                         
                           i 
                           , 
                           t 
                         
                       
                       ⁢ 
                       
                         
                           x 
                           
                             j 
                             , 
                             
                               t 
                               + 
                               1 
                             
                           
                         
                         ( 
                         
                           
                             ∑ 
                             n 
                           
                           
                             
                               x 
                               
                                 i 
                                 , 
                                 
                                   t 
                                   + 
                                   1 
                                   + 
                                   n 
                                 
                               
                             
                             ⁢ 
                             
                               x 
                               
                                 j 
                                 , 
                                 
                                   t 
                                   + 
                                   2 
                                   + 
                                   n 
                                 
                               
                             
                           
                         
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
       
         
           
             
               
                 
                   
                     H 
                     5 
                   
                   = 
                   
                     
                       ∑ 
                       
                         i 
                         , 
                         j 
                         , 
                         t 
                       
                     
                       
                     
                       
                         w 
                         ij 
                       
                       ⁢ 
                       
                         x 
                         
                           i 
                           , 
                           t 
                         
                       
                       ⁢ 
                       
                         x 
                         
                           j 
                           , 
                           
                             t 
                             + 
                             n 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
     Expression (1) represents an objective function of the delivery-optimization mathematical model, where H 1 , H 2 , H 3 , H 4 , and H 5  are represented by Expressions (2), (3), (4), (5), and (6), respectively. 
     In Expressions (1) to (6) the indexes i and j are for distinguishing among the two or more logistics centers, the two or more depositories, and the two or more delivery destinations (i.e., sites). In a graph depicting a quadratic unconstrained binary optimization (QUBO) problem with a model following Expression (1), the sites, that is, the two or more logistics centers, the two or more depositories, and the two or more delivery destinations correspond to the vertexes on the graph. That is, the indexes i and j are for distinguishing the vertexes on the graph representing the model according to Expression (1). 
     Further, the indexes t and n denote time. x it  denotes a variable of zero or one. When a truck is located at a site “i” at time t, x it =1. In other situations x it =0. w ij  denotes a (travel) distance between a site “i” and a site “j”. D, T, L, and D n  denote variables (parameters) for minimizing the objective function represented by Expression (1). 
     H 1  defined by Expression (2) is a reward term representing a reward corresponding to a load cost of a truck traveling between the two vertexes i and j. 
     H 2  defined by Expression (3) is a penalty term representing a monetary penalty corresponding to a cost of a truck traveling between the two vertexes i and j. 
     H 3  defined by Expression (4) is a term representing a condition that the number of sites (vertexes) that any truck can visit at optional time is only one. 
     H 4  defined by Expression (5) is a penalty term representing a monetary penalty corresponding to a condition for giving penalty when the load of a truck is less than a criterion and the truck travels between the same pair of sites redundantly. 
     H 5  defined by Expression (6) is a reward term representing a reward corresponding to a condition that a truck having multiple components with a less volume loaded thereon travels and stops over at multiple sites to unload the components on the route to the final destination. 
     The state measurement device  15  serves to control the variables D, T, L, and D n  by quantum annealing such that the energy of the physical system represented by the objective function of Expression (1) is to be at a minimum. The state measurement device  15  measures a state of the physical system represented by the objective function of Expression (1) to obtain values of the variables D, T, L, and D n  when the physical system is placed in a minimum energy state (i.e., ground state). The state measurement device  15  computes at least the number of trucks to be used for delivery, a total volume of components that each truck delivers, and mobile-structure route information (delivery route) of each truck, and a load handling time of each truck, using the values of the variables D, T, L, and D n . 
     Referring back to  FIG.  1   , the device interface  17  serves to directly or indirectly connect among the display device  3 , the input device  5 , and the processor  11  via the bus B. The device interface  17  may include a connection terminal such as a USB. Further, the device interface  17  may be connected to an external storage medium or a storage device (memory) through the connection terminal. 
     The network interface  19  serves to provide wireless or wired connection to a network N. In addition, the network interface  19  allows transmission and reception of information between the information processing apparatus  1  and external devices via the network N. 
     The following will describe a process of the delivery optimization by way of example. 
       FIG.  5    is a flowchart illustrating a process of the delivery optimization to be performed by the information processing apparatus  1  in an embodiment. As illustrated in  FIG.  5   , the state measurement device  15  acquires location information, delivery-object information, delivery-time information, and a maximum truck capacity (e.g., 15 t) from the main storage  12  (Step S 1 ). 
     The state measurement device  15  performs delivery optimization with a quantum computer using a mathematical model and inputs of the location information, the delivery-object information, and the delivery-time information. Specifically, the state measurement device  15  sets values of the parameters D, T, L, and D n  when the physical system represented by the objective function of Expression (1) is placed in a minimum energy state. Further, the state measurement device  15  computes the number of trucks to be used for delivery, mobile-structure route information (delivery route) of each truck, a total volume of components that each truck delivers, and a load handling time of each truck, using the set parameter values D, T, L, and D, (Step S 2 ). 
     The state measurement device  15  outputs, to the computational function  110 , the number of trucks to be used for delivery, the mobile-structure route information of each truck, the total volume of components that each truck delivers, and the load handling time of each truck as obtained through the delivery optimization (Step S 3 ). 
     The computational function  110  computes a travel time and a loading capacity of each truck for delivery from the number of trucks to be used for delivery, the mobile-structure route information of each truck, the total volume of components that each truck delivers, and the load handling time of each truck, as received from the state measurement device  15  (Step S 4 ). 
     The output control function  112  outputs a result of the computation (Step S 5 ). Specifically, the output control function  112  causes, for example, the display device  3  to display the number of trucks to be used for delivery, the mobile-structure route information of each truck, the total volume of components that each truck delivers, the load handling time of each truck, and the travel time and the loading capacity of each truck for delivery. 
     Example of Application 
     The following will describe a process of delivery optimization according to an example of application. In this example, the number of sites was set to 23, and a quantum annealing computer was used to perform delivery optimization using inputs of the location information and the other information depicted in  FIG.  2   . As a result, the number of 15-ton trucks to be used for delivery was computed to be 61. 
       FIG.  6    illustrate delivery routes of the 61 trucks, as computed by the delivery optimization in the example of application, on a map in a superimposed manner. 
       FIG.  7    illustrates exemplary mobile-structure route information as to 15 trucks among the 61 trucks computed by the delivery optimization. Specifically, in  FIG.  7    the sites to which each truck travels are depicted in order from the top of the rows. Note that in  FIG.  7    “LC” denotes logistics center, “DP” denotes depository, and “FA” denotes factory. 
       FIG.  8    illustrates exemplary mobile-structure route information (i.e., delivery route) as to one of the 61 trucks computed by the delivery optimization. As illustrated in  FIG.  8   , the mobile-structure route information includes sites where the track travels in order and estimated times of arrival there, components to be loaded at each site and the number thereof, and components to be unloaded at each site and the number thereof. 
       FIG.  9    is a bar chart illustrating an operating time (or travel time) of each of the 61 trucks computed by the delivery optimization. 
       FIG.  10    is a bar chart illustrating a loading capacity of each of the 61 trucks computed by the delivery optimization. 
     Thus, the user can easily and quickly obtain necessary information for an intended delivery operation by viewing the items of information illustrated in  FIGS.  6  to  10    on the screen of the display device  3 , for example. 
     COMPARATIVE EXAMPLE 
     For the sake of comparison, an expert artificially conducted delivery optimization in a traditional manner under the same condition as the example of application. Results of the computation were such that the number of trucks to be used for delivery is sixty 11-ton trucks and eighty-two 15-ton trucks.  FIG.  11    illustrates delivery routes of the sixty 11-ton trucks and eighty-two 15-ton trucks, as determined in the comparative example, on a map in a superimposed manner. 
     Through the comparison between the example of application and the comparative example, it can be seen that the number of trucks to be used for delivery is less and the truck delivery routes are more various in the example of application than in the comparative example. 
     The information processing apparatus  1  according to some embodiments as described above is applicable to delivery of two or more components by two or more trucks among two or more logistics centers, two or more depositories, and two or more delivery destinations. The information processing apparatus  1  includes the state measurement device  15  as a computing unit and the output control function  112  as an output. 
     The state measurement device  15  uses a mathematical model that is given inputs of at least: 
     location information of each of the two or more logistics centers, the two or more depositories, and the two or more delivery destinations; 
     delivery-object information including a quantity, a collecting location, a delivery destination of each of two or more components to be delivered per day; 
     delivery-time information representing delivery times at two sites, selected from the two or more logistics centers, the two or more depositories, and the two or more delivery destinations, on each permutational route; and 
     maximum loading-capacity information of each truck. Using the mathematical model, the state measurement device  15  computes at least: 
     the number of trucks to be used for delivery; 
     a total volume of components that each truck delivers; 
     mobile-structure route information including the logistics centers, the depositories, and the delivery destinations in which each truck engages; and 
     a load handling time of each truck, corresponding to the mobile-structure route information. The output control function  112  outputs the number of trucks to be used for delivery, the mobile-structure route information, the total volume of components that each truck delivers, and the load handling time. 
     Thus, the user can accurately and easily know the number of trucks to be used for an intended delivery, the delivery routes of each truck, the total volume of components that each truck delivers, and the load handling time of each truck by simply obtaining, for example, the location information of the sites such as the two or more logistics centers. 
     In addition, the number of trucks to be used for delivery computed by the state measurement device  15  is less than that obtained in the traditional manner. Also, the delivery routes of each truck computed by the state measurement device  15  are more various than those obtained in the traditional manner. This consequently makes it possible to optimize the component delivery operation by truck and improve the efficiency thereof. As a result, the cost of the delivery operation and carbon dioxide emission occurring from the delivery operation can be both reduced. 
     Further, the state measurement device  15  can also use another mathematical model including, as a reward, a truck load cost occurring between two sites selected from the two or more logistics centers, the two or more depositories, and the two or more delivery destinations. The state measurement device  15  can also use another mathematical model including, as a penal rule, a truck temporal cost occurring between two sites selected from the two or more logistics centers, the two or more depositories, and the two or more delivery destinations. 
     Moreover, the state measurement device  15  can use another mathematical model including, as a penal rule, a condition that the load of a truck traveling between two sites, selected from the two or more logistics centers, the two or more depositories, and the two or more delivery destinations, is less than a criterion. The state measurement device  15  can use another mathematical model including, as a reward, a condition for delivery of two or more components to intended logistics centers or depositories on the route to a delivery destination (that is, a condition for unloading components at multiple locations). 
     Further, the state measurement device  15  can use another mathematical model to be given additional inputs of a truck operating time and another mathematical model to be given additional inputs of a truck load handling time. 
     These mathematical models include new parameters which have not been considered heretofore. Because of this, the information processing apparatus  1  can optimize the delivery operation of components by truck and improve the efficiency thereof in comparison with the traditional method. 
     As an example, if the number of sites is 23, the number of delivery route patterns will be 23! (approximately, 2.58×10 22 ), which requires an enormous amount of computation for optimizing the delivery operation. The state measurement device  15  can compute a total volume of boxes that each truck delivers, delivery routes and a load handling time of each truck by quantum annealing using the mathematical model. Thereby, the state measurement device  15  can quickly compute the number of trucks to be used for delivery and the other information with less burden, in spite of an enormous amount of computation for optimizing the delivery operation required. 
     The information processing apparatus  1  further includes the computational function  110  as a computing unit. The computational function  110  is capable of computing the travel time and the loading capacity of each truck. The output control function  112  can output the travel time and the loading capacity of each truck. 
     Thus, the user can obtain new detailed information as to the component delivery operation by truck. Thereby, the user can optimize the component delivery operation by truck and improve the efficiency thereof in comparison with using the traditional method. 
     First Modification 
     The above embodiments have described an example that the information processing apparatus  1  includes the state measurement device  15  serving as a quantum annealing computer to perform delivery optimization. Alternatively, the state measurement device  15  may be, for example, a simulated annealing computer including semiconductor circuitry having simulated quantum effect. 
     Alternatively, the state measurement device  15  may be not a quantum annealing computer but a quantum gate computer, for example. The state measurement device  15  may also be a classical logical computer (or classical Turing computer), when appropriate. 
     Second Modification 
     The above embodiments have described an example that the information processing apparatus  1  incorporates the state measurement device  15  and the computational function  110  as a computing unit that performs delivery optimization. Alternatively, the state measurement device  15  may be provided on the cloud, for example, so that the information processing apparatus  1  can communicate with the state measurement device  15  via the network to perform delivery optimization. 
     Third Modification 
     The above embodiments have described an example of performing delivery optimization with reference to the location information, the delivery-object information, and the delivery-time information stored in the main storage  12 . Alternatively, the information processing apparatus  1  can acquire the location information and the other information from an external device via the network interface  19  to perform delivery optimization. 
     Fourth Modification 
     The above embodiments have described trucks as an example of mobile structures. However, the mobile structures are not limited to the trucks and may be bicycles or drones, for example. 
     Computer programs for executing information processing in the above embodiments may be recorded and provided in an installable or executable file format on a computer-readable recording medium such as a CD-ROM, a flexible disk (FD), a CD-R, a DVD, or a USB drive. In addition, such computer programs may be provided or distributed via a network such as the Internet. Such computer programs may be incorporated into a ROM or the like in advance. 
     The computer programs have a module configuration including the functional elements described above. As actual hardware, for example, the CPU (processor circuit) reads and executes the computer programs from the ROM or the HDD to thereby load the respective functional elements into the RAM and generate them on the RAM. The respective functional elements can be partially or entirely implemented by dedicated hardware such as an ASIC or an FPGA. 
     While certain embodiments have been described, these embodiments have been presented by way of example only, and are not intended to limit the scope of the inventions. Indeed, the novel embodiments described herein may be embodied in a variety of other forms; furthermore, various omissions, substitutions and changes may be made without departing from the spirit of the inventions. The accompanying claims and their equivalents are intended to cover such embodiments and such forms or modifications as would fall within the scope and spirit of the inventions.