CN112200460A - Full-automatic multi-working-mode combined scheduling method - Google Patents

Abstract

The invention discloses a full-automatic multi-working-mode combined scheduling method, which comprises the following steps: the method comprises the following steps: acquiring line basic data and a determined initial driving schedule, wherein the line basic data and the determined initial driving schedule comprise data such as the number of required operation times and operation duration of each shift; step two: classifying and grouping each shift in the initial driving schedule according to the operating time of a driver; step three: determining the working modes of drivers in different groups; step four: and automatically generating a monthly rest table of the driver according to the monthly rest parameters of the driver corresponding to different working modes. According to the invention, the driver rest tables are generated in different groups according to different working modes, parameters such as the number of the rest days of the driver per month and the shortest rest duration during the shift change between two adjacent working days are introduced, and the monthly driver shift scheduling result is automatically generated, so that the automation level of the driver shift scheduling is improved, and the reasonability and the balance of the rest and operation durations of the driver are met.

Description

Full-automatic multi-working-mode combined scheduling method

Technical Field

The invention relates to the field of scheduling methods, in particular to a full-automatic multi-working-mode combined scheduling method.

Background

In the management of bus operation and dispatching, the core of the bus dispatching system is an intelligent bus dispatching system, and the core of the bus dispatching system is the arrangement of vehicles and drivers, which relates to the optimization of resource allocation in various aspects such as people, vehicles, fields, stations, lines and the like. Therefore, the quality of the arrangement results of the vehicles and the drivers and the compiling efficiency directly influence the management capacity and the operation efficiency of the public transportation enterprises. However, most public transport enterprises in China still stay at the level of arranging drivers manually according to the experience of personnel, and the requirements of increasingly developed intelligent buses cannot be met.

The conventional bus scheduling method only has a driving plan, the arrangement of a driver is random, confusion is often caused during actual field execution, various problems such as unbalanced rest time of the driver and the like are caused, and the operation efficiency is seriously influenced, so that the full-automatic multi-working-mode combined scheduling method is provided.

Disclosure of Invention

The technical problem to be solved by the invention is as follows: the method solves the problems that the conventional bus scheduling method only has a driving plan, the arrangement of a driver is random, confusion is often caused during actual field execution, the rest time of the driver is unbalanced, and the like, and provides a full-automatic multi-working-mode combined scheduling method.

The invention solves the technical problems through the following technical scheme, and the invention comprises the following steps:

the method comprises the following steps: acquiring line basic data and a determined initial driving schedule, wherein the line basic data and the determined initial driving schedule comprise data such as the number of required operation times and operation duration of each shift;

step two: classifying and grouping each shift in the initial driving schedule according to the operating time of a driver;

step three: determining the working modes of drivers in different groups;

step four: automatically generating a monthly rest table of the driver according to monthly rest parameters of the driver corresponding to different working modes;

step five: and automatically generating the current shift of each driver every day on the basis of the rest list to form a final driver shift list.

Preferably, the specific treatment process of the step one is as follows:

s1: the driving schedule can be regarded as an m × n matrix, m is the maximum number of shifts, n is the maximum single number, F (i, j) refers to a departure time point F (i, j), an operation duration t (i, j) and a stop time delta (i, j) data set of each shift at a main/auxiliary station in each shift, F (i, j) { F (i, j), t (i, j), delta (i, j) }, i ═ 1,2, …, m; j is 1,2, …, n;

wherein: f (i, j) ≠ phi, which indicates that a data set exists in the row and the column of the i; f (i, j) ═ Φ, which indicates that there is no data set in row i and column j, that is, it is null, and if F (i, j) is null, which indicates that the vehicle is in a stopped operation state, all the data in the data set are null, i ═ 1,2, …, m; j is 1,2, …, n;

s2: according to the actual values in each F (i, j) set, the number c of required operation vehicles of each shift can be calculated_iAnd a required operation time t_iSet of, wherein, c_iIs equal to the sum of the number of all non-empty F (i, j), t_iEqual to the sum of the operating time t (i, j) and the station-stopping time delta (i, j) in all non-empty F (i, j), i being 1,2, …, m; j is 1,2, …, n.

