JPH08263546A - Allocation processor - Google Patents

Abstract

PURPOSE: To speedily and efficiently allocate many resources and automatically generate a schedule by selecting a piece which is high in priority without back tracking and allocating the selection branch of top priority of the piece repeatedly in order. CONSTITUTION: A piece priority granting means 6 give priority for automatic allocation under conditions as to pieces, a piece selecting means 7 selects and takes out a piece with high priority, and a selection branch priority granting means 8 give priority to the selection branch of the piece to be automatically allocated under conditions as to the taken-out piece; and a selection branch part selecting means 9 selects the selection branch part of a piece of high priority out according to the granted priority, and an automatic allocating means 10 allocates the selection branch part of the piece of high priority to the taken- out piece and automatically generates the schedule. At this time, priority for automatic allocation under preconditions and restriction conditions is given as the preconditions and restriction conditions of the allocation of the variable part of the piece.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an allocation processing device for allocating pieces. At various institutions such as driving schools, it is necessary to edit the curriculum (timetable) that efficiently uses and teaches so that competition with limited resources (eg, cars, courses, classrooms, instructors) does not occur. . At this time, it is desired to quickly and automatically allocate a large number of resources to create a curriculum.

[0002]

2. Description of the Related Art Conventionally, when a curriculum is generated by automatically allocating limited resources so that competition does not occur, it is a premise for describing facility names, which are resources, in a program or for automatic allocation. Describe each condition and constraint condition in a program, allocate one resource so that it satisfies the preconditions and constraint conditions, and return to the original state when it gets stuck and perform allocation with other possible combinations. Backtracking was performed and a large number of resources were allocated to automatically generate a curriculum.

[0003]

Therefore, since a large number of resources are repeatedly allocated and backtracked when they are stuck, they are repeatedly allocated by other combinations, so that a large number of resources can be allocated. There was a problem that time was needed and the curriculum could not be quickly generated and the curriculum could not be automatically generated.

The present invention solves these problems.
When allocating a large number of resources automatically, select the piece with the highest priority without backtracking, and then repeat the allocation of the highest priority option of this piece in order, and allocate a large number of resources quickly and efficiently. The purpose is to allocate and automatically generate a schedule.

[0005]

[Means for Solving the Problems] Means for solving the problems will be described with reference to FIG. In FIG. 1, the piece priority assigning means 6 assigns a priority to pieces automatically based on conditions (preconditions and constraint conditions).

The piece selecting means 7 selects a piece having a high priority. The option priority assigning means 8 assigns the priority of the option portion of the piece to be automatically assigned based on the condition (precondition and constraint condition) for the piece.

The option section selecting means 9 selects the option section of a piece having a high priority. The automatic allocation means 10
The selected option section is assigned to the variable section of the piece.

[0008]

According to the present invention, as shown in FIG. 1, the piece priority assigning means 6 assigns a priority to a piece automatically assigned based on conditions, and the piece selecting means 7 selects a piece having a high priority. The option portion of the piece to be automatically assigned based on the condition is attached to the pieces extracted and picked by the option priority assigning means 8, and the option portion of the piece having a higher priority is selected from the option portion selecting means 9 prioritized. Is selected, the automatic allocation means 10 allocates the option portion of the piece having a high priority to the extracted pieces, and automatically creates the schedule.

At this time, the conditions are preconditions and constraint conditions for allocating the variable part of the piece, and priorities for automatic allocation are given based on these preconditions and constraint conditions.

Therefore, when automatically assigning a large number of resources, a piece with a high priority is selected without backtracking, and then the option portion with a high priority of this piece is assigned to the relevant variable portion, thereby It becomes possible to allocate resources quickly and efficiently and automatically generate a schedule.

[0011]

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Next, the construction and operation of an embodiment of the present invention will be sequentially described in detail with reference to FIGS.

FIG. 1 shows a system block diagram of the present invention. In FIG. 1, a processing device 1 performs various processes according to a program, and is composed of 2 to 10.

The precondition generating means 2 generates and defines the preconditions of the piece (see FIG. 9). The constraint condition generating means 3 generates and defines the constraint condition of the piece (see FIG. 10).

