Computer-based examination administration and scheduling methods and systems

Abstract

This application relates to the field of internet technology and discloses a method and system for scheduling computer-based examinations. The method includes: acquiring computer lab information, exam paper information, and examinee information; determining a scheduling algorithm based on the computer lab information and the examinee information, and obtaining a scheduling result based on the scheduling algorithm; determining an exam paper distribution algorithm based on the scheduling result and the exam paper information, and using the exam paper distribution algorithm to determine the optimal seating arrangement and exam paper distribution scheme, wherein the number of adjacent seats for examinees of the same subject is minimized, and exam papers with the highest degree of difference are distributed to examinees based on the degree of seat proximity for examinees of the same subject; and completing the distribution of exam papers to the corresponding computer labs for each session. This application can support multi-subject mixed examinations and maximize the utilization of school computer lab resources while ensuring the lowest possible seat proximity and the highest degree of exam paper difference for examinees of the same subject. Therefore, it can not only significantly improve the utilization rate of computer labs but also more effectively prevent cheating.

Description

Technical Field

[0001] This application relates to the Internet field, and more particularly to the field of Internet education technology. Background Technology

[0002] With the rapid development of internet technology, information technology has been widely applied in the field of education, and more and more subjects have chosen computer-based testing as a way to assess students' learning outcomes in a way that saves manpower and resources.

[0003] However, current computer-based testing still cannot fully meet the needs of the education industry. For example, schools have a limited number of computer labs, which cannot meet the needs of large-scale, multi-subject computer-based testing. Furthermore, during exams, it is easy for students sitting next to each other to cheat by peeking at computer screens or copying answers, making effective supervision and management difficult. Summary of the Invention

[0004] The purpose of this application is to provide a computer-based examination scheduling method and system that can support mixed examinations of multiple subjects and maximize the use of school computer lab resources, while ensuring the lowest possible proximity of seats for candidates taking the same subject and the highest possible difference in exam papers. This can significantly improve the utilization rate of computer labs and more effectively prevent cheating.

[0005] This application discloses a method for scheduling computer-based examinations, including:

[0006] Obtain information about the computer lab, exam papers, and examinees;

[0007] The scheduling algorithm is determined based on the computer room information and the candidate information, and the scheduling result is obtained based on the scheduling algorithm.

[0008] Based on the exam scheduling results and exam paper information, an exam paper distribution algorithm is determined, and the optimal seating arrangement and exam paper distribution scheme is determined using the exam paper distribution algorithm. Among these schemes, the number of adjacent seats for candidates in the same subject is minimized, and the exam papers with the highest degree of difference are distributed to candidates based on the degree of adjacency of their seats in the same subject.

[0009] Complete the distribution of exam papers to the corresponding computer rooms for each session.

[0010] In a preferred embodiment, the step of determining the scheduling algorithm based on the computer room information and the candidate information, and obtaining the scheduling result based on the scheduling algorithm, includes the following sub-steps:

[0011] Randomly generate n initial schemes that satisfy the hard constraints to form an initial test arrangement scheme set;

[0012] An objective function is constructed based on multi-dimensional soft constraints to evaluate the merits of the initial test scheduling scheme.

[0013] Based on the objective function value, a set of candidate scheduling schemes is selected from the initial scheduling scheme set, and the candidate scheduling schemes are randomly combined to obtain an updated scheduling scheme set. Then, based on the objective function value, the optimal scheduling scheme is determined from the initial scheduling scheme set and the updated scheduling scheme set as the scheduling result.

[0014] In a preferred embodiment, the multi-dimensional soft constraints include one or any combination of the following: computer room utilization rate, exam scheduling rationality, exam paper utilization rate, and emergency response capability.

[0015] In a preferred embodiment, the step of determining the test paper distribution algorithm based on the exam scheduling results and test paper information, and using the test paper distribution algorithm to determine the optimal seating arrangement and test paper distribution scheme, includes the following sub-steps:

[0016] Obtain the above-mentioned exam scheduling results and exam paper information, and assign each exam paper to the corresponding exam room according to the above-mentioned exam scheduling results, and generate an exam paper assignment information table. The exam paper assignment information table includes the following information: exam room information, subject information and exam paper information.

[0017] The number of exam subjects arranged in the computer room for the current session is obtained from the exam paper allocation information table. If the number of exam subjects arranged in the computer room is greater than 1, the candidates for different exam subjects are first arranged by random order algorithm to ensure that the number of candidates for the same subject in adjacent seats is minimized; otherwise, the exam papers are directly randomly arranged.