Preferably, the specific processing procedure of classifying and grouping each shift in the original driving schedule according to the required operation duration in the step two is as follows:

first, for satisfying 0 < t_iThe shifts are matched and combined again in the shift less than or equal to 6 hours, the matched shifts need to be taken off line on the same main station and auxiliary station when the combination is matched, the station stop time between the off-line and the on-line meets a certain condition, the shifts which can be matched are grouped and divided according to the following operating time judgment condition, the shifts which cannot be matched can only meet the operating time of 0 < t_iLess than 6 hours, considered as a separate group;

for satisfying 13 ≦ t_iThe shift of less than 20 hours is split from the middle single shift into two different shifts in the morning and afternoon, and the operation time of each split shift basically meets 6 < t_i< 10 hours. Then dividing other original shifts and matched shifts meeting the operation duration condition and the split shifts to meet the condition that t is more than 6_iGroup < 10 hours;

finally satisfying t is more than or equal to 10_iDividing the original shift of less than 13 hours and the matched shift into a group;

the shifts in the schedule will eventually be divided into three groups of different operating duration conditions: grouping 1: 0 < t_iLess than or equal to 6; grouping 2: 6 < t_iLess than 10; grouping 3: t is not less than 10_i＜13。

Preferably, the specific process of determining the operating mode of the driver in the different groups in step three is as follows: grouping 1: 0 < t_i≤6；

The operation time corresponding to each shift in the group is too short, drivers corresponding to the shifts in the group are arranged to take turns for the shifts, namely each driver basically takes a half day of rest in the last half day every day, and no extra rest is provided;

grouping 2: 6 < t_i＜10；

The operation time corresponding to each shift in the group basically meets the standard operation time of each day, all drivers in the group arrange their shift lists according to the condition of having a rest for 3 days each month, which is equivalent to the average operation time of each day being 6 to 9 hours;

grouping 3: t is not less than 10_i＜13；

The operation time corresponding to each shift in the group is longer, all drivers in the group arrange a shift schedule according to the condition of having a 10-day rest in each month, and the average operation time per day is also 6-9 hours.

Preferably, the specific process of automatically generating the monthly rest list of the driver in the fourth step is as follows:

s1: calculating the number of rest people of different groups per day in each month;

suppose that the number of days of rest per month for drivers in different groups u is tau_u，u＝2,3，τ₂＝3，τ₃10. The number of corresponding shifts in different groups is L_uAnd u is 2 and 3. The number of drivers who should have a rest in each group is calculated, and the number of the drivers who should have a rest in each group is assumed to be rho_uThen, the following formula is used to solve the rho_u：(L_u+ρ_u)*τ_u＝30*ρ_uSolving for rho_uRounding to get the number of drivers who have a rest in different groups every day, and getting a number of lines L in each group every month_u+ρ_uNamely: a list of 30 total required driver population in the group;

s2: determining a monthly rest table according to the calculated number of people at rest in different groups every day;

the frame of the initial rest table in different groups is (L)_u+ρ_u) Listing 30, and then starting to build a rest table in each group;

first, starting on day 1 in the group, the number of days of rest on day 1 is ρ_uFirst put ρ in the list_uThe rest day P is placed on the 1 st row from top to bottom, and then the 2 nd day, i.e. the 2 nd row, from the rho_uStarting at line +1, p at day 2_uThe rest days P are sequentially arranged on the 2 nd column, and the 3 rd day, namely the 3 rd column is continued, from the rho th_u+ρ_uStarting at line +1, p at day 3_uThe rest days P are sequentially arranged on the 3 rd row and gradually increased according to the sequenceTo L_u+ρ_uLine, last increase to L for first time_u+ρ_uColumn of rows, assumed to be n₁Column, if the number of days of its rest day P does not satisfy the due rest day ρ_uLet's also be a difference ρ'_uIf it is, then go back to the n-th₁Line 1 of the columns begins to insert the remaining days of rest ρ'_uThen from the n-th₁+1 line from the ρ'_u+1 line begins with the nth₁ρ of +1 day_uThe rest days P are sequentially arranged at the nth₁+1 columns, repeat the above steps until the last column 30;

