School priority parallel volunteer optimization method based on order

Abstract

The invention discloses a school priority parallel volunteer optimization method based on order, which comprises the following steps of: making a table 1 according to the number of files and the lowest file score of each college in the batch in the region in the last year and the file progressive order of each college calculated from high to low according to the lowest file score; obtaining the enrollment plan number of each college in the batch in the region in the current year to generate an enrollment plan table 2 of the batch in the current year in the region, forming a table 3 according to the table 1 and the table 2, and automatically generating a first identification line and a second identification line according to the score order of examinees; the first identification line and the second identification line divide the table 3 into a punching area, a stable area and a preservation area in sequence from high to low; setting a volunteer quantity proportion according to a: b: c, and respectively selecting volunteer schools from a rushing area, a stable area and a guarantee area. Through the method, the students can be helped to select proper volunteer schools, and the students are prevented from missing the favorite volunteer schools.

Description

Technical Field

[0001] The present invention relates to the technical field of college entrance examination volunteer filling, and more precisely, to a method for preferentially selecting parallel volunteers with school priority based on rankings. Background Art

[0003] Filling in college entrance examination volunteers is a process in which Chinese college entrance examination candidates, after the release of their examination scores, select the colleges and majors they hope to be admitted to according to their scores and interests. Candidates usually fill in their volunteers within the specified time through the college entrance examination volunteer filling system according to certain rules and procedures. Filling in college entrance examination volunteers is an important link in the college entrance examination admission process and has a significant impact on the candidates' further education and future development.

[0004] In order to solve or optimize the problems that college entrance examination candidates cannot fully understand the information of the selected volunteers when filling in their volunteers, have a regretful mentality after enrollment, and cannot fully understand their own ability needs and personality needs, the research of this invention was carried out. Summary of the Invention

[0005] The technical problem to be solved by the present invention is to provide a method for preferentially selecting parallel volunteers with school priority based on rankings, through which students can be helped to select appropriate volunteer schools and avoid missing their favorite volunteer schools.

[0006] The technical solution of the present invention is to provide a method for preferentially selecting parallel volunteers with school priority based on rankings, including the following steps:

[0007] S1. Obtain the filing number and the lowest filing score of each college in this region and this batch in the previous year, and calculate the cumulative filing rankings of each college from high to low according to the lowest filing score to form Table 1;

[0008] S2. Obtain the enrollment plan numbers of each college in this region and this batch in the current year, and generate the enrollment plan table 2 for this region and this batch in the current year;

[0009] S3. Based on the ranking from high to low of the lowest filing scores in the previous year, generate Table 3 according to Table 1 and Table 2. The said Table 3 is a comprehensive table of college enrollment admission information, which contains the admission information of each college in the previous year and the enrollment data in the current year;

[0010] S4. Input the candidate's ranking into Table 3, compare the candidate's ranking with the cumulative filing rankings in the previous year. When the candidate's ranking is within a certain cumulative filing ranking interval in the previous year, form a first identification line; compare the candidate's ranking with the cumulative number of enrollment plans in the current year. When the candidate's ranking is within a certain cumulative number of enrollment plan interval in the current year, form a second identification line; the said first identification line and second identification line divide Table 3 from high to low into a rush zone, a stable zone, and a guarantee zone in sequence;

[0011] S5. Set the ratio of the number of volunteers as a:b:c, and select volunteer schools from the rush zone, stable zone, and safety zone respectively.

[0012] After adopting the above structure, the method for preferentially selecting parallel volunteers for schools based on ranks in the present invention has the following advantages compared with the prior art:

[0013] Since the method for preferentially selecting parallel volunteers for schools based on ranks in the present invention makes a table 1 of the number of students admitted to each college in this region and batch in the previous year and the lowest admission score, and calculates the cumulative admission ranks of each college from high to low according to the lowest admission score. Generate the admission plan table 2 of each college in this region and batch in this year, then form table 3 based on table 1 and table 2, and then automatically generate the first identification line and the second identification line according to the student's score rank. The first identification line and the second identification line divide table 3 into a rush zone, a stable zone, and a safety zone from high to low in sequence; Set the ratio of the number of volunteers as a:b:c, and select volunteer schools from the rush zone, stable zone, and safety zone respectively. Through the above method, it can help students select suitable volunteer schools and avoid missing the desired volunteer schools.

[0014] As an improvement, in step S1, specifically, the number of students admitted to each college and the lowest admission score are automatically retrieved from the admission score statistical table of this region in the previous year.

[0015] As an improvement, in step S1, the specific way to form table 1 is as follows: Assume there are a total of M colleges. is the lowest admission score of college i in year j, where i = 1···M, j = 0, 1; when j = 0, represents the lowest admission score of college i in the previous year; when j = 1, represents the lowest admission score of college i in this year; is the number of students admitted to college i in year j, where i = 1···M, j = 0, 1; when j = 0, represents the number of students admitted to college i in the previous year; when j = 1, represents the admission plan number of college i in this year;

[0016] When j = 0, obtain the lowest admission score of each college in the previous year Number of students admitted where i = 1···M, calculate the cumulative admission ranks of each college from high to low according to the lowest admission score

[0017]

[0018] After adopting this structure, table 1 can be automatically generated, and the formation of the table is more efficient. ​

[0019] As an improvement, in step S2, specifically, the college enrollment data is obtained from official sources such as provincial and autonomous region education examination authorities.

[0020] As an improvement, in step S3, the specific way to form Table 3 is as follows: Based on the sorting of the minimum filing scores of each college in the previous year from high to low, merge Table 1 and Table 2 to form Table 3. Add a new column to Table 3. When j = 1, obtain the enrollment plan number of each college in the current year where i = 1···M, calculate the cumulative enrollment plan number of each college in the current year from high to low according to the minimum filing score in the previous year and fill it into the newly added column of Table 3: and fill it into the newly added column of Table 3: and fill it into the newly added column of Table 3:

[0021]

[0022] After adopting this structure, Table 3 can be automatically generated, and the formation of the table is more efficient.

[0023] As an improvement, in step S4, let the rank of a certain candidate this year be x. When then there is a first identification line: When then there is a second identification line:

[0024] When the row number of Y0 < the row number of Y1, that is, the first identification line is higher than the second identification line, then the first identification line is the upper line for volunteer application, and the second identification line is the lower line for volunteer application, and the enrollment in this batch this year increases;

[0025] When the row number of Y0 > the row number of Y1, that is, the first identification line is lower than the second identification line, then the first identification line is the lower line for volunteer application, and the second identification line is the upper line for volunteer application, and the enrollment in this batch this year decreases;

[0026] When the row number of Y0 = the row number of Y1, that is, the first identification line is equal to the second identification line, then the enrollment in this batch this year is similar to that of the previous year, and the preferred volunteers of the previous year are referred to.

[0027] After adopting this structure, the first identification line and the second identification line can be automatically generated. Through the first identification line and the second identification line, the changes in this year's enrollment can be judged, which helps candidates obtain more information when filling in volunteer schools.

[0028] As an improvement, in step S5, let the number of volunteer schools that the candidate can apply for be N, and set the number of volunteer schools in the rush zone, stable zone, and guarantee zone according to a certain ratio. Among them, the ratio of the number of volunteer schools in the rush zone: the number of volunteer schools in the stable zone: the number of volunteer schools in the guarantee zone = a:b:c. Then the number of volunteer schools that can be applied for in the rush zone is For the convenience of calculation, let a + b + c = 10, then the number of volunteer schools that can be reported in the rush zone is

[0029] The steps for selecting volunteer schools in the rush zone are as follows:

[0030] For the college i in the rush zone, there are three indicators: ① The number of enrollment plans this year ② The increase in the number of enrollment plans compared to the previous year ③ The cumulative number T of the enrollment plans of this college i 1 The distance from the candidate's ranking x