[0018] In a preferred embodiment, in the step of distributing the test papers to the corresponding computer rooms for each session, the disordered questions of each test paper are reordered according to the test paper distribution scheme, and the final test paper distribution result is output and displayed on the examination interface after the candidates log in.

[0019] In a preferred embodiment, the step of obtaining the number of exam subjects scheduled for the current session in the computer lab based on the exam paper allocation information table, and if the number of exam subjects scheduled in the computer lab is greater than 1, firstly, a randomized algorithm is used to arrange the seating of candidates for different exam subjects; otherwise, the exam papers are directly randomly arranged, including the following sub-steps:

[0020] A randomized algorithm is used to arrange candidates for different exam subjects to determine a seating arrangement that minimizes the number of candidates for the same subject in adjacent seats; and

[0021] The test papers are randomly arranged, the degree of difference between the test papers is calculated, and the test papers with the greatest difference are distributed to adjacent candidates of the same subject according to the seating arrangement scheme.

[0022] This application also discloses a computer-based examination scheduling system, including:

[0023] The acquisition unit is used to acquire information about the computer room, exam papers, and examinees.

[0024] The exam scheduling result acquisition unit is used to determine the exam scheduling algorithm based on the computer room information and the candidate information, and to obtain the exam scheduling result based on the exam scheduling algorithm;

[0025] The optimal seating arrangement and test paper distribution scheme determination unit is used to determine the test paper distribution algorithm based on the examination results and test paper information, and to determine the optimal seating arrangement and test paper distribution scheme using the test paper distribution algorithm, wherein the number of adjacent seats for candidates in the same subject is minimized, and the test paper with the highest difference is distributed to the candidates based on the degree of adjacency of the seats for candidates in the same subject.

[0026] The test paper distribution unit is used to distribute test papers to the corresponding computer rooms for each session.

[0027] This application also discloses a computer-based examination administration scheduling device, including:

[0028] Memory, used to store computer-executable instructions; and,

[0029] A processor for implementing the steps of the method as described above when executing the computer-executable instructions.

[0030] This application also discloses a computer-readable storage medium storing computer-executable instructions that, when executed by a processor, implement the steps of the method described above.

[0031] In this implementation method, firstly, an exam scheduling algorithm is designed based on computer room information, candidate information, and exam scheduling requirements, and the optimal exam scheduling scheme is obtained through iterative optimization. Secondly, based on the exam scheduling results and exam paper information, the computer rooms arranging exams for multiple subjects are first randomly assigned to minimize the number of adjacent seats for candidates taking the same subject. Otherwise, the exam papers are randomly assigned to distribute the exam papers with the greatest difference to candidates taking adjacent seats for the same subject. Finally, the randomly assigned questions in each exam paper are reordered and the final exam paper distribution results are output.

[0032] Therefore, this application can support mixed examinations of multiple subjects and make the most of the school's computer lab resources, while ensuring the lowest possible proximity of seats and the greatest possible difference in test papers for candidates taking the same subject. This not only significantly improves the utilization rate of the computer lab, but also more effectively prevents cheating.

[0033] The specification of this application contains numerous technical features distributed across various technical solutions. Listing all possible combinations of these technical features (i.e., technical solutions) would make the specification excessively lengthy. To avoid this problem, the various technical features disclosed in the above-described invention, the various technical features disclosed in the following embodiments and examples, and the various technical features disclosed in the accompanying drawings can be freely combined to form various new technical solutions (all of which are considered to have been described in this specification), unless such a combination of technical features is technically infeasible. For example, one example discloses feature A+B+C, and another example discloses feature A+B+D+E. Features C and D are equivalent technical means that serve the same function, and technically only one needs to be used; they cannot be used simultaneously. Feature E can technically be combined with feature C. Therefore, the solution A+B+C+D should not be considered as described because it is technically infeasible, while the solution A+B+C+E should be considered as described. Attached Figure Description

[0034] Figure 1 This is a schematic diagram illustrating the principle of the computer-based examination administration arrangement method according to the first embodiment of this application;

[0035] Figure 2 This is a flowchart illustrating the computer-based examination administration method according to the first embodiment of this application;

[0036] Figure 3 This is another flowchart illustrating the computer-based examination administration method according to the first embodiment of this application;

