Intelligent examination arrangement method supporting multiple examination scenes
Through the intelligent test schedule method, combined with the examination room and candidate data, the test schedule results are optimized, and the existing system cannot effectively optimize the use of classroom space and distinguish examination subjects, achieving more efficient and accurate test schedule services.
Patent Information
- Application Number
- CN202510328333.5
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2025-03-19
- Publication Date
- 2025-06-13
AI Technical Summary
The existing test schedule system cannot effectively optimize the use of classroom space and distinguish the examination subjects in each examination room, resulting in insufficient utilization of classroom space and poor control of examination subjects, which affects the smooth progress of the examination and the candidates' experience.
An intelligent test scheduling method is adopted to generate the best test scheduling results through data preprocessing, selecting test scheduling strategies, running algorithms and result output. This method combines factors such as examination room number, capacity, candidate exam subjects and session time, and uses objective functions and strategy selection to optimize the test schedule results.
It effectively improves the flexibility of exam schedule, optimizes classroom space utilization, accurately distinguishes and controls the exam subjects, improves the exam experience between teachers and candidates, and ensures the smooth progress of the exam.
Smart Images
Figure SMS_1 
Figure QLYQS_1
Abstract
Description
Technical Field
[0001] The present invention relates to the technical field of college examination arrangements. Specifically, it is a method for intelligent examination scheduling that supports multiple examination scenarios. Background Art
[0002] In existing examination arrangement platforms, the design of the examination scheduling function is relatively basic and only meets the basic needs of examination scheduling. However, when faced with increasingly complex and diverse examination scenarios, its limitations have gradually emerged. With the booming development of online education, users' demands for the examination scheduling function are also increasing day by day. Colleges and universities are more expecting that the examination scheduling system can flexibly adapt to the needs of different examination scenarios and provide more efficient and accurate examination scheduling services.
[0003] Although the existing system functions meet the basic examination scheduling needs, significant defects and deficiencies have emerged in actual applications. First of all, the function design lacks flexibility and cannot be set and adjusted according to the specific requirements and conditions of the examination. For example, it is impossible to optimize the utilization of classroom space. Previously, candidates were simply assigned to each classroom without considering the capacity, layout of the classroom and the actual needs of the candidates. This has led to the underutilization of classroom space in some cases. Some classrooms may be too crowded while some are empty, or the classroom arrangements are discontinuous. This not only affects the candidates' examination experience but also increases the difficulty of examination management. It is impossible to distinguish and control the examination subjects in each examination room. Previously, without distinction, invigilators often encountered many troubles during the invigilation process. For example, in some examination rooms, due to different examination subjects, the examination materials, equipment, etc. required by candidates may also be different. However, the previous products could not make effective distinctions and controls, and invigilators needed to spend a lot of time and energy to confirm the examination subjects and required materials of candidates. This not only increases the workload of invigilators but also increases the risks of examination management.
[0004] Therefore, there are multiple significant defects and deficiencies in the existing products in terms of the examination scheduling function, including lack of flexibility, improper utilization of classroom space, and lax control of examination subjects. These problems not only affect the smooth progress of the examination but also reduce the candidates' examination experience and the work efficiency of invigilators. Therefore, it is very necessary and urgent to develop a new intelligent examination scheduling function that supports multiple examination scenarios. Summary of the Invention
[0005] The purpose of the present invention is to provide a method for intelligent examination scheduling that supports multiple examination scenarios, so as to solve the problems that the existing examination scheduling system cannot optimize the utilization of classroom space and cannot distinguish and control the examination subjects in each examination room.
[0006] To solve the above problems, the present invention adopts the following technical means: A method for intelligent examination scheduling that supports multiple examination scenarios, including: Data preprocessing: Entering examination room information, examination subjects, and candidate data; Selecting an examination scheduling strategy: Selecting a candidate arrangement strategy and an examination room arrangement strategy through an interactive interface; Running the algorithm: Generating an examination scheduling result through an examination scheduling function according to the selected strategy; Result output: Outputting the examination scheduling result, including the examination room allocation, examination subjects, and session time for each candidate.
[0007] Preferably, when running the examination scheduling function, it is combined with the number C of the examination room i , capacity N i and the examination subject K of the candidate j and session time T k .
[0008] Furthermore, the objective function of the examination scheduling function is:
[0009] where m is the number of examination rooms, n is the number of candidates, X ij is a 0-1 variable indicating whether candidate j is assigned to examination room i, and U ij is the utility value of examination room i for candidate j.
[0010] Even further, the candidate arrangement strategy is to select whether candidates with the same subject are arranged in the same examination room, using the S value as the judgment; When S = 0, the candidate arrangement strategy is that candidates with the same subject are not arranged in the same examination room, and at this time, students corresponding to all subjects are mixedly arranged in all classrooms; When S = 1, the candidate arrangement strategy is that candidates with the same subject are arranged in the same examination room. At this time, if the capacity Ni of the examination room and the number of examination rooms permit, candidates with the same subject will be arranged in the same examination room as much as possible; but if the number of examination rooms is insufficient, the remaining students will be arranged in the examination rooms that match the remaining capacity as much as possible. In the current situation, if a single examination room with surplus capacity cannot accommodate all the remaining students, the remaining students will be arranged according to the principle of occupying as few other examination rooms as possible.
[0011] Even further, let M k be the number of candidates for subject k, and N i be the capacity of examination room i. When S = 0, they are directly mixedly arranged according to the capacity Ni of the examination room and the number Mk of candidates.
[0012] Even further, let M k be the number of candidates for subject k, and N i be the capacity of examination room i. When S = 1, the allocation process is: S1. Sort both M k and N i from most to least; S2. Match M k and N i , and try to make M k ≈N i ; S3. If there are remaining students, allocate them on the premise of minimizing the number of other classrooms occupied.
[0013] Furthermore, the examination room arrangement strategy is to arrange and mix them in order of the capacity of the examination rooms; When the selection is to arrange them in order of the capacity of the examination rooms, the arrangement process is as follows: A1. Sort N i and M k ; A2. Match N i and M k , and make N i ≈M k ; A3. Allocate according to the value of S; In the step A3, when S = 1, place the students with a large number of single subjects in the large examination rooms similar to the number of students, and place the students with a small number of single subjects in the small examination rooms similar to the number of students. If there are still remaining students not allocated examination rooms after all allocations, then on the premise of minimizing the number of other classrooms occupied, calculate the number of remaining students not arranged in examination rooms, and then select the examination room closest to this number of students that can accommodate this number of students as much as possible in one go for allocation, and then loop this process until all students are allocated or all examination rooms are full.
[0014] Furthermore, when the selection is for mixed arrangement, the arrangement process is as follows: B1. Sort by the examination room number C i ; B2. Sort by the number of candidates n; B3. Poll and arrange examination rooms and candidates until all examination rooms are full or all candidates are arranged; Among them, arrange the examination rooms in order of number, and then arrange the students in order. The examination rooms and candidates start to be polled and arranged until finally all examination rooms are full or all candidates are arranged.
[0015] During the use of the present invention, the following beneficial effects are achieved: First, starting from the actual needs of the institution, an in-depth analysis is conducted by integrating the current preconditions for exam scheduling, including the actual problems encountered by the institution in exam scheduling and the specific resource situation of the current exam scheduling. The specific resources for exam scheduling include but are not limited to various aspects such as exam subjects, the number of candidates, the number of examination rooms, and the capacity of examination rooms. Based on these situations, models for various exam scenarios are established to plan the exam scheduling algorithm subsequently, and the interactive page of the exam scheduling function is comprehensively modified to make it clearer and more intuitive for users to select exam scheduling strategies.
[0016] It can effectively solve the existing defects and deficiencies, improve the flexibility of exam scheduling. Users can select different exam scheduling strategies according to the situation of their own schools, examination sites or examination areas to improve the utilization rate of classroom space and accurately distinguish and control exam subjects, which will greatly enhance the exam experience of teachers and candidates and effectively ensure the smooth progress of the exam. It has greatly improved the work efficiency of the previous manual exam scheduling.
[0017] Comprehensively considering the actual pain points of the institution in exam scheduling and combining with actual exam resources, such as: the number of examination rooms, the capacity of examination rooms, and factors such as the exam subjects and session times of candidates, an exam scheduling algorithm is developed. According to the strategy selected by the user, the algorithm can automatically generate the optimal exam scheduling result. This set of algorithms has sufficient flexibility and scalability and can meet the needs of various exam scenarios of current institutions. Specific implementation manner
[0018] To make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, rather than all of the embodiments.
[0019] Therefore, the following detailed description of the embodiments of the present invention is not intended to limit the scope of the present invention claimed, but merely represents the selected embodiments of the present invention. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of the present invention without creative efforts fall within the scope of protection of the present invention.
[0020] It should be noted that, without conflict, the embodiments in the present invention and the features in the embodiments can be combined with each other.
[0021] First, before exam scheduling, teachers or platform administrators need to enter data such as the name of the examination room, the examination site to which the examination room belongs, and the capacity of the examination room and save it to the corresponding database, so that the algorithm will make reasonable arrangements according to the actual situation of the examination room resources during exam scheduling.
[0022] Through the interactive control interface, teachers or platform administrators are allowed to flexibly select a suitable exam scheduling plan for themselves before the exam and perform automatic exam scheduling operations.
[0023] Then, according to the selected exam scheduling strategy, the exam scheduling structure is output.
[0024] Specifically, let the variable S represent whether candidates with the same subject are arranged in the same examination room, that is, the candidate arrangement strategy. Among them, S = 1 means on, and S = 0 means off.
[0025] The examination room arrangement strategy is divided into arranging in order of the capacity of the examination room (strategy A) and mixed arrangement (strategy B).
[0026] When running the exam scheduling function, comprehensively consider the examination room number C i , capacity N i and the examination subjects K of the candidates j , session time T k and other factors to generate the optimal exam scheduling result. The algorithm objective function: ; Among them, m is the number of examination rooms, n is the number of candidates, and x ij is a 0-1 variable indicating whether candidate j is assigned to examination room i, and U ij is the utility value of examination room i for candidate j (considering factors such as examination room capacity and examination subjects).
[0027] During the exam scheduling process, it may automatically identify the examination subjects K corresponding to the candidates to be assigned in each session j .
[0028] When S = 0, students corresponding to all subjects are mixedly arranged in all classrooms; When S = 1, if the examination room capacity and the number of examination rooms permit, candidates with the same subject will be arranged in the same examination room as much as possible; but if the number of examination rooms is insufficient, the remaining students will be placed in the examination rooms that match the remaining capacity as much as possible. In the current situation, if a single remaining examination room cannot accommodate all the remaining students, the principle of occupying as few other examination rooms as possible will be adopted to arrange the remaining students.
[0029] Among them, for S = 1, let M k be the number of candidates for subject k, and N i be the capacity of examination room i. Then the allocation process is as follows: S1. Sort both M k and N i from more to less.
[0030] S2. Match M k and N i , and try to make M k≈N i .
[0031] S3. If there are remaining students, allocate them on the premise of minimizing the number of other classrooms occupied.
[0032] For S = 0, directly mix and arrange according to the examination room capacity and the number of candidates.
[0033] When choosing the examination room arrangement strategy, when choosing Strategy A, the arrangement process is as follows: A1. Sort N i and M k ; A2. Match N i and M k , so that N i ≈M k ; A3. Allocate according to the value of S; Then, the examination room capacity and the number of students corresponding to the examination subjects will be arranged from most to least in turn, and then try to find an examination room with the same or close capacity to match the number of students corresponding to the subject, so as to maximize the utilization of the examination room capacity.
[0034] If the subject control selects to enable "S = 1", the algorithm will try to place students with a large number of single subjects in large examination rooms similar to the number of students, and place students with a small number of single subjects in small examination rooms similar to the number of students. If there are still remaining students after all allocations, they will be adaptively allocated on the premise of minimizing the number of other classrooms occupied, based on the number of remaining students and the remaining capacity of the classrooms; If the subject control selects to disable "S = 0", the algorithm will calculate the number of students who have not been arranged in the examination room, and then select an examination room that is closest to this number of students and can accommodate this number of students as much as possible for allocation, and then loop this process until all students are allocated or all examination rooms are full.
[0035] When choosing the examination room arrangement strategy, when choosing Strategy B, the arrangement process is as follows: B1. Sort by the examination room number C i ; B2. Sort by the number of candidates n; B3. Poll and arrange examination rooms and candidates until all examination rooms are full or all candidates are arranged; If this strategy is selected, the examination rooms will be arranged in sequence by number, and then the students will be arranged in sequence. The examination rooms and candidates will start polling and arranging until all examination rooms are full or all candidates are arranged. Under this strategy, each examination room will arrange students in sequence, and try to evenly distribute the students to each examination room.
[0036] Furthermore, for this application, the development language used is the Java language, and other languages can be used to implement this case.
[0037] Through the above technical means and methods, the intelligent examination scheduling method proposed in this case that supports multiple examination scenarios can effectively solve the defects and deficiencies existing in the previous system, improve the flexibility of examination scheduling. Users can select different examination scheduling strategies according to the situations of their own schools, examination sites or examination areas to improve the utilization rate of classroom space and accurately distinguish and control examination subjects. This will greatly enhance the examination experience of teachers and candidates and effectively ensure the smooth progress of examinations.
[0038] Although the present invention has been described in detail with reference to the foregoing embodiments, those skilled in the art can still modify the technical solutions recorded in the foregoing embodiments or perform equivalent replacements on some of the technical features. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principle of the present invention shall be included within the protection scope of the present invention.
Claims
1. A method for intelligent examination scheduling supporting multiple examination scenarios, characterized in that: include: Data preprocessing: input examination room information, examination subjects and examinee data; Select the test scheduling strategy: select the candidate scheduling strategy and the test center scheduling strategy through the interactive interface; Run the algorithm: Generate the test results through the test scheduling function according to the selected strategy; Result output: Output the test scheduling results, including each candidate's test center allocation, test subjects and session time.
2. The method for intelligently scheduling examinations supporting multiple examination scenarios according to claim 1, characterized in that: When running the test scheduling function, combined with the number C of the test room i , Capacity N i And the candidate's examination subject K j and the session time T k .
3. The method for intelligently scheduling examinations supporting multiple examination scenarios according to claim 2, characterized in that: The objective function of the test sorting function is: ； Among them, m is the number of examination rooms, n is the number of candidates, and X ij is a 0-1 variable, indicating whether candidate j is assigned to examination room i, U ij is the utility value of examination room i to examinee j.
4. The method for intelligently scheduling examinations supporting multiple examination scenarios according to claim 1, characterized in that: The candidate arrangement strategy is to select whether candidates of the same subject are arranged in the same examination room, using the S value as the situation judgment; When S=0, the candidate arrangement strategy is that candidates of the same subject are not arranged in the same examination room. At this time, students corresponding to all subjects are mixed in all classrooms; When S=1, the candidate arrangement strategy is to arrange candidates of the same subject in the same examination room. At this time, the capacity of the examination room N i If the number of examination rooms permits, candidates taking the same subject will be arranged in the same examination room as much as possible; however, if the number of examination rooms is insufficient, the remaining students will be placed in examination rooms that match the remaining capacity. In the current situation, if a single examination room with surplus capacity cannot accommodate all the remaining students, the remaining students will be arranged on the principle of occupying as few other examination rooms as possible.
5. The method for intelligently scheduling examinations supporting multiple examination scenarios according to claim 4, characterized in that: Assume M k is the number of candidates for subject k, N i is the capacity of examination room i. When S=0, the capacity N of the examination room is directly used. i and the number of examinees M k Mix the rows.
6. The method for intelligently scheduling examinations supporting multiple examination scenarios according to claim 4, characterized in that: Assume M k is the number of candidates for subject k, N i is the capacity of examination room i. When S=1, the allocation process is: S1. M k and N i All are sorted from most to least; S2. Match M k and N i , try to make M k ≈N i ; S3. If there are any remaining students, they will be allocated based on the premise of occupying the least number of other classrooms.
7. The method for intelligently scheduling examinations supporting multiple examination scenarios according to claim 4, characterized in that: The examination room arrangement strategy is to arrange and mix the examination rooms in order according to their capacity; When the option is to arrange the examination rooms in order of capacity, the arrangement process is as follows: A1. Sort N i and M k ; A2. Match N i and M k , so that N i ≈M k ; A3. Allocate according to the value of S; In step A3, when S=1, students with a large number of subjects are placed in a large examination room with a similar number of students, and students with a small number of subjects are placed in a small examination room with a similar number of students. If there are still students who have not been assigned examination rooms after all the assignments are completed, the number of remaining students who have not been assigned examination rooms will be calculated on the premise of occupying the least number of other classrooms, and then the examination room closest to the number of students that can accommodate this number of students at one time will be selected for assignment, and this process will be repeated until the students are assigned or all the examination rooms are full.
8. The method for intelligently scheduling examinations supporting multiple examination scenarios according to claim 7, characterized in that: When mixed scheduling is selected, the scheduling process is as follows: B1. Sort by examination room number Ci; B2. Sort by the number of candidates n; B3. Arrange examination rooms and candidates in round-robin fashion until all examination rooms are full or all candidates have been arranged; Among them, the examination rooms are arranged in sequence according to numbers, and then the students are arranged in sequence. The examination rooms and candidates begin to be arranged in turn until all examination rooms are full or all candidates have been arranged.