[0031] Set the weights of these three indicators as w1, w2, and w3 respectively, and w1 + w2 + w3 = 1.

[0032] Then there is

[0033]

[0034] Among them, y i Is the weighted total score of college i on these three indicators;

[0035] For other indicators such as the candidate's designated colleges and schools with only 1 - 2 enrollment plans, the candidate can consider and choose by himself; let ① The number of the candidate's designated colleges be n1 ② The number of schools with only 1 - 2 enrollment plans be n2; (n1, n2 can be 0)

[0036] Sort y i From large to small, and the candidate can select the first i From Schools as the rush zone proposed volunteer colleges.

[0037] After adopting this structure, it can automatically generate the volunteer filling area, reduce the difficulty of filling volunteer schools, increase the admission probability of volunteer schools, and can more accurately help students choose suitable volunteer schools.

[0038] As an improvement, it also includes step S6: Check the rationality of the volunteer school plan form. Let the progressive ranking recovery rate coefficient this year be r1 and the progressive ranking recovery rate coefficient of the previous year be r0, then Among them Is the total number of enrollment plans this year; Among them Is the total number of previous year's admissions;

[0039] If r1 < r0, it is reasonable; otherwise, it is unreasonable and the above steps should be repeated.

[0040] After adopting this structure, it can check the rationality of the volunteer school plan form and further improve the accuracy of filling volunteer schools. Detailed implementation manners

[0041] To better understand the present application, more detailed descriptions will be made for various aspects of the present application. It should be understood that these detailed descriptions are only descriptions of exemplary implementation manners of the present application, and do not limit the scope of the present application in any way.

[0043] It should also be understood that the terms "include", "comprise", "have", "contain", and "contain with", when used in this specification, indicate the presence of the described features, wholes, steps, operations, elements, and / or components, but do not exclude the presence or addition of one or more other features, wholes, steps, operations, elements, components, and / or combinations thereof.

[0044] The present application discloses a method for preferentially selecting parallel volunteer of schools based on ranking, including the following steps:

[0045] S1. Obtain the filing number and the lowest filing score of each college in this region and this batch in the previous year. Specifically, from the filing score statistical table of this region in the previous year, automatically capture the filing number and the lowest filing score of each college. And calculate the progressive ranking of each college according to the lowest filing score from high to low to form Table 1. The specific manner of forming Table 1 is as follows:

[0046] Suppose there are a total of M colleges. is the lowest filing score of college i in year j, where i = 1···M, j = 0, 1; when j = 0, represents the lowest filing score of college i in the previous year; when j = 1, represents the lowest filing score of college i in this year; is the filing number of college i in year j, where i = 1···M, j = 0, 1; when j = 0, represents the filing number of college i in the previous year; when j = 1, represents the enrollment plan number of college i in this year;

[0047] When j = 0, obtain the lowest filing score of each college in the previous year Filing number where i = 1···M, calculate the progressive ranking of each college according to the lowest filing score from high to low

[0048]

[0049] S2. Obtain the enrollment plan number of each college in this region and this batch in this year. Specifically, obtain college enrollment data from official sources such as provincial and autonomous region education examination institutes. Generate the enrollment plan table 2 of this region and this batch in this year.

[0050] S3. Taking the ranking from high to low of the lowest admission scores of the previous year as the benchmark, generate Table 3 according to Table 1 and Table 2. The said Table 3 is a comprehensive table of college enrollment admission information, which includes the admission information of each college in the previous year and the enrollment data of this year. The specific way to form Table 3 is as follows:

[0051] Taking the lowest admission scores of each college in the previous year as the benchmark, merge Table 1 and Table 2 to form Table 3. Add a new column in Table 3. When j = 1, obtain the enrollment plan number of each college in this year where i = 1···M, calculate the cumulative enrollment plan number of each college in this year from high to low according to the lowest admission score of the previous year and fill it into the newly added column of Table 3:

[0052]

[0053] S4. Input the candidate's ranking in Table 3, compare the candidate's ranking with the cumulative admission ranking of the previous year, and form the first identification line when the candidate's ranking is in a certain cumulative admission ranking interval of the previous year; compare the candidate's ranking with the cumulative enrollment plan number of this year, and form the second identification line when the candidate's ranking is in a certain cumulative enrollment plan number interval of this year; the said first identification line and second identification line divide Table 3 from high to low into the rush zone, the stable zone and the safe zone in turn.

[0054] Suppose a candidate's ranking this year is x, when then there is the first identification line: When then there is the second identification line:

[0055] When the row number of Y0 < the row number of Y1, that is, the first identification line is higher than the second identification line, then the first identification line is the upper line for volunteer application, the second identification line is the lower line for volunteer application, and the enrollment of this batch of students this year increases;

[0056] When the row number of Y0 > the row number of Y1, that is, the first identification line is lower than the second identification line, then the first identification line is the lower line for volunteer application, the second identification line is the upper line for volunteer application, and the enrollment of this batch of students this year decreases;

[0057] When the row number of Y0 = the row number of Y1, that is, the first identification line is equal to the second identification line, then the enrollment of this batch of students this year is similar to that of the previous year, and refer to the preferred volunteers of the previous year.

[0058] ​S5. Let the number of available volunteer options for the candidate be N. Set the number of volunteer options in the aggressive zone, stable zone, and safe zone according to a certain ratio. Among them, the ratio of the number of volunteer options in the aggressive zone: the number of volunteer options in the stable zone: the number of volunteer options in the safe zone = a:b:c. Then the number of available volunteer options in the aggressive zone is For the convenience of calculation, let a + b + c = 10. Then the number of available volunteer options in the aggressive zone is

[0059] The steps for selecting volunteer schools in the aggressive zone are as follows:

[0060] For the college i in the aggressive zone, there are three indicators: ① The number of enrollment plans this year ② The increase in the number of enrollment plans compared to the previous year ③ The cumulative enrollment plan number T of this college i 1 The distance from the candidate's ranking x

[0061] Set the weights of these three indicators as w1, w2, and w3 respectively, and w1 + w2 + w3 = 1.

[0062] Then there is

[0063]

[0064] Among them, y i Is the weighted total score of college i on these three indicators;

[0065] For other indicators such as the schools designated by the candidate himself and the schools with only 1 - 2 enrollment plans, the candidate can make a decision at his own discretion. Let ① The number of schools designated by the candidate himself be n1 ② The number of schools with only 1 - 2 enrollment plans be n2; (n1, n2 can be 0)

[0066] Sort y i From largest to smallest. The candidate can select the first i Among them Schools as the proposed volunteer colleges in the aggressive zone.

[0067] S6. Check the rationality of the volunteer school plan table. Let the progressive ranking recovery rate coefficient this year be r1 and the progressive ranking recovery rate coefficient of the previous year be r0. Then Among them Is the total number of enrollment plans this year; Among them Is the total number of candidates admitted in the previous year;

[0068] If r1 < r0, it is reasonable; otherwise, it is unreasonable and the above steps should be repeated.

[0069] The following takes Duomou as an example for specific illustration. Duomou is a candidate from Xinjiang, with a total score of 554 points and a ranking of 300. Through the method for preferentially selecting parallel volunteer schools based on ranking in the present invention, the volunteer schools are preferentially selected through the following steps:

[0070] S1. Obtain the filing number and the lowest filing score of each college in this region and for this batch in the previous year. Specifically, from the filing score statistical table of this region in the previous year, automatically capture the filing number and the lowest filing score of each college. And calculate the cumulative filing ranking of each college from high to low according to the lowest filing score, and form

[0071] Table 1. The formed Table 1 is as follows:

[0072]

[0073]

[0074]

[0075]