[0037] Figure 4 This is a schematic diagram of the structure of the computer-based examination scheduling system according to the second embodiment of this application. Detailed Implementation

[0038] In the following description, many technical details are presented to help the reader better understand this application. However, those skilled in the art will understand that the technical solutions claimed in this application can be implemented even without these technical details and various variations and modifications based on the following embodiments.

[0039] To make the objectives, technical solutions, and advantages of this application clearer, the embodiments of this application will be described in further detail below with reference to the accompanying drawings.

[0040] The first embodiment of this application relates to a method for scheduling computer-based examinations. In this method, firstly, basic information about the computer lab, examination papers, and examinees is obtained; secondly, a scheduling algorithm is designed based on the computer lab and examinee information to arrange the examinations; then, based on the scheduling results and combined with the examination paper information, an examination paper distribution algorithm is designed; finally, the examination papers for each session are distributed to the corresponding computer lab. Specifically, the process is as follows: Figure 3 As shown, its principle and specific implementation method are as follows: Figure 1 and Figure 2 As shown. The method includes the following steps:

[0041] Step 100: Obtain information about the computer lab, exam papers, and examinees;

[0042] Specifically, the computer room information may include one or any combination of the following: computer room number, open time period, number of available test seats, etc.

[0043] Specifically, exam paper information may include one or any combination of the following: exam subject, exam content, question number, etc.

[0044] Specifically, candidate information may include one or any combination of the following: name, student ID, exam subject, exam duration, etc.

[0045] Step 200: Determine the exam scheduling algorithm based on the computer room information and the candidate information, and obtain the exam scheduling result based on the exam scheduling algorithm.

[0046] In this step, an exam scheduling algorithm is designed to obtain the optimal exam session arrangement. This step is based on the principles of genetic algorithms and combines them with specific exam scheduling requirements to design an intelligent exam scheduling algorithm. The algorithm first constructs an objective function to evaluate the merits of different exam scheduling schemes, and then iteratively optimizes the initial set of schemes to obtain the optimal scheme. The exam scheduling scheme can specifically include the time, exam subjects, and number of candidates for each exam room.

[0047] The following example illustrates the specific implementation method of this step.

[0048] Step 210: Obtain the initial test scheduling scheme set.

[0049] Specifically, in this step, n initial schemes that satisfy the hard constraints are randomly generated to form an initial scheduling scheme set. The hard constraints refer to conditions that must be followed during scheduling and cannot be satisfied unconditionally.

[0050] Step 220: Construct an objective function based on multi-dimensional soft constraints, and use the objective function to evaluate the merits of the initial test scheduling scheme. The higher the objective function value, the better the evaluation result of the test scheduling scheme.

[0051] For example, multi-dimensional soft constraints could include computer room utilization, the rationality of exam scheduling, exam paper utilization, and the ability to respond to emergencies, etc.

[0052] In this step, an objective function is constructed based on multiple soft constraints, including the utilization rate of the computer room, the rationality of the exam schedule, the utilization rate of the exam papers, and the ability to respond to emergencies. The merits of each scheme are evaluated to obtain the exam scheduling scheme with the highest computer room utilization, the most reasonable exam schedule, the highest exam paper utilization, and the computer room with a certain capacity to cope with emergencies.

[0053] Specifically, the quality of the initial scheduling plan is evaluated based on the objective function value; the higher the objective function value, the better the evaluation result of the scheduling plan.

[0054] For example, the specific objective function is shown below:

[0055] F i =ω1f1+ω2f2+ω3f3+ω4f4

[0056] In the above formula, F i Let f1 represent the objective function value of the i-th exam scheduling plan, f2 represent the rationality of the exam arrangement, f3 represent the exam paper utilization rate, and f4 represent the ability to handle emergencies. Furthermore, based on the importance of each of the above factors in the exam scheduling task, corresponding weight values ​​ω1, ω2, ω3, and ω4 are set respectively.

[0057] More specifically, the calculation methods for the above parameters are as follows:

[0058]

[0059] Step 230: Iterative optimization to obtain the optimal exam scheduling plan, which is then used as the exam scheduling result.

[0060] In this step, a set of candidate scheduling schemes is selected from the initial scheduling scheme set based on the objective function value, and the candidate scheduling schemes are randomly combined to obtain an updated scheduling scheme set. Then, the optimal scheduling scheme is determined from the initial scheduling scheme set and the updated scheduling scheme set based on the objective function value as the scheduling result.

