Information processing device and information processing method

The information processing device and method effectively address the challenge of optimizing large-scale combinatorial problems by prioritizing important objective functions and iteratively updating conditions, ensuring efficient and optimal solutions for makespan and other indicators in resource-constrained scheduling.

WO2024236857A1PCT designated stage expired Publication Date: 2024-11-21HITACHI SOFTWARE ENG
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
PCT/JP2024/000612
Authority / Receiving Office
WO · WO
Patent Type
Applications
Current Assignee / Owner
Priority Date
2023-05-17
Filing Date
2024-01-12
Publication Date
2024-11-21

AI Technical Summary

Technical Problem

Existing methods for solving large-scale combinatorial optimization problems, particularly resource-constrained scheduling, struggle to strictly minimize the most important objective function (makespan) while considering other objective functions, often requiring numerous iterations without guaranteeing optimality and failing to account for additional optimization indicators.

Method used

An information processing device and method that prioritize important objective functions in a two-stage optimization process, reducing the number of variables through provisional solutions and iteratively updating conditions to optimize both critical and secondary objective functions, utilizing a combination of mixed integer programming and Ising machines for efficient problem-solving.

Benefits of technology

This approach allows for the strict optimization of important indicators and consideration of other optimization indicators in large-scale combinatorial problems, ensuring efficient and optimal solutions by minimizing makespan while leveling workload and reducing the number of variables, thereby improving resource allocation and scheduling efficiency.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure JP2024000612_21112024_PF_FP_ABST
    Figure JP2024000612_21112024_PF_FP_ABST
Patent Text Reader

Abstract

Provided are an information processing device and an information processing method that are capable of solving a large-scale combinational optimization problem comprising a plurality of objective functions. This information processing device for processing a combinational optimization problem comprising a plurality of objective function terms using a computer is characterized by: in a first stage, performing processing as a combinational optimization unit to execute an optimization process on objective function terms having a high level of importance among the plurality of objective function terms, and as a variable definition unit to refer to a tentative solution obtained by the combinational optimization unit and reduce the number of variables to be defined; and in a second stage, performing processing as a combinational optimization unit to execute an optimization process on objective function terms taking into account objective function terms having a relatively low level of importance, and as an optimization result determination unit to determine whether or not to terminate the optimization process on the basis of a specified determination criterion. The information processing device is also characterized by, when an optimization process is to be re-executed, updating conditions for defining variables, and repeatedly executing the optimization process in the second stage.
Need to check novelty before this filing date? Find Prior Art

Description

Information processing device and information processing method

[0001] The present invention relates to an information processing device and an information processing method.

[0002] In combinatorial optimization problems, it is sometimes necessary to find an optimal solution under multiple objective functions. In such multi-objective optimization, the importance of each objective function varies, and they can be classified into particularly important objective functions and objective functions with relatively low importance. Therefore, it is important to reliably optimize the particularly important objective functions while also reflecting the influence of objective functions with relatively low importance. However, this is difficult to achieve with large-scale combinatorial optimization problems.

[0003] For example, in resource-constrained scheduling problems, minimizing makespan (task duration) is often set as the most important objective function, but additional objective functions such as reducing the resources used and leveling the amount of resources used may also be added. In such cases, optimization that strictly minimizes makespan while also taking into account other objective functions is required. In particular, when the target problem is large-scale and has an objective function other than makespan that is expressed as a quadratic equation, the large scale makes it difficult to optimize using a linear programming solver by transforming the quadratic equation into a linear equation, and therefore it is desirable to utilize a method suitable for optimizing quadratic equations, such as an Ising machine.

[0004] Regarding the processing of the above-mentioned combinatorial optimization problem, Patent Document 1 states, "We provide a method for finding an approximate solution to a minimum makespan solution with high accuracy in a short time for a resource-constrained scheduling problem." and "An optimization device that iteratively finds a constraint-violating solution, a constraint-satisfying solution, and an approximate solution includes: an optimization processing unit that finds an approximate solution by a metaheuristic method by specifying an optimization target end time between a first end time, which is the end time of a previous constraint-violating solution, and a second end time, which is the end time of a previous constraint-satisfying solution; an optimization result determination unit that determines whether the approximate solution violates or satisfies the constraint; and a solution update unit that, based on the determination result by the optimization result determination unit, updates the first end time with the end time of the approximate solution if the approximate solution violates the constraint, and updates the second end time with the end time of the approximate solution if the approximate solution satisfies the constraint; and is characterized in that the approximate solution is iteratively found while updating the first end time and the second end time."

[0005] Furthermore, Non-Patent Document 1 describes the solution of a job shop scheduling problem using an Ising machine.

[0006] Japanese Patent Application Laid-Open No. 2021-190019

[0007] D. Shimada, T. Shibuya and T. Shibasaki, A Decomposition Method for Makespan Minimization in Job-Shop Scheduling Problem Using Ising Machine, 2021 IEEE 8th International Conference on Industrial Engineering and Applications (ICIEA), Chengdu, China, 2021, pp. 307-314

[0008] In Patent Document 1, a metaheuristic method such as simulated annealing using an Ising machine is used to minimize the makespan by repeatedly finding constraint-violating solutions and constraint-satisfying solutions while changing the upper limit of the makespan in a resource-constrained scheduling problem.

[0009] However, with this method, the number of iterations required to obtain the minimum makespan is unknown and may be extremely large in some cases. Also, because it uses a metaheuristic method, there is no guarantee that the makespan of the obtained solution is strictly minimum.

[0010] In addition, in Non-Patent Document 1, in resource-constrained scheduling, instead of the makespan, the sum of the end times of each task is minimized using an Ising machine to search for an approximate solution to the makespan minimization problem.

[0011] However, even if the total sum of task completion times is the same, the makespan can differ if one task is completed much later than the others, and if all tasks are completed at roughly the same time. This means that this method does not necessarily minimize the makespan.

[0012] As described above, with an Ising machine, there is a problem in strictly minimizing the makespan, which is the most important factor, and the optimization of other additional objective functions cannot be taken into consideration.

[0013] The present invention has been made in light of the above background, and aims to provide an information processing device and an information processing method that are capable of solving large-scale combinatorial optimization problems consisting of multiple objective functions, not limited to the resource-constrained scheduling problem exemplified above.

[0014] In order to solve the above-mentioned problems, the present invention provides "an information processing device that uses a computer to process a combinatorial optimization problem consisting of a plurality of objective function terms, the information processing device comprising: a first stage comprising a combinatorial optimization unit that performs optimization processing for objective function terms with high importance among the plurality of objective function terms; and a variable definition unit that reduces the number of variables to be defined by referring to a tentative solution obtained by the combinatorial optimization unit; a second stage comprising a combinatorial optimization unit that performs optimization processing for objective function terms that also take into account objective function terms with relatively low importance; and an optimization result determination unit that determines whether to terminate the optimization processing based on a specified determination criterion; and when the optimization processing is to be re-executed, the information processing device updates the conditions for defining the variables and repeatedly executes the optimization processing of the second stage."

