Information processing device, information processing method, and program

Abstract

To better allocate vehicles to areas where loading and unloading operations are performed. [Solution] The information processing device includes a processing unit. The processing unit determines an order for each of a plurality of vehicles to patrol a plurality of buildings each including one or more loading and unloading work areas, based on a loading and unloading time calculated based on an allocated inventory of luggage stored in the plurality of buildings. The processing unit assigns one or more vehicles selected from the plurality of vehicles to each of one or more target periods during which loading and unloading work is performed in each of the one or more loading and unloading work areas, based on the order.

Description

[Technical field]

[0001] An embodiment of the present invention relates to an information processing device, an information processing method, and a program. [Background technology]

[0002] While the volume of goods being transported increases year by year, the shortage of drivers for the vehicles used in logistics is becoming a social issue. For example, there is a demand to reduce the waiting time for cargo in warehouses and improve the working environment for drivers. One solution that has been proposed is a technology that reduces the waiting time for cargo by improving the efficiency of allocation using a berth reservation system. A berth is an area where vehicles carry out loading and unloading work (loading and unloading work area). [Prior art documents] [Patent documents]

[0003] [Patent Document 1] Patent No. 7148960 Summary of the Invention [Problem to be solved by the invention]

[0004] In recent years, with the consolidation and expansion of warehouses, as well as the use of joint deliveries, there are increasing opportunities for a single vehicle to travel between multiple buildings within a warehouse to carry out loading and unloading operations. Each of the multiple buildings is equipped with one or more berths. Conventional berth reservation systems did not take into account the need to travel between multiple buildings, and therefore sometimes were unable to appropriately assign vehicles to berths.

[0005] An object of the present invention is to provide an information processing device, an information processing method, and a program that can more appropriately allocate vehicles to areas where loading and unloading operations are performed. [Means for solving the problem]

[0006] An information processing device according to an embodiment includes a processor. The processor determines an order for each of a plurality of vehicles to patrol a plurality of buildings each including one or more loading and unloading work areas, based on a loading and unloading time calculated based on an allocated inventory of luggage stored in the plurality of buildings. The processor assigns one or more vehicles selected from the plurality of vehicles to each of one or more target periods during which loading and unloading work is performed in each of the one or more loading and unloading work areas, based on the order. [Brief description of the drawings]

[0007] [Figure 1] 1 is a schematic diagram of an information processing system including an information processing apparatus according to a first embodiment. [Diagram 2] FIG. 1 is a block diagram of an information processing apparatus according to a first embodiment. [Diagram 3] FIG. 4 is a diagram showing an example of the data structure and data of a birth master. [Figure 4] 4 is a diagram showing an example of a data structure and data of registered vehicle information; [Diagram 5] 11A and 11B are diagrams showing an example of the data structure and data of allocation band information; [Figure 6] 4 is a flowchart showing a berth allocation process according to the first embodiment. [Figure 7] 5A and 5B are diagrams showing an example of a data structure and data of loaded product information. [Figure 8] FIG. 13 is a diagram showing an example of the data structure and data of warehouse information. [Figure 9] FIG. 13 is a diagram showing an example of a data structure and data of allocation priority master data. [Figure 10] 4A and 4B are diagrams showing an example of a data structure and data of allocation information. [Figure 11] 11A and 11B are diagrams showing an example of the data structure and data of a work efficiency master. [Figure 12] FIG. 4 is a diagram showing an example of the data structure and data of loading / unloading time information. [Figure 13] FIG. 13 is a diagram showing an example of the data structure and data of a travel time master. [Figure 14] 4A and 4B are diagrams showing an example of a data structure and data of vehicle state information; [Figure 15] FIG. 4 is a diagram showing an example of a data structure and data of an auxiliary task master. [Figure 16] 5A and 5B are diagrams showing an example of the data structure and data of tour order information. [Figure 17] 5A and 5B are diagrams showing an example of a data structure and data of vehicle size conditions. [Figure 18] FIG. 13 is a diagram showing an example of a data structure and data of warehousing / receiving conditions. [Figure 19] 5A and 5B are diagrams showing an example of the data structure and data of a route condition. [Figure 20] 6 is a diagram showing an example of a data structure and data of assigned vehicle candidate evaluation information. FIG. [Figure 21] 5A and 5B are diagrams showing an example of a data structure and data of assigned vehicle information. [Figure 22] FIG. 11 is a schematic diagram of an information processing system including an information processing apparatus according to a second embodiment. [Figure 23] FIG. 11 is a block diagram of an information processing apparatus according to a second embodiment. [Figure 24] FIG. 13 is a diagram showing an example of the data structure and data of the berth usage time master. [Diagram 25] FIG. 13 is a diagram showing an example of a data structure and data of unavailable berth conditions. [Figure 26] 13 is a flowchart of a berth allocation process according to the second embodiment. [Figure 27] FIG. 11 is a diagram showing an example of assigned vehicle information according to the second embodiment. [Figure 28] FIG. 2 is a hardware configuration diagram of the device according to the first or second embodiment. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0008] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, preferred embodiments of an information processing apparatus according to the present invention will be described in detail with reference to the accompanying drawings.

[0009] In the following embodiment, in order to handle cases where cargo handling work is performed by visiting multiple buildings (an example of multiple buildings) in a warehouse, a visiting order for the multiple buildings is derived so as to shorten cargo waiting time, and then vehicle candidates to be assigned based on the visiting order are extracted and evaluation points are calculated, and vehicle allocation to berths is determined. By adjusting the visiting order for the multiple buildings, cargo waiting time can be further reduced.

[0010] The information processing apparatus according to the embodiment has the following functions, for example. (F1) Inventory allocation function that allocates the cargo (goods, etc.) transported by the vehicle to the inventory of each building (F2) A loading / unloading time calculation function that calculates loading / unloading time based on the amount of allocated inventory and work efficiency (F3) A function for determining the patrol order of multiple buildings based on information including loading and unloading times. (F4) A function to extract candidates for vehicles that can be allocated (candidates for allocation) based on the patrol order and vehicle reception conditions, etc. (F5) Evaluation value calculation function to calculate the evaluation value of the assigned vehicle candidate (F6) A function for selecting a vehicle to be allocated from among the candidates based on the evaluation value.

[0011] The information processing apparatus according to the embodiment may further include at least some of the following functions. - Calculate the buildings to be patrolled based on inventory allocation (hereinafter referred to as patrol buildings) and the loading and unloading time for each patrol building. Calculate loading and unloading times taking into account work efficiency according to the type of packaging (pallet, case, loose, etc.). In the case of decentralized inventory, allocation is made according to the allocation priority of the building (priority for allocation). The order of visits will be determined to equalize the congestion in each building. In the case of decentralized inventory, congestion can be further leveled out by adjusting the allocation priority of each building. Berth allocation is performed taking into consideration vehicle access conditions (vehicle size conditions, entry / exit conditions, route conditions, etc.). - Calculate the evaluation value based on the time to delivery.

[0012] The cargo stored in the warehouse and transported by the vehicle may be any item, but for example, it is an item that is handled as a commodity. In the following, an example in which the cargo is a commodity will be described. Also, distributed inventory means that the same type of cargo (commodity) is stored in multiple buildings.

[0013] Examples of vehicle allocation use cases include: (U1) Real-time allocation to determine the allocation of vehicles to berths where allocation is required (U2) Creating a berth allocation plan for all vehicles for a certain period

[0014] The following description will be divided into a first embodiment that is mainly applicable to use case U1 and a second embodiment that is mainly applicable to use case U2.

[0015] (First embodiment) Fig. 1 is a schematic diagram of an information processing system including an information processing device 100 of the first embodiment. As shown in Fig. 1, the information processing system includes a plurality of vehicles 1, a warehouse 2, the information processing device 100, a vehicle management device 200, a warehouse management device 300, and a network 400. The warehouse 2 includes a plurality of entrance / exit gates 3a, 3b, 3c, and 3d, and a plurality of buildings 4a, 4b, 4c, 4d, and 4e. Each of the plurality of buildings 4a, 4b, 4c, 4d, and 4e includes a plurality of berths 5.

[0016] The entrance / exit gates 3a, 3b, 3c, and 3d are gates through which the vehicle 1 enters and exits the warehouse 2 (an area in which multiple buildings are installed). When there is no need to distinguish between the entrance / exit gates 3a, 3b, 3c, and 3d, they are simply referred to as the entrance / exit gates 3. The number of entrance / exit gates 3 is not limited to four, and may be one to three, or five or more.

