Container placement program, information processing device, and container placement method

JP2026098489APending Publication Date: 2026-06-17FUJITSU LTD

Patent Information

Authority / Receiving Office
JP · JP
Patent Type
Applications
Current Assignee / Owner
FUJITSU LTD
Filing Date
2024-12-05
Publication Date
2026-06-17

Smart Images

  • Figure 2026098489000001_ABST
    Figure 2026098489000001_ABST
Patent Text Reader

Abstract

This allows us to propose container arrangements that minimize the increase in the number of loading and unloading cycles. [Solution] The processing unit 12 obtains the predicted departure time for each of the multiple containers placed in the storage area (predetermined region) 14, and an estimated value of the standard deviation of the error between the predicted departure time and the actual departure time. Using the predicted departure time and the estimated value, the processing unit 12 determines a weighting coefficient for each pair of containers that represents the probability of swapping the departure order. The processing unit 12 formulates a linear programming problem concerning the arrangement of the multiple containers in the storage area 14 using an objective function in which the decision variable is weighted by the weighting coefficient. The decision variable indicates whether the first container, which is included in the pair of containers, is stacked on top of the second container, whose predicted departure time is later than that of the first container. The processing unit 12 performs a solution process for the linear programming problem according to the objective function and outputs the arrangement information of the multiple containers in the storage area 14, which is the result of the solution process.
Need to check novelty before this filing date? Find Prior Art

Claims

1. The estimated departure time for each of the multiple containers placed in a predetermined area, and the estimated standard deviation of the error between the estimated departure time and the actual departure time are obtained. Using the predicted loading time and the estimated value, a weight coefficient is determined for each pair of containers included in the plurality of containers, representing the probability of the loading order being altered from the predicted loading order represented by the predicted loading time. Using an objective function weighted by the weight coefficients, the linear programming problem concerning the arrangement of the plurality of containers in the predetermined region is formulated, where the determination variable indicating whether the first container is stacked on top of the second container among the first container and the second container whose predicted loading time is later than that of the first container included in the container pair is weighted by the weight coefficients. The linear programming problem is solved according to the aforementioned objective function. The result of the above solving process is outputting the arrangement information of the plurality of containers in the predetermined region. A container deployment program that causes a computer to execute a process.

2. The container placement program according to claim 1, wherein the estimated value is calculated based on the history of the actual time of removal.

3. The container placement program according to claim 2, wherein the probability density distribution of the measured time of removal is represented by a log-normal distribution based on the history.

4. The aforementioned linear programming problem concerns the arrangement of the multiple containers when they are placed in a predetermined area, which is a temporary storage area, before they are unloaded by multiple vehicles after being transported from a ship. The aforementioned objective function represents the number of load changes during unloading. The container placement program according to claim 1.

5. The container placement program according to claim 4, wherein the rearrangement of the unloading order is caused by a delay in the arrival time of any of the plurality of vehicles to the predetermined area.

6. The estimated departure time for each of the multiple containers placed in a predetermined area, and the estimated standard deviation of the error between the estimated departure time and the actual departure time are obtained. Using the predicted loading time and the estimated value, a weight coefficient is determined for each pair of containers included in the plurality of containers, representing the probability of the loading order being altered from the predicted loading order represented by the predicted loading time. Using an objective function weighted by the weight coefficients, the linear programming problem concerning the arrangement of the plurality of containers is formulated by determining whether the first container, among the first container and the second container whose predicted departure time is later than that of the first container, is stacked on top of the second container. The linear programming problem is solved according to the aforementioned objective function. The result of the above solving process is outputting the arrangement information of the plurality of containers in the predetermined region. Processing unit, An information processing device having

7. The estimated departure time for each of the multiple containers placed in a predetermined area, and the estimated standard deviation of the error between the estimated departure time and the actual departure time are obtained. Using the predicted loading time and the estimated value, a weight coefficient is determined for each pair of containers included in the plurality of containers, representing the probability of the loading order being altered from the predicted loading order represented by the predicted loading time. Using an objective function weighted by the weight coefficients, the linear programming problem concerning the arrangement of the plurality of containers is formulated by determining whether the first container, among the first container and the second container whose predicted departure time is later than that of the first container, is stacked on top of the second container. The linear programming problem is solved according to the aforementioned objective function. The result of the above solving process is outputting the arrangement information of the plurality of containers in the predetermined region. A method of deploying containers in which a computer executes processing.