[0015] Furthermore, the present invention is defined as "an information processing method for processing a combinatorial optimization problem consisting of a plurality of objective function terms using a computer, the information processing method comprising the steps of: in a first step, executing an optimization process for objective function terms with high importance among the plurality of objective function terms; and performing a process of reducing the number of variables to be defined by referring to a tentative solution obtained by the optimization process; in a second step, executing an optimization process for objective function terms taking into account objective function terms with relatively low importance; and performing a process of determining whether to terminate the optimization process based on a specified determination criterion; and if the optimization process is to be re-executed, updating the conditions for defining the variables and repeatedly executing the optimization process of the second step."

[0016] According to the present invention, even for large-scale combinatorial optimization problems, it is possible to precisely optimize important optimization indices while also taking other optimization indices into account. Problems, configurations, and effects other than those described above will become clear from the following description of the preferred embodiment of the invention.

[0017] 1 is a block diagram showing an example of a schematic hardware configuration of an information processing device. 2 is a block diagram showing an example of a main functional configuration of an information processing device. 3 is a flowchart showing an example of the procedure of an optimization method. 4 is a flowchart showing an example of task order specification. 5 is a diagram showing an example of a table showing the number of work days for each task for each company. 6 is a flowchart showing an example of the procedure of an optimization method. 7 is a diagram showing an example of a work plan created using a rule base. 8 is a diagram showing an example of a work plan calculated by a mixed integer programming solver under the condition that a plan is created with the minimum total number of days. 9 is a diagram showing an example of a work plan calculated by an Ising machine under the condition that a plan is created with the minimum total number of days. 10 is a diagram showing an example of a work plan calculated by a mixed integer programming solver under the condition that a maximum allowable total number of days is 23 days. 11 is a diagram showing an example of a work plan calculated by a mixed integer programming solver under the condition that a maximum allowable total number of days is 24 days. 12 is a diagram showing an example of a work plan calculated by an Ising machine under the condition that a maximum allowable total number of days is 24 days. 13 is a diagram showing an example of a work plan calculated by an Ising machine under the condition that a maximum allowable total number of days is 26 days.

[0018] Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In the following description, identical or similar components will be designated by common reference numerals, and duplicate descriptions will be omitted. Furthermore, when there are multiple elements having the same or similar functions, different subscripts will be used for the same reference numerals. Furthermore, when there is no need to distinguish between multiple elements, the subscripts will be omitted.

[0019] The optimization problem solving process according to the present invention can be applied to many situations, but in the following example, we consider a resource-constrained scheduling problem in which the resources, such as personnel, companies, and machines responsible for each task are determined, and the resource allocation and start time for each task are determined. As an example, we will assume that there are constraints on the order in which each task is performed.

[0020] In such scheduling problems, the most important objective may be to minimize the time when the entire work is completed. However, in the actual work planning process, optimization that takes into account various indicators in addition to minimizing the work completion time is required, such as reducing the number of people involved in the work as much as possible, having the same person perform work in succession as much as possible, and leveling the workload among people.

[0021] Therefore, as an embodiment of the present invention, an example of creating a schedule that places emphasis on the overall work completion time while also taking other items into consideration will be shown. The embodiment described in this disclosure is not limited to cases where minimizing the work completion time is emphasized, but can also be applied to cases where minimizing total costs, maximizing profits, etc. are emphasized while also optimizing other items of relatively low importance.

[0022] Fig. 1 shows an example of the hardware configuration of an information processing device that executes work plan optimization. The information processing device 100 shown in Fig. 1 includes a processor 101, a main memory device 102, an auxiliary memory device 103, an input device 104, an output device 105, a communication device 106, one or more combinatorial optimization devices 107, and a system bus 108 that communicatively connects these devices.

[0023] The information processing device 100 may be realized, for example, by using virtual information processing resources such as a cloud server provided in part or in whole by a cloud system. The information processing device 100 may also be realized, for example, by a plurality of information processing devices that are communicably connected and operate in cooperation with each other.

[0024] The processor 101 is configured using, for example, a CPU (Central Processing Unit) and an MPU (Micro Processing Unit). The main memory device 102 is a device that stores programs and data, and is, for example, a ROM (Read Only Memory) (SRAM (Static Random Access Memory), NVRAM (Non Volatile RAM), Mask ROM (Mask Read Only Memory), PROM (Programmable ROM), etc.), a RAM (Random Access Memory) (DRAM (Dynamic Random Access Memory), etc.), etc. The auxiliary storage device 103 is a hard disk drive, a flash memory, a solid state drive (SSD), an optical storage device (a compact disc (CD), a digital versatile disc (DVD), etc.), etc. The programs and data stored in the auxiliary storage device 103 are read into the main storage device 102 as needed.

[0025] The input device 104 is a user interface that accepts information input from a user, and is, for example, a keyboard, a mouse, a card reader, a touch panel, etc. The output device 105 is a user interface that provides information to a user, and is, for example, a display device (LCD (Liquid Crystal Display), a graphics card, etc.) that visualizes various information, an audio output device (speaker), a printer, etc. The communication device 106 is a communication interface that communicates with other devices, and is, for example, a NIC (Network Interface Card), a wireless communication module, a USB (Universal Serial Interface) module, a serial communication module, etc.

[0026] The combinatorial optimization device 107 is a device that solves an input combinatorial optimization problem. The combinatorial optimization device 107 may be dedicated hardware designed specifically to execute a metaheuristic algorithm such as simulated annealing, or dedicated hardware that searches for a solution to an optimization problem expressed as an Ising model. However, the general-purpose computing processor 101 may function as a combinatorial optimization device to solve the combinatorial optimization problem without providing a dedicated combinatorial optimization device 107.

[0027] The combinatorial optimization device 107 may take the form of an expansion card attached to the information processing device 10, such as a GPU (Graphics Processing Unit). The combinatorial optimization device 107 may be configured with hardware such as a CMOS (Complementary Metal Oxide Semiconductor) circuit, an FPGA (Field Programmable Gate Array), or an ASIC (Application Specific Integrated Circuit). The combinatorial optimization device 107 includes a control device, a storage device, an interface for connecting to the system bus 5, and the like, and transmits and receives commands and information to and from the processor 101 via the system bus 108. The combinatorial optimization device 107 may be communicably connected to other combinatorial optimization devices 107 via a communication line, for example, and may operate in cooperation with the other combinatorial optimization devices 107 .

[0028] Fig. 2 shows the main functional configuration (software configuration) of the information processing device 100. The information processing device 100 shown in Fig. 2 includes a problem data acquisition unit 111, a formulation generation unit 112, a variable definition unit 113, an objective function setting unit 114, a combinatorial optimization unit 115, an optimization result determination unit 116, a solution output unit 117, and a storage unit DB.

[0029] These functions are realized by the processor 101 reading and executing a program stored in the main memory device 102, or by hardware included in the combinatorial optimization device 107. In addition to the above functions, the information processing device 100 may also include other functions such as an operating system, a file system, a device driver, and a DBMS (Database Management System).