get the rest table (L) of drivers in different groups in 30 days per month_u+ρ_u) 30, in the rest table, the positions except the rest day P are all empty initially, which indicates that the driver needs the corresponding shift.

Preferably, the specific process of the final driver shift schedule in the step five is as follows:

SS 1: calculating the rest time of the shift change between each shift in different groups every day, and establishing a shift change rest time table;

according to the shift data determined in different groups, the u-th group has L_uThe number of shifts, knowing the starting hours F of each shift in each group_uiAnd end of service time T_uiFor a driver, after finishing one shift and leaving work on the same day, another shift is carried out on the next day, namely, the shift is carried out, a certain rest time is needed in the middle, in order to ensure the balance of the rest time when each driver shifts, a shift rest time table is established, and L is provided_uLine L_uAnd (4) columns.

The head of the row of the turn-over rest time table in each group is each shift in the group and the corresponding ending operation time thereof, and is sorted from late to early according to the ending operation time, the head of the list of the turn-over rest time table is each shift in the group and the corresponding starting operation time thereof, and is sorted from late to early according to the starting operation time, the intersection of each row and column is rest time data, and is the rest time of a driver after one shift is turned over to another shift, namely, the rest time is equal to the difference between the starting operation time of the shift on the next day and the ending operation time of the shift on the same day;

SS 2: searching and matching to obtain the number of the drivers who should go to work every day according to the shift-turning rest time table, and ensuring that the rest time of each driver after shift-turning every day meets the preset condition and is relatively balanced;

on the basis of the rest list with the determined rest day P position in each group, the corresponding shift of the 1 st day in the group is determined firstly, except the rest day P position, the shift is sequentially placed at the empty position of the 1 st column from late to early according to the operation time of each shift end, the shift of the 2 nd day is arranged according to the shift determined on the previous day, and according to the data of the shift-turning rest list, the matching results which meet the shift-turning rest time condition and have relatively balanced rest time after each shift are found. And sequentially matching the data of the shift-changing rest table to obtain the shift of each subsequent row, namely each day, and further obtaining a driver shift schedule.

Compared with the prior art, the invention has the following advantages: the full-automatic multi-working-mode combined scheduling method includes classifying and grouping the number of shifts in an initial driving schedule according to the operating time of a driver, generating a driver rest schedule according to different working modes in different groups, introducing parameters such as the number of days of rest of the driver per month and the shortest rest time when the driver turns over between two adjacent working days, automatically matching and searching scheduling results meeting conditions, automatically generating monthly driver scheduling results, improving the automation level of the driver scheduling, meeting the rationality and balance of the driver rest and operating time, adapting to the diversified scheduling requirements of buses in actual operation, organizing dispersedly operated vehicles by combining and classifying and grouping the initial driving schedule, and comprehensively considering the daily rest time, the daily rest time and the like of the driver based on the grouped driving schedule, Under the condition that the number of days of rest and the operating time per month meet the labor law, the complex multi-target combination optimization problem is modeled and solved, the drivers are reasonably arranged while the passenger flow requirements are met, and the intelligent level of scheduling and scheduling organization of the drivers is improved.

Drawings

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

Detailed Description

The following examples are given for the detailed implementation and specific operation of the present invention, but the scope of the present invention is not limited to the following examples.

As shown in fig. 1, the present embodiment provides a technical solution: a full-automatic multi-working-mode combined scheduling method comprises the following steps:

the method comprises the following steps: acquiring line basic data and a determined initial driving schedule, wherein the line basic data and the determined initial driving schedule comprise data such as the number of required operation times and operation duration of each shift;

step two: classifying and grouping each shift in the initial driving schedule according to the operating time of a driver;

step three: determining the working modes of drivers in different groups;