[0061] In other words, the objective function value of each initial examination scheduling scheme is calculated according to the objective function, a selection strategy is adopted to obtain a set of candidate examination scheduling schemes from the initial examination scheduling scheme set, and random combinations are performed to obtain an updated examination scheduling scheme set. Finally, the optimal examination scheduling scheme is obtained from the initial examination scheduling scheme set and the updated examination scheduling scheme set as the examination scheduling result.

[0062] Step 300: Determine the test paper distribution algorithm based on the test scheduling results and test paper information, and use the test paper distribution algorithm to determine the optimal seating arrangement and test paper distribution scheme, wherein the number of adjacent seats for candidates in the same subject is minimized, and the test paper with the highest difference is distributed to the candidates based on the degree of adjacency of the seats for candidates in the same subject.

[0063] This step involves designing an algorithm to obtain the optimal seating arrangement and exam paper distribution scheme. First, an exam paper distribution information table is generated based on the aforementioned scheduling results. Second, for computer labs with more than one exam subject, seating is arranged to ensure the minimum number of adjacent seats for students taking the same subject. Finally, multiple sets of exam papers with the highest degree of difference are generated, and these papers are distributed to students taking the same subject based on the degree of adjacency between their seats.

[0064] The following example illustrates the specific implementation method of this step.

[0065] Step 310: Obtain the above-mentioned exam scheduling results and exam paper information, and assign each exam paper to the corresponding exam room according to the above-mentioned exam scheduling results, and generate an exam paper assignment information table. The exam paper assignment information table includes the following information: exam room information, subject information and exam paper information.

[0066] For example, the exam paper assignment information table is shown below:

[0067]

[0068]

[0069] Note: R represents the computer room, T represents the session, and S = {s} k} indicates the exam subjects in this computer lab. This indicates the number of candidates scheduled for this exam subject. This indicates the exam paper information corresponding to this exam subject.

[0070] Step 320: Intelligently distribute test papers and obtain the optimal distribution plan.

[0071] In this step, the number of exam subjects scheduled for the current session in this computer lab is obtained based on the exam paper allocation information table. If the number of exam subjects scheduled in the computer lab is greater than 1, a randomized algorithm is first used to arrange the seats of candidates for different exam subjects to ensure that the number of candidates for the same subject in adjacent seats is minimized. Adjacent seats include seats in front, behind, left, right, and diagonally opposite. Otherwise, the exam papers are randomly assigned.

[0072] For example, see Figure 2 The specific implementation of the above algorithm is as follows:

[0073] Step 321: Use a randomized algorithm to arrange seats for candidates taking different exams, ensuring that the number of candidates taking the same exam in adjacent seats is minimized; that is, the seats are randomly arranged. This includes the following sub-steps:

[0074] ① Sort the exam subjects in ascending order based on the number of candidates for each subject.

[0075] ② First, arrange the seats for candidates taking the same subject in order (i.e., those with fewer candidates first). The seating arrangement rule is as follows: assign seat numbers to candidates taking the same subject in alternating rows and columns. If the number of candidates exceeds the number of seats available, randomly assign seat numbers to the remaining candidates. Arrange the seats for candidates taking each subject in turn according to the above rules until all candidates have been seated, thus obtaining the initial seating arrangement.

[0076] ③ Calculate the number of adjacent seats for candidates taking the same subject in the seating arrangement. The calculation method is as follows: sequentially check whether there are candidates taking the same subject in the seats in front of, behind, to the left and right of the current seat, as well as in the diagonally opposite seat. If so, increment by 1, until all seats have been traversed.

[0077] ④ Randomly change the seat of a candidate to obtain a new seating arrangement and repeat step ③.

[0078] ⑤ If the number of adjacent seats for candidates in the same subject is less in the new scheme than in the old scheme, retain the new scheme; otherwise, repeat step ④.

[0079] ⑥ Repeat steps ④-⑤ until the number of adjacent seats is lower than the set threshold. Then output the current solution as the final solution. Otherwise, perform N iterations and output the solution with the fewest adjacent seats as the final solution (if the solution with the fewest adjacent seats is greater than 1, then randomly select one of them).

[0080] Step 322: Distribute the test papers.

[0081] Specifically, after seating is arranged, the exam papers are randomly assigned, the degree of difference between the papers is calculated, and the exam papers with the greatest difference are distributed to adjacent candidates of the same subject according to the seating arrangement. This includes the following sub-steps:

[0082] ① Generate K (4K) sets of test papers for the same subject with the highest degree of difference.

[0083] Step 1: When K=1, the order of the questions in the initial test paper is randomly shuffled to obtain the first set of test papers;

[0084] Step 2: When K=2, repeat the scrambling operation and calculate the difference between the current scrambled test paper and the first test paper. If the maximum difference remains unchanged after n consecutive executions, output the test paper corresponding to the maximum difference as the second test paper. The test paper difference is calculated as follows:

[0085]

[0086] Where F represents test paper A k1 With Exam Paper A k2 Dissimilarity, where n is the total number of test items. This is the question number of the i-th question in the kj-th test paper.

[0087] Step 3: When there are 3K, repeat the scrambling operation and calculate the average difference between the current scrambled test paper and the generated test paper (combine multiple test papers in pairs and calculate the difference value of each combination of test papers according to the above formula to obtain the average difference between the current test paper and the generated test paper). If the maximum average difference value does not change after n consecutive executions, output the corresponding test paper with the largest average difference value.

[0088] ② Based on the degree of adjacency of candidates' seats in the same subject, assign them the test paper with the highest degree of difference. When the number of adjacent seats is greater than 1, assign them the test paper with the highest average degree of difference from the surrounding test papers.

[0089] ③ Distribute the test papers to candidates for each subject in sequence according to the above steps, complete the test paper distribution, and obtain the test paper distribution plan.

[0090] Step 400: Complete the distribution of test papers to the corresponding computer rooms for each session. In this process, according to the test paper distribution plan, the disordered questions of each test paper are reordered and the final test paper distribution results are output. These results will be displayed on the examination interface after the candidates log in.

[0091] The advantages of the above embodiments are that, while supporting mixed examinations of multiple subjects and making the most of the school's computer lab resources, they ensure the lowest possible proximity of seats for students taking the same subject and the greatest possible difference in exam papers. This not only significantly improves the utilization rate of the computer lab but also more effectively prevents cheating.

[0092] The second embodiment of this application relates to a computer-based examination scheduling system, the structure of which is as follows: Figure 4 As shown, the computer-based examination scheduling system includes:

[0093] The acquisition unit is used to acquire information about the computer room, exam papers, and examinees.

[0094] The exam scheduling result acquisition unit is used to determine the exam scheduling algorithm based on the computer room information and the candidate information, and to obtain the exam scheduling result based on the exam scheduling algorithm;

[0095] The optimal seating arrangement and test paper distribution scheme determination unit is used to determine the test paper distribution algorithm based on the examination results and test paper information, and to determine the optimal seating arrangement and test paper distribution scheme using the test paper distribution algorithm, wherein the number of adjacent seats for candidates in the same subject is minimized, and the test paper with the highest difference is distributed to the candidates based on the degree of adjacency of the seats for candidates in the same subject.

[0096] The test paper distribution unit is used to distribute test papers to the corresponding computer rooms for each session.

[0097] The first embodiment is a method embodiment corresponding to this embodiment. The technical details in the first embodiment can be applied to this embodiment, and the technical details in this embodiment can also be applied to the first embodiment.

[0098] It should be noted that those skilled in the art should understand that the functions of each module shown in the above-described implementation of the computer-based examination scheduling system can be understood with reference to the relevant description of the aforementioned computer-based examination scheduling method. The functions of each module shown in the above-described implementation of the computer-based examination scheduling system can be implemented by a program (executable instructions) running on a processor, or by specific logic circuits. If the above-described computer-based examination scheduling system is implemented as a software functional module and sold or used as an independent product, it can also be stored in a computer-readable storage medium. Based on this understanding, the technical solution of the embodiments of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, mobile hard drives, read-only memory (ROM), magnetic disks, or optical disks. Thus, the embodiments of this application are not limited to any specific hardware and software combination.

[0099] Accordingly, this application also provides a computer storage medium storing computer-executable instructions, which, when executed by a processor, implement the various method implementations of this application.

[0100] Furthermore, this application also provides a computer-based examination scheduling device, including a memory for storing computer-executable instructions and a processor; the processor is used to implement the steps in the above-described method embodiments when executing the computer-executable instructions in the memory. The processor may be a Central Processing Unit (CPU), or other general-purpose processors, digital signal processors (DSPs), application-specific integrated circuits (ASICs), etc. The aforementioned memory may be read-only memory (ROM), random access memory (RAM), flash memory, hard disk, or solid-state drive, etc. The steps of the methods disclosed in the various embodiments of this invention can be directly implemented by a hardware processor, or implemented by a combination of hardware and software modules in the processor.