[0030] The storage unit DB includes a problem data storage unit DB1, a formulation data storage unit DB2, a variable data storage unit DB3, a provisional solution storage unit DB4, and a calculation program storage unit DB5, which are configured in the main storage unit 102 or the auxiliary storage unit 103.

[0031] The problem data acquisition unit 111 stores information input from outside to set a resource-constrained scheduling problem as problem data D1 in the problem data storage unit DB1 of the storage unit DB. The information input from outside (problem data D1) includes the order relationship of each task, information on each resource for each task, information on the required time for each task, items to be set as objective functions for optimization, information on the importance of each objective function term, etc. The information input from outside is performed, for example, by a user via a user interface (input device, output device, communication device, etc.).

[0032] The formulation generation unit 112 mathematically expresses (formulates) the resource-constrained scheduling problem as a combinatorial optimization problem from the problem data information D1 stored in the problem data storage unit DB1, and stores the formulated data D2 in the formulated data storage unit DB2 of the storage unit DB. The variable definition unit 113 refers to the problem data information D1 stored in the problem data storage unit DB1 and the formulated data D2 stored in the formulated data storage unit DB2, defines variables for solving the resource-constrained scheduling problem, and stores the defined variables as variable data D3 in the variable data storage unit DB3.

[0033] The objective function setting unit 114 determines the objective function to be optimized from the problem data information D1 regarding the importance of each objective function stored in the problem data storage unit DB1, and transmits the objective function selected as the optimization target to the combinatorial optimization unit 115.

[0034] The combinatorial optimization unit 115 uses the variable data D3 stored in the variable data storage unit DB3 to solve the formulation data D2 (resource-constrained scheduling problem) described in the formulation data storage unit DB2. The combinatorial optimization unit 115 executes the solution of the resource-constrained scheduling problem using the combinatorial optimization device 107 and the processor 101. The combinatorial optimization unit 115 receives as input the objective function acquired from the objective function unit 114, the mathematical expression of the resource-constrained scheduling problem D2 stored in the formulation data storage unit DB2, and the variables created by the variable definition unit 113, and outputs the solution of the resource-constrained scheduling problem D2 to the optimization result determination unit 116 and the solution output unit 117. The optimization result determination unit 116 receives as input the solution obtained by the combinatorial optimization unit 115 and determines whether to continue the solution search.

[0035] When the combinatorial optimization unit 115 finishes finding a solution, the solution output unit 117 reads out the solution obtained by the combinatorial optimization unit 115 and the constant values ​​and the like used in the combinatorial optimization unit 115, and stores them as a tentative solution D4 in a tentative solution storage unit DB4 of the storage unit DB. In addition, the solution output unit 117 may output the result read out from the combinatorial optimization unit 115 to the output device 105 or the communication device 106.

[0036] The calculation program storage unit DB5 is a program that the variable definition unit 113 executes when defining variables while referring to the problem data storage unit DB1, and a program that the combinatorial optimization unit 115 executes when solving a resource-constrained scheduling problem using the combinatorial optimization device 107 or the processor 101.

[0037] Fig. 3 is a flowchart showing an example of the procedure of the optimization process according to the present invention. The optimization method shown in Fig. 3 is preferably executed by the functional units shown in Fig. 2 using the information processing device 100 configured with the hardware shown in Fig. 1. Hereinafter, the process executed by the information processing device 100 shown in Fig. 3 will be referred to as optimization process S200. Note that, in the following, the letter "S" before the reference numeral indicates a processing step. The optimization process S200 is started, for example, by receiving an instruction from a user via the input device 104.

[0038] The optimization process S200 will be described below with reference to FIG.

[0039] First, in processing step S201, the objective function setting unit 114 refers to the information on the importance of each optimization objective (problem data information D1) stored in the problem data storage unit DB1, and sets only items with particularly high importance as objective functions, and the combinatorial optimization unit 115 executes the optimization process.

[0040] Taking a resource-constrained scheduling problem as an example, possible optimization objectives include minimizing task completion times, minimizing costs, minimizing the number of workers, leveling out the workload of each worker, and having the same worker perform tasks as consecutively as possible. Each optimization objective may be input by the user via a user interface. The user may also input the importance of each optimization objective.

[0041] The importance of each item to be optimized can be specified, for example, by numerically weighting each objective function term or by specifying the order of priority. Alternatively, the user may directly specify the objective function terms to be optimized in processing step S201 and the subsequent processing step S203. In the optimization in processing step S201, the combinatorial optimization unit 115 may be used multiple times to repeatedly perform optimization calculations. After the optimization in processing step S201 is completed, the obtained solution is stored in the provisional solution storage unit DB4 of the storage unit DB.

[0042] In processing step S202, after processing in processing step S201, the solution obtained in processing step S201 is defined as a tentative solution D4, and the variable definition unit 113 redefines the variable D3 using information about the tentative solution D4. In the variable definition in processing step S202, the information obtained from the tentative solution D4 is used to avoid defining unnecessary variables. In other words, in processing step S202, pruning of the variable D3 used in processing step S201 is performed. This pruning of the variable D3 means excluding calculations related to variables whose values ​​can be analytically determined in advance from subsequent processing in order to calculate a feasible solution that satisfies all constraints and to maintain the objective function value already optimized in processing step S201. This reduces the number of variables to be calculated in subsequent optimization processing.

[0043] In processing step S203, optimization is performed using the variables pruned in processing step S202, including items that were not considered as optimization objectives in processing step S201. The optimization in processing step S203 does not necessarily include the items that were optimization objectives in processing step S201. In processing step S203, similar to processing step S201, the objective function setting unit 114 determines the objective function to be optimized by referencing problem data information D1 related to the optimization objective stored in the problem data storage unit DB1, and the combinatorial optimization unit 115 performs the optimization. The user may input in advance whether to set the items that were optimization objectives in processing step S201 as optimization objectives in processing step S203, and store this information in the problem data storage unit DB1. After the optimization in processing step S203 is completed, the solution obtained in processing step S203 is stored as a provisional solution D4 in the provisional solution storage unit DB4 of the storage unit DB.

[0044] In processing step S204, the optimization result determination unit 116 inputs the solution obtained in processing step S203 and determines whether to terminate the optimization processing S200 or to repeat a part of the optimization processing S200. The conditions for determining whether to terminate the solution search in processing step S204 may be, for example, whether the objective function value has improved from the previous solution, whether a preset time limit has been reached, etc.

[0045] Processing step S205 is executed when it is not determined in processing step S204 that the solution has been completed. In processing step S205, the conditions for the variable pruning process executed in processing step S202 are updated. However, the conditions do not necessarily have to be updated, and the conditions used in the previous processing step S202 may remain unchanged.