step four: automatically generating a monthly rest table of the driver according to monthly rest parameters of the driver corresponding to different working modes;

step five: and automatically generating the current shift of each driver every day on the basis of the rest list to form a final driver shift list.

The specific treatment process of the step one is as follows: the format of the original driving schedule is as follows:

s1: the driving schedule can be regarded as an m × n matrix, m is the maximum number of shifts, n is the maximum single number, F (i, j) refers to a departure time point F (i, j), an operation duration t (i, j) and a stop time delta (i, j) data set of each shift at a main/auxiliary station in each shift, F (i, j) { F (i, j), t (i, j), delta (i, j) }, i ═ 1,2, …, m; j is 1,2, …, n;

wherein: f (i, j) ≠ phi, which indicates that a data set exists in the row and the column of the i; f (i, j) ═ Φ, which indicates that there is no data set in row i and column j, that is, it is null, and if F (i, j) is null, which indicates that the vehicle is in a stopped operation state, all the data in the data set are null, i ═ 1,2, …, m; j is 1,2, …, n;

s2: according to the actual values in each F (i, j) set, the number c of required operation vehicles of each shift can be calculated_iAnd a required operation time t_iSet of, wherein, c_iIs equal to the sum of the number of all non-empty F (i, j), t_iEqual to the sum of the operating time t (i, j) and the station-stopping time delta (i, j) in all non-empty F (i, j), i being 1,2, …, m; j is 1,2, …, n.

The specific processing procedure of classifying and grouping each shift in the original driving schedule according to the required operation duration in the step two is as follows:

first, for satisfying 0 < t_iThe shifts are matched and combined again in the shift less than or equal to 6 hours, the matched shifts need to be taken off line on the same main station and auxiliary station when the combination is matched, the station stop time between the off-line and the on-line meets a certain condition, the shifts which can be matched are grouped and divided according to the following operating time judgment condition, the shifts which cannot be matched can only meet the operating time of 0 < t_iLess than 6 hours, considered as a separate group;

for satisfying 13 ≦ t_iThe shift of less than 20 hours is split from the middle single shift into two different shifts in the morning and afternoon, and the operation time of each split shift basically meets 6 < t_i< 10 hours. Then dividing other original shifts and matched shifts meeting the operation duration condition and the split shifts to meet the condition that t is more than 6_iGroup < 10 hours;

finally satisfying t is more than or equal to 10_iDividing the original shift of less than 13 hours and the matched shift into a group;

the shifts in the schedule will eventually be divided into three groups of different operating duration conditions: grouping 1: 0 < t_iLess than or equal to 6; grouping 2: 6 < t_iLess than 10; grouping 3: t is not less than 10_i＜13。

The specific process of determining the working mode of the drivers in the different groups in the step three is as follows: grouping 1: 0 < t_i≤6；

The operation time corresponding to each shift in the group is too short, drivers corresponding to the shifts in the group are arranged to take turns for the shifts, namely each driver basically takes a half day of rest in the last half day every day, and no extra rest is provided;

grouping 2: 6 < t_i＜10；

The operation time corresponding to each shift in the group basically meets the standard operation time of each day, all drivers in the group arrange their shift lists according to the condition of having a rest for 3 days each month, which is equivalent to the average operation time of each day being 6 to 9 hours;

grouping 3: t is not less than 10_i＜13；

The operation time corresponding to each shift in the group is longer, all drivers in the group arrange a shift schedule according to the condition of having a 10-day rest in each month, and the average operation time per day is also 6-9 hours.

The specific process of automatically generating the monthly rest list of the driver in the fourth step is as follows:

s1: calculating the number of rest people of different groups per day in each month (30 days);

suppose that the number of days of rest per month for drivers in different groups u is tau_u，u＝2,3，τ₂＝3，τ₃10. The number of corresponding shifts in different groups is L_uAnd u is 2 and 3. The number of drivers who should have a rest in each group is calculated, and the number of the drivers who should have a rest in each group is assumed to be rho_uThen, the following formula is used to solve the rho_u：(L_u+ρ_u)*τ_u＝30*ρ_uSolving for rho_uRounding to get the number of drivers who have a rest in different groups every day, and getting a number of lines L in each group every month_u+ρ_uNamely: a list of 30 total required driver population in the group;