[0017] Each of the multiple buildings 4a, 4b, 4c, 4d, and 4e is a building where luggage can be stored. When there is no need to distinguish between the buildings 4a, 4b, 4c, 4d, and 4e, they are simply referred to as buildings 4. The number of buildings 4 is not limited to four, and may be two to three or five or more.

[0018] The berths 5 are provided in each of the multiple buildings 4, and are loading / unloading work areas where the vehicles 1 approach and perform loading / unloading work.

[0019] The vehicle management device 200 is a device that transmits and receives information about the vehicle 1 and manages it. The warehouse management device 300 is a device that transmits and receives information about the building 4 (e.g., inventory information). The information processing device 100 corresponds to a device that assigns berths based on information from the vehicle management device 200 and the warehouse management device 300 (berth assignment device).

[0020] The network 400 is a network for data communication between devices in the information processing system. The network 400 may be in any form, for example, a local area network (LAN) or the Internet.

[0021] In this embodiment, the information processing device 100 performs a process (berth allocation) of allocating a loading and unloading operation of a vehicle 1 to a specific time period in the future at a certain berth 5, and displays the result of the berth allocation to a user or transmits it to a driver of the vehicle 1. For example, this can be used for a service of allocating and reserving a vehicle 1 in a warehouse to a berth 5 that is likely to become available in the near future.

[0022] 2 is a block diagram showing an example of a configuration of the information processing device 100 according to the first embodiment. As shown in FIG 1, the information processing device 100 includes a processing unit 110, a storage unit 120, a display unit 101, an operation unit 102, a communication unit 103, and a bus 61.

[0023] The storage unit 120 stores various data used in various processes by the information processing device 100. The data stored in the storage unit 120 is mainly divided into input data, intermediate data, and output data. The input database 121, the intermediate database 122, and the output database 123 correspond to databases that store the input data, the intermediate data, and the output data, respectively.

[0024] Details of the input database 121, intermediate database 122, and output database 123 will be described later, but each database corresponds to, for example, the following data. The data stored in the input database 121 may be obtained from the vehicle management device 200 or the warehouse management device 300. Input database 121: berth master (Figure 3), registered vehicle information (Figure 4), allocation band information (Figure 5), loaded product information (Figure 7), warehouse information (Figure 8), allocation priority master (Figure 9), work efficiency master (Figure 11), travel time master (Figure 13), vehicle status information (Figure 14), incidental work master (Figure 15), vehicle size conditions (Figure 17), entry / exit conditions (Figure 18), route conditions (Figure 19) Intermediate database 122: allocation information (FIG. 10), loading / unloading time information (FIG. 12), tour order information (FIG. 16), allocation vehicle candidate evaluation information (FIG. 20), Output database 123: Allocated vehicle information (Figure 21)

[0025] The storage unit 120 can be configured from any commonly used storage medium, such as a flash memory, a memory card, a RAM (Random Access Memory), a HDD (Hard Disk Drive), or an optical disk.

[0026] Each database (input database 121, intermediate database 122, output database 123) may be stored in a physically different storage medium, or may be stored in a different storage area of ​​the same physically stored medium.

[0027] The display unit 101 is a display device such as a display for displaying input data, intermediate data, and output data. The operation unit 102 is a component that allows a user to perform operations such as data input in accordance with data displayed on the display unit 101, and is realized by, for example, a keyboard and a mouse. The display unit 101 and the operation unit 102 may be realized by, for example, a touch panel that integrates the two.

[0028] The communication unit 103 is a communication interface (I / F) for communicating with the vehicle management device 200, the warehouse management device 300, and other systems (devices) via a communication line such as a network 400.

[0029] The bus 61 is a connection line that connects each unit (the processing unit 110, the storage unit 120, the display unit 101, the operation unit 102, and the communication unit 103).

[0030] The processing unit 110 performs various processes using the data stored in the storage unit 120. For example, the processing unit 110 acquires data from an input database 121, executes berth allocation, and writes the result of the berth allocation to an output database 123 of the storage unit 120. Data obtained as an intermediate product of the berth allocation is stored in an intermediate database 122 of the storage unit 120, and is used during subsequent processing by the processing unit 110.

[0031] The processing unit 110 includes an allocation unit 111, a time calculation unit 112, an order determination unit 113, a candidate extraction unit 114, an evaluation value calculation unit 115, and an allocation unit 116. The allocation unit 111, the time calculation unit 112, the order determination unit 113, the candidate extraction unit 114, the evaluation value calculation unit 115, and the allocation unit 116 correspond to, for example, the above-mentioned functions (F1) to (F6), respectively.

[0032] The allocation unit 111 allocates inventory of goods stored in multiple buildings 4 for each of the multiple vehicles 1. In the case of distributed inventory, the allocation unit 111 may determine the building 4 from which inventory is to be allocated and the quantity of inventory to be allocated to the building 4 based on a priority (allocation priority) defined for each of the multiple buildings 4.

[0033] The time calculation unit 112 calculates the loading / unloading time in each of the multiple buildings 4 based on the allocated inventory and a predetermined loading / unloading work efficiency (hereinafter, work efficiency). The work efficiency is determined, for example, for each building 4 and for each packing style in the building 4. In other words, the time calculation unit 112 calculates the loading / unloading time based on the allocated inventory and the work efficiency according to the packing style.

[0034] The packing style refers to the storage state (packaging form, etc.) of the product during loading and unloading operations. For example, the packing style includes pallets, cases, and loose items.

[0035] The unit of setting the work efficiency is not limited to the above, and any unit may be used. For example, the work efficiency may be set for each product, each product group, and each vehicle 1 (driver).

[0036] The order determination unit 113 determines, for each of the multiple vehicles 1, an order (patrol order) for visiting the multiple buildings 4 for loading and unloading the inventory allocated to the vehicle 1, based on the calculated loading and unloading time. The method for determining the tour order will be described in detail later.

[0037] The candidate extraction unit 114 extracts, from the plurality of vehicles 1, one or more candidates (allocated vehicle candidates) for the vehicle 1 to be allocated to one or more allocation bands, based on the determined traveling order.

[0038] An allocation time slot indicates a period (target period) during which loading and unloading work is performed at a berth 5. An allocation time slot is a calculation concept that indicates a certain time period (start time to end time) at a berth 5 of a certain building 4. The information processing device 100 allocates vehicles 1 (loading and unloading work of vehicles 1) to the allocation time slot.

[0039] The candidate extraction unit 114 may extract candidates based on the approaching conditions and the patrol order defined for each berth 5. The approaching conditions include at least one of the following conditions, for example. - Vehicle 1 size conditions (Vehicle size conditions) · Conditions that indicate whether to perform a goods receipt or issue (goods receipt / issue conditions) - Conditions indicating which vehicle 1 is permitted to carry out loading / unloading operations (route conditions)

[0040] A route is information that indicates a group of vehicles 1. A route is, for example, a transportation company that owns one or more vehicles 1, and a transportation destination (information that indicates the transportation destination). For example, when a transportation company is specified as a route condition, candidates are extracted from vehicles 1 that belong to the specified transportation company. When a transportation destination is specified as a route condition, candidates are extracted from vehicles 1 whose destination is the specified transportation destination.

[0041] The evaluation value calculation unit 115 calculates an evaluation value for each of the one or more extracted candidates. The evaluation value is an index of evaluation regarding the allocation of each allocation band.

[0042] For example, the evaluation value calculation unit 115 calculates the evaluation value based on at least one of the date and time (entrance time) when the vehicle 1 enters the warehouse 2 (any of the entrances and exits 3) and the date and time (exit time) when the vehicle 1 leaves the warehouse 2 (any of the entrances and exits 3). The evaluation value calculation unit 115 may calculate the evaluation value based on the difference between the exit time and the date and time (scheduled exit time) when the vehicle 1 is scheduled to leave the warehouse 2 (any of the entrances and exits 3).

[0043] More specifically, the evaluation value calculation unit 115 calculates the evaluation value by, for example, at least one of the following methods (E1) to (E3). (E1) Calculate the evaluation value in ascending order of the entrance time so that the value increases. (E2) The evaluation value is calculated in ascending order of the exit time so that the value increases. (E3) The evaluation value is calculated in descending order of the departure delay time (corresponding to the time to leave), which is the difference between the departure time and the scheduled departure time, so that the value increases.

[0044] The allocation unit 116 selects one or more candidates as allocated vehicles from the extracted one or more candidates for each of the one or more allocation bands based on the evaluation value, and allocates the selected one or more vehicles 1 (allocated vehicles).