[0046] Here, the pruning conditions refer to conditions regarding how the information in the tentative solution D4 is used, such as how to reflect the task completion times found in the tentative solution D4 and whether to reflect the resource allocation for each task in the variable definitions. After processing in process step S205, variables are redefined in process step S202 by referring to the new tentative solution and the updated pruning conditions. Then, process step S203 is executed again. This series of processes consisting of process steps S205, S202, and S203 is repeatedly executed until it is determined in process step S204 that the solution has been found.

[0047] In short, the optimization process in FIG. 3 can be summarized as a two-stage optimization process in which a first optimization process is performed using only some objective functions selected from multiple objective functions to be optimized according to their importance, and then a second optimization process is performed using all objective functions, including those with low importance, using the provisional solution obtained in the first optimization process.

[0048] An example of the optimization process S200 will be described below using an example of a resource-constrained scheduling problem. In the resource-constrained scheduling problem in this example, the companies responsible for each task are treated as resources, and the problem is assumed to involve assigning a responsible company to each task and determining the start date for each task. However, the order of each task is specified, and the same company cannot perform multiple tasks simultaneously.

[0049] The problem we will deal with as an example here is to optimize the relationship between multiple tasks and multiple resources (companies in charge of the tasks). In Figure 4, we assume that there are 11 tasks in total, Task 01 to Task 11, and that the order of the tasks shown in the figure must be observed.

[0050] Figure 4 shows an example of specifying the order of tasks in a resource-constrained scheduling problem, and the execution order of multiple tasks is determined by observing the order of tasks shown in Figure 4. Here, the start and end points of each arrow indicate the order of tasks, and the task at the start point must be completed before the task at the end point can be started. For example, tasks 02 and 03 must be completed before task 06 can be started, and tasks 08 and 09 cannot be started unless task 06 is completed.

[0051] In this problem, the multiple resources (companies in charge of the work) are five companies in total, namely, Company A to Company E. Figure 5 is a table showing an example of a list of the number of work days for each company for each of the 11 work tasks shown in Figure 4.

[0052] Each company can only take on tasks for which numbers are entered. For example, Company A cannot take on tasks 01 and 05-08, but can take on tasks 02, 03, 04, 09, 10, and 11, with required days of 10, 8, 2, 2, 9, and 6, respectively. The following describes the procedure for scheduling optimization, which allocates each task to each company and determines the start date for each task while adhering to the task order shown in Figure 4.

[0053] FIG. 6 is a flowchart showing an example of a scheduling optimization procedure. Hereinafter, the process shown in FIG. 6 and executed by the information processing device 100 will be referred to as optimization process S300. The series of steps constituting the optimization process S300 (processing steps S301, S302, S303, S304, S305, S306, and S307) correspond to processing step S201 of the optimization process S200 shown in FIG. 3. Similarly, processing step S309 corresponds to processing step S202, processing steps S308 and S310 correspond to processing step S203, processing step S311 corresponds to processing step S204, and processing step S312 corresponds to processing step S205.

[0054] In processing step S301 of Fig. 6, a tentative work plan (tentative solution) is first created using rule-based processing. In rule-based processing, for example, the company that requires the shortest number of days to complete each task may be assigned to the task. In this case, in the example of Fig. 5, tasks 01, 02, and 03 are assigned to companies that can complete the tasks in the shortest number of days, such as Company D (5 days), Company B (2 days), and Company D (4 days), respectively.

[0055] After all the company assignments have been decided, the start date for each task is determined according to the task sequence shown in Figure 4. In this case, the start date is determined so that each task is completed as early as possible, while ensuring that the same company does not perform different tasks at the same time.

[0056] Figure 7 shows a work plan created using the rule-based processing described above. The horizontal axis represents the number of days elapsed, and the vertical axis represents the work number. In this example, we focus on work 01, which is positioned first in the work sequence in Figure 4, and set its start date as day 1. Furthermore, referring to Figure 5, work 01 is assigned to Company D, which can complete the work in the shortest number of days, so a schedule for work 01 is set for days 1 through 5.

[0057] Next, focusing on task 02, whose start condition is the completion of task 01, the start date of task 02 is set to the sixth day immediately after the completion of task 01, and the schedule for the two days (seventh day) determined in Figure 5 is determined. Next, the start date of task 03 is determined. In terms of the construction order, task 03 can start on the first day, but since tasks 01 and 03 are both handled by Company D and the same company cannot simultaneously perform different tasks, task 03's start date is set to the sixth day immediately after the completion of task 01. Similarly, the start dates for tasks 04 and beyond can be determined while adhering to the construction order and ensuring that the same company does not handle multiple tasks at the same time. Note that tasks 06 and 07 can begin only after the completion of multiple upstream tasks. Therefore, the start date of the task is determined based on the completion date of the task with the latest end date among the multiple upstream tasks.

[0058] Figure 7 shows an example of a work plan created using the rule-based processing described above. It can be seen that the plan satisfies all of the construction sequence specifications shown in Figure 4, and does not allow each company to work on different tasks at the same time. In addition, the plan created using this rule-based processing has the overall work completion date set at the 24th.

[0059] In the example of processing step S301 of the rule-based processing described above, the start dates were determined simply in the order of the task numbers, i.e., task 01, task 02, task 03, etc. However, this order is not necessarily required. However, when determining the start date of each task, the start dates for all tasks that must be completed before the task in question can be determined in the task order shown in FIG. 4 must already have been determined. For example, when determining the start date of task 06, the start dates for tasks 02 and 03 must already have been determined. This means that, for example, when attempting to determine the start date of a certain task, if there is even one task among the tasks that must be completed in advance that does not have a start date determined, the determination of the start date for that task can be postponed and the determination of the start dates for the other tasks can be prioritized. For example, if the start date for task 02 has not yet been determined when attempting to determine the start date for task 06, the process for determining the start date for task 06 can be postponed until after the process for determining the start date for task 02.

[0060] In the example of processing step S301 of the rule-based processing described above, the company responsible for each task was assigned to the company with the fewest number of days required. However, other methods of assignment may also be used. For example, tasks may be assigned to companies in order, and start dates determined, so that each task's completion date is the earliest. In this case, for example, task 01 is started by Company D on the first day. Next, task 02 is started by Company B on the sixth day. Task 03 is started by Company A on the first day. If task 03 is assigned to the company with the fewest number of days required, task 03 will be started by Company D on the sixth day and completed on the ninth day. However, if companies are assigned so that each task's completion date is the earliest, task 03's completion date will be the eighth day. In this way, by assigning companies so that each task's completion date is the earliest, it is possible to advance the completion date of each task while taking into account the constraint that the same company cannot simultaneously undertake different tasks.

[0061] 6, in process step S302, a formulation is generated for solving the input resource-constrained scheduling problem using a mixed integer programming solver. An example of the formulation is shown below.