[0101] It should be noted that in this patent application, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one" does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes said element. In this patent application, if it refers to performing an action according to an element, it means performing the action at least according to that element, including two cases: performing the action only according to that element, and performing the action according to that element and other elements. Expressions such as "multiple," "repeatedly," and "various" include two, two times, two kinds, and more than two, more than two times, and more than two kinds.

[0102] All documents mentioned in this application are considered to be incorporated in their entirety into the disclosure of this application so that they can serve as a basis for modifications if necessary. Furthermore, it should be understood that after reading the foregoing disclosure of this application, those skilled in the art can make various alterations or modifications to this application, and these equivalent forms also fall within the scope of protection claimed in this application.

Claims

1. A method for exam paper arrangement, characterized in that, The application comprises the following steps: obtaining computer room information, test paper information and examinee information; determining an examination arrangement algorithm based on the computer room information and the examinee information, and obtaining an examination arrangement result based on the examination arrangement algorithm, wherein the examination arrangement algorithm is based on a multi-dimensional soft constraint condition to construct a target function to evaluate the pros and cons of an examination arrangement scheme, and the target function is: wherein, represents the objective function value of the i-th examination arrangement scheme, represents the objective function value of the i-th examination arrangement scheme, represents the machine room utilization rate, represents the examination arrangement rationality, represents the test paper utilization rate, represents the sudden situation coping ability, respectively are corresponding weight values; The machine room utilization rate The calculation method is: in, This represents the total number of computer rooms. The total number of matches. express The computer room is The total number of exam slots allocated for each session. express The computer room is Total number of exam slots for all sessions express The computer room is The availability status of a match; The test arrangement rationality degree The calculation method is: wherein, represents the examination end time, represents the examination start time, represents the examination start time of the session, is the total number of sessions; The test paper utilization rate The calculation method is as follows: wherein, represents the number of sets of test papers provided by the teacher, represents the total number of fields; The burst handling capability The calculation is: wherein represents machine room in the number of tests allocated for each session, the total number of examinees, is the total number of examinees, ; determining a test paper distribution algorithm based on the examination arrangement result and the test paper information, and determining an optimal seat arrangement and test paper distribution scheme by using the test paper distribution algorithm, which comprises the following steps: assigning each test paper to a corresponding examination room for an examination session based on the examination arrangement result, and generating a test paper assignment information table, wherein the test paper assignment information table comprises examination room information, subject information and test paper information; obtaining the number of examination subjects arranged in the computer room for the current examination session based on the test paper assignment information table, and if the number of examination subjects arranged in the computer room is greater than 1, using a disorder algorithm to arrange seats for examinees of different examination subjects to determine a seat arrangement scheme, so as to ensure that the number of examinees of the same subject in adjacent seats is minimized, wherein the adjacent seats include front and back seats, left and right seats, and diagonally opposite seats. disordering the test papers to generate multiple sets of differentiated test papers, calculating the difference degree between the test papers, and distributing the test papers with the largest difference degree to examinees of adjacent seats of the same subject based on the seat arrangement scheme.

2. The method of claim 1, wherein, The step of determining an examination arrangement algorithm based on the computer room information and the examinee information, and obtaining an examination arrangement result based on the examination arrangement algorithm comprises the following sub-steps: randomly generating n initial schemes satisfying the hard constraint condition to form an initial examination arrangement scheme set; constructing a target function based on the multi-dimensional soft constraint condition to evaluate the pros and cons of the initial examination arrangement schemes by using the target function; selecting a candidate examination arrangement scheme set from the initial examination arrangement scheme set based on the target function value, randomly combining the candidate examination arrangement schemes to obtain an updated examination arrangement scheme set, and determining an optimal examination arrangement scheme from the initial examination arrangement scheme set and the updated examination arrangement scheme set based on the target function value as the examination arrangement result.

3. The method of claim 2, wherein, The multi-dimensional soft constraint condition comprises one or any combination of the following: computer room utilization rate, examination arrangement rationality, test paper utilization rate and sudden situation response capability.