[0076]

[0077]

[0078]

[0079] S2. Obtain the enrollment plan number of each college in this region and for this batch in the current year, and generate the enrollment plan table 2 for this region and for this batch in the current year. Table 2 is as follows:

[0080]

[0081]

[0082]

[0083]

[0084]

[0085]

[0086] S3. Based on the ranking from high to low of the lowest filing score in the previous year as the benchmark, generate Table 3 according to Table 1 and Table 2. The said Table 3 is a comprehensive table of college enrollment admission information, and this table includes the admission information of each college in the previous year and the enrollment data in the current year. Table 3 is as follows:

[0087]

[0088]

[0089]

[0090]

[0091]

[0092]

[0093] S4. Input the candidate's rank in Table 3, compare the candidate's rank with the cumulative admission rank of the previous year. When the candidate's rank is within a certain cumulative admission rank range of the previous year, form a first identification line; compare the candidate's rank with the cumulative number of this year's enrollment plan. When the candidate's rank is within a certain cumulative number range of this year's enrollment plan, form a second identification line; the above-mentioned first identification line and second identification line divide Table 3 into a rush zone, a stable zone, and a safety zone from high to low in sequence, and the rush zone, stable zone, and safety zone are respectively reflected in Table 3.

[0094] S5. Set the proportion of the number of volunteers as a:b:c, select volunteer schools from the rush zone, stable zone, and safety zone respectively, and form Table 4 as the volunteer form. Table 4 is as follows:

[0095]

[0096] When the candidate selects a volunteer school from Table 4, the probability of admission will be greatly improved, which can help students select suitable volunteer schools and avoid missing the desired volunteer schools.

[0097] The present invention is not limited to the above-mentioned best implementation manner. Any person can obtain other various forms of products under the inspiration of the present invention. However, no matter what changes are made in its shape or structure, as long as it has a technical solution identical or similar to the present application, it falls within the protection scope of the present invention.

Claims

1. A method for preferentially selecting parallel voluntary applications of schools based on ranking, characterized in that, It includes the following steps: S1. Obtain the filing numbers and the lowest filing scores of each university in this batch in this region in the previous year, and calculate the cumulative filing ranks of each university from high to low according to the lowest filing scores to form Table 1; S2. Obtain the enrollment plan numbers of each university in this batch in this region in the current year, and generate the enrollment plan table 2 of this batch in this region in the current year; S3. Based on the sorting from high to low of the lowest filing scores in the previous year as the benchmark, generate Table 3 according to Table 1 and Table 2. The said Table 3 is the comprehensive table of college enrollment admission information, which contains the admission information of each university in the previous year and the enrollment data in the current year; S4. Input the candidate rank in Table 3, compare the candidate rank with the cumulative filing rank in the previous year. When the candidate rank is in a certain cumulative filing rank interval in the previous year, form the first identification line; compare the candidate rank with the cumulative number of the enrollment plan in the current year. When the candidate rank is in a certain cumulative number interval of the enrollment plan in the current year, form the second identification line; the said first identification line and second identification line divide Table 3 into a rush zone, a stable zone and a guarantee zone from high to low in turn; S5. Set the proportion of the number of volunteers as a:b:c, and select volunteer schools from the rush zone, the stable zone and the guarantee zone respectively.

2. The method for preferentially selecting parallel volunteer of schools based on ranking according to claim 1, characterized in that In step S1, specifically, the filing numbers and the lowest filing scores of each university in this batch are automatically captured from the filing score statistical table of this region in the previous year.