s2: determining a monthly rest table according to the calculated number of people at rest in different groups every day;

the frame of the initial rest table in different groups is (L)_u+ρ_u) Listing 30, and then starting to build a rest table in each group;

first, starting on day 1 in the group, the number of days of rest on day 1 is ρ_uFirst put ρ in the list_uThe rest day P is placed on the 1 st row from top to bottom, and then the 2 nd day, i.e. the 2 nd row, from the rho_uStarting at line +1, p at day 2_uThe rest days P are sequentially arranged on the 2 nd column, and the 3 rd day, namely the 3 rd column is continued, from the rho th_u+ρ_uStarting at line +1, p at day 3_uThe rest days P are sequentially arranged on the 3 rd row and gradually increased to L according to the sequence_u+ρ_uLine, last increase to L for first time_u+ρ_uColumn of rows, assumed to be n₁Column, if the number of days of its rest day P does not satisfy the due rest day ρ_uLet's also be a difference ρ'_uIf it is, then go back to the n-th₁Line 1 of the columns begins to insert the remaining days of rest ρ'_uThen from the n-th₁+1 line from the ρ'_u+1 line begins with the nth₁ρ of +1 day_uThe rest days P are sequentially arranged at the nth₁+1 columns, repeat the above steps until the last column 30;

get the rest table (L) of drivers in different groups in 30 days per month_u+ρ_u) 30, in the rest table, the positions except the rest day P are all empty initially, which indicates that the driver needs the corresponding shift.

The concrete processing procedure of the final driver shift schedule in the step five is as follows:

SS 1: calculating the rest time of the shift change between each shift in different groups every day, and establishing a shift change rest time table;

according to the shift data determined in different groups, the u-th group has L_uThe number of shifts, knowing the starting hours F of each shift in each group_uiAnd end of service time T_uiFor a driver, after finishing a shift and leaving the shift, another shift is carried out the next day, and the process is carried outThe shift-changing is carried out, a certain rest time is required in the middle, in order to ensure the balance of the rest time when each driver shifts, a shift-changing rest time table is established, and L is provided_uLine L_uAnd (4) columns.

The head of the row of the turn-over rest time table in each group is each shift in the group and the corresponding ending operation time thereof, and is sorted from late to early according to the ending operation time, the head of the list of the turn-over rest time table is each shift in the group and the corresponding starting operation time thereof, and is sorted from late to early according to the starting operation time, the intersection of each row and column is rest time data, and is the rest time of a driver after one shift is turned over to another shift, namely, the rest time is equal to the difference between the starting operation time of the shift on the next day and the ending operation time of the shift on the same day;

SS 2: searching and matching to obtain the number of the drivers who should go to work every day according to the shift-turning rest time table, and ensuring that the rest time of each driver after shift-turning every day meets the preset condition and is relatively balanced;

on the basis of the rest list with the determined rest day P position in each group, the corresponding shift of the 1 st day in the group is determined firstly, except the rest day P position, the shift is sequentially placed at the empty position of the 1 st column from late to early according to the operation time of each shift end, the shift of the 2 nd day is arranged according to the shift determined on the previous day, and according to the data of the shift-turning rest list, the matching results which meet the shift-turning rest time condition and have relatively balanced rest time after each shift are found. And sequentially matching the data of the shift-changing rest table to obtain the shift of each subsequent row, namely each day, and further obtaining a driver shift schedule.

Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present invention, "a plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.

In the description herein, references to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.

Although embodiments of the present invention have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present invention, and that variations, modifications, substitutions and alterations can be made to the above embodiments by those of ordinary skill in the art within the scope of the present invention.

Claims (6)

1. A full-automatic multi-working-mode combined scheduling method is characterized by comprising the following steps:

the method comprises the following steps: acquiring line basic data and a determined initial driving schedule, wherein the line basic data and the determined initial driving schedule comprise data such as the number of required operation times and operation duration of each shift;