The piece generation means 4 generates and defines pieces based on the variable part (see FIG. 7). The option section generating means 5 generates and defines the option section of the piece based on the preconditions (see FIG. 8).

The piece priority assigning means 6 attaches a priority to each piece automatically based on the number of valid choices of pieces and the constraint condition. The piece selection means 7 selects a piece having a high priority from the pieces assigned the priority by the piece priority assigning means 6.

The option priority assigning means 8 assigns the priority of the option portion of the pieces automatically assigned to the pieces selected by the piece selecting means 7 based on the preconditions and the constraint conditions.

The option section selecting means 9 selects the option section of the high priority options prioritized by the option priority assigning means 8. The automatic allocation means 10 allocates the option part selected by the option part selection means 9 to the variable part of the piece.

The display device 12 displays a screen. The input device 13 is used for various inputs, and here is a mouse for selecting various fields on the screen of the display device 12 or a keyboard for inputting various data.

The business term definition 14 is a variable part, a choice part, a precondition, and a constraint condition item displayed on the screen of the display device 12 which are defined and registered in advance in a divided manner. is there.

Next, the operation of the configuration of FIG. 1 will be described in detail according to the order shown in the flowchart of FIG. Figure 2
Shows a flowchart for explaining the operation of the present invention.

In FIG. 2, S1 gives priority to all pieces. This is the screen for defining the variable part in FIG. 7, which will be described later, the screen for defining the alternative part in FIG. 8, the screen for defining the constraint condition in FIG. 9, and the ones defined in advance as shown in the constraint condition example in FIG. Based on the variable part, the option part, and the constraint condition, all the pieces are given the priority of the frame when automatically assigned based on the constraint condition. For example, the priority of a piece = log (the total number of valid choices / the number of valid selections of a piece) + log (the total number of absolute conditions / the number of absolute conditions that a piece must satisfy) (Equation 1). The previous section shows that the less effective choices for a piece, the higher the priority.The latter section has absolute conditions that must be met (constraints have absolute conditions that must be met and desired conditions that must be met as much as possible. Here, the higher the absolute condition, the higher the priority. Furthermore,
The priority of the pieces may be calculated by further adding the following items designated by the user.

・ Position designation (for example, the order of basic, priority, and applied is made higher in priority) ・ Adjacency designation (higher priority when adjacent) ・ Same designation ・ Others In S2, the allocation target piece list is empty Determine whether. this is,
It is determined whether the list of pieces to be assigned (the list of variable portions of pieces) is empty and all pieces have been assigned. If YES, the process ends (end). If NO, the process proceeds to S3.

In step S3, the highest priority frame h (variable part h of the frame) is selected and removed from the target frame list. S4 is the piece h
Determines whether the unevaluated absolute condition list that must be satisfied is empty.
In the case of YES, it is found that all the absolute conditions to be satisfied have been evaluated, so the process proceeds to S10. If NO, the process proceeds to S5.

In S5, the absolute condition c is selected and removed from the absolute condition list of the piece h. In S6, the option that violates the absolute condition c is deleted from the valid option list of the piece h.

In step S7, it is determined whether or not there is a valid option for the piece h. In the case of YES, since it is found that there are valid options for the piece h, the satisfaction degree of the absolute condition c is added to the priority of each valid option in S8, and the process returns to S4 and is repeated.

On the other hand, in the case of NO in S7, it has been found that there is no preferential option for the piece h, so in S9 it is determined as an unassigned piece. This unallocated piece is automatically allocated by moving the already allocated piece to an empty area and performing so-called reallocation so as to allocate it to the area.

In S10, since the priorities of the options of all the pieces h have been calculated in the YES of S4, the satisfaction levels of all desired conditions that the piece h should satisfy are added to the priority of each valid option. This calculates the priority of each effective option as follows, for example.

[0028] Here, c and r respectively represent constraint conditions (absolute condition and desired condition) that should be satisfied by the frame of interest. I _c , I _r
Represents the constraint satisfaction of the piece of interest. W _C and W _R represent the weights of the constraint species (constraint program) of c and r.

In S11, the valid option having the highest priority of the option priorities calculated in S10 is assigned to the piece h. By the above, all pieces are given priority (Equation 1),
One piece h with the highest priority is taken out, the priority of the effective option of this piece h is calculated (Equation 2), and the effective option (option part) with the highest priority of the effective option is piece h (variable part of the piece).
By assigning to, the one step with a high priority is selected in the first step, and the option section with a high priority is repeatedly assigned to this piece in the next second step. It is possible to sequentially assign the option section. As a result, it becomes possible to automatically assign the option part to the variable parts of a large number of pieces at extremely high speed, eliminating the conventional process of backtracking and re-allocating.

FIG. 3 shows an explanatory diagram of creating an option list of the present invention. This is based on the piece option definition 15 (FIG. 8) and the prerequisite definition 16 (FIG. 9) of the piece.
Create 0, v1, v2 ...
Create as values and save.

FIG. 4 is an explanatory diagram of frame selection and option selection according to the present invention. This is done by selecting the piece with the highest priority from the pieces 18 created and saved according to FIG. 3 (S in FIG. 2).
3) The priority of the valid option is calculated based on the valid option of the selected piece having the high priority and the constraint condition stored outside the drawing (S4 to S10 in FIG. 2). Then, the effective option with the highest priority is assigned to the piece (S in FIG. 2).
11).