[0062] To formulate the resource constrained scheduling problem, we first define the following variables: i、j、d δ: A binary variable that is 1 if company i starts operation j after d days, and 0 otherwise. i : A binary variable that is 1 if company i is in charge of at least one task, and 0 otherwise. D: A continuous variable or integer variable that corresponds to the upper bound of the total task completion date. Next, we define the following constants: d i、j : Number of days required by company i for task j d max : Maximum number of working days allowed M i : Maximum number of tasks that company i can handle N i : Total number of companies w k : Weighting coefficient of each objective function (k=1, 2, ...) The above definition can be more specifically stated as follows. First, d i、j is the number of days required for each task by each company, as shown in Figure 5. maxis set in processing steps S303 and S308 of FIG. 6 by referring to the tentative work plan obtained by the rule-based processing. i is the required days table shown in Figure 5 and d max For example, d max In the case of M = 13, Company A can only take charge of three tasks at most: Task 04, Task 09, and Task 11. A社 = 3. j is the total number of companies, which is 5 in this resource-constrained scheduling problem. k is the objective function Q k is a weighting factor for the sigma-based weighting factor, which may be specified by the user.

[0063] Next, we define the following set: P: a set of work pairs with order constraints I j : A set of companies that can handle task j i : A set of tasks that company i can handle. The above definition can be further detailed as follows: First, P includes, for example, (task 01, task 02), (task 02, task 05), etc. j and J i can be determined from the table of required days shown in FIG. 作業02 = {Company A, Company B, Company C, Company E}, and J A社 = {task 02, task 03, task 04, task 09, task 10, task 11}.

[0064] The objective function in this resource-constrained scheduling problem is expressed as the objective function term Q, for example, as in the following equations (1) to (4), using the variables, constants, and sets defined above. k It can be expressed by:

[0065]

[0066]

[0067]

[0068]

[0069] Objective function term Q 1corresponds to the upper bound of the total work completion date, and the objective function term Q 1 By minimizing the objective function term Q, the work completion date can be minimized. 2 is the number of companies that can be assigned at least one role to the task. i While satisfying the constraints on the objective function term Q 2 By minimizing the objective function term Q, the number of companies to which work can be assigned can be minimized. 3 is the total number of consecutive operations by the same company multiplied by -1. Here, consecutive operations refer to starting another operation immediately after finishing one operation. The reason for multiplying by -1 is the objective function term Q 3 This is to maximize the number of consecutive tasks by minimizing the objective function term Q 4 is the variance of the number of working days among all companies in the entire work schedule. 4 By minimizing this, the number of working days between companies can be equalized.

[0070] In the conceptual explanation of the optimization process in FIG. 3, in the processing step S201, it is stated that "only items with high importance are optimized as the first optimization process", but this is because the objective function term Q 1 , Q 2 , Q 3 , Q 4 This means that this part of the objective function term Q is selected from the above.

[0071] The overall objective function H in this resource-constrained scheduling problem is the above objective function term Q k Weighting coefficient w k This can be expressed as the following equation (5) as a weighted sum of

[0072]

[0073] However, in the processing step S302 of FIG. 6 in this embodiment, in order to create a formulation for a mixed integer programming solver, the objective function term Q 3 Weighting coefficient w 3 and the objective function term Q 4 Weighting coefficient w 4is always set to 0. In the example of this embodiment, the optimization process of only the items with high importance in the processing step S201 of FIG. 3 is performed using a known mixed integer programming solver, but other methods such as simulated annealing, genetic algorithm, tabu search, and stochastic evolution method may also be used.

[0074] Next, the constraints are formulated. In this resource-constrained scheduling problem, it is necessary to consider constraints such as those in the following equations (6) to (10).

[0075]

[0076]

[0077]

[0078]

[0079]

[0080] Equation (6) indicates that each task must be executed exactly once. Equation (7) reflects the task ordering shown in FIG. 4 and specifies all task pairs (j p , j n ) for work j p The work n This means that the work must be completed before the start date of δ. Equation (8) prohibits the same company from being in charge of multiple tasks at the same time. Equation (9) i The constraint on δ is that if company i is assigned even one task, i becomes 1. While satisfying this equation (9), the objective function term Q 2 By minimizing δ i is 0 only if company i has not been assigned any work, and the objective function Q 2 The number of companies in charge of the work can be expressed by the term. Equation (10) sets an upper bound for the work completion date, and indicates that any work will be completed by the D-1 day. While satisfying this equation (10), the objective function term Q 1 By minimizing this, the overall work completion date can be minimized.

[0081] In processing step S303 of FIG. 6, the work completion date in the provisional plan obtained in processing step S301 is multiplied by a constant d max However, instead of the actual completion date in the tentative plan, you can also add a few days to the completion date or subtract a few days from the completion date. max , the 24th is substituted as the work completion date in the plan created by the rule-based processing shown in FIG.

[0082] In processing step S304 of FIG. 6, the variable s i、j、d , δ i , D. Define the variable δ i is for all companies, δ A社 , δ B社 However, in the processing step S305 described later, the objective function term Q 2 If the objective function H does not include i The variable D is defined as a continuous variable or an integer variable. i、j、d is the task set J that can be handled by all companies i. i In addition, for company i and task j, the variable s i、j、d The range of dates d that defines the date d must be such that all work is completed within d max It is determined that the process will end on the day. i、j、d is defined only for the date d on which company i can start work j, with reference to the construction sequence specification shown in FIG.

[0083] Specifically, the earliest finish date for all paths of pre-tasks for task j is calculated, and the day after the maximum of these dates is set as the earliest start date for task j. Taking task 06 in Figure 4 as an example, the pre-task paths are (task 01, task 02) and (task 03), and the earliest finish date can be calculated by adding the minimum number of days required for each task for these two paths. As a result, the earliest finish date for (task 01, task 02) is determined to be the seventh day, and the earliest finish date for (task 03) is determined to be the fourth day, so the earliest start date for task 06 is the eighth day. This argument means that because it takes a minimum of seven days to complete the pre-tasks for task 06, task 06 can only start on the eighth day at the earliest.

[0084] In addition, the minimum number of construction days for all passes of the subsequent work of work j is calculated, and the maximum value of these is d max The value subtracted from (= 24 days) is the latest date allowed as the end date of task j. Taking task 06 in Figure 4 as an example, the paths of subsequent tasks are (task 08, task 11) and (task 09, task 11), and the minimum number of construction days for these two paths can be calculated by adding up the minimum number of construction days for each task. As a result, the minimum number of construction days for (task 08, task 11) and (task 09, task 11) are found to be 10 days and 4 days, respectively, so the latest allowable end date for task 06 is d. max -10 = day 14. This argument means that in order for the successor to activity 06 to be completed by day 24, activity 06 must be completed by day 14 at the latest.

[0085] The earliest start date of operation j obtained by the above method is d j start , the latest finish date is d j finish Then, the variable s ijd The range of days d that defines j start , d j finish -d ij For example, the variable s for Company D for task 06 shown in FIG. D社、作業06、d The range of the number of days d that defines the variable s corresponding to the task 06 and the company D is [8, 10]. ijdFor the range of days other than these, the variable s D社、作業06、d is always 0, so there is no need to define it.