[0045] Each unit of the processing unit 110 is realized, for example, by one or more processors. For example, each unit may be realized by having a processor such as a CPU (Central Processing Unit) and a GPU (Graphics Processing Unit) execute a program, that is, by software. Each unit may be realized by a processor such as a dedicated IC (Integrated Circuit), that is, by hardware. Each unit may be realized by a combination of software and hardware. When multiple processors are used, each processor may realize one of the units, or two or more of the units.

[0046] The information processing device 100 may be physically configured as one device, or may be physically configured as multiple devices. For example, the information processing device 100 may be constructed on a cloud environment. Each unit in the information processing device 100 may be distributed and provided in multiple devices.

[0047] Next, a detailed description will be given of the processing of each unit by the information processing device 100. First, the building 4, the berth 5, the vehicle 1, and the allocation band will be described. In the following, an example will be described in which the warehouse 2 is configured as follows. Includes two buildings, A and B Building A includes two berths A1 and A2 - Building B includes two berths B1 and B2. · Three vehicles, X, Y, or Z, are assigned to the four berths above.

[0048] The data structure and values ​​of each piece of data described below are examples for explaining the present embodiment, and are not limited to these. For example, the data may be configured to be managed as history data by adding the date and time of registration and the name of the registered user as elements of each piece of data.

[0049] Information indicating the correspondence between building 4 and berth 5 is stored in a berth master included in input database 121. Fig. 3 is a diagram showing an example of the data structure and data of the berth master. As shown in Fig. 3, the berth master includes a building ID and a berth ID.

[0050] The building ID is identification information for identifying building 4. The berth ID is identification information for identifying berth 5. In the following, building 4 with a building ID of "a" may be referred to as building a, and berth 5 with a berth ID of "b" may be referred to as berth b. In the example of FIG. 3, two berths A1 and A2 with berth IDs of "A1" and "A2", respectively, are registered in building A with a building ID of "A". Furthermore, two berths B1 and B2 with berth IDs of "B1" and "B2", respectively, are registered in building B with a building ID of "B".

[0051] Information on vehicle 1 is stored in the registered vehicle information included in the input database 121. Fig. 4 is a diagram showing an example of the data structure and data of the registered vehicle information. As shown in Fig. 4, the registered vehicle information includes a vehicle ID, a scheduled entry time, a scheduled exit time, a route code, a vehicle size, and an entry / exit mode.

[0052] The vehicle ID is identification information that identifies the vehicle 1. The route code is identification information that identifies the route (group of vehicles 1). The entry / exit mode is information that identifies whether the corresponding vehicle 1 is loading (exiting) or unloading (entering). In the example of FIG. 4, the entry / exit mode "O" is registered for the exiting vehicle 1, and the entry / exit mode "I" is registered for the entering vehicle 1. In the example of FIG. 4, the vehicle size is represented by the weight of the vehicle 1 (t: ton), but may be represented by other indicators.

[0053] In the following, vehicle 1 with a vehicle ID of "c" may be referred to as vehicle c. In the example of Fig. 4, vehicles X, Y, and Z are registered in the registered vehicle information, and the scheduled entry time, scheduled exit time, route code, vehicle size, and entry / exit mode are registered for each vehicle.

[0054] As described above, an allocation time band represents a certain time period (start time to end time) at a berth 5 to which a certain building 4 is assigned. Vehicles 1 are assigned so that loading and unloading operations can be performed at the corresponding berth 5 within the range from the start time to the end time. Information on the allocation time band is stored in the allocation time band information included in the input database 121.

[0055] Fig. 5 is a diagram showing an example of the data structure and data of the allocation band information. As shown in Fig. 5, the allocation band information includes an allocation band ID, a building ID, a berth ID, a start time, and an end time. The allocation band ID is identification information for identifying an allocation band.

[0056] In the example of Fig. 5, allocation time slot information with an allocation time slot ID of "T1" is registered for the time period 11:00-15:00 in berth A1 of building A. In the following, an allocation time slot with an allocation time slot ID of "d" may be referred to as allocation time slot d. In this embodiment, vehicle 1 to be allocated to allocation time slot T1 is selected from vehicles X, Y, and Z.

[0057] Next, the operation of each part of the processing unit 110 will be described with reference to the flowchart in Fig. 6. Fig. 6 is a flowchart showing an example of a berth allocation process in this embodiment. The berth allocation process is a process for allocating a vehicle 1 to an allocation band of a berth 5 specified by the allocation band information.

[0058] First, the allocation unit 111 allocates inventory for each building 4 for each vehicle 1 (step S101). For example, the allocation unit 111 calculates the allocated inventory quantity for each building 4 in each vehicle 1 using the loaded commodity information, warehouse information, and allocation priority master included in the input database 121, and outputs the allocation information included in the intermediate database 122.

[0059] FIG. 7 is a diagram showing an example of the data structure and data of loaded product information. The loaded product information indicates information on the products to be loaded or loaded on each vehicle 1. As shown in FIG. 7, the loaded product information includes a vehicle ID, a product ID, a packing style code, and a quantity. The product ID is identification information for identifying a product. In the following, a product with a product ID of "e" may be referred to as product e. The packing style code is identification information for identifying the packing style. The packing style codes PL and CS in FIG. 7 indicate that the packing style is a pallet and a case, respectively.

[0060] In the example of FIG. 7, five products P1 to P5 are registered. The quantity of any one of the five products (it may be one or more) is registered for vehicles X, Y, and Z. The quantity represents the quantity to be loaded in the case of outgoing goods, and represents the quantity to be unloaded in the case of incoming goods. For example, when the in / out mode is registered as shown in FIG. 4, the quantities of vehicles X and Y, which are outgoing "O", represent the quantity to be loaded. The quantity of vehicle Z, which is incoming "I", represents the quantity to be unloaded.

[0061] The quantity is also registered together with a packing code that indicates the packing format used during loading and unloading. For example, the number of pallets of product P2 to be loaded onto vehicle X is 100, and the number of cases of product P4 to be unloaded onto vehicle Z is 1000.

[0062] Fig. 8 is a diagram showing an example of the data structure and data of the warehouse information. The warehouse information represents information on the products stored in each building 4. As shown in Fig. 8, the warehouse information includes a building ID, a product ID, a packaging code, and a quantity.

[0063] In the example of Fig. 8, it is shown that products P1 to P3 are stored in building A, and products P3 to P5 are stored in building B. Note that product P3 is stored in both building A and building B (distributed inventory).

[0064] The quantity indicates the quantity of the corresponding product in stock (inventory quantity) in the corresponding building 4. As with the loaded product information in FIG. 7, the inventory quantity is registered together with the packing code.

[0065] In step S101 of FIG. 6, the allocation unit 111, for example, determines from which building 4 inventory to allocate the quantity in the loaded product information, and confirms that quantity by subtracting (shipping out) or adding (shipping in) to the quantity in the warehouse information.

[0066] For example, product P2 of vehicle X is stored in building A, and the inventory quantity of 5000 in building A is greater than the quantity of 100 to be shipped from vehicle X. Therefore, the allocation unit 111 determines that the shipped product P2 will be loaded in building A. Also, for example, product P5 of vehicle Z is stored in building B, and therefore the allocation unit 111 determines that the incoming product P5 will be unloaded in building B. In inventory allocation at the time of warehousing, inventory with a quantity of zero may be registered in the warehouse information so that allocation can be performed even when the inventory is zero.

[0067] As described above, the product P3 of the vehicle Y is classified as a distributed inventory. In the case of a distributed inventory, the allocation unit 111 may refer to the allocation priority master and execute allocation using the allocation priority for each building 4. Note that the allocation priority master, the work efficiency master, the ancillary work master, and the like may be registered separately for warehousing and shipping.

[0068] 9 is a diagram showing an example of the data structure and data of the allocation priority master. The allocation priority master registers the priority (allocation priority) determined for each of the multiple buildings 4.

[0069] Product P3 is stored as distributed inventory in buildings A and B, with building A having a higher allocation priority than building B. Therefore, the allocation unit 111 first allocates inventory from building A. If the product runs out of stock in building A, the allocation unit 111 further allocates inventory from building B.

[0070] 7 and 8, 2000 cases of product P3 for vehicle Y need to be shipped, while there are 1000 cases in stock in building A. Therefore, the allocation unit 111 first allocates 1000 cases from building A, and then allocates the remaining 1000 cases from building B.

[0071] In the example of FIG. 9, the allocation priority is set commonly for all products, but the allocation priority may be set for each product or each product group.

[0072] The allocation unit 111 outputs the result of the allocation as allocation information contained in the intermediate database 122.