4. The method of claim 1, wherein, The step of determining a test paper distribution algorithm based on the examination arrangement result and the test paper information, and determining an optimal seat arrangement and test paper distribution scheme by using the test paper distribution algorithm comprises the following sub-steps: obtaining the above-mentioned examination arrangement result and test paper information, and assigning each test paper to a corresponding examination room for an examination session based on the examination arrangement result to generate a test paper assignment information table, wherein the test paper assignment information table comprises the following information: examination room information, subject information and test paper information; obtaining the number of examination subjects arranged in the computer room for the current examination session based on the test paper assignment information table, wherein if the number of examination subjects arranged in the computer room is greater than 1, first using a disorder algorithm to arrange seats for examinees of different examination subjects to ensure that the number of examinees of the same subject in adjacent seats is minimized; otherwise, directly disordering the test papers.

5. The method of claim 1, wherein, In the step of completing the test paper distribution of each corresponding computer room, reordering the disordered test questions of each test paper based on the test paper distribution scheme and outputting the final test paper distribution result, which is displayed to the examination interface after the examinee logs in.

6. The method of claim 4, wherein, The number of examination subjects arranged in the machine room for the current session is obtained according to the test paper distribution information table, and if the number of examination subjects arranged in the machine room is greater than 1, the examinees of different examination subjects are arranged seats by using a disorder algorithm first; otherwise, the test papers are arranged in disorder directly, including the following sub-steps: The examinees of different examination subjects are arranged seats by using a disorder algorithm to determine a seat arrangement scheme, so as to ensure that the same-subject examinees of adjacent seats are the least; and The test papers are arranged in disorder, the difference degree of the test papers is calculated, and the test papers with the greatest difference degree are distributed to the adjacent-seat examinees of the same subject according to the seat arrangement scheme.

7. A machine examination invigilation system, characterized in that, It comprises: An acquisition unit is configured to acquire machine room information, test paper information, and examinee information; An arrangement result acquisition unit is configured to determine an arrangement algorithm according to the machine room information and the examinee information, and to obtain arrangement results according to the arrangement algorithm, wherein the arrangement algorithm is based on a multi-dimensional soft constraint condition to construct a target function to evaluate the pros and cons of an arrangement scheme, and the target function is as follows: wherein, denotes the objective function value of the th examination arrangement scheme, denotes the room utilization rate, denotes the examination arrangement rationality, denotes the paper utilization rate, denotes the emergency response capability, are the corresponding weight values, respectively. Machine room utilization rate The calculation method is as follows: wherein, is the total number of machine rooms, is the total number of sessions, represents the machine room in the total number of examination seats allocated by the session, represents the total examination seats of the session in the machine room, represents the idle state of the session in the machine room, The test arrangement rationality degree The calculation method is: wherein, represents the examination end time, represents the examination start time, represents the examination start time of the session, is the total number of sessions; The test paper utilization rate The calculation method is as follows: wherein, represents the number of sets of test papers provided by the teacher, represents the total number of fields; The burst handling capability The calculation is as follows: wherein represents Machine room in the number of tests allocated for each session, the total number of examinees, is times the total number of examinees, ; An optimal seat arrangement and test paper distribution scheme determination unit is configured to determine an optimal seat arrangement and test paper distribution scheme according to the arrangement results and the test paper information, and the unit is configured to: distribute each test paper to a corresponding examination machine room for the current session according to the arrangement results to generate a test paper distribution information table containing examination room information, subject information, and test paper information; obtain the number of examination subjects arranged in the machine room for the current session according to the test paper distribution information table, and arrange seats for the examinees of different examination subjects by using a disorder algorithm to determine a seat arrangement scheme when the number of examination subjects arranged in the machine room is greater than 1, so as to ensure that the same-subject examinees of adjacent seats are the least, wherein the adjacent seats include front and back, left and right, and diagonal seats; and arrange the test papers in disorder to generate multiple sets of differentiated test papers, calculate the difference degree between the test papers, and distribute the test papers with the greatest difference degree to the adjacent-seat examinees of the same subject according to the seat arrangement scheme; A test paper distribution unit is configured to complete the distribution of test papers in each corresponding machine room.

8. A machine examination management apparatus characterized by comprising: It comprises: A memory is configured to store computer executable instructions; And A processor is configured to implement the steps in the method of any one of claims 1 to 6 when executing the computer executable instructions.

9. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer executable instructions, and the computer executable instructions are executed by the processor to implement the steps in the method of any one of claims 1 to 6. The computer readable storage medium stores computer executable instructions, and the computer executable instructions are executed by the processor to implement the steps in the method of any one of claims 1 to 6.

Images