Patent ID: 11893528
Assignee: HITACHI, LTD.
Field: IT methods for management (Electrical engineering)
Classification: CPC G  Y | IPC G

Claim 8:
9. A logistics optimization method by a logistics operation optimization apparatus that perform optimization regarding a sequential order of articles for performing operation in regard to the articles in each operation process to sequentially distribute the articles, the logistics optimization method comprising:
by the logistics operation optimization apparatus, a step of computing, on a basis of an overall optimum proposal list in which optimum turns of the articles over entire logistics operation are lined up and of an every-process optimum sequential order list in which optimum turns of the articles in each operation process are lined up, for each operation process, a deviation degree between the turns of the articles in an overall optimum proposal indicated by the overall optimum proposal list and the turns the articles in each operation process;
by the logistics operation optimization apparatus, a step of comparing turns of the articles of overall optimum plans indicated by an overall optimum plan list in the past and turns of the articles indicated by an operation history with each other to search, on a basis of a default information list table in which combinations of turns of the articles, which turns are different at a fixed ratio from each other, are stored, for any combination of turns that are defaulted with respect to the overall optimum plans indicated by the overall optimum plan list in the past to obtain a number of combinations of the turns that are defaulted;
by the logistics operation optimization apparatus, a step of obtaining estimation operation time and an error of the estimation operation time from the overall optimum proposal indicated by the overall optimum proposal list;
by the logistics operation optimization apparatus, a step of obtaining an evaluation value of the overall optimum proposal according to an evaluation expression, which is based on the deviation degree computed by a deviation degree computing section between the turns of the articles in the overall optimum proposal indicated by the overall optimum proposal list and the turns of the articles in each operation process, the number of combinations of the turns that are defaulted and obtained by a default sequential order search section, and the estimation operation time and the error of the estimation operation obtained by an operation time estimation section;
by the logistics operation optimization apparatus, a step of determining an overall optimum plan on a basis of the evaluation value of the overall optimum proposal obtained by an overall optimum plan determination section, and creating the overall optimum plan list in which optimum turns of the articles over the entire logistics operation are lined up, wherein
an evaluation expression with which the overall optimum plan determination section obtains the evaluation value of the overall optimum proposal is a weighted linear sum of the deviation degree between the turns of the articles in the overall optimum proposal list and the turns of the articles in each operation process, the number of combinations of the turns that are defaulted, and the estimation operation time, and the error of the estimation operation time, and
by the logistics operation optimization apparatus, in response to the determination of the overall optimum plan and creation of the overall optimum plan list, a step of delivering a command of a handled article sequential order to a robot to perform the overall optimum plan indicated by the overall optimum plan list.