[0086] 6, an optimal work plan is created by finding a combination of variable values ​​that minimizes the objective function value using, for example, a known mixed integer programming solver for the formulation generated in process step S302 and the variables defined in process step S304. In the optimization process in process step S305, the tentative work plan obtained in process step S301 may be used as an initial solution.

[0087] Hereinafter, as an item of high importance in the processing step S201 of FIG. 3, the objective function term Q 1 When only the (work completion date) is specified, the objective function term Q 1 (Work completion date) and Q 2 The following examples will be described separately for the case where two items, "number of companies in charge of the work" and "number of companies in charge of the work" are specified. Note that the objective function setting unit 114 in Fig. 2 selects which objective function term is the most important item by referring to the information on the importance of each objective function term stored in the problem data storage unit DB1.

[0088] First, the objective function term Q 1 If only the (work completion date) is a high-importance item and minimizing the work completion date is a prerequisite for creating a plan, in processing step S305 of FIG. 6, the objective function H is 1 Only, that is, H = w 1 Q 1 This is done by optimizing the weighting coefficient w 2 , w 3 , w 4 This can be achieved by substituting 0 for all of the objective function terms Q 2 If the constraint (9) on the number of companies is not included, it is not necessary to take it into account as a constraint.

[0089] FIG. 8 shows the objective function H (= w1 Q 1 This is a Gantt chart of a work plan created from the solution when minimizing the variable s ijd and the number of days required for each task d ij The solution can be created by referencing the value of the variable s ijd For example, if we take a variable that includes Company A as a subscript, A社、作業04、4 = 1, Company sA, tasks 09 and 15 = 1, and all others are 0. The value of variable D in the obtained solution is 23 days, and the overall task completion date is 23 days. In the rule-based task plan shown in Figure 7, the task completion date is 24 days, and the optimization in S305 has shortened the task completion date by one day.

[0090] The mixed integer programming solver can guarantee that the solution obtained is an exact solution. Therefore, the obtained work completion date of 23 days is the exact minimum work completion date. In this way, once the mixed integer programming solver has completed the solution, a work plan with the minimum number of days can be created.

[0091] Referring again to FIG. 6, in processing step S306, the work plan obtained in processing step S305 is referenced, and d max As a method of updating, for example, the value of d is updated by changing the work completion date of the work plan obtained in processing step S305 to 23rd. max In this case, at the time of processing step S303 in FIG. max = 24, but in processing step S306, max = 23, where d max The method of updating is not limited to the above method, and a value obtained by adding or subtracting a few days from the task completion date in the task plan obtained in processing step S305 may be substituted. max The method of updating may be specified by the user. The optimization process in process step S305 may be terminated midway, for example, by setting a limit on the calculation time. If the optimization process using the mixed integer programming solver is terminated midway, there is no guarantee that the solution obtained in process step S305 is an exact solution. Therefore, for example, in process step S306, maxBy making the value smaller than the previous value, the number of variables defined in processing step S304 can be reduced, and as a result, the calculation time required to obtain an exact solution in the next processing step S305 can be shortened.

[0092] In step S307 of Fig. 6, it is determined whether to end the solution using the mixed integer programming solver or to repeat the procedure of steps S304, S305, and S306. The determination conditions include, for example, whether an exact solution has been obtained in step S305, and whether the objective function value has improved compared to the previous solution. The determination conditions may also be specified by the user, and for example, the user may specify whether the solution is repeated up to a specified number of times. max The solution may be repeatedly obtained while decreasing or increasing the value of . In the following description, it is assumed that a solution with the smallest task completion date is obtained in processing step S305.

[0093] In processing step S308 of FIG. 6, after the mixed integer programming solver has completed solving, a formulation for an Ising machine is generated. The flowchart shown in FIG. 6 assumes that the optimization process S203 including items of low importance in FIG. 3 is executed by an Ising machine. In the formulation for an Ising machine, a method of incorporating the constraint equations shown in equations (6) to (10) into the objective function using the well-known Lagrangian function method or a method of using the well-known alternating direction multiplier method may be adopted. Also, all constraint equations may be written as penalty terms and incorporated into the objective function. When the constraint conditions are written as penalty terms, for example, the constraint equation (6) may be expressed as equation (11), and the weighting coefficient w 6 and add it to the objective function.

[0094]

[0095] In processing step S309 of FIG. 6, the total work completion date is d max Define the variables so that they are within the range. In this case, d max = 23, and for each company i and each operation j, the variable s ijdBy obtaining the minimum work completion date strictly in step S305 of FIG. ijd The range of days for which the above is defined can be reduced, reducing the number of variables to be handled.

[0096] Also, the variable s ijd and variable δ i In the tentative solution obtained in processing step S305, variables may be defined only for companies to which at least one task has been assigned. However, in the case of the tentative solution shown in Figure 8, tasks have been assigned to all five candidate companies, so in this embodiment, variables are defined for all companies. The case in which variables are defined for only some companies in processing step S309 will be described later.

[0097] In processing step S310 of FIG. 6, optimization is performed using an Ising machine, taking into account the objective function term that was not considered in processing step S305. In the optimization process in processing step S310, the provisional solution obtained in processing step S305 may be used as the initial solution. In this case, the newly added objective function term is Q 2 , Q 3 , Q 4 and each has a weighting coefficient w 2 , w 3 , w 4 However, when constraint conditions are incorporated into the objective function as the Lagrangian function method, the alternating direction multiplier method, or penalty terms, the objective function value including the terms derived from the constraints is optimized. In this embodiment, in particular, the objective function term Q 3 , Q 4 is a quadratic objective function, which is relatively difficult to handle with a mixed integer programming solver, and is an objective function term that the Ising machine excels at.

[0098] The weighting coefficient w of the objective function term used in the processing step S310 of FIG. k is the weighting coefficient w used in processing step S305 k For example, in processing step S305, the objective function term Q 1 was specified as the overall objective function H, but in processing step S310,1 = 0, the task completion date may be excluded from the optimization. This type of processing is effective in creating a task plan where minimizing the task completion date is a necessary condition. That is, the task completion date is strictly minimized at the time of processing step S305, and this minimum task completion date is set as d max In step S309, the work plan is always set to d max If the variables are defined so that the work is completed by the minimum completion date, the optimization process in step S310 will always obtain a work plan in which all work is completed by the minimum completion date. In this case, the objective function H is added with an objective function term Q relating to the work completion date. 1 Then, in processing step S310, optimization is performed including the objective function term not considered in processing step S305, thereby making it possible to create a work plan that takes into account additional optimization indices such as the leveling of the number of consecutive work tasks and the number of work days while maintaining the minimum work completion date.

[0099] FIG. 9 shows max This is an example of a work plan obtained by performing the optimization process of processing step S310 in FIG. 6 using an Ising machine, with the 23rd day set as the minimum work completion date. In this example, the objective function H to be optimized is the objective function term Q 3 , objective function term Q 4 and the objective function term Q 1 , Q 2 That is, the number of consecutive operations (objective function term Q 3 ), work day leveling (objective function term Q 4 ) is specified.

[0100] In the example work plan shown in Fig. 9, the work completion date is the 23rd, which is the same value as the minimum work completion date calculated in processing step S305 in Fig. 6. Furthermore, the number of consecutive executions is 1 (tasks 03 and 04 by company A) in the work plan in Fig. 8, but after undergoing optimization processing using the Ising machine, it increases by 2 to 3 (tasks 03 and 04 by company A, tasks 05 and 09 by company C, and tasks 08 and 10 by company E) in the work plan in Fig. 9.

[0101] This increases the number of consecutive work days by the same company as much as possible within the scope of the work sequence, minimizing the number of unnecessary idle days for each company. To equalize the number of working days, we simply compare the variance of the number of working days for each company. In the work plan shown in Figure 8, the number of working days for each company is as follows: Company A: 12 days, Company B: 5 days, Company C: 2 days, Company D: 12 days, and Company E: 11 days, resulting in a variance of the number of working days between companies of 17.04.

[0102] On the other hand, as a result of the optimization process using the Ising machine, in the work plan of Fig. 9, the number of operating days for each company is as follows: Company A: 10 days, Company B: 5 days, Company C: 10 days, Company D: 12 days, and Company E: 11 days, and the variance in the number of operating days between the companies has decreased from the plan of Fig. 8 to 5.84. This equalizes the burden between the companies as much as possible.

[0103] In this way, we first strictly minimize the task completion date, which is the most important optimization index, and then create a plan that takes into account the additional optimization indexes of maximizing the number of consecutive tasks and minimizing the variance in the number of working days while adhering to that task completion date. In this example, we assumed that minimizing the task completion date was a necessary condition. This assumption is a common case in resource-constrained scheduling problems.

[0104] In conventional methods using Ising machines, in order to minimize the task completion date, it was necessary to repeat the optimization process multiple times and heuristically search for an optimal solution. In particular, the number of iterations of the optimization process required to find the shortest task completion date was unknown, and furthermore, it was not possible to guarantee that the obtained task completion date was exactly the shortest. As exemplified in this embodiment, the task completion date was strictly minimized using a mixed integer programming solver, and then an optimization process using an Ising machine was performed, including a quadratic objective function. As a result, it was possible to create a plan that reliably minimized the task completion date while also taking other optimization indices into account, with only one loop as the overall procedure.

[0105] 6, it is determined whether to terminate the solution search by the Ising machine or to execute it again according to a previously specified criterion for determination. This criterion for determination includes, for example, whether all constraint conditions are satisfied, whether the objective function value is improved compared to the previous solution by the Ising machine, whether the optimization process by the Ising machine has been executed the number of times specified by the user, etc.

[0106] In processing step S312 of FIG. 6, the work plan obtained in processing step S310 is referred to, and d max This is effective when minimizing the work completion date is not a necessary condition for creating a schedule, for example, when you want to prioritize minimizing other objective function terms, such as the number of consecutive work tasks or the variance in the number of working days between companies, even if it means delaying the overall work completion date.

[0107] Next, as an optimization item with high importance in processing step S201 of FIG. 3, the objective function term Q 1 (Work completion date) and Q 2 (number of companies in charge of work) will be specified. 1 Explanations of procedures similar to those when only the (task completion date) is specified will be omitted where appropriate.

[0108] 6 again, in process steps S301 and S302, a rule-based tentative plan is created and a formulation for a mixed integer programming solver is generated by the method already described. In process step S303 of FIG. 6, for example, 23 days, which is the work completion date in the tentative plan obtained in process step S301 minus 1, is calculated as d max Suppose we substitute

[0109] Next, the objective function term Q 1 As in the case where only the first and second companies are considered, processing steps S304 and S305 in FIG. 6 are executed. As a result, for example, a work plan as shown in FIG. 10 is obtained. In this work plan, the work completion date is the 23rd, and the number of companies in charge of the work is 5 (all of companies A to E). Here, the variable s is set so that the work completion date is always the 23rd or less at the time of processing step S304. ijdTherefore, it should be noted that the optimization process in process step S305 cannot create a plan in which the work completion date is the 24th day or later.

[0110] In processing step S306 of FIG. max The value of d is increased from the previous setting of 23 to, for example, 24. Then, in processing step S307 of FIG. 6, it is determined that the mixed integer programming solver should be used again to find a solution. max The update method and the criteria for continuing the solution are, for example, "Continue solving until the objective function value no longer improves." max The value of d can be increased by 1 and the solution can be repeated. max You can also specify "increase the value of d by 1 and repeat twice." max does not need to be increased, and d max The optimization process may be repeated while decreasing .

[0111] FIG. 11 shows the second loop. max An example of a work plan calculated using a mixed integer programming solver is shown below. In this work plan, the work completion date is the 24th, and the number of companies in charge of the work is four (only companies A to D are in charge of the work, and company E is not in charge). The objective function term Q 1 Weighting coefficient w 1 Compared with the objective function term Q 2 Weighting coefficient w 2 If is sufficiently large and reducing the number of companies is important, d max By changing the value of d and executing the optimization process again, it is possible to obtain a plan that reduces the number of companies even if it means extending the work completion date. However, if it is not necessary to strictly minimize the work completion date, it is possible to change the value of d at the time of processing step S303 in FIG. max Alternatively, the value of ∇ ... may be set to a sufficiently large value to reduce the number of times that processing steps S304 to S307 are repeated.

[0112] After obtaining the work plan shown in FIG. 11, in processing step S306 of FIG. maxFor example, it is assumed that the work completion date of 24th obtained in processing step S305 is directly substituted into . Furthermore, it is assumed that it is determined in processing step S307 in Fig. 6 that the optimization processing by the mixed integer programming solver is to be terminated, and in processing step S308, a formulation for an Ising machine is generated by the method already described.

[0113] In processing step S309 of FIG. 6, the total work completion date is d max Define the variable so that it is within 24 days. ijd The range of the date d defining the objective function term Q can be determined by the same procedure as in step S304 of FIG. 2 If we focus on reducing the number of companies in charge, we can use the variable s ijd and the variable δ i In the tentative solution ( FIG. 11 ) obtained in processing step S305, the variable is defined only for the companies that appear in the plan, i.e., only for company A, company B, company C, and company D, and it is not necessary to define the variable for company E. In this case, since the variable itself is defined only for the four companies, company A, company B, company C, and company D, the work plan obtained by the optimization process using the Ising machine will always be responsible for four or fewer companies.

[0114] In the process step S310 of FIG. 6, an optimization process using an Ising machine is performed. At this time, as an additional objective function, for example, an objective function term Q 3 Adding this, the objective function term to be optimized is w 1 Q 1 , w 2 Q 2 , w 3 Q 3 However, in the processing step S309, the variable s ijd and the variable δ i When the objective function term Q 2 does not need to be included in the objective function H. The objective function term added here is Q 3 It is not necessary to limit it to Q 4 or other optimization indices.

[0115] FIG. 12 shows maxThis is a work plan obtained by performing optimization processing using an Ising machine under the condition that Q = 24 days. In this example, the objective function term is Q 1 , Q 2 , Q 3 Compared to the provisional solution (FIG. 11) obtained in processing step S305 of FIG. 6, the work completion date remains unchanged at 24th, and the total number of work companies remains unchanged at four. In processing step S309 of FIG. 6, variables are defined with reference to the provisional solution, and these optimization indices can be set so that they do not deteriorate compared to the provisional solution. However, the newly added objective function term Q for continuous work 3 As a result, the number of consecutive tasks increases from 3 in FIG. 11 to 4 in FIG. 12 while maintaining the values ​​of the optimization indices with high priority, namely, the task completion date and the number of companies.

[0116] After the work plan shown in FIG. 12 is obtained, it is assumed that it is determined in processing step S311 of FIG. 6 that the solution is to be re-executed using the Ising machine. Furthermore, in processing step S312, d max Assume that the 26th is set as the date. max The method of updating d may be specified in advance by the user. For example, "Until the objective function value no longer improves, max In this case, the solution is repeatedly obtained using the Ising machine while increasing by 2. When repeatedly obtaining a solution using the Ising machine, the solution obtained in the previous solution obtaining process may be used as the initial solution.

[0117] In processing step S309 of FIG. max = 26 days, variables are defined only for four companies, A to D. Furthermore, optimization is performed using an Ising machine in processing step S310.

[0118] FIG. 13 shows an example of a work plan calculated by an Ising machine under the above conditions. maxBecause the value of has been increased, the completion date has been extended to 26 days, but the number of companies remains unchanged at four, from Company A to Company D. Also, the number of consecutive tasks has increased from four to seven. If you prioritize improving other objective function terms even if it means slightly delaying the completion date, you can use d max Then, the optimization process can be performed again using the Ising machine by changing the value of

[0119] Although one embodiment has been described in detail above, it goes without saying that the present invention is not limited to the above embodiment and can be modified in various ways without departing from the spirit of the present invention. For example, the above embodiment has been described in detail to clearly explain the present invention, and the present invention is not necessarily limited to an embodiment having all of the described configurations. Furthermore, it is possible to add, delete, or replace part of the configuration of the above embodiment with other configurations.

[0120] Furthermore, the above-described configurations, functional units, processing units, processing means, etc. may be partially or entirely implemented in hardware, for example, by designing them as integrated circuits. The above-described configurations, functions, etc. may also be implemented in software by a processor interpreting and executing a program that implements each function. Information such as the programs, tables, and files that implement each function can be stored in a memory, a recording device such as a hard disk or SSD (Solid State Drive), or a recording medium such as an IC card, SD card, or DVD.

[0121] In addition, in the above figures, the control lines and information lines shown are those that are considered necessary for explanation, and do not necessarily show all the control lines and information lines that are actually implemented. For example, it may be considered that almost all components are actually connected to each other.

[0122] The above-described layout of the various functional units, processing units, and databases of the information processing device 100 is merely an example. The layout of the various functional units, processing units, and databases can be changed to an optimal layout in terms of the performance, processing efficiency, communication efficiency, etc. of the hardware and software included in the information processing device 100.

[0123] Furthermore, the configuration (schema, etc.) of the database that stores the various types of data described above can be flexibly changed from the viewpoint of efficient use of resources, improved processing efficiency, improved access efficiency, improved search efficiency, and the like.

[0124] 100: Information processing device 107: Combinatorial optimization device 111: Problem data acquisition unit 112: Formulation generation unit 113: Variable definition unit 114: Objective function setting unit 115: Combinatorial optimization unit 116: Optimization result determination unit 117: Solution output unit DB: Storage unit DB1: Problem data storage unit DB2: Formulation data storage unit DB3: Variable data storage unit DB4: Tentative solution storage unit DB5: Calculation program storage unit

Claims

1. An information processing device that uses a computer to process combinatorial optimization problems consisting of multiple objective function terms, comprising: a first stage in which a combinatorial optimization unit performs optimization processing for objective function terms with high importance among the multiple objective function terms; and a variable definition unit that reduces the number of variables to be defined by referring to a tentative solution obtained by the combinatorial optimization unit; and a second stage in which the combinatorial optimization unit performs optimization processing for objective function terms that also take into account objective function terms with relatively low importance; and an optimization result judgment unit that judges whether to terminate the optimization processing based on a specified judgment criterion; and when the optimization processing is to be re-executed, the information processing device updates the conditions for defining the variables and repeatedly executes the optimization processing of the second stage.

2. An information processing device as described in claim 1, characterized in that, in accordance with the importance of each objective function term designated in advance by a user, objective function terms are divided into those with high importance and those with low importance, and in the first and second stages of optimization processing, the combinatorial optimization unit selects the objective function terms to be optimized.

3. An information processing device according to claim 1, wherein the mathematical optimization methods used in the optimization process may be different from each other, and the information processing device is provided with a program for executing each mathematical optimization method, and a combinatorial optimization device.

4. An information processing device according to claim 3, comprising: a formulation generation unit which formulates a combinatorial optimization problem in accordance with the mathematical optimization method used in each of the first and second optimization processing stages, and a storage unit which stores the formulation.

5. An information processing device according to claim 1, characterized in that, before executing the first stage optimization process, a feasible provisional solution is obtained by a rule-based method different from the mathematical optimization method used in the first and second stages.

6. An information processing apparatus according to claim 1, wherein an already obtained tentative solution is used as an initial solution in the first and second optimization processing stages.

7. An information processing device according to claim 1, characterized in that, when reducing the number of variables to be defined, a variable definition unit prunes variables whose values ​​can be analytically determined based on information obtained from feasible tentative solutions obtained in advance and constraints imposed on the combinatorial optimization problem, without defining the variables.

8. An information processing device according to claim 1, characterized in that it comprises a variable definition unit which, when reducing the number of variables to be defined, prunes some variables without defining them by referring to information obtained from feasible provisional solutions obtained in advance and the importance of each objective function term.

9. An information processing device according to claim 5, characterized in that, prior to the first and second stages of optimization processing, pruning of variables is performed by referring to the feasible provisional solution, and the optimization processing is repeatedly performed by changing the conditions used for pruning of variables depending on the results of the optimization processing, the constraint conditions, and the importance of the objective function terms.

10. An information processing method for processing a combinatorial optimization problem consisting of a plurality of objective function terms using a computer, comprising the steps of: in a first step, executing an optimization process for objective function terms with high importance among the plurality of objective function terms, and performing a process of reducing the number of variables to be defined by referring to a provisional solution obtained in the optimization process; in a second step, executing an optimization process for objective function terms taking into account objective function terms with relatively low importance, and performing a process of determining whether to terminate the optimization process based on a specified determination criterion; and, when re-executing the optimization process, updating the conditions for defining the variables and repeatedly executing the optimization process in the second step.

Citation Information

Patent Citations

  • Multipurpose optimization method

    JP1996036560A

  • Optimization problem analysis device and optimization problem analysis method

    JP2013242662A