[0073] FIG. 10 is a diagram showing an example of the data structure and data of the allocation information. As shown in FIG. 10, the allocation information includes a vehicle ID, a building ID, a packing style code, and a quantity. The building ID is the building ID of the building 4 for which inventory has been allocated to the vehicle 1 with the corresponding vehicle ID. The quantity is the amount of inventory allocated to the allocated building ID. In this way, the allocation information registers the allocated quantity for each vehicle 1, building 4, and packing style.

[0074] 10 has a data structure in which the total quantity of multiple products is registered when multiple products are allocated from a certain building 4. The data structure is not limited to this, and for example, when the work efficiency is calculated for each product or each product group, the quantity for each product or each product group may be registered.

[0075] Returning to the explanation of the flowchart in Fig. 6, the time calculation unit 112 calculates the loading and unloading time for each building 4 (circulating building) to which the inventory has been allocated (step S102). For example, the time calculation unit 112 calculates the loading and unloading time for each vehicle 1 at the circular building using the allocation information included in the intermediate database 122 and the information of the work efficiency master included in the input database 121, and outputs the loading and unloading time information included in the intermediate database 122.

[0076] Fig. 11 is a diagram showing an example of the data structure and data of the work efficiency master. As shown in Fig. 11, the work efficiency master includes a building ID, a packing style code, and work efficiency. The work efficiency is expressed, for example, as the amount that can be loaded or unloaded per hour (pallets / h, cases / h, etc.). In the example of Fig. 11, the work efficiency is registered for each building 4 and packing style.

[0077] When the work efficiency is expressed as shown in Fig. 11, the time calculation unit 112 calculates the loading and unloading time for each vehicle 1 and building 4, for example, by dividing the quantity in the allocation information by the work efficiency. When multiple quantities are registered for each vehicle 1 and building, the time calculation unit 112 sets the total of the loading and unloading times calculated for the multiple quantities as the loading and unloading time for each vehicle 1 and building 4. For example, in the example of Fig. 10, two quantities (100 pallets, 1000 cases) are registered for vehicle Y and building A. The time calculation unit 112 calculates 2 hours as the loading and unloading time for vehicle Y and building A, which is the sum of the loading and unloading time of 1 h (1 hour) for the quantity of 100 pallets and the loading and unloading time of 1 h (1 hour) for the quantity of 1000 cases.

[0078] 12 is a diagram showing an example of the data structure and data of the loading / unloading time information. As shown in FIG 12, the loading / unloading time information includes a vehicle ID, a building ID, and a loading / unloading time.

[0079] Returning to the explanation of the flowchart in Fig. 6, the order determination unit 113 determines the order of visiting the buildings for each vehicle 1 (step S103). For example, the order determination unit 113 determines the order of visiting the buildings 4 for each vehicle 1 using the loading and unloading time information included in the intermediate database 122 and the information of the travel time master, vehicle status information, and incidental work master of the input database 121, and outputs the order of visiting the buildings 4 for each vehicle 1 to the visiting order information included in the intermediate database 122.

[0080] Fig. 13 is a diagram showing an example of the data structure and data of the travel time master. The travel time master registers the time required for travel between the entrance / exit gate 3 and each building 4, or between two buildings 4. As shown in Fig. 13, the travel time master includes building ID_1, building ID_2, and required time. Building ID_1 and building ID_2 are set with the identification information of the building 4 (building ID) or the identification information of the entrance / exit gate ("G" in the example of Fig. 13).

[0081] Fig. 14 is a diagram showing an example of the data structure and data of the vehicle state information. The vehicle state information is information that indicates the state of the vehicle 1. As shown in Fig. 14, the vehicle state information includes a vehicle ID, a current position, a start time, and a status code.

[0082] The current location indicates the location of the vehicle 1 identified by the vehicle ID. The current location may be specified in units of a building 4 or an entrance / exit. FIG. 14 shows an example in which the current location is specified by the identification information of the building 4 or the entrance / exit.

[0083] The start time indicates the time at which berth allocation for each vehicle 1 begins (the earliest time at which berth allocation can be performed). For example, for a waiting vehicle 1, the start time can be the time at which the processing result of the information processing device 100 is reflected. On the other hand, for a vehicle 1 that has not yet arrived at the warehouse or a vehicle 1 that is performing some kind of work, a time in the future is set as the start time.

[0084] The status code indicates the state of each vehicle 1. The status code (state) includes, for example, not yet arrived (NA), loading and unloading (LD), moving (MV), waiting (WT), and departed (DP).

[0085] FIG. 14 is an example of vehicle status information as of 10:00. Vehicles X and Y are waiting near buildings A and B, respectively, and can be immediately eligible for berth allocation, so their start time is set to 10:00. Vehicle Z has not yet arrived and is scheduled to enter at 12:00, so its start time is set to 12:00. In other words, vehicle Z will be eligible for berth allocation from 12:00 onwards.

[0086] FIG. 15 is a diagram showing an example of the data structure and data of the ancillary work master. Ancillary work represents work required before and after loading and unloading work. Examples of ancillary work include communication and procedures at the time of entering and leaving the gate. Ancillary work includes pre-ancillary work carried out before the start of loading and unloading work, and post-ancillary work carried out after the work is completed. Note that ancillary work is not included in the time slot of the allocation band because it is considered that the ancillary work does not occupy berth 5.

[0087] As shown in Fig. 15, the ancillary work master includes a building ID, a berth ID, a front ancillary work, a rear ancillary work, and a work interval. The work interval is the minimum time between successive loading and unloading operations at the same berth 5. In the example of Fig. 15, the ancillary work is set in units of a building 4 and a berth 5. The unit of the ancillary work is not limited to this, and may be set, for example, in units of a vehicle 1 (driver).

[0088] Fig. 16 is a diagram showing an example of the data structure and data of the tour order information. As shown in Fig. 16, the tour order information includes a vehicle ID, a building ID, a tour order, a loading / unloading start time, and a loading / unloading end time. The tour order indicates the determined tour order. The loading / unloading start time and the loading / unloading end time indicate the start time and the end time of the loading / unloading work, respectively.

[0089] The order determination unit 113 determines the tour order and the times of one or more scheduled events (scheduled event times) in the following manner. The order determination unit 113 registers the start time and end time of a loading and unloading operation among the scheduled event times as the loading and unloading start time and loading and unloading end time.

[0090] The tour order can be determined, for example, by the following procedure. (M1) The patrol order is determined based on ascending order of loading / unloading time, descending order of loading / unloading time, or the priority of each of multiple buildings 4 (priority for determining the order). (M2) The patrol order is determined so as to equalize the congestion level in each building 4, which is calculated using the loading and unloading time. (M3) Randomly determine the tour order.

[0091] The congestion degree represents the degree of congestion (concentration) of vehicles 1 assigned to one building 4. An example of (M2) will be described below. First, the order determination unit 113 provisionally determines the patrol order for each vehicle 1 in advance using a simple method. The provisional determination can be performed using, for example, the above-mentioned (M1). The order determination unit 113 pro rataly divides the range from the scheduled entrance time to the scheduled departure time for each vehicle 1 according to the patrol order provisionally determined for that vehicle 1 and according to the ratio of loading and unloading times, and labels a patrol building for each of the pro rataly divided time periods. The order determination unit 113 can estimate the congestion degree of each patrol building at a certain time by counting the number of vehicles for each labeled patrol building.

[0092] The order determination unit 113 determines the visiting order so that the congestion degree of each visiting building calculated in this manner is equalized. For example, the order determination unit 113 determines the visiting order that equalizes the congestion degree by correcting the provisionally determined visiting order so as to minimize the cost function calculated from the congestion degree.

[0093] The cost function is expressed, for example, by the following formula (1): The average congestion degree represents the average value of the congestion degrees of all the circulation towers at each time. Cost function = (congestion level - average congestion level)^2, sum of all times (1)

[0094] The above process can be a process of selecting an optimal plan from among candidates for amendment plans (amendments to the visiting order) whose number is equivalent to "(number of buildings!)^number of vehicles". Therefore, if the number of buildings and vehicles increases, the amount of calculations may become excessive. Taking such cases into consideration, the order determination unit 113 may determine a visiting order that levels out the degree of congestion by applying an optimization method applicable to large-scale combinatorial optimization problems. The optimization method is, for example, the following method. Metaheuristic solutions such as genetic algorithms (GA) and simulated annealing (SA) -Fast heuristic methods such as greedy methods and local improvement methods

