-
1.
公开(公告)号:US20190228360A1
公开(公告)日:2019-07-25
申请号:US16333713
申请日:2017-11-28
Applicant: Hitachi, Ltd.
Inventor: Yoshiki AOYAMA , Yuichi KOBAYASHI
IPC: G06Q10/06 , G06Q50/04 , G05B19/418 , G06N20/00
Abstract: To make it possible to plan and provide a new production schedule reflecting characteristics or tendencies appearing in production schedules planned in the past. A schedule planning section calculates, on the basis of history information concerning production schedules of products planned in the past, a schedule pattern including production order of the products while considering constraint conditions in producing the products, rearranges the production order of the products according to the calculated schedule pattern, and creates a plurality of schedule candidates concerning a production schedule of the products. A schedule evaluating section evaluates the plurality of schedule candidates on the basis of evaluation indicators corresponding to the constraint conditions, and selects a best production schedule out of the plurality of schedule candidates.
-
2.
公开(公告)号:US20240241700A1
公开(公告)日:2024-07-18
申请号:US18467383
申请日:2023-09-14
Applicant: Hitachi, Ltd.
Inventor: Fumito TAGASHIRA , Yui OGURA , Yuichi KOBAYASHI , Keitaro UEHARA
IPC: G06F8/35 , G06Q10/0631
CPC classification number: G06F8/35 , G06Q10/06311
Abstract: A schedule optimization system capable of easily solving a complicated optimization problem without using past assets is developed.
A storage unit 120 includes an optimization problem description table indicating an optimization problem for drafting a schedule in a schedule optimization system 300, a scheduled data table indicating a value of a constant being a fixed element in the optimization problem, and a template as a pattern of a source code of the schedule optimization system. A processing unit 130 generates the source code of the schedule optimization system by inserting information based on the optimization problem description table and the scheduled data table into the template.-
3.
公开(公告)号:US20230298054A1
公开(公告)日:2023-09-21
申请号:US18023271
申请日:2022-02-22
Applicant: Hitachi, Ltd.
Inventor: Yui KAZAWA , Yuichi KOBAYASHI , Kaori NAKAGAWA
IPC: G06Q30/0202 , G06Q50/30
CPC classification number: G06Q30/0202 , G06Q50/30
Abstract: It is determined whether it is necessary to change departure time of a connection destination vehicle at a connection station based on transfer failure location information and a searching result of an alternative route searching unit.
-
公开(公告)号:US20220414582A1
公开(公告)日:2022-12-29
申请号:US17679673
申请日:2022-02-24
Applicant: Hitachi, Ltd.
Inventor: Yumiko ISHIDO , Yuichi KOBAYASHI , Yuko YAMASHITA
Abstract: A schedule change apparatus includes a change model creation section, a schedule creation section, a schedule change evaluation indicator creation section, a production simulator, and a control section. The change model creation section creates a change model estimating a portion of the schedule to be changed. The schedule creation section uses the schedule change model to generate proposed schedule changes and generate a proposed alternative schedule. The schedule change evaluation section generates a schedule change evaluation indicator indicating a best value for a proposed schedule change. The production simulator implements simulation with a simulation condition changed on a basis of schedule execution status information and equipment operation status information for the day and calculates values of the schedule change evaluation indicator for the proposed alternative schedule candidate group on a basis of the schedule change evaluation indicator already learned. The control section outputs a proposed schedule change.
-
公开(公告)号:US20180121850A1
公开(公告)日:2018-05-03
申请号:US15795521
申请日:2017-10-27
Applicant: HITACHI, LTD.
Inventor: Jian ZHENG , Yasuharu NAMBA , Yuichi KOBAYASHI , Yoshiyasu TAKAHASHI
IPC: G06Q10/06 , G06Q10/08 , G05B19/418
Abstract: The system includes an ideal plan creation unit configured to create an ideal plan of the respective processes in a first process order based on a process knowledge information being a relationship between the product and an implementation time of the respective processes and on a predetermined indicator, a plan candidate planning unit configured to create a plurality of the plan candidates in the respective processes in an order opposite to the first process order based on a limitation condition being a limitation or condition which imposes on the respective processes, a plan candidate selection unit configured to calculate similarity between the ideal plan and each of the plurality of the plan candidates and to select the plan candidate having a high similarity to the ideal plan as an implementation plan, and a learning unit configured to reflect the selected implementation plan on the process knowledge information.
-
6.
公开(公告)号:US20240308558A1
公开(公告)日:2024-09-19
申请号:US18578872
申请日:2022-04-28
Applicant: Hitachi, Ltd.
Inventor: Yuko YAMASHITA , Yuichi KOBAYASHI , Tsuyoshi MINAKAWA , Yasuhide MORI , Yumiko ISHIDO , Kazumasa TOKUHASHI , Atsushi TOYAMA , Hirotake YOSHIDA
IPC: B61L27/16
CPC classification number: B61L27/16
Abstract: An operation plan change assistance system includes a determination model generation unit configured to generate an operation plan change determination model that receives information about a train operation content before a certain point in time and information about a change in an operation plan executed before the point in time and outputs information about a change in operation plan to be executed next; and an operation plan change proposal creation unit configured to input information about a train operation content before a point in time designated by a user and information about a change in an operation plan executed before the designated point in time, create change candidates that are candidates for each change in an operation plan to be executed in stages after the designated point in time, specify a change candidate that satisfies a predetermined condition, and create the specified change candidate as an operation plan change proposal.
-
公开(公告)号:US20240028982A1
公开(公告)日:2024-01-25
申请号:US18117561
申请日:2023-03-06
Applicant: Hitachi, Ltd.
Inventor: Yoshiyasu TAKAHASHI , Yuichi KOBAYASHI , Keitaro UEHARA , Tsukasa EIRAKU
IPC: G06Q10/0631 , G06Q50/04
CPC classification number: G06Q10/0631 , G06Q50/04
Abstract: Allowable constraint relaxation is achieved even when it is difficult to identify a constraint satisfaction solution. A production plan making device 1 that makes a plan related to a task has a production history DB2 that stores history information in the task, a past history reading unit 13 that reads the history information, a constraint relaxation unit 12 that identifies a deviation degree indicating a position relationship related to the constraint boundary of a constraint in making the plan of a history represented by the history information, calculates a weight indicating the degree of the constraint for constraint relaxation according to the deviation degree, and relaxes the weight when the plan cannot be made by an optimization process based on the weight, and a mathematical optimization unit 11 that makes the plan by the optimization process on the basis of the relaxed weight.
-
公开(公告)号:US20230027009A1
公开(公告)日:2023-01-26
申请号:US17671961
申请日:2022-02-15
Applicant: Hitachi, Ltd.
Inventor: Kaori NAKAGAWA , Yuichi KOBAYASHI , Yui KAZAWA , Tatsuhiro SATO
Abstract: A logistics operation optimization apparatus computes, for each operation process, a deviation degree between turns of articles of overall optimum proposals indicated by an overall optimum proposal list and turns of the articles in each operation process, estimation operation time, and an error of the estimation operation time from the overall optimum proposal, and the number of combinations of turns that are defaulted from an overall optimum plan indicated by an overall optimum plan list in the past, evaluates the overall optimum proposal according to an evaluation expression of a weighted linear sum including the deviation degree, the estimation operation time, and the error of the estimation operation time from the overall optimum proposal, and the number of combinations of the turns that are defaulted, and creates an overall optimum plan list of the best overall optimum plan, from the overall optimum proposals indicated by the overall optimum proposal list.
-
公开(公告)号:US20230281532A1
公开(公告)日:2023-09-07
申请号:US18017699
申请日:2021-08-25
Applicant: Hitachi, Ltd.
Inventor: Tsuyoshi MINAKAWA , Yuki MAEKAWA , Ryota UEMATSU , Yuko YAMASHITA , Yumiko ISHIDO , Yuichi KOBAYASHI
IPC: G06Q10/0631 , G06Q50/30
CPC classification number: G06Q10/06315 , G06Q50/30
Abstract: Provided is a service plan change assistance apparatus (110) including: a storage apparatus (13) that stores a decision model in which a service status of each of a delayed train and a to-be-delayed train to be delayed due to the delayed train and train service plan change content for recovering a delay of the to-be-delayed train are associated with each other, in association with a station at which the to-be-delayed train is delayed due to the delayed train; and an arithmetic apparatus (11) that estimates a future train service status based on a train service plan and a train service record before a current time, identifies, from the estimated train service status, the station at which the to-be-delayed train to be delayed due to the delayed train is standing, inputs information on the estimated train service status to a decision model associated with the identified station to create a service plan change proposal that includes information indicating train service change content for recovering the delay of the to-be-delayed train, and outputs the created service plan change proposal.
-
公开(公告)号:US20230033597A1
公开(公告)日:2023-02-02
申请号:US17789156
申请日:2020-12-29
Applicant: Hitachi, Ltd.
Inventor: Yumiko ISHIDO , Yuichi KOBAYASHI
IPC: G06Q10/06
Abstract: Provided is a technology of facilitating coordination of an overall plan by making it possible to draft an operation plan that is easily acceptable to other planning subjects.
A system includes a draft plan creating device that creates a plurality of draft plans satisfying a given constraint condition, an evaluation device that evaluates each of the draft plans with a first algorithm and generates a self-evaluation value, an evaluation estimating device that evaluates each of the draft plans with a second algorithm different from the first algorithm and generates an estimated cooperation partner's evaluation value, and a cooperation partner's rate computing device that computes a rate indicating the weight of the estimated cooperation partner's evaluation value. In the system, the plurality of draft plans are evaluated on the basis of an objective function that is calculated from the self-evaluation value, the estimated cooperation partner's evaluation value, and the rate.
-
-
-
-
-
-
-
-
-