Information processing device, optimization method, and non-transitory computer-readable storage medium
By optimizing vehicle layout within vehicle transport vessels using computer optimization methods and annealing computers or Ising machines, the problem of long vehicle loading and unloading optimization times in existing technologies is solved, achieving rapid and efficient vehicle layout optimization.
Patent Information
- Application Number
- CN202110373078.8
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Priority Date
- 2020-12-23
- Filing Date
- 2021-04-07
- Publication Date
- 2024-11-05
- Estimated Expiration
- 2041-04-07
AI Technical Summary
In the case of multiple loading and unloading of cargo, the optimization of existing technologies takes too long, especially in the planning and creation of vehicle layout in vehicle transport vessels, where there are many constraints that lead to long manual operation times.
The optimization method implemented by computer receives spatial information and generates multiple constraints. It uses an annealing computer or Ising machine to optimize vehicle layout and automatically generates an optimized plan for vehicles in vehicle transport vessels, reducing instability.
By using automated optimization methods, the time required for vehicle layout optimization has been significantly reduced, for example, from 30 minutes to less than 5 minutes to generate a vehicle layout that meets the constraints.
Smart Images

Figure CN113537871B_ABST
Abstract
Description
Technical Field
[0001] The embodiments discussed herein are related to an information processing device, an optimization method, and a non-transitory computer-readable storage medium storing an optimization program. Background Art
[0002] When placing cargo in a multi-storey warehouse, surface parking space, vehicle transport vessel (also referred to as a "car carrier ship" or "car carrier"), etc., the arrangement of the cargo or vehicles when loading is optimized so that the cargo, etc. does not block the passage when loading or unloading the cargo, etc.
[0003] For example, a technology has been known for optimizing the balance and the like of a single-layer ship with an open ceiling when sheet coils are transported from a plurality of warehouses to the ship and stacked in two layers on the ship. In addition, a technology has been known for creating a delivery plan that provides excellent transportation efficiency in the case of delivering delivery goods from a plurality of delivery sources to a plurality of delivery destinations so that after unloading the delivery goods at each delivery destination, another delivery goods is loaded and delivered to the next delivery destination. Furthermore, a technology has been known for individually determining the vehicle arrangement in the loading plan (vehicle arrangement) of an automobile carrier so as not to form a broken space while avoiding obstacles in the carrier existing within the block in the carrier. Summary of the invention
[0004] [Technical issues]
[0005] However, in the above-mentioned technology, when loading and unloading cargo multiple times, etc., there are many constraints, so that the optimization takes a lot of time. For example, consider a vehicle transport ship into which vehicles are loaded at multiple ports and from which vehicles are unloaded at multiple ports. In this case, considering that the loading and unloading of vehicles can be performed, it is necessary to create a plan for arranging vehicles in each block within the vehicle transport ship. Such a plan is usually created manually and takes a lot of time.
[0006] According to one aspect, a solution is provided for reducing the time spent optimizing the arrangement of goods.
[0007] [Solution to the problem]
[0008] According to one aspect of the embodiment, a computer-implemented optimization method is provided. In an example, the method includes: receiving spatial information related to a target space for placing goods, the spatial information being divided into a plurality of parts and defining routes between the plurality of parts and routes from each of the plurality of parts to an entrance; generating a first constraint, a second constraint, and a third constraint according to the spatial information, the first constraint indicating that there are no other goods on the route from the goods to be loaded or unloaded to the entrance during loading or unloading of the goods, the second constraint indicating the number of goods to be loaded and the number of goods to be unloaded, and the third constraint indicating the maximum load capacity of each of the plurality of parts; and determining a cargo arrangement that optimizes the degree of instability of the target space based on the first constraint, the second constraint, and the third constraint.
[0009] [Beneficial Effects of the Invention]
[0010] In aspects of embodiments, the time spent optimizing the arrangement of goods may be reduced. BRIEF DESCRIPTION OF THE DRAWINGS
[0011] Figure 1 is a diagram for describing an information processing apparatus according to a first embodiment;
[0012] Figure 2 is a functional block diagram showing a functional configuration of an information processing apparatus according to a first embodiment;
[0013] Figure 3 It is a schematic diagram of a vehicle transport vessel;
[0014] Figure 4 is a diagram showing a graphical structure corresponding to a space in a vehicle transport vessel;
[0015] Figure 5 is a diagram showing a vehicle loading and unloading table;
[0016] Figure 6 is a schematic diagram of a block divided into cells;
[0017] Figure 7 is a diagram for describing a solution performed by an optimization device and a calculation of a vehicle arrangement represented by the solution;
[0018] Figure 8 is a diagram showing an optimized vehicle configuration;
[0019] Fig. 9 is a flow chart showing the flow of the optimization process;
[0020] Fig.10 is a diagram showing a vehicle loading and unloading table of a second embodiment;
[0021] Fig.11 is a diagram for describing the sequence of ports of call according to the second embodiment;
[0022] Fig.12 is a diagram for describing how to specify switching of a formulation for describing constraint condition 1 according to the second embodiment;
[0023] Fig.13 is a diagram for describing a general expression of constraint condition 1 according to the second embodiment;
[0024] Fig.14 is a diagram for describing the formulation of constraint condition 3 according to the second embodiment;
[0025] Fig.15 is a diagram for describing a general expression of constraint condition 3 according to the second embodiment;
[0026] Fig.16 is a graph used to describe constraint 1 when there are concurrent ports;
[0027] Fig.17 is a graph used to describe constraint 3 when there are concurrent ports;
[0028] Fig.18 is a flowchart showing the flow of optimization processing according to the second embodiment; and
[0029] Fig.19 is a diagram for describing a hardware configuration example. DETAILED DESCRIPTION
[0030] The embodiments of the information processing device, optimization method, and optimization program disclosed in the present application will be described in detail with reference to the accompanying drawings. Note that the present disclosure is not limited to these embodiments. In addition, each of these embodiments can be appropriately combined as long as there is no inconsistency.
[0031] [First embodiment]
[0032] [Description of information processing device]
[0033] Figure 1 is a diagram for describing the information processing device 10 according to the first embodiment. Figure 1 The information processing device 10 shown is an example of a computer device that optimizes the arrangement of cargo or vehicles when loading when cargo is placed in a multi-story warehouse, a surface parking space, a vehicle transport ship, etc., so that the cargo, etc. does not block the passage during loading and unloading of the cargo, etc.
[0034] In the first embodiment, an example of arrangement of cargo will be described by taking a vehicle transport ship into which vehicles are loaded at several ports and unloaded at several ports in one voyage as an example. Note that a vehicle is an example of cargo, and a vehicle transport ship is an example of a target space in which cargo is placed.
[0035] like Figure 1 As shown, the information processing device 10 receives input of spatial information about the interior of the vehicle transport vessel where the vehicle is placed, the spatial information being divided into a plurality of sections and defining routes between the plurality of sections and routes from each of the plurality of sections to an entrance. Similarly, the information processing device 10 receives input of loading and unloading information corresponding to a so-called vehicle loading and unloading table indicating ports where vehicles are loaded, ports where vehicles are unloaded, and how many vehicles are loaded or unloaded at each port.
[0036] Then, the information processing device 10 generates a constraint condition using the input information. For example, the information processing device 10 generates a first constraint condition indicating that no other vehicles exist on the route from the vehicle to be loaded or unloaded to the entrance when loading and unloading the vehicle. In addition, the information processing device 10 generates a second constraint condition indicating that the number of vehicles to be loaded and the number of vehicles to be unloaded are specified in advance. Furthermore, the information processing device 10 generates a third constraint condition indicating that the vehicle is placed in each of the plurality of sections when the load capacity does not exceed the preset load capacity (maximum load capacity).
[0037] When loading and unloading vehicles at each port, the center of gravity of the ship is also important, and it is preferably planned so that the center of gravity of the ship is as low as possible in order to reduce the possibility of the ship capsizing. In the present embodiment, the information processing device 10 generates an objective function for calculating the degree of instability of the vehicle transport ship. Thereafter, the information processing device 10 uses an optimization device such as an annealing computer or an Ising machine to determine the vehicle arrangement that minimizes the objective function under the first constraint, the second constraint, and the third constraint. With this configuration, the information processing device 10 can automatically generate complex constraints, thereby shortening the time spent on optimizing the vehicle arrangement.
[0038] [Functional configuration of information processing device]
[0039] Figure 2 1 is a functional block diagram showing the functional configuration of the information processing device 10 according to the first embodiment. Figure 2As shown, the information processing device 10 includes a communication unit 11 , a display unit 12 , a storage unit 13 , and a control unit 20 .
[0040] The communication unit 11 is a processing unit that controls communication with another device and is implemented by, for example, a communication interface, etc. For example, the communication unit 11 transmits and receives various data to and from an external device such as a device used by an administrator, etc.
[0041] The display unit 12 is a processing unit that displays various types of information, and is implemented by, for example, a display, a touch panel, etc. For example, the display unit 12 displays a finally obtained vehicle arrangement result, a calculated solution result, and the like.
[0042] The storage unit 13 is an example of a processing unit that stores various data, programs executed by the control unit 20 , etc., and is implemented by, for example, a memory, a hard disk, etc. The storage unit 13 stores ship information 14 and a vehicle loading and unloading table 15 .
[0043] The ship information 14 is information about a vehicle transport ship in which a vehicle is placed, which is divided into a plurality of parts and defines routes between the plurality of parts and routes from each of the plurality of parts to an entrance. For example, the ship information 14 corresponds to information about a graphical structure obtained by graphically showing a schematic diagram of a vehicle transport ship or the like.
[0044] First, a schematic diagram of a vehicle transport vessel will be described. Figure 3 is a schematic diagram of a vehicle transport ship. Figure 3 As shown in the schematic diagram of FIG. 1 , the vehicle transport ship has six levels from deck 1 on the first level to deck 6 on the sixth level. Each deck is divided into blocks. The vehicle transport ship has one entrance on deck 3. The decks are connected by ramps S1, S2 and S3.
[0045] Furthermore, deck 6 is divided into four blocks, namely blocks 1 to 4, deck 5 is divided into four blocks, namely blocks 5 to 8, and deck 4 is divided into four blocks, namely blocks 9 to 12. Similarly, deck 3 is divided into four blocks, namely blocks 13 to 16, deck 2 is divided into three blocks, namely blocks 17 to 19, and deck 1 is divided into three blocks, namely blocks 20 to 22.
[0046] In addition, ramp S1 is a route from deck 6 and deck 5 to the entrance on deck 3, ramp S2 is a route from deck 4 to the entrance, and ramp S1 is a route from deck 2 and deck 1 to the entrance.
[0047] Next, information related to a graphic structure obtained by graphically illustrating a schematic diagram of a vehicle transport ship will be described. Figure 4 is a diagram showing a graphical structure corresponding to a space in a vehicle transport vessel. Figure 4 As shown, blocks in the same deck are connected to each other. In addition, blocks 1 to 4 of deck 6 are sequentially connected to the entrance via blocks 2, 6, and 13. Blocks 5 to 8 of deck 5 are sequentially connected to the entrance via blocks 6 and 13. Blocks 9 to 12 of deck 4 are sequentially connected to the entrance via blocks 10 and 13.
[0048] Blocks 13 to 16 of deck 3 are connected to the inlet via block 13. Blocks 17 to 19 of deck 2 are connected to the inlet via block 17, block 14, and block 13, in sequence. Blocks 20 to 22 of deck 1 are connected to the inlet via block 20, block 17, block 14, and block 13, in sequence.
[0049] Note that the ship information 14 includes load information specifying, for example, the maximum load capacity of each block and Figure 4 Information about the graphical structure shown includes deck position, block position, ramp position, etc.
[0050] return Figure 2 The vehicle loading and unloading table 15 is an example of loading and unloading information defining the order in which the vehicle transport ship stops at ports, the number of vehicles to be unloaded, and the like. Figure 5 is a diagram showing a vehicle loading and unloading table 15. Figure 5 As shown, in the vehicle loading and unloading table 15, a loading port for loading a vehicle, an unloading port for unloading a vehicle, and the number of vehicles to be loaded and to be unloaded are associated with each other.
[0051] Specifically, for example, the vehicle loading and unloading table 15 specifies that the vehicle transport ship stops in the order of Port A → Port B → Port C → Port D → Port E → Port F. In addition, the numbers in the vehicle loading and unloading table 15 indicate the number of vehicles to be loaded and unloaded at each port. For example, 1600 vehicles (8) are loaded at Port B and unloaded at Port F.
[0052] The control unit 20 is a processing unit that controls the entire information processing device 10, and is implemented by, for example, a processor, etc. The control unit 20 includes a receiving unit 21, a formulation unit 22, an optimization unit 23, and an output calculation unit 24. Note that the receiving unit 21, the formulation unit 22, the optimization unit 23, and the output calculation unit 24 may be implemented by an electronic circuit such as a processor, or may be implemented as an example of a process performed by a processor.
[0053] The receiving unit 21 is a processing unit that receives the ship information 14 and the vehicle loading and unloading table 15. For example, the receiving unit 21 receives the ship information 14 and the vehicle loading and unloading table 15 from the administrator terminal or the like via the communication unit 11 and stores the ship information 14 and the vehicle loading and unloading table 15 in the storage unit 13. Note that the ship information 14 and the vehicle loading and unloading table 15 may be information manually generated by an administrator or the like or information generated using a known tool or the like.
[0054] The formulation unit 22 is a processing unit that performs formulation of constraints and objective functions using the ship information 14, the vehicle loading and unloading table 15, etc. Specifically, for example, the formulation unit 22 regards the optimization problem according to the first embodiment as a mathematical optimization problem, and generates a plurality of constraints and objective functions.
[0055] (premise)
[0056] Here, the formulation unit 22 divides each block into cells and assigns binary variables to the respective cells. Figure 6 is a schematic diagram of a block divided into cells. Figure 6 As shown, each block is divided into four cells. Note that the number of divisions (the number of cells) is preferably determined by the specifications of the optimization device. For example, if the number of cells is too large, the number of variables increases, and the optimization speed of the optimization device decreases. Therefore, the number of cells is preferably determined according to the processing capacity of the optimization device.
[0057] Then, the formulating unit 22 defines the definitions of variables and constants as follows. ijkm " is a value of "1" or "0". Note that when "x ijkm ” is “1”, meaning that there is a vehicle in cell m in block k that is loaded at loading port i and to be unloaded at unloading port j, and when “x ijkm "When it is "0", it means other situations. ij " is the number of vehicles loaded at loading port i and to be unloaded at unloading port j. "b km ” is the maximum load capacity of cell m in block k. “M” is the number of loading ports, “N” is the number of unloading ports, “R” is the number of blocks, and “S k ” is the number of cells in block k.
[0058] (Constraint 1)
[0059] Next, the constraint 1 will be described. For example, the formulation unit 22 generates the constraint 1 indicating that other cargo does not exist on the route from the cargo to be loaded or unloaded to the entrance when loading and unloading cargo. In other words, for example, the formulation unit 22 generates the constraint 1 indicating that "when a vehicle passes through a certain block, the vehicle cannot pass unless there is no vehicle in the block."
[0060] For example, when there is a vehicle in a cell and the block between the cell and the entrance is focused on, it is expected that a vehicle loaded at a loading port before the loading port where the vehicle is loaded does not exist in the block, and a vehicle to be unloaded at an unloading port after the unloading port at which the vehicle is to be unloaded does not exist in the block. Therefore, when there is a vehicle loaded at a loading port p and to be unloaded at an unloading port q in a cell s of a block r, the formulation unit 22 can define the vehicle y blocking the passage by equation (1): pq , where k' indicates the block between cell s and the entrance.
[0061]
[0062] Here, it is expected that for a particular x pqrs ,(x pqrs =1 when y pq =0) and (x pqrs = 0 when y pq is any value), and this can be defined by equation (2). In this case, (x pqrs ·y pq ) is the minimum value. Therefore, it is desirable to establish equation (3) for calculating the sum for all p, q, r and s.
[0063] x pqrs ·y pq =0 …(2)
[0064]
[0065] (Constraint 2)
[0066] Next, the constraint 2 will be described. For example, the formulation unit 22 generates the constraint 2 indicating that the number of cargoes to be loaded and the number of cargoes to be unloaded are specified in advance. That is, for example, the formulation unit 22 generates the constraint 2 indicating that "the number of vehicles to be loaded at the loading port and to be unloaded at the unloading port is the value specified in the vehicle loading and unloading table 15".
[0067] For example, it is desirable that, in the entire vehicle transport ship, the sum of the number of vehicles loaded at the loading port p and the number of vehicles unloaded at the unloading port q is equal to c in the vehicle loading and unloading table 15.pq value, and this is defined by equation (4). Therefore, it is desirable to establish equation (5) that calculates the sum for all p and q.
[0068]
[0069]
[0070] (Constraint 3)
[0071] Next, the constraint 3 will be described. For example, the formulation unit 22 generates the constraint 3 indicating that the cargo is arranged in each of the plurality of sections when the load capacity does not exceed the preset load capacity. That is, for example, the formulation unit 22 generates the constraint 3 indicating that "the vehicle may not be loaded when the load capacity is equal to or greater than the maximum load capacity of one cell".
[0072] For example, a vehicle associated with one port exists in one cell, but a vehicle associated with two ports does not exist in the same cell. In other words, for example, for a specific cell s in a specific block r, the sum of all ports is expected to be 0 or 1, which is defined by equation (6). pqrs This condition of can be defined by equation (7). Therefore, it is desirable to establish equation (8) for calculating the sum for all r and s.
[0073]
[0074]
[0075]
[0076] (Objective Function)
[0077] Next, the objective function will be described. For example, in order to improve the stability of the vehicle transport ship, the formulation unit 22 preferably lowers the position of the center of gravity of the vehicle transport ship as much as possible. Here, the difference between the load capacity of the deck on the upper half of the vehicle transport ship and the load capacity of the deck on the lower half is defined as the value G indicating the degree of instability of the vehicle transport ship. i That is, for example, in the first embodiment, G i For example, the definition of "G i = (load capacity of the area above deck 4) - (load capacity of the area below deck 3)". Therefore, when the vehicle transport ship leaves each port, G i It can be defined by equation (9). For example, G1 in equation (9) corresponds to the degree of instability when the vehicle transport ship leaves the loading port A. Therefore, the objective function can be expressed by equation (10) using G iThe average value of .
[0078]
[0079]
[0080] As described above, the formulation unit 22 generates constraint 1, constraint 2, constraint 3, and an objective function, and outputs them to the optimization unit 23 .
[0081] The optimization unit 23 is a processing unit that optimizes the instability degree of the vehicle transport ship under constraint conditions 1, constraint conditions 2, and constraint conditions 3. Specifically, for example, the optimization unit 23 calculates a solution that minimizes the instability degree (reduces the instability degree as much as possible) by solving the constrained optimization problem.
[0082] For example, the optimization unit 23 generates the energy function E in formula (11), which is the sum of the above-mentioned constraint conditions 1, constraint conditions 2, constraint conditions 3 and the objective function using preset arbitrary constants (β, γ, σ, ε). Then, the optimization unit 23 inputs the energy function E into an optimization device such as an Ising machine or an annealing computer, and runs the optimization device to calculate the value that minimizes the value of the objective function.
[0083]
[0084]
[0085] The output calculation unit 24 is a processing unit that calculates the optimal vehicle arrangement. Specifically, for example, the output calculation unit 24 uses the solution result obtained by the optimization unit 23 having the optimization device to determine the optimal vehicle arrangement that minimizes the degree of instability of the vehicle transport ship. Then, the output calculation unit 24 displays the determined vehicle arrangement on the display unit 12 or stores the determined vehicle arrangement in the storage unit 13.
[0086] Figure 7 is a diagram used to describe the solution performed by the optimization device and the calculation of the vehicle arrangement represented by the solution. Figure 7 As shown, the output calculation unit 24 defines a binary variable z n , and z n With x ijkm Associated, for example, z1 = x 1111 and z2 = x 1112 For example, when the optimization device uses z n = 0, (000...000) as the initial solution to perform the calculation, the obtained Figure 7 The solution represented by equation (12) (z1 = 1, z2 = 0, ..., z 13=1).
[0087] Here, when z n = 1, there is a vehicle. Therefore, the output calculation unit 24 extracts the provided z n =1, and obtain the corresponding i, j, k, and m. In this way, the output calculation unit 24 can calculate the loading port i, the unloading port j, and the cell m in the block k where the vehicle exists. For example, if the number of intersections where the loading port is defined as i and the unloading port is defined as j written in the vehicle loading and unloading table 15 is defined as c and the number of loading ports is M, the output calculation unit 24 can express c as "c=i+M(j-1)". Therefore, the output calculation unit 24 can indicate that the vehicle c exists in the cell m in the block k.
[0088] By executing the above-described processing, the output calculation unit 24 calculates the loading port i, the unloading port j, and the cell m in the block k where the vehicle exists, and associates the calculated result with the schematic diagram, thereby determining the vehicle arrangement. Figure 8 is a diagram showing the optimized vehicle layout. Figure 8 As shown, the output calculation unit 24 generates a schematic diagram indicating the arrangement of each of the vehicles ( 1 ) to ( 9 ) shown in the vehicle loading and unloading table 15 , and displays the generated schematic diagram on the display unit 12 . Figure 8 The example of the schematic diagram indicates that, for example, 800 vehicles (1) loaded at loading port A and to be unloaded at unloading port D are placed on deck 6, and 1,300 vehicles (3) loaded at loading port C and to be unloaded at unloading port D are placed across deck 6, deck 5 and deck 3.
[0089] [Processing flow]
[0090] Fig. 9 is a flow chart showing the process of optimization processing. Fig. 9 As shown, when the process starts (S101: Yes), the receiving unit 21 of the information processing device 10 acquires the ship information 14 (S102) and the vehicle loading and unloading table 15 (S103).
[0091] Subsequently, the formulation unit 22 generates various constraints (S104) and an objective function (S105) based on the ship information 14 and the vehicle loading and unloading table 15. Then, the optimization unit 23 generates an energy function obtained by adding the various constraints and the objective function, inputs the generated energy function to the optimization device, and obtains a solution result through the optimization device (S106).
[0092] Thereafter, the output calculation unit 24 calculates the vehicle arrangement represented by the result (solution) solved by the optimization device (S107), and outputs the vehicle arrangement obtained by the calculation (S108).
[0093] [Effect]
[0094] As described above, the information processing device 10 regards the problem as a mathematical optimization problem, determines the constraints and the objective function according to the input data, and uses the optimization device to solve the problem. Therefore, even when the vehicle is loaded and unloaded multiple times, the information processing device 10 can shorten the time taken for optimization. For example, the information processing device 10 can obtain a vehicle arrangement that satisfies the constraints by solving a problem that would take 30 minutes to solve manually in only about 5 minutes using the optimization device.
[0095] [Second embodiment]
[0096] As described above, the information processing device 10 can use a schematic diagram of a moving body such as a vehicle transport ship, a vehicle loading and unloading table, etc. to automatically generate a constraint condition of a mathematical optimization problem that is difficult to set in a general manner when considering various conditions. In addition, the information processing device 10 can generate a complex vehicle arrangement by automatically solving a mathematical optimization problem in consideration of the constraint condition, and output the complex vehicle arrangement to a predetermined device or display, etc., output the complex vehicle arrangement as a proposal for vehicle arrangement, or provide the complex vehicle arrangement to an operating company of a vehicle transport ship. Therefore, compared with ordinary techniques such as techniques that are not capable of automatically creating constraint conditions, the information processing device 10 can achieve a reduction in the time required to create the constraint condition, and can shorten the time required to optimize the cargo arrangement.
[0097] Meanwhile, the first embodiment describes an example in which unloading (carrying out) of a vehicle is performed after loading (carrying in) of the vehicle is completed. However, there may be a case where there is an unloading port before the last loading port. In the second embodiment, a method for using the free space more efficiently in such a case will be described. Note that the functional configuration of the information processing device 10 according to the second embodiment is the same as that of the information processing device 10 of the first embodiment.
[0098] Fig.10 is a diagram for describing a vehicle loading and unloading table 15 according to the second embodiment, and Fig.11 2 is a diagram for describing the order of the ports of call according to the second embodiment. Note that the order of the ports of call may also be included in the vehicle loading and unloading table 15.
[0099] like Fig.10As shown, in the vehicle loading and unloading table 15, the loading ports for loading vehicles, the unloading ports for unloading vehicles, and the corresponding numbers of vehicles to be loaded and to be unloaded are associated with each other. In addition, the vehicle loading and unloading table 15 defines the loading ports as Port A, Port B, and Port D, and the unloading ports as Port C, Port E, and Port F. In addition, Fig.11 The port table in defines that the vehicle transport vessel makes port calls in the order of "Port A, Port B, Port C, Port D, Port E, and Port F". Taking these definitions into account, 2200 (=500+600+1100) vehicles will be loaded at Port A, and 2000 (=300+100+1600) vehicles will be loaded at Port B. Thereafter, 800 (=500+300) vehicles will be unloaded at Port C, 300 (=200+100) vehicles will be loaded at Port D, then 900 (600+100+200) vehicles will be unloaded at Port E, and 2800 (1100+1600+100) vehicles will be unloaded at Port F.
[0100] Under such conditions, if the method according to the first embodiment is used, there is a possibility that the vehicle loaded after the vehicle is unloaded at the port C will not be placed in the free space generated by the unloading at the port C.
[0101] In view of this, in the second embodiment, constraint 1 and constraint 3 are generated according to the subdivision of the conditions, and optimization is performed. This configuration achieves further efficient use of free space, thereby achieving efficient vehicle transportation. Specifically, in the second embodiment, constraint 1 is formulated separately before switching from the unloading port to the loading port and after switching from the unloading port to the loading port, and constraint 3 is formulated for checking the load capacity of each cell at the moment when the load capacity in the ship is at the maximum value. Note that constraint 2 is the same as constraint 2 of the first embodiment.
[0102] (Formulation of constraint 1)
[0103] First, the constraint 1 indicating that there is no other cargo on the route from the cargo to be loaded and unloaded to the entrance when loading (carrying in) and unloading (carrying out) cargo will be described. Regarding the constraint 1, the formulation unit 22 separately formulates the constraint 1 at the first moment when the load capacity of the cargo is at the minimum value, that is, before switching from the unloading port to the loading port and after switching from the unloading port to the loading port. That is, for example, the formulation unit 22 adds a condition for switching the route to the entrance before the first moment when the load capacity of the cargo is at the minimum value and after the first moment when the load capacity of the cargo is at the minimum value to the constraint 1 of the first embodiment.
[0104] Specifically, the formulation unit 22 determines the demarcation point of the sequence of the ports of call as switching. Fig.12 1 is a diagram for describing how to specify a switch for describing a formulation of constraint condition 1 according to the second embodiment. Fig.12 As shown, the formulation unit 22 determines the point where the number of vehicles placed in the ship changes (the vehicles are unloaded) between Port B and Port D among the loading ports as the switching candidate A, and determines the point where the number of vehicles placed in the ship changes (the vehicles are loaded) between Port C and Port E among the unloading ports as the switching candidate B. Then, the formulation unit 22 specifies the point between Port C and Port D (the point common in both cases) as the switching point.
[0105] In other words, for example, the formulation unit 22 specifies the boundary between unloading and loading, at which the load capacity in the ship is minimized, as a switching point in the order of port calls.
[0106] Then, the formulation unit 22 separately creates the constraint condition 1. Specifically, Fig.12 As shown, the formulation unit 22 sets the index of the port C located before switching from the unloading port to the loading port to "j, q = b", and sets the index of the port D located after switching from the unloading port to the loading port to "i, p = a". Note that the load capacity of the ship at the switching point is minimized.
[0107] Here, at the time of loading the vehicle at Port D, unloading of the vehicle has been completed at Port C, and therefore, there is no need to consider Area N. Furthermore, the time of unloading the vehicle at Port C is before the time of loading the vehicle at Port D, and therefore, there is no need to consider Area M.
[0108] That is to say, Fig.12 As shown, when the vehicle x in the area N corresponding to "q≤b" in the vehicle loading and unloading table 15 pqrs When unloaded, the vehicles in the region M corresponding to “i ≥ a” have not been loaded after the port D, and therefore, the formulation unit 22 determines that there is no obstacle. Therefore, the formulation unit 22 defines the vehicle y blocking the passage by equation (12): pq .
[0109]
[0110] (When q≤b)
[0111] In addition, when the loading vehicle loads and unloads the vehicle x in the area M corresponding to "p ≥ a" in the table 15 pqrsWhen there is no vehicle in area N corresponding to "j ≤ b" before port C, and thus, the formulation unit 22 determines that there is no obstacle. Therefore, the formulation unit 22 defines the vehicle y obstructing the passage by Equation (13). pq .
[0112]
[0113] (When p ≥ a)
[0114] In addition, the formulation unit 22 defines the vehicle y obstructing the passage when loading and unloading the vehicle x corresponding to the area "p < a, q > b" other than area N and area M in the vehicle loading and unloading table 15 by Equation (14) similar to Equation (1) described above in the first embodiment. pqrs When pq .
[0115]
[0116] (When p b)
[0117] Therefore, since in all cases represented by Equation (12), Equation (13), and Equation (14), when x pqrs = 1, the formulation unit 22 needs to set y pq = 0, thus the formulation unit 22 defines to minimize B in Equation (15).
[0118]
[0119] (Generalization of Constraint 1)
[0120] Next, the formulation unit 22 formulates the constraint 1 represented by Equation (15) as a general expression. Fig.13 is a diagram for describing the general expression of Constraint 1 according to the second embodiment. Fig.13 shows the order of the calling ports associated with the loading or unloading process. That is,[[]] Fig.13 the example of defines that the ship makes port calls in the order from port A to port J, and loading is performed at port A.
[0121] Under such conditions, the formulation unit 22 designates the boundary between port D and port E and the boundary between port H and port I as the moments before and after switching from the unloading port to the loading port. Here, since the load capacity on the ship has a minimum value at these boundaries, port D and port H are called the pre-minimum ports, and port E and port I are called the post-minimum ports.
[0122] Under this condition, the formulating unit 22 defines equation (15) as equation (16), and y in equation (16) pq It can be generalized using function J1(p) and function M1(p) by equation (17). Here, function J1(p) is a function that returns the index q+1 of the nearest previous minimum port among the ports before the loading port p, and returns 1 if there is no previous minimum port before the loading port p. In addition, function M1(p) is a function that returns the index p-1 of the nearest next minimum port among the ports after the unloading port q, and returns M if there is no next minimum port after the unloading port q.
[0123]
[0124]
[0125] (Formulation of constraint 3)
[0126] Next, the constraint condition 3 indicating that the cargo is placed in each of the plurality of sections without exceeding the preset load capacity will be described. With respect to the constraint condition 3 in the first embodiment, the formulation unit 22 adds a condition for checking the load capacity of each cell at the second moment when the load capacity in the ship is at the maximum value.
[0127] Fig.14 is a diagram for describing the formulation of constraint condition 3 according to the second embodiment. Fig.14 The format and information of Fig.10 and Fig.11 The format and information of the ship are the same as those of the ship, and thus a detailed description of the format and information will be omitted. Constraint 3 defines that it is impossible to load a vehicle having a load capacity equal to or greater than the maximum load capacity in one cell. Accordingly, the formulation unit 22 determines that it is sufficient to check whether there is a vehicle having a load capacity equal to or greater than the maximum load capacity in each cell at the moment when the load capacity in the ship is at a maximum value, and specifies the moment of switching from loading to unloading.
[0128] That is, for example, the formulation unit 22 specifies the point when the ship leaves Port B and Port D as the time. Therefore, the formulation unit 22 determines that during the switching from Port B to Port C Fig.14 Whether the load capacity of area Q in the load capacity exceeds the upper limit of the load capacity, and determine during the switch from port D to port E Fig.14 Whether the load capacity of the region P in exceeds the upper limit of the load capacity. Therefore, equation (18) is established. Therefore, it is sufficient to minimize equation (19) for obtaining the sum of all r and s.
[0129] and
[0130]
[0131] (Generalization of constraint 3)
[0132] Next, the formulation unit 22 formulates the constraint condition 3 represented by equation (19) as a general expression. Specifically, in the case where there are multiple unloading ports before the last loading port, the formulation unit 22 uses Fig.15 To define a general expression. Fig.15 is a diagram for describing a general expression of constraint condition 3 according to the second embodiment. Fig.15 The order of ports of call shown in Fig.13 The same, therefore a detailed description of these ports of call will be omitted.
[0133] like Fig.15 As shown, the formulation unit 22 divides the sequence of port calls into regions (paths) separated by the smallest port intervals. Fig.15 In the formula (16), port A, port B, port C, and port D belong to path 1, port E, port F, port G, and port H belong to path 2, and port I and port J belong to path 3. Each path has a maximum port (port B, port F, and port I). Then, since it is sufficient to minimize D in the above formula (19) in each path, the formulation unit 22 can generalize the constraint condition 3 in formula (20) by using formula (16).
[0134]
[0135] Note that "n" in formula (20) indicates the index of the path, and "P" indicates the set of paths. In addition, function M3(n) is a function that returns the index p-1 of the last minimum port in path n+1, and returns M when path n+1 does not exist. In addition, function J3(n) is a function that returns the index q+1 of the first minimum port in path n-1, and returns 1 when path n-1 does not exist.
[0136] (How to address concurrent ports)
[0137] Meanwhile, in addition to the case where the unloading port and the loading port are different, there may be a port that performs both loading and unloading (concurrent port). The constraints in such a case will be considered. Fig.16 is a graph for describing constraint 1 when there are concurrent ports, and Fig.17 is a graph used to describe constraint 3 when there are concurrent ports. Note that Fig.16 and Fig.17An example is shown in which loading and unloading takes place at port C.
[0138] like Fig.16 As shown, the formulation unit 22 takes into account that the concurrent port C is divided into two ports, and the unloading port C that performs the unloading process D and the loading port C where the loading process is performed L is continuous. Therefore, the unloading port C D is the previous minimum port and load port C L is the last minimum port. Therefore, when the vehicle x in the area Y corresponding to "q≤b" in the vehicle loading and unloading table 15 pqrs When unloaded, the vehicle in the area X corresponding to "i ≥ a" has not been loaded, and therefore, there is no obstacle. In addition, when the vehicle x in the area X corresponding to "p ≥ a" in the vehicle loading and unloading table 15 is pqrs When loaded, there is no vehicle in the area Y corresponding to "j≤b", and therefore, there is no obstacle.
[0139] In this way, the formulation unit 22 divides the concurrent port C into the first minimum port C with respect to the constraint condition 1. D and after the minimum port C L , and therefore, even when there is a concurrent port C, the formulation unit 22 can achieve formulation and generalization through equations similar to equations (16) and (17) described above.
[0140] In addition, if Fig.17 As shown, the time when the load capacity on the ship is at the maximum is the time when the ship leaves Port B and Port D which are ports before unloading. Therefore, it is necessary to control loading so that the load capacity of vehicles in area Y does not exceed the upper limit when the ship leaves Port B, and so that the load capacity of vehicles in area D does not exceed the upper limit when the ship leaves Port D.
[0141] In this way, even when there is a concurrent port C, the formulation unit 22 divides the concurrent port C into the former minimum ports C with respect to the constraint condition 3. D and after the minimum port C L , so that the moment when the load capacity is at the maximum value can be subdivided. Therefore, the formulation unit 22 can implement formulation and generalization through a formula similar to the formula (20) described above.
[0142] (optimization)
[0143] As described above, the information processing device 10 inputs the energy function E represented by equation (21) into an optimization device such as an Ising machine or an annealing computer, where equations (16) and (17) are used for constraint 1 and equation (20) is used for constraint 3, and runs the optimization device. Note that "β, γ, σ" are arbitrary constants set in advance, and constraint 2 is the same as constraint 2 represented by equation (5) of the first embodiment.
[0144]
[0145] Although the objective function is omitted here, the information processing device 10 can generate an energy function similar to equation (11) using the objective function of equation (10) described in the first embodiment, and calculate a value that minimizes the value of the objective function by performing optimization.
[0146] (Processing flow)
[0147] Fig.18 : is a flowchart showing the flow of the optimization process according to the second embodiment. Fig.18 As shown, when the process starts (S201: Yes), the receiving unit 21 of the information processing device 10 acquires the ship information 14 (S202) and the vehicle loading and unloading table 15 (S203).
[0148] Subsequently, the formulation unit 22 determines the demarcation points of the order of the ports of call at each time described above based on the ship information 14 and the vehicle loading and unloading table 15 (S204), subdivides the conditions based on the demarcation points of the order of the ports of call (S205), and generates each constraint condition according to the subdivided conditions (S206). Similarly, the formulation unit 22 generates an objective function (S207).
[0149] Then, the optimization unit 23 generates an energy function obtained by adding each constraint condition and the objective function, inputs the generated energy function to the optimization device, and obtains the solution result of the optimization device (S208). Thereafter, the output calculation unit 24 calculates the vehicle arrangement represented by the solution result (solution) of the optimization device (S209), and outputs the vehicle arrangement obtained by the calculation (S210).
[0150] (Effect)
[0151] As described above, even if there is an unloading port before the last loading port, or there are concurrent ports, the information processing device 10 can generate constraint 1 and constraint 3 by subdividing the conditions, thereby determining a vehicle arrangement that can effectively use the free space after unloading.
[0152] [Third Embodiment]
[0153] Although the embodiments have been described above, the embodiments may be implemented in various different modes in addition to the modes described above.
[0154] [Numerical value, etc.]
[0155] The number of vehicles, the number of ports, the diagram showing the configuration inside the vehicle transport ship, etc. used in the above embodiment are only examples and can be changed arbitrarily. In addition, although the above embodiment describes an example of dividing each block on the vehicle transport ship into a plurality of cells, the embodiment is not limited thereto, and one block may include only one cell. In addition, as an optimization device for performing optimization, an external device connected to the information processing device 10 using various buses, networks, etc. may also be used, or a processor built into the information processing device 10 may also be used. Note that various known methods may be applicable as methods for optimizing the energy function and the objective function. In addition, the center of gravity is an example of an indicator of the degree of instability.
[0156] [goods]
[0157] The above embodiment has been described above taking a vehicle transport ship as an example. However, the embodiment is not limited thereto, and various cargoes and spaces such as a multi-storey warehouse, a surface parking space, and a cargo storage device may be used as a target. Note that the cargo is not limited to vehicles, and various delivery cargoes such as cardboard boxes may be handled in the same manner. Note that examples of the degree of instability of the target space include not only the center of gravity of a moving body carrying cargo, but also the appropriate position and center of gravity of a warehouse where cargo is placed, etc.
[0158] [system]
[0159] Unless otherwise specified, pieces of information including processing procedures, control procedures, designated names, various types of data, and parameters described above or shown in the drawings may be optionally changed.
[0160] In addition, the individual constituent elements of each device shown in the drawings are conceptual in function and do not necessarily have to be physically configured as shown in the drawings. In other words, the specified form of allocation and integration of each device is not limited to the form shown in the drawings. That is, for example, all or part of the devices can be configured by functionally or physically allocating and integrating in optional units according to various types of loads, usage conditions, etc. Note that the receiving unit 21 is an example of a receiving unit, the formulating unit 22 is an example of an acquisition unit, a specifying unit, and a generating unit, and the optimizing unit 23 and the output calculating unit 24 are examples of a determining unit.
[0161] Furthermore, all or any part of the respective processing functions performed in each device may be realized by a central processing unit (CPU) and a program analyzed and executed by the CPU, or may be realized as hardware by wired logic.
[0162] [hardware]
[0163] Next, a hardware configuration example of the information processing device 10 will be described. Fig.19 is a diagram used to describe an example of a hardware configuration. Fig.19 As shown, the information processing device 10 includes a communication device 10a, a hard disk drive (HDD) 10b, a memory 10c, and a processor 10d. Fig.19 The respective units shown in are interconnected by a bus or the like.
[0164] The communication device 10a is a network interface card or the like, and communicates with another server. The HDD 10b stores Figure 2 Shows the functions of the program and database (DB).
[0165] The processor 10d reads and executes data from the HDD 10b and the like. Figure 2 Each processing unit shown processes a program similar to the processing of the program, and the program read is developed in the memory 10c, thereby activating the execution of the reference Figure 2 The processing of each function described in the above description is performed. For example, the processing performs a function similar to that of each processing unit included in the information processing device 10. Specifically, for example, the processor 10d reads a program having the same function as that of the receiving unit 21, the formulation unit 22, the optimization unit 23, the output calculation unit 24, etc. from the HDD 10b, etc. Then, the processor 10d performs processing that performs a processing similar to that of the receiving unit 21, the formulation unit 22, the optimization unit 23, the output calculation unit 24, etc.
[0166] As described above, the information processing device 10 operates as an information processing device that performs the optimization method by reading and executing the program. In addition, the information processing device 10 can also realize functions similar to those of the above-described embodiments by reading the program described above from the recording medium by a medium reading device and executing the read program described above. Note that the programs cited in other embodiments are not limited to being executed by the information processing device 10. For example, the embodiments can be similarly applied to a case where another computer or server executes the program or a case where such a computer and server execute the program in collaboration.
[0167] [Citation List]
[0168] [Patent Document]
[0169] Japanese Patent Publication No. 10-305929.
[0170] Japanese Patent Publication No. 2005-112609.
[0171] Japanese Patent Publication No. 1-127526.
[0172] Reference Mark List
[0173] 10 Information processing device
[0174] 11 Communication unit
[0175] 12 Display unit
[0176] 13 Storage Unit
[0177] 14 Vessel Information
[0178] 15 Vehicle loading and unloading table
[0179] 20 Control unit
[0180] 21 Receiving unit
[0181] 22 Formula Units
[0182] 23 Optimization Unit
[0183] 24 Output calculation unit
Claims
1. An information processing device, comprising: a receiving unit that receives space information about a target space where cargo is placed, loading and unloading information, and load information, the space information being divided into a plurality of sections and defining routes between the plurality of sections and routes from each of the plurality of sections to an entrance, the loading and unloading information in which the number of cargoes to be loaded for each of a plurality of loading positions and the number of cargoes to be unloaded for each of a plurality of unloading positions are associated with each other, and the load information being related to a maximum load capacity of each of the plurality of sections in the space information; a generating unit, the generating unit generating a first constraint condition, a second constraint condition, and a third constraint condition based on the space information, the loading and unloading information, and the load information, the first constraint condition indicating that other cargoes do not exist on a route from the cargoes to be loaded or to be unloaded to the entrance during loading or unloading of the cargoes, the second constraint condition indicating the number of cargoes to be loaded and the number of cargoes to be unloaded, and the third constraint condition indicating a maximum load capacity of each of the plurality of sections; as well as A determination unit is configured to determine a cargo arrangement that optimizes the instability degree of the target space based on the first constraint condition, the second constraint condition, and the third constraint condition.
2. The information processing device according to claim 1, wherein: The generating unit generates an objective function for calculating the degree of instability of the target space, and The determination unit determines a cargo arrangement that minimizes the degree of instability of the target space using an energy function using the first constraint condition, the second constraint condition, the third constraint condition, and the objective function.
3. The information processing device according to claim 2, wherein: The determination unit inputs the energy function into an Ising machine, and determines a cargo arrangement that minimizes a degree of instability of the target space using a solution result obtained by the Ising machine.
4. The information processing device according to claim 1, further comprising: an acquisition unit configured to acquire the loading and unloading information indicating positions through which a moving body carrying cargo passes and a sequence of the positions, the positions including positions into which cargo is loaded and positions from which cargo is unloaded; as well as a designation unit configured to designate a first time at which the load capacity of the cargo in the target space is at a minimum value and a second time at which the load capacity of the cargo in the target space is at a maximum value by using the loading and unloading information and the space information, Wherein, the generating unit is configured to: generating the first constraint condition according to the spatial information, the first constraint condition indicating that other cargo does not exist on a route from the cargo to be loaded or unloaded to the entrance during loading or unloading of cargo, the first constraint condition defining a condition for changing the route before the first moment and after the first moment, generating the second constraint condition according to the loading and unloading information, the second constraint condition indicating the number of goods to be loaded and the number of goods to be unloaded; generating the third constraint condition according to the load information, the third constraint condition indicating a maximum load capacity of each of the plurality of sections, the third constraint condition defining that the maximum load capacity is satisfied at the second moment when the load capacity of the cargo in the target space is at a maximum value, and The determining unit is configured to determine a cargo arrangement that optimizes the instability degree of the target space by using the first constraint condition, the second constraint condition, and the third constraint condition.
5. The information processing device according to claim 4, wherein: The designation unit is configured to, in a case where a plurality of positions where cargo is unloaded exist before the position where cargo is loaded in the loading and unloading information, designate a boundary where switching from the position where cargo is unloaded to the position where cargo is loaded occurs, and group the order of positions before and after the boundary, and The generating unit is configured to generate the first constraint condition, the second constraint condition, and the third constraint condition for each group of the sequence of positions.
6. The information processing device according to claim 4 or 5, wherein: The designation unit is configured to: designate a concurrent position, the concurrent position being a position where both loading and unloading of cargo are performed according to the loading and unloading information, and The generating unit is configured to: dividing the concurrent location into two locations, the two locations being a first location into which cargo is loaded and a second location from which cargo is unloaded, the two locations being consecutive, and The first constraint condition, the second constraint condition, and the third constraint condition are generated by replacing the concurrent position with the two positions in the order of the two positions.
7. A computer-implemented optimization method, the method comprising: receiving space information related to a target space where cargo is placed, loading and unloading information, and load information, the space information being divided into a plurality of sections and defining routes between the plurality of sections and routes from each of the plurality of sections to an entrance, the loading and unloading information in which the number of cargo to be loaded for each of a plurality of loading positions and the number of cargo to be unloaded for each of a plurality of unloading positions are associated with each other, and the load information being related to a maximum load capacity of each of the plurality of sections in the space information; generating a first constraint, a second constraint, and a third constraint based on the space information, the loading and unloading information, and the load information, the first constraint indicating that other cargoes do not exist on a route from the cargoes to be loaded or unloaded to the entrance during loading or unloading of the cargoes, the second constraint indicating the number of cargoes to be loaded and the number of cargoes to be unloaded, and the third constraint indicating a maximum load capacity of each of the plurality of sections; as well as A cargo arrangement that optimizes the instability level of the target space is determined based on the first constraint, the second constraint, and the third constraint.
8. The optimization method according to claim 7, acquiring the loading and unloading information indicating positions and the order of the positions, the positions being positions through which a moving body carrying cargo passes, the positions including positions into which cargo is loaded and positions from which cargo is unloaded; and specifying a first time and a second time by using the loading and unloading information and the space information, the first time being a time when the load capacity of the cargo in the target space is at a minimum value, and the second time being a time when the load capacity of the cargo in the target space is at a maximum value, in, the generating of the first constraint condition is configured to generate the first constraint condition according to the spatial information, the first constraint condition indicating that other cargo does not exist on a route from the cargo to be loaded or unloaded to the entrance during loading or unloading of cargo, the first constraint condition defining a condition for changing the route before the first moment and after the first moment, wherein the generating of the second constraint condition is configured to generate the second constraint condition according to the loading and unloading information, the second constraint condition indicating the number of goods to be loaded and the number of goods to be unloaded, wherein the generating of the third constraint condition is configured to generate the third constraint condition according to the load information, the third constraint condition indicating a maximum load capacity of each of the plurality of parts, the third constraint condition defining that the maximum load capacity is satisfied at the second moment when the load capacity of the cargo in the target space is at a maximum value, and The determining is configured to determine a cargo arrangement that optimizes the instability level of the target space by using the first constraint, the second constraint, and the third constraint.
9. A non-transitory computer-readable storage medium for storing an optimization program for causing a processor to perform the following process, the process comprising: receiving space information related to a target space where cargo is placed, loading and unloading information, and load information, the space information being divided into a plurality of sections and defining routes between the plurality of sections and routes from each of the plurality of sections to an entrance, the loading and unloading information in which the number of cargo to be loaded for each of a plurality of loading positions and the number of cargo to be unloaded for each of a plurality of unloading positions are associated with each other, and the load information being related to a maximum load capacity of each of the plurality of sections in the space information; generating a first constraint, a second constraint, and a third constraint based on the space information, the loading and unloading information, and the load information, the first constraint indicating that other cargoes do not exist on a route from the cargoes to be loaded or unloaded to the entrance during loading or unloading of the cargoes, the second constraint indicating the number of cargoes to be loaded and the number of cargoes to be unloaded, and the third constraint indicating a maximum load capacity of each of the plurality of sections; as well as A cargo arrangement that optimizes the instability level of the target space is determined based on the first constraint, the second constraint, and the third constraint.
10. The non-transitory computer readable storage medium of claim 9, the processing further comprising: acquiring the loading and unloading information indicating positions and the order of the positions, the positions being positions through which the moving body carrying the cargo passes, the positions including positions into which the cargo is loaded and positions from which the cargo is unloaded; as well as specifying a first time and a second time by using the loading and unloading information and the space information, the first time being a time when the load capacity of the cargo in the target space is at a minimum value, and the second time being a time when the load capacity of the cargo in the target space is at a maximum value, wherein the generating of the first constraint condition is configured to generate the first constraint condition according to the spatial information, the first constraint condition indicating that other cargo does not exist on a route from the cargo to be loaded or unloaded to the entrance during loading or unloading of cargo, the first constraint condition defining a condition for changing the route before the first moment and after the first moment, wherein the generating of the second constraint condition is configured to generate the second constraint condition according to the loading and unloading information, the second constraint condition indicating the number of goods to be loaded and the number of goods to be unloaded, wherein the generating of the third constraint condition is configured to generate the third constraint condition according to the load information, the third constraint condition indicating a maximum load capacity of each of the plurality of parts, the third constraint condition defining that the maximum load capacity is satisfied at the second moment when the load capacity of the cargo in the target space is at a maximum value, and The determining is configured to determine a cargo arrangement that optimizes the instability level of the target space by using the first constraint, the second constraint, and the third constraint.