[0095] The congestion degree, the cost function, and the optimization method are not limited to the above, and any other congestion degree, cost function, and optimization method may be used.

[0096] The sequence determination unit 113 may determine the tour sequence so as to level out the congestion level by using the allocation priority for each of the multiple buildings 4 as a parameter. Parameterizing the allocation priority can be interpreted as being equivalent to parameterizing the distribution of distributed inventory.

[0097] For example, if product P3 is distributed inventory as shown in Figure 8, and building A has a higher allocation priority as shown in Figure 9, then the loading and unloading time for vehicle Y in buildings A and B will each be 2 hours (Figure 12). If building B has a higher allocation priority, product P3 (vehicle Y quantity: 2,000) can be allocated entirely from building B (product P3 quantity: 40,000). Therefore, the loading and unloading time for vehicle Y in buildings A and B will be 1 hour and 3 hours, respectively. As a result of changing the loading and unloading time, the congestion degree may also change. Therefore, by parameterizing the allocation priority of each building 4 and optimizing the congestion degree, a patrol order with less congestion can be obtained.

[0098] Next, we will explain how to calculate the scheduled event time of each vehicle 1. The scheduled event time represents the start time and end time of each scheduled event when multiple scheduled events progress according to the required time (without considering waiting for berths due to vehicle congestion).

[0099] The scheduled events are, for example, the following events. Note that the following events will proceed in the order listed. (I1) Introduction (I2) Move (I3) Pre-operation (I4) Cargo handling (I5) Post-operation (I6) Move (I7) Repeat I3 to I6 for the patrol building. (I8) Departure

[0100] The time of entry can be obtained from the registered vehicle information (scheduled entry time), the time required for travel can be obtained from the travel time master, the time required for pre-accompanying work and post-accompanying work can be obtained from the ancillary work master, and the time required for loading and unloading work can be obtained from the loading and unloading time information.

[0101] In addition, the vehicle 1 whose status code in the vehicle state information is other than pre-arrival (NA) or post-departure (DP) is in any event between (I1) entrance and (I8) exit. Therefore, the order determination unit 113 calculates the scheduled event time by starting from the start time of the vehicle state information and progressing from the intermediate event by the required time. When the status code in the vehicle state information is pre-arrival (NA), the order determination unit 113 calculates the scheduled event time by, for example, setting the event time of the entrance as the scheduled entrance time and progressing the subsequent event by the required time. When the status code in the vehicle state information is pre-arrival (DP), the order determination unit 113 does not need to calculate the scheduled event time. In addition, when the status code is other than pre-arrival (NA), the actual time may be acquired from the vehicle management device 200 for the event that has already occurred. The order determination unit 113 stores the start time and end time of the loading and unloading work in the tour order information based on the calculated scheduled event time.

[0102] As in the above, an example will be described in which the input database 121 stores the data shown in each figure. In this example, the route order obtained is Building A → Building B → Entry / Exit G for vehicle X, Building B → Building A → Entry / Exit G for vehicle Y, and Entry / Exit G → Building B → Entry / Exit G for vehicle Z. The scheduled event time for each vehicle 1 is calculated as follows. For example, "@A" indicates that the work is performed in Building A, and "@B→G" indicates movement from Building B to Entry / Exit G. [Vehicle X] Pre-work @A:10:00~10:10 Cargo handling work@A:10:10~11:10 Post-work @A:11:10~11:20 Movement @A→B: 11:20~11:50 Front-end work @B:11:50~11:55 Cargo handling work@B:11:55~14:55 Post-work @B:14:55~15:00 Move @B→G: 15:00~15:20 [Vehicle Y] Front-end work @B:10:00~10:05 Cargo handling work@B:10:05~12:05 Post-work @B:12:05~12:10 Move @B→A:12:10~12:40 Front-end work @A: 12:40~12:50 Cargo handling work@A:12:50~14:50 Post-work @A:14:50~15:00 Movement @A→G: 15:00~15:20 [Vehicle Z] Move@G→B:12:00~12:20 Front-end work@B:12:20~12:25 Cargo handling work@B:12:25~14:25 Post-work @B:14:25~14:30 Move @B→G: 14:30~14:50

[0103] The sequence determination unit 113 registers the start time and end time of the loading and unloading work (entrance time or departure time in the case of the entrance / exit gate G) among the scheduled event times in the tour sequence information.

[0104] Returning to the explanation of the flowchart in Fig. 6, the candidate extraction unit 114 extracts candidates for vehicles to be allocated to the allocation band using information such as the approaching conditions and the patrol order (step S104). For example, the candidate extraction unit 114 extracts candidates for vehicles 1 that can be allocated to the allocation band using the patrol order information contained in the intermediate database 122 and the registered vehicle information, allocation band information, and approaching conditions (vehicle size conditions, entry / exit conditions, route conditions) information contained in the input database 121, and outputs the allocation vehicle candidate evaluation information contained in the intermediate database 122.

[0105] Fig. 17 is a diagram showing an example of the data structure and data of the vehicle size conditions. As shown in Fig. 17, the vehicle size conditions include a building ID, a berth ID, a lower size limit, and an upper size limit. The lower size limit and the upper size limit indicate the lower and upper limits of the size of the vehicle 1 that can pull up to the berth 5 identified by the corresponding building ID and berth ID. Therefore, a vehicle 1 whose vehicle size set in the registered vehicle information is not within the range between the lower size limit and the upper size limit cannot be assigned to the berth 5.

[0106] FIG. 18 is a diagram showing an example of the data structure and data of the loading / unloading conditions. The loading / unloading conditions are conditions that indicate that only vehicles 1 entering or leaving the warehouse during a specific time period for each berth 5 will be accepted. As shown in FIG. 18, the loading / unloading conditions include a building ID, a berth ID, a start time, an end time, and a loading / unloading mode. The start time and end time represent the start time and end time of the time period during which only vehicles 1 engaged in loading / unloading work (either leaving or entering the warehouse) specified in the loading / unloading mode will be accepted. Berths 5 and time periods for which loading / unloading conditions are not registered can accept any vehicles 1 entering or departing.

[0107] FIG. 19 is a diagram showing an example of the data structure and data of a route condition. A route condition is a condition that indicates that only vehicles 1 belonging to a specific route are accepted for each berth 5 in a specific time period. As shown in FIG. 19, a route condition includes a building ID, a berth ID, a start time, an end time, and a route code. The start time and end time represent the start time and end time of the time period in which only vehicles 1 belonging to the route specified by the route code are accepted. Berths 5 and time periods in which no route condition is registered can accept all vehicles 1.

[0108] The candidate extraction unit 114 extracts candidates from among the vehicles 1 that satisfy the approaching conditions (vehicle size conditions, entrance / exit conditions, and route conditions). Note that the approaching conditions may be a part of the vehicle size conditions, the entrance / exit conditions, and the route conditions.

[0109] In the example where the input database 121 stores the data shown in each figure, vehicles X, Y, and Z each satisfy the entrance condition for the allocation time slot T1. Therefore, the candidate extraction unit 114 refers to the scheduled event time calculated as described above, and extracts vehicles that can be assigned to the allocation time slot T1 from among the vehicles X, Y, and Z.

[0110] Since the allocation time slot T1 is 11:00-15:00 at berth A1, it corresponds to the above-mentioned scheduled event times of vehicle X's loading / unloading work @A: 10:10-11:10 and vehicle Y's loading / unloading work @A: 12:50-14:50. Vehicle X can be assigned to the allocation time slot T1 by correcting the scheduled event time to 11:00-12:00 by delaying it by 50 minutes. Vehicle Y can be assigned to the allocation time slot T1 as it is with the calculated scheduled event time (12:50-14:50). Therefore, the candidate extraction unit 114 extracts both vehicle X and vehicle Y as assigned vehicle candidates and registers them in the assigned vehicle candidate evaluation information.

[0111] Fig. 20 is a diagram showing an example of the data structure and data of the allocated vehicle candidate evaluation information. As shown in Fig. 20, the allocated vehicle candidate evaluation information includes an allocation time slot ID, a vehicle ID, a start time, an end time, and an evaluation value. The start time and end time are the start time and end time of the scheduled event time to be allocated (if corrected, the corrected scheduled event time). Note that the evaluation value has not been set at the time when the candidate is extracted.

[0112] Returning to the explanation of the flowchart in Fig. 6, the evaluation value calculation unit 115 calculates an evaluation value for each vehicle 1 of the allocated vehicle candidates (step S105). For example, the evaluation value calculation unit 115 calculates an evaluation value for the allocation of each allocated vehicle candidate to an allocation band using the allocated vehicle candidate evaluation information contained in the intermediate database 122 and information such as the registered vehicle information contained in the input database 121, and updates the evaluation value of the allocated vehicle candidate evaluation information contained in the intermediate database 122.