3. The method for preferentially selecting parallel volunteer of schools based on ranking according to claim 1, characterized in that In step S1, the specific way to form Table 1 is as follows: Suppose there are a total of M universities. is the lowest admission score of university i in year j, where i = 1 ··· M, j = 0, 1; when j = 0, represents the lowest admission score of university i in the previous year; When j = 1, represents the lowest admission score of university i this year; is the number of admitted students of university i in year j, where i = 1···M, j = 0, 1; when j = 0, represents the number of admitted students of university i in the previous year; When j = 1, represents the enrollment plan number of college i this year; When j = 0, obtain the lowest admission score of each university in the previous year Number of admitted students Where i = 1 ··· M, calculate the cumulative admission ranking of each university according to the lowest admission score From high to low 4. The method for preferentially selecting parallel volunteer of schools based on ranking according to claim 1, wherein In step S2, specifically, the college enrollment data is obtained from official sources such as provincial and autonomous region education examination institutes.

5. The method for preferentially selecting parallel volunteer of schools based on ranking according to claim 1, wherein In step S3, the specific way to form Table 3 is as follows: Based on the minimum filing scores of each college in the previous year Taking the ranking from high to low as the benchmark, Table 1 and Table 2 are merged to form Table 3. Add a new column to Table 3. When j = 1, obtain the enrollment plan numbers of each university in the current year where i = 1 ··· M, according to the lowest filing score of the previous year Calculate the cumulative enrollment plan numbers of each university in the current year from high to low And fill them into the new column of Table 3:

6. The method for preferentially selecting parallel volunteer of schools based on ranking according to claim 5, wherein In step S4, let the ranking of a certain candidate this year be x. When then there is a first identification line: When When there is a second identification line: When the row number of Y0 < the row number of Y1, that is, the first identification line is higher than the second identification line, then the first identification line is the upper line for volunteer application, the second identification line is the lower line for volunteer application, and the enrollment in this batch in the current year increases; When the row number of Y0 > the row number of Y1, that is, the first identification line is lower than the second identification line, then the first identification line is the lower line for volunteer application, the second identification line is the upper line for volunteer application, and the enrollment in this batch in the current year decreases; When the row number of Y0 = the row number of Y1, that is, the first identification line is equal to the second identification line, then the enrollment in this batch in the current year is similar to that in the previous year, and the preferred volunteers are referred to those in the previous year.

7. The method for preferentially selecting parallel voluntary applications of schools based on ranking according to claim 1, wherein In step S5, assume the number of volunteer options available to the candidate is N, and set the number of volunteer options in the aggressive zone, stable zone, and protective zone according to a certain ratio. Among them, the ratio of the number of volunteer options in the aggressive zone: the number of volunteer options in the stable zone: the number of volunteer options in the protective zone = a:b:c. Then the number of volunteer options available in the aggressive zone is For the convenience of calculation, it can be assumed that a + b + c = 10. Then the number of volunteer options available in the aggressive zone is The steps for selecting volunteer schools in the rush zone are as follows: For the college \(i\) in the buffer zone, there are three indicators: ① The number of this year's enrollment plan ② The increased number of enrollment plans compared with the previous year ③ The progressive number \(T\) of the college's enrollment plan i 1 The distance from the candidate's ranking \(x\) Set the weights of these three indicators as w1, w2, and w3 respectively, and w1 + w2 + w3 = 1, then there is Among them, y i is the weighted total score of university i on these three indicators; For other indicators, such as the schools designated by the candidates themselves and those with an enrollment plan of only 1 or 2 students, the candidates shall make their own discretion; let ① the number of schools designated by the candidates themselves be n1, and ② the number of schools with an enrollment plan of only 1 or 2 students be n2; (n1 and n2 can be 0). Sort y i in descending order, and the candidates can select from y i the first schools as the target institutions for the aspirational application of college entrance examination.

8. The method for preferentially selecting parallel voluntary applications of schools based on rankings according to claim 7, characterized in that, It also includes step S6 of verifying the rationality of the volunteer school plan form. Let the progressive ranking recovery rate coefficient this year be r1 and the progressive ranking recovery rate coefficient last year be r0. Then where is the total enrollment plan number this year; where is the total number of last year's archives. If r1 < r0, it is reasonable; otherwise, it is unreasonable, and the above steps should be repeated.

Images