FIG. 5 shows a program structure explanatory diagram of the present invention. In the present invention, as shown in the drawing, allocation program, piece selection, constraint determination, option priority setting, option selection, other, constraint determination program, number, position, adjacency, separation, same, exclusive, exclusion, priority, sequence Since the two allocation programs and the constraint determination program have independent structures, when adding a new constraint type, it is only necessary to add a new program to the constraint determination program. . Similarly, the corrections need only be made individually.

In addition, the constraint condition of FIG.
Business term definition 14) and special symbols. here,
As shown in the figure, the constraint condition has “absolute” and “desired” in the classification. “Absolute” (absolute condition) is a constraint condition that cannot be assigned unless it is satisfied, and “desired” (desired condition). Should be satisfied if possible, and is a constraint that may be assigned contrary to this. The constraint pattern sets the content of the constraint condition. The comparison represents the relationship between the constraint pattern and the constraint value. For example, in the constraint condition on the first line, the content determined by the constraint pattern is the constraint value "1".
It is an absolute condition that it is smaller than the number of individuals (determined by the type).

FIG. 6 is an explanatory view of sieving of options of the present invention. In FIG. 6, options are defined. As shown in FIG. 3 described above, this is a piece option definition 15
Is defined by In this state, as shown in, all options are virtually assigned.

Generates options. In this state, as shown in, the valid option is filtered out according to the precondition defined by the precondition definition 16 of FIG. 3, and the piece option 17 of FIG. 3 is defined and stored as the piece 18.

The constraint judgment is performed. In this state, the selection of effective options by the absolute condition of
Satisfaction of absolute conditions is calculated. Further, the degree of satisfaction of the desired condition is calculated with. Finally, the options shown in are left and assigned.

As described above, the present invention is
The process of proceeding to the next step is performed without returning to the order of, so that the highest priority is assigned in order. As a result, the conventional backtracking does not occur, and unnecessary backtracking does not require redoing of unnecessary calculations and determinations, thereby enabling high-speed processing.

FIG. 7 shows an example of a screen according to the present invention (for defining variable part).
Indicates. This is a list in which items of the variable part for defining the variable part of the piece are displayed as shown below. Effective number Course Number of vehicle days Practical stage Item Concatenated number Coincident number ○ -Youth ・ ・ Automobiles 2 Practical skill focus ・ ・ 1-2 Here, valid means that the one-line definition is valid. The course is the name of the course and represents the "Youth four-wheel two-day course". The vehicle type represents "four wheels." The number of days represents the number of days the program is conducted. The truth represents the content. The stage represents the stage of the piece (discrimination between basic and important). Items represent the items to be implemented in the course (braking (medium / low speed) and motocross trial). The number of pieces is the number of the pieces. For example, when it is "2", it means that two pieces are defined.
Therefore, here, there are two types of exercises to be carried out: "braking (medium / low speed)" and "motocross trial."
Since the number is “2”, the total of these combinations is 4
One piece is defined by this one entry and is simplified.