[0113] For the example in FIG. 20, a case will be described in which evaluation values ​​that increase in descending order of gate exit delay time are used. Vehicle X is assigned to allocation time slot T1 50 minutes behind schedule, so the end time (gate exit time) of the scheduled event for moving to and from the gate will be 16:10 (15:20+50 minutes). Therefore, the gate exit delay time, which is the difference between vehicle X's scheduled gate exit time of 15:00 (registered vehicle information in FIG. 4) and the gate exit time of 16:10, is 70 minutes. Vehicle Y is assigned to allocation time slot T1 at the scheduled event time, so its gate exit time is 15:20. Therefore, the gate exit delay time, which is the difference between vehicle Y's scheduled gate exit time of 15:30 and the gate exit time of 15:20, is -10 minutes (10 minutes ahead).

[0114] The evaluation value calculation unit 115 updates the assigned vehicle candidate evaluation information, for example, by using the departure delay time as the evaluation value. Fig. 20 shows an example of the assigned vehicle candidate evaluation information after the update. The evaluation value may be calculated in a composite manner by combining a plurality of methods (for example, the above E1 to E3).

[0115] Returning to the explanation of the flowchart in Fig. 6, the allocation unit 116 selects an allocation vehicle with a high evaluation value from among the allocation vehicle candidates, and allocates it to the allocation band (step S106). For example, the allocation unit 116 uses the allocation vehicle candidate evaluation information contained in the intermediate database 122 to select a vehicle 1 to be allocated to the allocation band, and outputs the allocation vehicle information contained in the output database 123.

[0116] Fig. 21 is a diagram showing an example of the data structure and data of the assigned vehicle information. As shown in Fig. 21, the assigned vehicle information includes an assigned time slot ID, a building ID, a berth ID, a start time, an end time, and a vehicle ID. The vehicle ID is the vehicle ID of a vehicle 1 assigned to an assigned time slot identified by the assigned time slot ID.

[0117] 21, the allocation unit 116 selects vehicle X with the larger evaluation value from vehicle X and vehicle Y, which are candidates for allocation vehicles. Note that the allocation unit 116 may select multiple vehicles 1 in consideration of the possibility that the selected vehicle 1 may become unavailable for allocation for some reason. In that case, the allocation unit 116 may select multiple vehicles 1 by, for example, ranking them in descending order of evaluation value.

[0118] In this way, the information processing device of the first embodiment can more appropriately allocate vehicles 1 to areas (berths) where loading and unloading operations are performed, for example, by using the functions F1 to F6 described above.

[0119] Second Embodiment The information processing device of the second embodiment creates a berth allocation plan for all vehicles in a certain period, as in the above-mentioned use case U2.

[0120] Fig. 22 is a schematic diagram of an information processing system including an information processing device 100-2 of the second embodiment. As shown in Fig. 22, the information processing system of this embodiment includes a plurality of vehicles 1, a warehouse 2, an information processing device 100-2, a vehicle management device 200-2, a warehouse management device 300, a network 400, a plurality of transportation companies 500-2a to 500-2e, and a network 600-2. The same reference numerals are used for the same configuration as the first embodiment, and the description will be omitted.

[0121] The network 600-2 is a network for performing data communication between the vehicle management device 200-2 and a plurality of transport companies 500-2a to 500-2e. The network 600-2 may be in any form of network, for example, a local area network (LAN) or the Internet. The network 600-2 may be integrated with the network 400.

[0122] The transport companies 500-2a to 500-2e correspond to companies that use the warehouse 2. When there is no need to distinguish between the transport companies 500-2a to 500-2e, they may be simply referred to as the transport company 500-2.

[0123] The vehicle management device 200-2 further includes a function of receiving a vehicle reservation request from the transport company 500-2 via the network 600-2 and transmitting the result of the vehicle reservation to the transport company 500-2. A vehicle reservation means, for example, allocating a berth 5 in a warehouse 2 to a vehicle 1 managed by each transport company 500-2 and reserving the use of the allocated berth 5. The information processing system of this embodiment can be applied to a service of making a vehicle reservation for the next day based on information on the desired use of the warehouse 2 transmitted by the transport company 500-2 by the previous day, for example.

[0124] The information processing device 100-2 allocates the vehicles 1 of each transport company 500-2 to berths 5 based on information from the vehicle management device 200-2 and the warehouse management device 300. For example, the information processing device 100-2 performs a process of allocating loading and unloading work of each vehicle 1 to an available time slot of each berth 5 during a specific period in the future (e.g., the next day), and displays the processing result to the user or transmits the processing result to the transport company 500-2 via the vehicle management device 200-2.

[0125] Fig. 23 is a block diagram showing an example of the configuration of an information processing device 100-2 according to the second embodiment. As shown in Fig. 23, the information processing device 100-2 includes a processing unit 110-2, a storage unit 120-2, a display unit 101, an operation unit 102, a communication unit 103, and a bus 61.

[0126] In the second embodiment, the functions of the processing unit 110-2 and the storage unit 120-2 are different from those in the first embodiment. The other configurations and functions are the same as those in the block diagram of the information processing device 100 in the first embodiment shown in FIG. 2, so they are denoted by the same reference numerals and will not be described here.

[0127] The storage unit 120-2 stores an input database 121-2, an intermediate database 122, and an output database 123. The input database 121-2 of the second embodiment differs from the input database 121 of the first embodiment in that it further includes a berth usage time master and an unavailable berth condition.

[0128] Processing unit 110-2 differs from processing unit 110 of the first embodiment in that period determination unit 117-2 is added and in the function of allocation unit 116-2.

[0129] The period determination unit 117-2 determines one or more allocation time slots based on the time when each berth 5 is available. The period determination unit 117-2 corresponds to a function of aggregating the allocation time slots (available time slots) of all berths 5 in each building 4. For example, the period determination unit 117-2 refers to the berth usage time master and identifies the time slot when each berth 5 is available, i.e., the allocation time slot.

[0130] Fig. 24 is a diagram showing an example of the data structure and data of the berth usage time master. The berth usage time master is data for managing time periods during which the berths 5 in each building 4 are available. As shown in Fig. 24, the berth usage time master includes a building ID, a berth ID, a start time, and an end time.

[0131] The period determination unit 117-2 can grasp the time period (time period from start time to end time) during which each berth 5 in each building 4 (building A and building B) is available by referring to the berth usage time master. For example, berth A1 is available from 8:00 to 22:00.

[0132] The period determination unit 117-2 further refers to the unavailable berth conditions indicating the unavailability of the berth 5, and specifies the time period during which each berth 5 is unavailable. The period determination unit 117-2 determines the time period during which a berth 5 is available at a specific time, i.e., the allocation time slot, by comparing the information on the unavailable berth conditions with the berth usage time master.

[0133] Fig. 25 is a diagram showing an example of the data structure and data of the unusable berth conditions. The unusable berth conditions are conditions under which berth 5 is unusable, for example, conditions indicating a time period during which berth 5 is unusable. The time period during which berth 5 is unusable is, for example, a time period during which maintenance or the like is performed. As shown in Fig. 25, the unusable berth conditions include a building ID, a berth ID, a start time, and an end time.

[0134] The period determination unit 117-2 can grasp the time periods (time periods from start time to end time) when each berth 5 in each building 4 (building A and building B) is unavailable by referring to the unavailable berth conditions. The unavailable berth conditions work in conjunction with the berth usage time master and are used to clearly define the valid time periods to which the vehicle 1 should be assigned.

[0135] For example, according to the berth usage time master (Fig. 24), berth A1 is available from 8:00 to 22:00, but according to the unavailable berth conditions (Fig. 25), berth A1 is unavailable from 15:00 to 22:00. Based on this information, the period determination unit 117-2 determines (extracts) an allocation time slot of up to 8:00 to 15:00 for berth A1.

[0136] Among the time periods registered in the berth utilization time master, berths 5 and time periods that are not registered in the unavailable berth conditions are available for allocation of a vehicle 1. In other words, berths 5 are considered available for use during time periods that are not registered in the unavailable berth conditions, and can be used for allocation of a vehicle 1.

[0137] The period determination unit 117-2 performs the above analysis for all berths 5 in all buildings 4, and determines (extracts) all available allocation bands (a set of allocation bands).