step two: classifying and grouping each shift in the initial driving schedule according to the operating time of a driver;

step three: determining the working modes of drivers in different groups;

step four: automatically generating a monthly rest table of the driver according to monthly rest parameters of the driver corresponding to different working modes;

step five: and automatically generating the current shift of each driver every day on the basis of the rest list to form a final driver shift list.

2. The method of claim 1, wherein the method comprises: the specific treatment process of the step one is as follows:

s1: the driving schedule can be regarded as an m × n matrix, m is the maximum number of shifts, n is the maximum single number, F (i, j) refers to a departure time point F (i, j), an operation duration t (i, j) and a stop time delta (i, j) data set of each shift at a main/auxiliary station in each shift, F (i, j) { F (i, j), t (i, j), delta (i, j) }, i ═ 1,2, …, m; j is 1,2, …, n;

wherein: f (i, j) ≠ phi, which indicates that a data set exists in the row and the column of the i; f (i, j) ═ Φ, which indicates that there is no data set in row i and column j, that is, it is null, and if F (i, j) is null, which indicates that the vehicle is in a stopped operation state, all the data in the data set are null, i ═ 1,2, …, m; j is 1,2, …, n;

s2: according to the actual values in each F (i, j) set, the number c of required operation vehicles of each shift can be calculated_iAnd a required operation time t_iSet of, wherein, c_iIs equal to the sum of the number of all non-empty F (i, j), t_iEqual to the sum of the operating time t (i, j) and the station-stopping time delta (i, j) in all non-empty F (i, j), i being 1,2, …, m; j is 1,2, …, n.

3. The method of claim 1, wherein the method comprises: the specific processing procedure of classifying and grouping each shift in the original driving schedule according to the required operation duration in the step two is as follows:

first, for satisfying 0 < t_iThe shifts are matched and combined again in the shift less than or equal to 6 hours, the matched shifts need to be taken off line on the same main station and auxiliary station when the combination is matched, the station stop time between the off-line and the on-line meets a certain condition, the shifts which can be matched are grouped and divided according to the following operating time judgment condition, the shifts which cannot be matched can only meet the operating time of 0 < t_iLess than 6 hours, considered as a separate group;

for satisfying 13 ≦ t_iThe shift of less than 20 hours is split from the middle single shift into two different shifts in the morning and afternoon, and the operation time of each split shift basically meets 6 < t_i< 10 hours. Then dividing other original shifts and matched shifts meeting the operation duration condition and the split shifts to meet the condition that t is more than 6_iGroup < 10 hours;

finally satisfying t is more than or equal to 10_iDividing the original shift of less than 13 hours and the matched shift into a group;

the shifts in the schedule will eventually be divided into three groups of different operating duration conditions: grouping 1: 0 < t_iLess than or equal to 6; grouping 2: 6 < t_iLess than 10; grouping 3: t is not less than 10_i＜13。

4. The method of claim 1, wherein the method comprises: the specific process of determining the working mode of the drivers in the different groups in the step three is as follows:

grouping 1: 0 < t_i≤6；

The operation time corresponding to each shift in the group is too short, drivers corresponding to the shifts in the group are arranged to take turns for the shifts, namely each driver basically takes a half day of rest in the last half day every day, and no extra rest is provided;

grouping 2: 6 < t_i＜10；

The operation time corresponding to each shift in the group basically meets the standard operation time of each day, all drivers in the group arrange their shift lists according to the condition of the preset days of rest of each month, which is equivalent to the average operation time of each day being 6 to 9 hours;

grouping 3: t is not less than 10_i＜13；

The operation time corresponding to each shift in the group is longer, all drivers in the group arrange a shift schedule according to the condition of having a rest for a preset day every month, and the average operation time per day is also 6 to 9 hours.

5. The method of claim 1, wherein the method comprises: the specific process of automatically generating the monthly rest list of the driver in the fourth step is as follows:

s1: calculating the number of rest people of different groups per day in each month;

