# US 2024/0403736 A1 · Scheduling optimization method and scheduling optimization system

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2024/0403736 A1
- Document ID: US20240403736A1
- Status: Published application
- Kind: A1
- Application number: 18/804,235
- Filed: 2024-08-14
- Published: 2024-12-05
- Earliest claimed: 2022-04-05
- Assignees: Mitsubishi Electric Corporation
- Applicants: Mitsubishi Electric Corporation
- Inventors: Nobuyuki YOSHIKAWA
- Web page: https://patentgrep.com/patent/US20240403736A1

## CPC

- G06Q 10/04: Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem" (market predictions or forecasting for commercial activities G06Q30/0202)
- G06N 99/00: Subject matter not provided for in other groups of this subclass
- G06Q 10/06: Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q 50/40: Business processes related to the transportation industry (shipping G06Q10/083)
- G08G 5/00: Traffic control systems for aircraft
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G08G: TRAFFIC CONTROL SYSTEMS (guiding railway traffic, ensuring the safety of railway traffic B61L; arrangement of road signs or traffic signals E01F9/00; radar or analogous systems, sonar systems, lidar systems specially adapted for traffic control G01S13/91, G01S15/88, G01S17/88; {radar or analogous systems, sonar systems, lidar systems specially adapted for anti-collision purposes G01S13/93, G01S15/93, G01S17/93})

## Abstract

A scheduling optimization method includes: a step of generating an ising model for an occupation system to which at least one occupation subject and at least one occupation object belong, and for which an optimal solution of an order that the at least one occupation subject occupies the at least one occupation object, and of an occupation time; a step of calculating a plurality of solution candidates for the optimal solution by solving the ising model by an annealing method, each of the solution candidates indicating the order; a step of selecting a solution candidate that has a relatively small cost function and occurs relatively frequently among the plurality of solution candidates; and a step of assigning a time during which the at least one occupation subject occupies the at least one occupation object on the basis of the order indicated by the selected solution candidate.

## Claims

### Claim 1

A scheduling optimization method comprising:
generating an ising model for an occupation system to which at least one occupation subject and at least one occupation object belong, and for which an optimal solution of an order that the at least one occupation subject occupies the at least one occupation object, and of an occupation time during which the at least one occupation subject occupies the at least one occupation object is to be calculated;
calculating a plurality of solution candidates for the optimal solution by solving the ising model by an annealing method, each of the solution candidates indicating the order that the at least one occupation subject occupies the at least one occupation object;
selecting a solution candidate that has a relatively small cost function and occurs relatively frequently among the plurality of solution candidates; and
assigning a time during which the at least one occupation subject occupies the at least one occupation object on a basis of the order indicated by the selected solution candidate and indicating that the at least one occupation subject occupies the at least one occupation object.

### Claim 2

A scheduling optimization system comprising:
a processer to execute a program; and
a memory to store the program which, when executed by the processor, performs, processes of,
generating an ising model for an occupation system to which at least one occupation subject and at least one occupation object belong, and for which an optimal solution of an order that the at least one occupation subject occupies the at least one occupation object, and of an occupation time during which the at least one occupation subject occupies the at least one occupation object is to be calculated;
calculating a plurality of solution candidates for the optimal solution by solving the ising model by an annealing method, each of the solution candidates indicating the order that the at least one occupation subject occupies the at least one occupation object;
selecting a solution candidate that has a relatively small cost function and occurs relatively frequently among the plurality of solution candidates; and
assigning a time during which the at least one occupation subject occupies the at least one occupation object on a basis of the order indicated by the selected solution candidate and indicating that the at least one occupation subject occupies the at least one occupation object.
