Information processing device, optimization method, and non-transitory computer-readable storage medium for storing optimization program

Patent metadata

Field	Value
Publication number	US-11468405-B2
Application number	US-202117244999-A
Country	US
Kind code	B2
Filing date	Apr 30, 2021
Priority date	Aug 17, 2020
Publication date	Oct 11, 2022
Grant date	Oct 11, 2022

Abstract

An optimization method includes: receiving space information regarding sections, a route between sections, and a route from each section to an entrance for a target space; setting a coefficient used to change a maximum load capacity of a cargo to be arranged in each region included in each section; generating a first constraint condition indicating that another cargo does not exist on the route from a cargo to be loaded or to be unloaded to the entrance at the time when the cargo is loaded and unloaded, a second constraint condition indicating the number of cargoes to be loaded and the number of cargoes to be unloaded calculated using the coefficient, and a third constraint condition indicating the maximum load capacity calculated using the coefficient; and determining cargo arrangement in the target space based on the first and second and third constraint conditions.

First claim

What is claimed is:

1. An information processing device coupled to an optimization device, the information processing device comprising:
a memory configured to store, for each of a plurality of places, space information and demand information, the space information being information defining a target space in which a cargo is placed at that place, the target space defined in the space information including a plurality of sections obtained by dividing the target space, the demand information being information including an amount corresponding to a number of cargos to be loaded to the target space at that place, wherein the space information includes, for each of the plurality of sections, a route from that section to an entrance of the target space, and a maximum load capacity; and
a processor circuit coupled to the memory, the processor circuit being configured to perform processing, the processing including:
obtaining, for each of the plurality of places, the space information from the memory;
executing, for each of the plurality of places, a setting processing configured to set, for each of the plurality of sections indicated by the space information for that place, a coefficient in response that the amount included in the demand information for that place is less than the maximum load capacity included in the space information for that section, the coefficient being obtained by dividing that amount by that maximum load capacity;
executing, for each of the plurality of places, a generation processing configured to
generate, for each of the plurality of sections indicated by the space information for that place by using the space information for that section and the demand information for that place, a first constraint condition requiring that another cargo does not exist on a route to be used for loading or unloading a cargo from or to the entrance of the target space, a second constraint condition that indicates the number of cargoes to be loaded and the number of cargoes to be unloaded which are calculated using the coefficient set for that section, and a third constraint condition that indicates an adjusted maximum load capacity by multiplying the coefficient set for that section by the maximum load capacity included in the space information for that section;
generate an energy function by using the first constraint condition, the second constraint condition, the third constraint condition, and an objective function for calculating a degree of instability of the target space; and
execute a determination processing configured to
input the generated enemy function to the optimization device to cause the optimization device to search a solution of the energy function that minimizes the degree of instability of the target space under the first constraint condition, the second constraint condition, and the third constraint condition, and
determine, based on the solution searched by the optimization device, a cargo arrangement in the target space.

2. The information processing device according to claim 1 , wherein the setting processing is configured to calculate the number of the plurality of regions using the number of plurality of sections and the number of cargoes to be arranged and sets the coefficient for each of the calculated region.

3. The information processing device according to claim 1 , wherein the setting processing is configured to calculate, for each of the plurality of regions, the coefficient using the maximum load capacity of the region and the number of cargoes to be arranged in the region based on the space information.

4. The information processing device according to claim 1 , wherein the determination processing is configured to input an energy function based on a sum of the first constraint condition, the second constraint condition, and the third constraint condition to an Ising machine and determines the arrangement using a solution result by the Ising machine.

5. An optimization method implemented by a computer coupled to an optimization device, the method comprising:
receiving, for each of a plurality of places, space information from a memory configured to store, for each of the plurality of places, the space information and demand information, the space information being information defining a target space in which a cargo is placed at that place, the target space defined in the space information including a plurality of sections obtained by dividing the target space, the demand information being information including an amount corresponding to a number of cargos to be loaded to the target space at that place, wherein the space information includes, for each of the plurality of sections, a route from that section to an entrance of the target space, and a maximum load capacity;
executing, for each of the plurality of places, a setting processing configured to set, for each of the plurality of sections indicated by the space information for that place, a coefficient in response that the amount included in the demand information for that place is less than the maximum load capacity included in the space information for that section, the coefficient being obtained by dividing that amount by that maximum load capacity;
executing, for each of the plurality of places, a generation processing configured to
generate, for each of the plurality of sections indicated by the space information for that place by using the space information for that section and the demand information for that place, a first constraint condition requiring that another cargo does not exist on a route to be used for loading or unloading a cargo from or to the entrance of the target space, a second constraint condition that indicates the number of cargoes to be loaded and the number of cargoes to be unloaded which are calculated using the coefficient set for that section, and a third constraint condition that indicates an adjusted maximum load capacity by multiplying the coefficient set for that section by the maximum load capacity included in the space information for that section; and
generate an enemy function by using the first constraint condition, the second constraint condition, the third constraint condition, and an objective function for calculating a degree of instability of the target space; and
execute a determination processing configured to
input the generated energy function to the optimization device to cause the optimization device to search a solution of the energy function that minimizes the degree of instability of the target space under the first constraint condition, the second constraint condition, and the third constraint condition, and
determine, based on the solution searched by the optimization device, a cargo arrangement in the target space.

6. A non-transitory computer-readable storage medium for storing an optimization program which causes a processor coupled to an optimization device to perform processing, the processing comprising:
receiving, for each of a plurality of places, space information from a memory configured to store, for each of the plurality of places, the space information and demand information, the space information being information defining a target space in which a cargo is placed at that place, the target space defined in the space information including a plurality of sections obtained by dividing the target space, the demand information being information including an amount corresponding to a number of cargos to be loaded to the target space at that place, wherein the space information includes, for each of the plurality of sections, a route from that section to an entrance of the target space, and a maximum load capacity;
executing, for each of the plurality of places, a setting processing configured to set, for each of the plurality of sections

Assignees

• Fujitsu Ltd

Inventors

• Yamaguchi Hideshi

Classifications

• B65G1/1373

  for fulfilling orders in warehouses · CPC title

• G06Q10/087 Primary

  Inventory or stock management, e.g. order filling, procurement or balancing against orders · CPC title

• G06F17/18

  for evaluating statistical data {, e.g. average values, frequency distributions, probability functions, regression analysis (forecasting specially adapted for a specific administrative, business or logistic context G06Q10/04)} · CPC title

• B65G1/04 Primary

  mechanical · CPC title

• B65G67/603

  using devices specially adapted for articles · CPC title