suppose that the number of days of rest per month for drivers in different groups u is tau_u，u＝2,3，τ₂＝3，τ₃10. The number of corresponding shifts in different groups is L_uAnd u is 2 and 3. The number of drivers who should have a rest in each group is calculated, and the number of the drivers who should have a rest in each group is assumed to be rho_uThen, the following formula is used to solve the rho_u：(L_u+ρ_u)*τ_u＝30*ρ_uSolving for rho_uRounding to get the number of drivers who have a rest in different groups every day, and getting a number of lines L in each group every month_u+ρ_uNamely: a list of 30 total required driver population in the group;

s2: determining a monthly rest table according to the calculated number of people at rest in different groups every day;

the frame of the initial rest table in different groups is (L)_u+ρ_u) Listing 30, and then starting to build a rest table in each group;

first, starting on day 1 in the group, the number of days of rest on day 1 is ρ_uFirst put ρ in the list_uThe rest day P is placed on the 1 st row from top to bottom, and then the 2 nd day, i.e. the 2 nd row, from the rho_uStarting at line +1, p at day 2_uThe rest days P are sequentially arranged on the 2 nd column, and the 3 rd day, namely the 3 rd column is continued, from the rho th_u+ρ_uStarting at line +1, p at day 3_uThe rest days P are sequentially arranged on the 3 rd row and gradually increased to L according to the sequence_u+ρ_uLine, last increase to L for first time_u+ρ_uColumn of rows, assumed to be n₁Column, if the number of days of its rest day P does not satisfy the due rest day ρ_uLet's also be a difference ρ'_uIf it is, then go back to the n-th₁Line 1 of the columns begins to insert the remaining days of rest ρ'_uThen from the n-th₁+1 line from the ρ'_u+1 line begins with the nth₁ρ of +1 day_uThe rest days P are sequentially arranged at the nth₁+1 columns, repeat the above steps until the last column 30;

get the rest table (L) of drivers in different groups in 30 days per month_u+ρ_u) 30, in the rest table, the positions except the rest day P are all empty initially, which indicates that the driver needs the corresponding shift.

6. The method of claim 1, wherein the method comprises: the concrete processing procedure of the final driver shift schedule in the step five is as follows:

SS 1: calculating the rest time of the shift change between each shift in different groups every day, and establishing a shift change rest time table;

according to the shift data determined in different groups, the u-th group has L_uThe number of shifts, knowing the starting hours F of each shift in each group_uiAnd end of service time T_uiFor a driver, after finishing one shift and leaving work on the same day, another shift is carried out on the next day, namely, the shift is carried out, a certain rest time is needed in the middle, in order to ensure the balance of the rest time when each driver shifts, a shift rest time table is established, and L is provided_uLine L_uAnd (4) columns.

The head of the row of the turn-over rest time table in each group is each shift in the group and the corresponding ending operation time thereof, and is sorted from late to early according to the ending operation time, the head of the list of the turn-over rest time table is each shift in the group and the corresponding starting operation time thereof, and is sorted from late to early according to the starting operation time, the intersection of each row and column is rest time data, and is the rest time of a driver after one shift is turned over to another shift, namely, the rest time is equal to the difference between the starting operation time of the shift on the next day and the ending operation time of the shift on the same day;

SS 2: searching and matching to obtain the number of the drivers who should go to work every day according to the shift-turning rest time table, and ensuring that the rest time of each driver after shift-turning every day meets the preset condition and is relatively balanced;

on the basis of the rest list with the determined rest day P position in each group, the corresponding shift of the 1 st day in the group is determined firstly, except the rest day P position, the shift is sequentially placed at the empty position of the 1 st column from late to early according to the operation time of each shift end, the shift of the 2 nd day is arranged according to the shift determined on the previous day, and according to the data of the shift-turning rest list, the matching results which meet the shift-turning rest time condition and have relatively balanced rest time after each shift are found. And sequentially matching the data of the shift-changing rest table to obtain the shift of each subsequent row, namely each day, and further obtaining a driver shift schedule.

Images