[0138] The allocation unit 116-2 allocates one or more vehicles to each allocation time slot determined by the period determination unit 117-2. The allocation unit 116-2 corresponds to a function of optimally matching one or more available allocation time slots with one or more vehicles 1.

[0139] In order to use berths 5 more effectively, it is desirable to allocate appropriate vehicles 1 to appropriate time slots from among the many vehicles 1 that may exist. The allocation unit 116-2 has a function of managing the process for this purpose. In other words, the allocation unit 116-2 derives the most rational combination from among the combinations of many vehicles 1 and limited allocation slots. To achieve this, the allocation unit 116-2 not only allocates berths based on the calculation of evaluation values, but also checks the possibility of allocation and matches with vehicles 1, and executes an optimization method to maximize overall efficiency and effectiveness.

[0140] Next, the operation of each unit of the processing unit 110-2 will be described with reference to the flowchart in Fig. 26. Fig. 26 is a flowchart showing an example of the berth allocation process of this embodiment. The berth allocation process of this embodiment is a process of determining allocation bands for a plurality of berths 5 and allocating vehicles 1 to the determined allocation bands.

[0141] Steps S201 to S203 are similar to steps S101 to S103 in the information processing device 100 of the first embodiment, and therefore a description thereof will be omitted.

[0142] In this embodiment, the period determination unit 117-2 refers to the berth utilization time master and the unavailable berth conditions to identify the time periods during which each berth 5 is available, and determines (extracts) the set of identified time periods as a set of allocation time slots (step S204).

[0143] Next, the candidate extraction unit 114 extracts candidates for allocation vehicles for each allocation belt included in the set of allocation belts using information such as the entrance conditions and the patrol order (step S205). This process is required to satisfy the constraint conditions. In this process, combinations of all vehicles 1 and all allocation belts included in the set of allocation belts are evaluated as possibilities.

[0144] Next, the allocation unit 116-2 calculates an evaluation value for each combination of each allocation band and each vehicle of the allocation vehicle candidate (step S206). The method (objective function) for calculating the evaluation value can be the same as that in the first embodiment. The allocation unit 116-2 focuses on the combination with the highest objective function (evaluation value) and determines the final berth allocation for all vehicles 1 (step S207).

[0145] The allocation unit 116-2 may use an optimization method to prevent an explosive increase in combinations. The result of berth allocation may vary significantly depending on the order in which constraints and objective functions are considered. Therefore, the allocation unit 116-2 may determine berth allocation by applying an optimization method applicable to large-scale combinatorial optimization problems. The optimization method is, for example, the following method. Metaheuristic solutions such as genetic algorithms (GA) and simulated annealing (SA) -Fast heuristic methods such as greedy methods and local improvement methods

[0146] This enables the information processing device 100-2 to derive optimal berth allocation for each vehicle 1, thereby maximizing the efficiency and effectiveness of the entire system.

[0147] Fig. 27 is a diagram showing an example of assigned vehicle information included in the output database 123 of the second embodiment. The assigned vehicle information of the second embodiment has the same data structure as the assigned vehicle information of the first embodiment, but differs in that berth allocation results are output for multiple allocation time slots. That is, while the assigned vehicle information of the first embodiment (Fig. 21) is the allocation result for only the allocation time slot T1, the assigned vehicle information of Fig. 27 includes the results of berth allocation for five allocation time slots T1 to T5 corresponding to any of the four berths 5 in two buildings 4.

[0148] For example, berth A1 in building A is assigned the loading and unloading work of vehicle X from 11:00 to 12:00, followed by the loading and unloading work of vehicle Y from 12:50 to 14:50.

[0149] The processing unit 110-2 may output (display) a display screen (such as a Gantt chart from the viewpoint of a berth) displaying the allocated vehicles and the allocated time slots for each berth 5 on the display unit 101. This allows, for example, the user to check the usage schedule of the berth 5.