The "selectable item" column in the lower left of FIG. 7 is a list that may be selected in the selected column by selecting any column below the variable part with the mouse. It is also a field for displaying symbols and numbers that can be entered. When you select from the list or symbols or numbers displayed in this "Selectable item" column, the selected item or symbol or number string is displayed in the "Selectable item" column on the right side and the column clicked with the mouse. Will be defined and entered.

As described above, the items of the variable part of the piece are displayed on the screen in the upper row, the lower column is selected with the mouse, and selected from the list displayed in the "selectable item" column in the lower row.
It is displayed in the "selection item" column in the lower right, and when an execution instruction (for example, selecting the additional button on the screen to execute the instruction) is given, it is clicked with the mouse and input in the selected column to be defined. It will be. By repeating this, it becomes possible to define as shown in the column of each item. As a result, the variable part definition can be modified or added by simply modifying or adding the variable part item on the screen, or by modifying or adding the content of any item in each definition. It can be easily performed.

FIG. 8 shows an example of the screen of the present invention (for defining the option section). This is a list in which the items of the option section for defining the option section of the piece are displayed in the same manner as described in FIG. 7 as shown below.

Effective date Time facility Facility instructor ○ -1 time period ・ ・ 6 time period Large classroom Small classroom ・ ・ Practice instructor undecided Here, valid means that the one-line definition is valid. The date is the date of the piece concerned, and since it is in the state of definition that automatic assignment has not been made yet,-(undecided)
Represents The facility represents the facility to which the piece is assigned. The affiliation indicates the affiliation of the instructor. The instructor is an assigned instructor, and here it is undecided.

Further, in the "selectable item" column at the lower left of FIG. 8, when an arbitrary column below the option section items is selected with the mouse, a list and a list which may be selected in the selected column are displayed. This is a field for displaying symbols and numbers that may be entered. When you select from the list or symbols or numbers displayed in this "Selectable item" column, the selected item or symbol or number string is displayed in the "Selectable item" column on the right side and the column clicked with the mouse. Will be defined and entered.

As described above, the item of the option portion of the piece is displayed on the screen in the upper stage, the lower column is selected with the mouse, and selected from the list displayed in the "Selectable item" column in the lower stage, It is displayed in the "selection item" column in the lower right, and when an execution instruction (for example, selecting the additional button on the screen to execute the instruction) is given, it is clicked with the mouse and input in the selected column to be defined. It will be. By repeating this, it becomes possible to define in the column of each item as illustrated. As a result, the definition of the option section can be arbitrarily modified or added simply by modifying or adding the item of the option section of the piece on the screen or by further modifying or adding the content of the optional item of each definition. It can be easily performed.

FIG. 9 shows a screen example (for defining constraint conditions) of the present invention. This is a list in which the items of the constraint conditions for defining the constraint conditions of the pieces are displayed as shown below. Effective classification Constraint No. Course Number of vehicle days Start Practical stage item ○ Absolute number-Cancellation / ---- Practical skill-Night training Nighttime combination No. The set item is a constraint condition, and-represents that it is not a determination target of the constraint condition. In particular, comparison is a special symbol operator, and the constraint value is a value that serves as a comparison criterion. For example, the comparison “≦” and the constraint value “1” shown in the figure represent that the frame is equal to or smaller than the constraint value “1”. That is, it is defined that the number of the pieces is one or less and the pieces are automatically assigned under the constraint of the other set items shown in the figure.

The "selectable item" column in the lower left of FIG. 9 is a list that may be selected in the selected column by selecting an arbitrary column below the constraint condition items with the mouse. It is also a field for displaying symbols and numbers that can be entered. When you select from the list or symbols or numbers displayed in this "Selectable item" column, the selected item or symbol or number string is displayed in the "Selectable item" column on the right side and the column clicked with the mouse. Will be defined and entered.