[0150] On the other hand, from the assigned vehicle information in Fig. 27, it can be understood that, for example, vehicle X will perform loading and unloading work in building A from 11:00 to 12:00, and then perform loading and unloading work in building B from 12:45 to 15:45. Therefore, the processing unit 110-2 may output (display) on the display unit 101 a display screen (such as a Gantt chart from the vehicle's perspective) that displays the assigned berth and assigned time zone for each vehicle 1. This allows the user to check scheduled events for vehicle 1, for example.

[0151] In this manner, the information processing device of the second embodiment can determine one or more allocation bands for one or more berths, and can more appropriately allocate vehicles to the determined allocation bands.

[0152] As described above, according to the first and second embodiments, vehicles can be more appropriately allocated to areas where loading and unloading operations are performed.

[0153] Next, the hardware configuration of each device (information processing device, vehicle management device, warehouse management device) of the first or second embodiment will be described with reference to Fig. 28. Fig. 28 is an explanatory diagram showing an example of the hardware configuration of the device of the first or second embodiment.

[0154] The device of the first or second embodiment includes a control device such as a CPU (Central Processing Unit) 51, a storage device such as a ROM (Read Only Memory) 52 and a RAM (Random Access Memory) 53, a communication I / F 54 that connects to a network and performs communication, and a bus 61 that connects each unit. For example, in the case of an information processing device 100, the CPU 15 corresponds to the processing unit 110, the storage device corresponds to the storage unit 120, and the communication I / F 54 corresponds to the communication unit 103.

[0155] The programs executed by the device of the first or second embodiment are provided in a state that they are pre-installed in the ROM 52 or the like.

[0156] The program executed by the device of the first or second embodiment may be configured to be provided as a computer program product by being recorded in an installable or executable format on a computer-readable recording medium such as a CD-ROM (Compact Disk Read Only Memory), a flexible disk (FD), a CD-R (Compact Disk Recordable), or a DVD (Digital Versatile Disk).

[0157] Furthermore, the program executed by the device of the first or second embodiment may be stored on a computer connected to a network such as the Internet and provided by being downloaded via the network. Also, the program executed by the device of the first or second embodiment may be provided or distributed via a network such as the Internet.

[0158] The program executed by the device of the first or second embodiment can cause a computer to function as each part of the device described above. In this computer, the CPU 51 can read the program from a computer-readable storage medium onto a main storage device and execute the program.

[0159] A configuration example of the embodiment will be described below. (Configuration example 1) determining an order for each of a plurality of vehicles to visit a plurality of buildings each including one or more loading / unloading work areas based on a loading / unloading time calculated based on an allocated inventory of luggage stored in the plurality of buildings; Allocating one or more vehicles selected from the plurality of vehicles to one or more target periods during which loading and unloading operations are performed in each of the one or more loading and unloading operation areas based on the order; Processing section An information processing device comprising: (Configuration example 2) The processing unit includes: for each of a plurality of vehicles, an inventory of cargo stored in a plurality of said buildings; Calculating the loading and unloading times at the plurality of buildings based on the allocated inventory and a predetermined efficiency of loading and unloading operations; determining, for each of the plurality of vehicles, an order in which the vehicles will travel to the plurality of buildings for loading and unloading the inventory assigned to the vehicle based on the loading and unloading time; extracting one or more candidates for the vehicle to be assigned to one or more of the target periods from the plurality of the vehicles based on the order; Calculating an evaluation value for the allocation to the target period for each of the one or more candidates; assigning, for each of one or more time periods, one or more vehicles selected from one or more of the candidates based on the evaluation values; The information processing device according to configuration example 1. (Configuration example 3) The processing unit includes: Calculating the loading and unloading time based on the allocated inventory and the efficiency according to a storage state of the allocated inventory. The information processing device according to configuration example 2. (Configuration Example 4) The processing unit includes: When the same type of cargo is stored in a plurality of buildings, the building from which the inventory is to be allocated and the quantity of the inventory to be allocated are determined based on a priority level set for each of the plurality of buildings. The information processing device according to configuration example 1 or 2. (Configuration Example 5) The processing unit includes: determining the order based on an ascending order of the loading and unloading time, a descending order of the loading and unloading time, or a priority determined for each of the plurality of buildings; The information processing device according to any one of configuration examples 1 to 3. (Configuration Example 6) The processing unit includes: determining the order so that the congestion degree of each of the plurality of buildings, which is calculated using the loading and unloading time, is equalized; The information processing device according to any one of configuration examples 1 to 4. (Configuration Example 7) The processing unit includes: determining the order so as to equalize the degree of congestion using a priority for each of the plurality of buildings as a parameter; The information processing device according to configuration example 6. (Configuration Example 8) The processing unit includes: extracting the candidates from the plurality of vehicles based on vehicle approach conditions determined for each loading / unloading work area, the vehicle size conditions including at least one of vehicle entry and exit conditions indicating whether the vehicle is to enter or leave the warehouse, and conditions indicating the vehicles that are permitted to carry out the loading / unloading work, and the order; The information processing device according to configuration example 2. (Configuration Example 9) The processing unit includes: calculating the evaluation value based on at least one of a date and time when the vehicle enters an area in which the plurality of buildings are installed and a date and time when the vehicle leaves an area in which the plurality of buildings are installed; The information processing device according to configuration example 2. (Configuration Example 10) The processing unit includes: calculating the evaluation value based on a difference between a date and time when the vehicle leaves an area in which the plurality of buildings are installed and a date and time when the vehicle is scheduled to leave the area in which the plurality of buildings are installed; The information processing device according to configuration example 2. (Configuration Example 11) The processing unit includes: determining one or more time periods of interest based on the availability of each of the one or more loading and unloading work areas; allocating one or more vehicles to each of the determined one or more target periods; The information processing device according to any one of configuration examples 1 to 10. (Configuration Example 12) The processing unit includes: An order determination unit that determines the order; an allocation unit that allocates one or more of the vehicles to each of the one or more target periods; Equipped with The information processing device according to any one of configuration examples 1 to 11. (Configuration Example 13) An information processing method executed by an information processing device, a sequence determination step of determining, for each of the plurality of vehicles, a sequence for visiting a plurality of buildings each including one or more loading / unloading work areas, based on a loading / unloading time calculated based on an allocated inventory of luggage stored in the plurality of buildings; an allocation step of allocating one or more vehicles selected from the plurality of vehicles to each of one or more target periods in which loading and unloading operations are performed in each of the one or more loading and unloading operation areas based on the order; An information processing method comprising: (Configuration Example 14) On the computer, a sequence determination step of determining, for each of the plurality of vehicles, a sequence for visiting a plurality of buildings each including one or more loading / unloading work areas, based on a loading / unloading time calculated based on an allocated inventory of luggage stored in the plurality of buildings; an allocation step of allocating one or more vehicles selected from the plurality of vehicles to each of one or more target periods in which loading and unloading operations are performed in each of the one or more loading and unloading operation areas based on the order; A program for executing the above.

[0160] Although some embodiments of the present invention have been described, these embodiments are presented as examples and are not intended to limit the scope of the invention. These novel embodiments can be implemented in various other forms, and various omissions, substitutions, and modifications can be made without departing from the spirit of the invention. These embodiments and their modifications are included in the scope and spirit of the invention, and are included in the scope of the invention and its equivalents described in the claims. [Explanation of symbols]

[0161] 100, 100-2 Information processing device 101 Display section 102 Operation section 103 Communications Department 110, 110-2 Processing section 111 Provision Department 112 Time calculation section 113 Order determining part 114 Candidate Extraction Unit 115 Evaluation value calculation unit 116, 116-2 Allocation section 117-2 Period determination section 120, 120-2 Storage section 121, 121-2 Input database 122 Intermediate Database 123 Output Database 200 Vehicle management device 300 Warehouse management equipment 400 Network 600-2 Network

Claims

1. Calculating a loading / unloading time for each of the plurality of vehicles in a plurality of buildings by dividing an allocated inventory quantity among inventory of cargo stored in the plurality of buildings each including one or more loading / unloading work areas by a predetermined loading / unloading work efficiency; determining an order for each of the plurality of vehicles to visit the plurality of buildings for loading and unloading the inventory assigned to the vehicle based on ascending order of the loading and unloading time, descending order of the loading and unloading time, or a priority determined for each of the plurality of buildings, or determining the order so as to equalize the degree of congestion of each of the plurality of buildings calculated using the loading and unloading time; extracting, from the plurality of vehicles, one or more candidates for the vehicle to be assigned to each of one or more target periods in which loading and unloading operations are performed in each of one or more loading and unloading operation areas based on the order; Calculating an evaluation value for allocation to the target period based on at least one of the following for each of the one or more candidates: a date and time when the vehicle enters an area in which the plurality of buildings are installed, a date and time when the vehicle leaves the area in which the plurality of buildings are installed, and a difference between a date and time when the vehicle leaves the area in which the plurality of buildings are installed and a date and time when the vehicle is scheduled to leave the area in which the plurality of buildings are installed; assigning, for each of one or more time periods, one or more vehicles selected from one or more of the candidates based on the evaluation values; Processing section An information processing device comprising:

2. The processing unit includes: for each of a plurality of vehicles, inventory of cargo stored in a plurality of said buildings; The information processing device according to claim 1 .

3. The processing unit includes: Calculating the loading and unloading time based on the allocated inventory and the efficiency according to a storage state of the allocated inventory. The information processing device according to claim 1 .

4. The processing unit includes: When the same type of cargo is stored in a plurality of buildings, the building from which the inventory is to be allocated and the quantity of the inventory to be allocated are determined based on a priority level set for each of the plurality of buildings. The information processing device according to claim 1 .

5. The processing unit includes: determining the order so as to equalize the degree of congestion using a priority for each of the plurality of buildings as a parameter; The information processing device according to claim 1 .

6. The processing unit includes: extracting the candidates from the plurality of vehicles based on vehicle approach conditions determined for each loading / unloading work area, the vehicle size conditions including at least one of vehicle entry and exit conditions indicating whether the vehicle is to enter or leave the warehouse, and conditions indicating the vehicles that are permitted to carry out the loading / unloading work, and the order; The information processing device according to claim 1 .

7. The processing unit includes: determining one or more time periods of interest based on the availability of each of the one or more loading and unloading work areas; Allocating one or more vehicles to each of the determined one or more target periods; The information processing device according to claim 1 .

8. The processing unit includes: An order determination unit that determines the order; an allocation unit that allocates one or more of the vehicles to each of the one or more target periods; Equipped with The information processing device according to claim 1 .

9. An information processing method executed by an information processing device, a time calculation step of calculating a loading / unloading time in each of a plurality of buildings by dividing an allocated inventory quantity of cargo stored in each of a plurality of buildings including one or more loading / unloading work areas by a predetermined loading / unloading work efficiency; an order determination step of determining, for each of the plurality of vehicles, an order of visiting the plurality of buildings for loading and unloading the inventory allocated to the vehicle based on ascending order of the loading and unloading time, descending order of the loading and unloading time, or a priority determined for each of the plurality of buildings, or determining the order so as to equalize the degree of congestion of each of the plurality of buildings calculated using the loading and unloading time; an extraction step of extracting, from the plurality of vehicles, one or more candidates for the vehicle to be assigned to each of one or more target periods in which loading and unloading operations are performed in each of the one or more loading and unloading operation areas based on the order; an evaluation value calculation step of calculating, for each of the one or more candidates, an evaluation value for allocation to the target period based on at least one of a date and time when the vehicle enters an area in which the plurality of buildings are installed, a date and time when the vehicle leaves the area in which the plurality of buildings are installed, and a difference between a date and time when the vehicle leaves the area in which the plurality of buildings are installed and a date and time when the vehicle is scheduled to leave the area in which the plurality of buildings are installed; an allocation step of allocating, for each of one or more target periods, one or more vehicles selected from one or more of the candidates based on the evaluation value; An information processing method comprising:

10. On the computer, a time calculation step of calculating a loading / unloading time in each of a plurality of buildings by dividing an allocated inventory quantity of cargo stored in each of a plurality of buildings including one or more loading / unloading work areas by a predetermined loading / unloading work efficiency; an order determination step of determining, for each of the plurality of vehicles, an order of visiting the plurality of buildings for loading and unloading the inventory allocated to the vehicle based on ascending order of the loading and unloading time, descending order of the loading and unloading time, or a priority determined for each of the plurality of buildings, or determining the order so as to equalize the degree of congestion of each of the plurality of buildings calculated using the loading and unloading time; an extraction step of extracting, from the plurality of vehicles, one or more candidates for the vehicle to be assigned to each of one or more target periods in which loading and unloading operations are performed in each of the one or more loading and unloading operation areas based on the order; an evaluation value calculation step of calculating, for each of the one or more candidates, an evaluation value for allocation to the target period based on at least one of a date and time when the vehicle enters an area in which the plurality of buildings are installed, a date and time when the vehicle leaves the area in which the plurality of buildings are installed, and a difference between a date and time when the vehicle leaves the area in which the plurality of buildings are installed and a date and time when the vehicle is scheduled to leave the area in which the plurality of buildings are installed; an allocation step of allocating, for each of one or more target periods, one or more vehicles selected from one or more of the candidates based on the evaluation value; A program for executing the above.

Images