As described above, the item of the constraint condition of the piece is displayed on the screen in the upper stage, the lower column is selected by the mouse, and the list or the symbols or characters displayed in the "Selectable item" column in the lower stage are displayed. Select from, display in the “Selected item” column in the lower right, and further execute instructions (for example, select the additional button shown on the screen to execute) and click the mouse to enter in the selected column. Will be defined. By repeating this, it becomes possible to define as shown in the column of each item. As a result, the definition of the constraint condition can be modified or added simply by modifying or adding the item of the constraint condition of the piece on the screen, or by modifying or adding the content of the optional item of each definition. It can be easily performed.

FIG. 10 shows an example of constraint conditions of the present invention. This is a constraint condition defined on the screen (for constraint condition definition), and the constraint condition is defined as shown in the column other than −. Therefore, the piece is automatically assigned according to the defined constraint condition other than-in each definition (content of one line). For example, valid: ○ Classification: Absolute Constraint: Number Comparison: ≦ Constraint value: When defined as 1, this constraint condition definition is valid, is an absolute constraint condition, is a constraint on the number of pieces, and the relevant piece is It means that one or less (including one) is assigned.

If the classification is "desired", it is desired that automatic allocation is performed according to the desired constraint condition if possible, but if it is not possible, it is not necessary to satisfy.
The constraints include the number, position, adjacency, separation, sameness, exclusion, exclusion, priority, order, and the like. There are various operators (=, <, ≧,>, etc.) for comparison.

FIG. 11 shows an example of automatic allocation according to the present invention. This is an example of automatic allocation in S11 of FIG. 2 described above. Here, it is displayed that there are "7" unallocated. Reference numerals 40, 42, 43, etc. in the figure are codes (numbers) representing process names. The arrow shows the same contents as the left side.

[0051]

As described above, according to the present invention,
The priority of each piece is given based on the condition, the piece with the highest priority is taken out, the priority of the option section is given based on the condition for this piece, and the option section of the piece with the highest priority is set as the variable of the taken out piece. Since a configuration that allocates to multiple parts is adopted, the conventional backtracking is eliminated when a large number of resources are automatically allocated and the processing does not return. Therefore, it is possible to allocate resources quickly and efficiently with simple processing. . As a result, it has become possible to automatically allocate a large number of resources and to create a schedule automatically at high speed with simple processing.

[Brief description of drawings]

FIG. 1 is a system block diagram of the present invention.

FIG. 2 is a flowchart explaining the operation of the present invention.

FIG. 3 is an explanatory diagram of creating an option list of the present invention.

FIG. 4 is an explanatory diagram of frame selection and option selection according to the present invention.

FIG. 5 is an explanatory diagram of a program structure of the present invention.

FIG. 6 is an explanatory diagram of sieving of options of the present invention.

FIG. 7 is a screen example (for defining a variable part) of the present invention.

FIG. 8 is an example of a screen of the present invention (for defining an option section).

FIG. 9 is a screen example (for defining constraint conditions) of the present invention.

FIG. 10 is an example of constraint conditions of the present invention.

FIG. 11 is an example of automatic allocation according to the present invention.

[Explanation of symbols]

 1: Processing device 2: Precondition generation means 3: Constraint condition generation means 4: Piece generation means 5: Choice section generation means 6: Piece priority assigning means 7: Variable section selection means 8: Choice priority assignment means 9: Choices Part selection means 10: Automatic allocation means 12: Display device 13: Input device 14: Business term definition 15: Piece option definition 16: Precondition definition 17: Piece option 18: Piece

Claims (2)

[Claims] 1. A variable part of a piece to be automatically allocated, a choice part of a piece to be allocated to this variable part, a condition, and a piece priority assigning means for giving a priority to the piece automatically assigned based on the condition. From the prioritized pieces, a piece with a higher priority is taken out from the prioritized pieces, and an option priority assigning means for assigning a priority to the option portion of the piece to be automatically assigned based on the above conditions for this piece. An allocation processing device comprising: means for allocating an option part of a piece having a high priority to the extracted piece. 2. The conditions are preconditions and constraint conditions for allocating a variable part of a piece.
The allocation processing device described.