CN112966842A

CN112966842A - Subway vehicle maintenance plan automatic generation method based on time slice segmentation

Info

Publication number: CN112966842A
Application number: CN202110330769.XA
Authority: CN
Inventors: 谢飞; 刘荣峰; 钱江; 周庭梁; 杨辉; 李鸿毛; 蒋远
Original assignee: Casco Signal Cherngdu Ltd
Current assignee: Casco Signal Cherngdu Ltd
Priority date: 2021-03-29
Filing date: 2021-03-29
Publication date: 2021-06-15

Abstract

The invention discloses a subway vehicle maintenance plan automatic generation method based on time slice segmentation, which belongs to the technical field of railway traffic vehicle maintenance and comprises an initialization step, a validity checking step and a maintenance plan generation step, so that the defect of relying on manual planning in the prior art can be effectively overcome, the subway vehicle maintenance plan automatic generation method can be uniformly distributed in a period, a maintenance team can be guaranteed to obtain sufficient rest time, the operability of maintenance plan scheduling is enhanced, the continuity of a balance maintenance task can be guaranteed, the maintenance days of balance maintenance of different maintenance times are different from 1 to 3 days, the maintenance days exceeding 2 days need to be guaranteed to be continuously executed, the scheduling conflict which cannot be automatically identified in the manual planning process can be solved, and the scheduling constraint can be met by the arrangement of the maintenance task.

Description

Subway vehicle maintenance plan automatic generation method based on time slice segmentation

Technical Field

The invention relates to the technical field of maintenance of rail transit vehicles, in particular to a subway vehicle maintenance plan automatic generation method based on time slice segmentation.

Background

In recent years, with the rapid development of urban rail transit in China, higher requirements are put forward on the overhaul and application work efficiency of the metro vehicles to a certain extent, so that the metro vehicles develop towards a more intelligent direction, and therefore, how to more efficiently and reasonably compile the overhaul plan of the metro vehicles is one of the core problems for researching the improvement of the overhaul work efficiency of the vehicles.

In the existing subway vehicle operation and maintenance process, maintenance scheduling personnel manually arrange an annual maintenance plan and a monthly maintenance plan mainly according to the running kilometers of the vehicle, the operation time and the like, in the annual and monthly maintenance scheduling, balanced maintenance is an important maintenance schedule, the train maintenance schedule is optimized and integrated on the basis of fully evaluating the reliability of the train and the fault period of parts, the maintenance and parking time of the train is effectively shortened, the utilization rate and the operation reliability of the train are improved to a certain extent, and therefore the reasonable arrangement of balanced maintenance tasks plays a key role in improving the current subway vehicle maintenance work efficiency.

However, the existing subway vehicle maintenance planning process mainly has the following problems:

(1) at present, the planning of the vehicle maintenance plan mainly depends on manual work to arrange the planned maintenance date of the train according to the running kilometers and the application time of the vehicle and the relevant constraint of the balanced maintenance process, thereby forming the annual and monthly maintenance plan of the vehicle. The manual compiling mode has the defects of complex process, unreasonable arrangement, easy error result, large workload and the like.

(2) Along with the development of subway operation towards the online networking operation direction, the intelligent level of vehicle maintenance work and the reduction of subway operation maintenance cost are brought forward urgent needs. In the manual arrangement process, the actual condition change of the vehicle in the actual production process, such as vehicle failure, cannot be considered, and the maintenance plan cannot be adjusted in a self-adaptive manner.

Aiming at the problems in the prior art, the current subway vehicle maintenance scheduling algorithm mainly relates to a maintenance plan pre-arrangement algorithm of multi-objective optimization and a vehicle maintenance balance scheduling algorithm based on multi-factor comprehensive evaluation. For example, the Chinese invention patent document with publication number CN106845789A, publication date of 2017, 6 and 13 and named as "annual inspection repair plan automatic pre-arrangement method of track traffic equipment based on repair process" discloses an annual inspection repair plan automatic pre-arrangement method: step 1, inputting a annual overhaul schedule template, an equipment information table, a historical overhaul record and a repair schedule; step 2, calling out an annual inspection schedule template; step 3, filling a year maintenance schedule template; screening all maintenance equipment belonging to a certain specialty of a certain line from the equipment information table, reading maintenance information corresponding to each maintenance equipment from the maintenance schedule table, and filling the maintenance equipment and the corresponding maintenance information into an annual maintenance schedule template; step 4, establishing a target function and constraint conditions; step 5, generating an initial annual overhaul plan by the filled annual overhaul plan form template according to a target function and constraint conditions, and distributing annual overhaul tasks to 12 months; and 6, auditing the initial annual inspection and repair plan, and taking the annual inspection and repair plan after the audit is passed as a final annual inspection and repair plan. However, the application only carries out automatic pre-arrangement aiming at the annual inspection plan of the rail transit equipment, and does not separate the most main equipment of the vehicle; the pre-arrangement result is an annual inspection and repair plan, relevant changes are not made on the inspection and repair tasks of each month according to the actual running condition of the equipment, the annual inspection plan of the rail transit equipment is only automatically pre-arranged, and the most main equipment of the vehicle is not independent; the prearranged result is an annual inspection plan, and the conditions that the rest time of an inspection team cannot be guaranteed, the workshop inspection resources are insufficient and the like are not considered.

For example, the invention discloses a vehicle maintenance plan balance scheduling method, which is disclosed in the chinese patent publication No. CN109214690A, having publication date of 2019, 1 month and 15 days, entitled "a system and a method for multi-factor comprehensive evaluation of vehicle maintenance plan balance scheduling", and comprises: the method comprises the following steps: under the conditions that the annual maintenance total amount of the train is unchanged and the maintenance period and the maintenance depth of each part are not changed, the maintenance contents of the original traditional planned maintenance are divided into monthly inspections to form a new maintenance rule; step two: compiling an annual plan, a monthly plan and a weekly plan according to a repair program; step three: comprehensively utilizing the support of multi-source monitoring data, establishing an evaluation index automatically collected by depending on vehicle operation data to perform logic operation, and evaluating the vehicle health state; step four: modifying and changing the maintenance strategy according to the data processing result of the step three; step five: and displaying the scheduled plan to relevant maintenance personnel on the station billboard and/or the handheld maintenance terminal, and carrying out maintenance operation by the maintenance personnel according to the plan. The application improves the on-train rate, the reliability and the safety of the train, and can adjust the maintenance schedule sequence and the maintenance time according to the actual state of the train, but the application does not consider the uniform distribution problem of maintenance schedule arrangement, and the problem that the rest time of maintenance teams cannot be guaranteed due to continuous operation can occur; the condition that the conflict exists between the maintenance schedule arrangement and the actual maintenance resources of the workshop is not considered in the scheduling processing process, and the self-adaptive adjustment can not be carried out according to the scheduling conflict.

Disclosure of Invention

The invention aims to provide an automatic generation method of a subway vehicle maintenance plan based on time slice segmentation, aiming at the defects of complex process, unreasonable arrangement, easy error result, large workload and the like when the vehicle year and month maintenance plan is compiled in the prior art.

The purpose of the invention is realized by the following technical scheme:

the subway vehicle maintenance plan automatic generation method based on time slice segmentation is characterized by comprising the following steps of:

the method comprises the steps of initializing, setting automatic scheduling parameters of a subway vehicle maintenance plan, and loading basic data of the vehicle maintenance plan and vehicle historical maintenance data of all subway vehicles to be maintained; the automatic scheduling parameters comprise the times of various maintenance courses required in each set period of each row of subway vehicles to be maintained and the time period of intervals required by each type of maintenance course; the basic data of the vehicle maintenance plan comprise the number of subway vehicles to be maintained, the number of workshop maintenance groups, and the maintenance times and maintenance days of various required maintenance schedules, wherein the planned maintenance schedules are usually arranged periodically within a period of time (a set period), for example, the balanced maintenance is divided into 12 times within a period of one year, and the maintenance times are arranged for the first time within the period of a certain maintenance schedule; the historical overhaul data of the vehicles comprise overhaul records of all subway vehicles to be overhauled, wherein the overhaul records comprise past overhaul dates, various overhaul and repair times and various overhaul and repair times;

a legality checking step, which is to check the legality of the maintenance resources before scheduling for the automatic scheduling parameters set in the initialization step and the basic data of the vehicle maintenance plan, namely to check whether the maintenance resources required by the annual maintenance plan exceed the maintenance resources actually owned by the workshop, and concretely, to calculate the number of the maintenance resources YS (unit: row/day) required in the maintenance plan period, wherein YS = the number of the rows of the subway vehicles to be maintained and the number of the maintenance days required by each subway vehicle to be maintained to complete all the maintenance and repair processes arranged in the maintenance plan period; and calculating the number YZ (unit: column/day) of the maintenance resources which can be provided by the maintenance workshop in the year, wherein YZ = the number of balance maintenance groups of the workshop and the number of all working days of the balance maintenance groups in one year; if YZ is more than or equal to YS, the resource meets the scheduling requirement, and the validity check is passed; if YS is more than or equal to YZ, the workshop maintenance resources are insufficient, and the validity check is not passed;

an overhaul plan generating step, after the data of the automatic scheduling parameters and the basic data of the vehicle overhaul plan set in the initializing step pass the overhaul resource validity check of the validity checking step, determining the repair schedule and the repair schedule of each row of subway vehicles to be overhauled for the first time in a set period according to the overhaul records of the subway vehicles to be overhauled, then carrying out the overhaul and repair schedule times and types in each set period of the subway vehicles to be overhauled according to the automatic scheduling parameters and the basic data of the vehicle overhaul plan, as well as the time period and the number of days of the interval required by each type of overhaul and repair schedule, carrying out the overhaul plan in the set period on all the subway vehicles to be overhauled one by one according to the number of workshop overhaul teams, and setting that the same overhaul workshop team can not carry out the overhaul and repair schedule on more than one row of subway vehicles to be overhauled in the same, and generating a maintenance task table in which the times, types, maintenance times and time of all required maintenance processes of each row of subway vehicles to be maintained in a set period correspond to the workshop maintenance team.

In the initialization step, the overhaul schedule comprises routine overhaul and planned overhaul, the overhaul schedule of routine overhaul comprises weekly check and top check, similar to daily maintenance, the overhaul schedule of planned overhaul refers to balanced overhaul, the balanced overhaul is generally more complicated than the daily maintenance, certain consumable parts and consumables need to be overhauled after a train runs for a certain time and/or for a certain distance, the overhaul complexity, requirements and working hours are generally more than the daily maintenance, the number of times that each train of subway vehicles to be overhauled can be scheduled to be balanced overhaul schedule is not more than 2 in principle, the metering unit is generally 'one day', the overhaul schedule generally comprises an annual schedule, a monthly schedule, a weekly schedule and a daily schedule, the annual schedule mainly researches the annual schedule and the monthly schedule of the vehicles, the annual schedule is a set of all overhaul schedules (mainly the balanced overhaul schedule) of each train of subway vehicles to be overhauled in the year or the month, the annual plan is decomposed to obtain a monthly plan of each month, the maintenance tasks mainly arranged by the two plans are balanced maintenance schedules, the annual/monthly maintenance plan can participate in the automatically scheduled maintenance schedule, namely, the maintenance schedule needing to participate in the automatic scheduling of the annual/monthly maintenance plan is a configurable item and can be configured according to actual requirements, for example, in the annual maintenance plan, the maintenance schedule needing to be automatically scheduled is balanced maintenance, and when other maintenance schedules are not temporarily scheduled, only the maintenance schedule can be configured.

Further, the automatic scheduling parameters include a maximum value MAX and a minimum value MIN of the number of various overhaul schedules completed by each row of subway vehicles to be overhauled every day, the unit is (one/day), the progress which can be completed by each overhaul schedule refers to the number of work contents of a certain overhaul schedule which can be completed by a workshop overhaul team bearing overhaul tasks every day, the number of times N that each row of subway vehicles to be overhauled can be scheduled to carry out routine overhaul schedules and the number of times N of planned overhaul schedules every month, and each set period is set to include M complete months, then, the minimum value of the number of times that each row of subway vehicles to be overhauled needs to carry out overhaul schedules in each set period is M (N/MIN + N/MIN), and the maximum value of the number of times is M (N/MAX + N/MAX).

In the initialization step, the basic data of the vehicle maintenance plan also comprises vehicle information of the subway vehicle to be maintained, and the vehicle information comprises the number, the model number, the vehicle code and an attached unit of the subway vehicle to be maintained; the overhaul record also comprises a trial repair schedule, a trial repair date and a trial repair time of the subway vehicle to be overhauled, wherein the trial repair date is the date of first arrangement of overhaul after the subway vehicle to be overhauled is delivered for operation; the trial repair process is a repair process which is arranged for the subway vehicle to be repaired for the first time, and the trial repair process is usually arranged for balanced repair; the trial repair times are corresponding to the scheduled trial repair processes of the subway vehicle to be repaired, and are determined according to the actual situation, the scheduled repair processes are not always started from 1, the scheduled repair processes are usually scheduled periodically within a period of time, for example, the balanced repair is divided into 12 times for a period of one year, and the repair process is scheduled for the second time within the period;

in the initialization step, the basic data of the vehicle maintenance plan also comprises team information of maintenance teams of each workshop, and the team information comprises team names, team types, working areas and field sections to which the teams belong; the team type comprises a balance repair team and a routine repair team, wherein the balance repair team is mainly used, the scheme mainly considers that a repair plan of one year or one month is generated on the basis of balance repair, the balance repair is a repair process divided into 12 sub-procedures by taking one year as a period and also belongs to a staged major repair process, and the subway company generally adopts the mode to replace the prior fixed repair (namely annual inspection); the working area comprises a positive line area and an in-warehouse area;

in the initialization step, the overhaul record also comprises vehicle overhaul schedule information, and the vehicle overhaul schedule information comprises an overhaul schedule name, an overhaul schedule code, overhaul schedule times, a vehicle model, cycle days, deviation days, overhaul days and priority information; the repair journey name can be understood as the code number of the repair task required for different types of vehicles; the cycle days are days at intervals required for overhauling a subway vehicle to be overhauled in a certain overhauling process, namely, after overhauling A is finished on the first vehicle, overhauling A is carried out on the first vehicle at intervals of 15 days; the deviation days refer to the redundant days allowed to be overhauled in advance or in a postponed way in the implementation process of a certain repair process; the number of repair days is the amount of time that a repair process needs to be performed.

The maintenance plan generating step specifically includes the following steps:

step 1, for each row of subway vehicles to be detected, firstly, calling historical vehicle overhaul data in the initialization step, and according to the type and the frequency of balanced overhaul schedules required to be arranged by each row of subway vehicles to be detected in the automatic scheduling parameters of the initialization step, the time period required by each type of overhaul schedule, the overhaul times of various overhaul schedules and the overhaul days in the basic data of the vehicle overhaul plan, and using the last overhaul record in the historical vehicle overhaul data of each row of subway vehicles to be detected to discharge the overhaul initial plan of various overhaul times required to be carried out by all the subway vehicles to be detected in the set period;

step 2, according to the number of the workshop overhaul groups in the basic data of the vehicle overhaul plan, automatically distributing the workshop overhaul groups corresponding to the overhaul initial plan, wherein the same workshop overhaul group cannot be repeatedly matched with different subway vehicle overhaul schedules within the same time period until all overhaul schedule tasks of all the workshop overhaul groups within a set period are all arranged in the overhaul initial plan, and generating a periodic overhaul plan of each row of subway vehicles to be detected;

and 3, comparing the periodic maintenance plans of each row of the subway vehicles to be detected one by one, adjusting the overlapping of the inter-vehicle maintenance team tasks in the same time period in the periodic maintenance plans, and finally generating a maintenance task table corresponding to all the subway vehicles to be maintained in a set period according to the maintenance time sequence.

In the step 1, specifically, a last overhaul schedule carried out in vehicle historical overhaul data of each row of subway vehicles to be overhauled is firstly called, a first overhaul schedule of each row of subway vehicles to be overhauled in a set period is discharged according to the overhaul schedule required by each row of subway vehicles to be overhauled in the set period in the automatic scheduling parameters and the repair schedule of each overhaul schedule in basic data of a vehicle overhaul plan, and then the overhaul schedule and the repair schedule of each row of subway vehicles to be overhauled in the set period are sequentially arranged according to a time period of an interval required by each overhaul schedule, the repair schedule of each overhaul schedule and the repair schedule of each row of subway vehicles to be overhauled in the set period and the overhaul days;

specifically, a set period is divided into N time slices in the installation time sequence, and each time slice is divided into time sub-slices according to the overhaul days of various overhaul schedules; after the first overhaul schedule of the subway vehicle to be overhauled in the set period is obtained, the starting time of the first overhaul schedule of the subway vehicle to be overhauled in the set period is calculated according to the time of the last overhaul schedule in the vehicle historical overhaul data of the subway vehicle to be overhauled and the time period needing to be spaced between the first overhaul schedule of the subway vehicle to be overhauled in the set period, the time sub-pieces of the first overhaul schedule are found and occupied correspondingly in the set period, and then the corresponding time sub-pieces are sequentially occupied according to the time period needing to be spaced between each overhaul schedule of the subway vehicle to be overhauled in the set period, the overhaul times of various overhaul schedules and the overhaul days until all the time sub-pieces are completely occupied.

In the step 1, if a certain train of subway vehicles to be detected does not have historical vehicle maintenance data, a trial maintenance process is arranged for the subway vehicles to be detected as the beginning, and the first day in a set period is set as the starting time of the trial maintenance process of the subway vehicles to be detected.

Compared with the prior art, the technical scheme comprises the following innovation points and beneficial effects (advantages):

(1) the technical scheme provides an automatic generation method of the subway vehicle maintenance plan based on the time slice, which can effectively overcome the defect that the plan is compiled manually in the prior art;

(2) the technical scheme can ensure that the balance maintenance tasks of all vehicles can be uniformly distributed in one month, thereby ensuring that maintenance teams obtain sufficient rest time and enhancing the operability of maintenance plan scheduling;

(3) the technical scheme can ensure the continuity of the balance repair task, and the balance repair of different repair times has different repair days of 1-3 days, and the continuous execution of the balance repair tasks is ensured when the repair days exceed 2 days.

(4) The technical scheme can solve the scheduling conflict which cannot be automatically identified in the manual compiling process so as to ensure that the arrangement of the maintenance task can meet the scheduling constraint.

Drawings

The foregoing and following detailed description of the invention will be apparent when read in conjunction with the following drawings, in which:

FIG. 1 is a schematic overview flow diagram of the automatic generation algorithm of the present invention;

FIG. 2 is a flowchart of an annual plan automatic scheduling algorithm according to an embodiment of the present invention;

FIG. 3 is a schematic diagram of a time slice segmentation process according to an embodiment of the present invention;

FIG. 4 is a schematic illustration of a service vehicle grouping flow of an embodiment of the automatic generation algorithm of the present invention;

FIG. 5 is a schematic diagram of a grouping process according to trial repair dates in accordance with an embodiment of the automatic generation algorithm of the present invention;

FIG. 6 is a schematic diagram of a grouping process according to a last repair date according to an embodiment of an automatic generation algorithm of the present invention;

FIG. 7 is a schematic view of a vehicle service assignment process according to an embodiment of the present invention;

FIG. 8 is a schematic diagram of a vehicle service assignment process according to an embodiment of the present invention.

Detailed Description

The technical solutions for achieving the objects of the present invention are further illustrated by the following specific examples, and it should be noted that the technical solutions claimed in the present invention include, but are not limited to, the following examples.

The specific implementation scheme of the subway vehicle maintenance plan automatic generation method based on time slice segmentation comprises an initialization step, a validity check step and a maintenance plan generation step, and specifically comprises the following steps:

the initialization step is to set automatic scheduling parameters of a subway vehicle maintenance plan, load basic data of the vehicle maintenance plan and historical vehicle maintenance data of all subway vehicles to be maintained; the automatic scheduling parameters comprise the times of various maintenance courses required in each set period of each row of subway vehicles to be maintained and the time period of intervals required by each type of maintenance course; the basic data of the vehicle maintenance plan comprise the number of subway vehicles to be maintained, the number of workshop maintenance groups, and the maintenance times and maintenance days of various required maintenance schedules, wherein the planned maintenance schedules are usually arranged periodically within a period of time (a set period), for example, the balanced maintenance is divided into 12 times within a period of one year, and the maintenance times are arranged for the first time within the period of a certain maintenance schedule; the historical overhaul data of the vehicles comprise overhaul records of all subway vehicles to be overhauled, wherein the overhaul records comprise past overhaul dates, various overhaul and repair times and various overhaul and repair times;

in the initialization step, the overhaul schedule comprises routine overhaul and planned overhaul, the overhaul schedule of the routine overhaul comprises weekly check and top check, similar to daily maintenance, the overhaul schedule of the planned overhaul refers to balanced overhaul, the balanced overhaul is generally more complicated than the daily maintenance, certain consumable parts and consumables need to be overhauled in a targeted way after a train runs for a certain time and/or a certain distance, the overhaul complexity, requirements and labor hour length are generally more than those of the daily maintenance, the balanced overhaul is divided into 12-month overhaul, the cycle days are 30 days, the deviation days are +/-5 days, all vehicles have to finish 12-month overhaul within one year time, the overhaul is carried out according to 1-month overhaul 2-month overhaul 3 … month overhaul 11-month overhaul 12 in sequence, wherein 1, 2, 3, … and 12 are overhaul schedules, the overhaul days specified in each time are different from 1 to 3 days per month, and the number of the balanced overhaul schedule of each train to be overhauled is not more than 2 in principle, the measurement unit is generally 'number/day', the overhaul plan generally comprises an annual plan, a monthly plan, a weekly plan and a daily plan, the annual plan and the monthly plan of the vehicle are mainly researched, the annual plan is a set of all overhaul schedules (mainly balanced overhaul schedules) of each row of subway vehicles to be overhauled in the year or month, the monthly plan of each month can be obtained after the annual plan is decomposed, overhaul tasks mainly scheduled by the two plans are balanced overhaul schedules, the annual/monthly overhaul plan can participate in the overhaul schedules of the automatic schedules, namely, the overhaul schedules needing to participate in the automatic schedules of the annual/monthly overhaul plan are configurable items, the overhaul schedules can be configured according to actual requirements, for example, in the annual overhaul plan, the overhaul schedules needing to be automatically scheduled are balanced repairs, when other overhaul is temporarily not needed, only the balanced repairs can be configured, the annual and monthly plan scheduling constraints mainly include: (1) except the overtime situation, the rest time of 1 day is at least guaranteed in one week of monthly shift repair, and the rest time of 4 days is at least guaranteed in two continuous weeks; (2) when the number of overhaul days of a certain overhaul schedule is more than 1 day, the continuity of the scheduled overhaul date is ensured; (3) the time interval of two times of schedule repair of a certain vehicle should meet the requirement of the cycle days +/-deviation days.

in the initialization step, the basic data of the vehicle maintenance plan also comprises team information of maintenance teams of each workshop, and the team information comprises team names, team types, working areas and field sections to which the teams belong; the team type comprises a balance repair team and a routine repair team, wherein the balance repair team is mainly used, the scheme mainly considers that a repair plan of one year or one month is generated on the basis of balance repair, the balance repair is a repair process divided into 12 sub-procedures by taking one year as a period and also belongs to a staged major repair process, and the subway company generally adopts the mode to replace the prior fixed repair (namely annual inspection); the working area comprises a positive line area and an in-warehouse area; .

Namely, the basic data includes:

(1) and the vehicle information comprises the vehicle number, the vehicle model, the vehicle code, an attached unit, a trial repair date, a trial repair schedule and a trial repair time. Wherein, the trial repair date is the date of first arrangement of repair after the delivery operation of the vehicle, the trial repair schedule is the first arrangement of repair schedule (usually arrangement of balanced repair), and the trial repair schedule is determined according to the actual situation and does not necessarily start from 1;

(2) and the workshop overhaul team information comprises team names, team types, working areas and field sections to which the teams belong. The team type mainly refers to a balance team group, also called monthly team group, the team group goes to work from Monday to Friday, and a rest can be taken after working; the working area is divided into a positive line and a warehouse;

(3) the vehicle repair journey information comprises repair journey names, repair journey codes, repair times, vehicle types, cycle days, deviation days, repair days and priorities, and the repair journey can be understood as a repair task required by different types of vehicles, wherein the cycle days are a certain repair journey which is carried out every several days; the number of deviated days is the number of days that a certain repair process allows proper advanced or delayed repair; the number of repair days is the amount of time required to perform the repair procedure.

The legality checking step is to check the legality of the overhaul resources before scheduling for the automatic scheduling parameters set in the initialization step and the basic data of the vehicle overhaul plan, namely to check whether the overhaul resources required by the annual overhaul plan exceed the overhaul resources actually owned by a workshop or not, and concretely, to calculate the number of the overhaul resources YS (unit: row/day) required in an overhaul plan period, wherein YS = the number of the rows of the metro vehicles to be overhauled and the number of the overhaul days required by each metro vehicle to be overhauled to complete all the overhaul and repair processes arranged in the overhaul plan period; and calculating the number YZ (unit: column/day) of the maintenance resources which can be provided by the maintenance workshop in the year, wherein YZ = the number of balance maintenance groups of the workshop and the number of all working days of the balance maintenance groups in one year; if YZ is more than or equal to YS, the resource meets the scheduling requirement, and the validity check is passed; if YS is more than or equal to YZ, the workshop maintenance resources are insufficient, and the validity check is not passed;

Further, the maintenance plan generating step specifically includes the following steps:

Here, for easier understanding, we will describe the annual maintenance plan as an example, that is, the set period is 1 year, and monthly maintenance (balance maintenance) is used as a plan arrangement basis, and then the maintenance plan generating step specifically includes the following steps:

s1, initializing an annual planned maintenance task sequence WY according to the historical maintenance data of the vehicle;

s2, dividing the maintenance time slices according to months and generating a maintenance time slice set ST of the annual plan;

s3, grouping the vehicles according to the previous overhaul date or trial overhaul date of the vehicles to generate an overhaul vehicle grouping set P corresponding to the overhaul time slice;

step S3 specifically includes the following steps:

s301, initializing a group set P of overhaul vehicles into an ordered set with the same number as the ST time slices;

s302, circulating monthly, and judging whether all vehicles are distributed into a designated group P [ i ]; if yes, go to step S4; if not, executing step S302;

s303, distributing all vehicles to the vehicle group P [ i ] in the current month according to the vehicle group rule; let month i = i +1, and return to step S301.

The vehicle set V is the vehicle information in the initialization step S1, including the vehicle number, the vehicle model, the vehicle code, the attached unit, the trial repair date, the trial repair schedule, the trial repair order, and the like;

the vehicle grouping rule is to calculate the estimated repair time in month i (i =1, 2, …, 12) according to the previous repair date/trial repair date of the vehicle, and to assign a certain vehicle to a certain slice P [ i ] [ j ] (j is a slice number, j =1, 2, …, Q [ i ]) of the vehicle grouping P [ i ] of month i according to the time by using the one-to-one correspondence between the vehicle grouping P set and the repair time slice set ST. Wherein the estimated repair time of the vehicle = last repair date/trial repair date of the vehicle ×. distribution coefficient η, wherein η = days of month i/days of month i-1; if the last repair date of the vehicle is empty, calculating according to the trial repair date; if not, the inspection date of the vehicle is calculated according to the previous inspection date of the vehicle. For example: when the vehicle group of V1 was assigned in month 2, it was found that it was scheduled for a repair on day 30 in month 1, and the estimated repair time =30 × (28/31) ≈ 28 (rounding off) in month 2, and therefore, V1 vehicles were assigned to the slice of the vehicle group P [ i ] corresponding to day 28 in month 2.

S4, circulating monthly, and judging whether the maintenance tasks of all vehicles are scheduled to be completed; if yes, go to step S4; if not, go to step S5;

s5, circulating according to the time slice, and whether the maintenance task of each vehicle is scheduled to be completed; if yes, let month i = i +1, return to step S4; if not, go to step S6;

s6, arranging all vehicles in the vehicle group P [ i ] [ j ] corresponding to the time slice ST [ i ] [ j ] in sequence according to scheduling constraints, and updating the vehicle maintenance task sequence WY; let the packet number j = j +1, and return to step S5.

Fields of the annual planned overhaul task sequence mainly comprise a car number, overhaul time, overhaul times, overhaul days and the like, and assignment is carried out on the overhaul time, the overhaul times and the overhaul days of 12 months in the year according to the last overhaul period or the trial overhaul period of the car in the historical overhaul data and the change rule of the monthly overhaul times.

The maintenance time slice set of the annual plan is formed by dividing a natural month into a plurality of ordered maintenance time slice sets, and the date in each time slice is also ordered.

The inspection vehicle grouping is a combination of all vehicle divisions to be scheduled and corresponding time slices on the basis of time slice division, so that the specific inspection date of the vehicle can be conveniently arranged in the subsequent steps.

Step S6 specifically includes the following steps:

s601, sequentially appointing specific overhaul dates of all vehicles in overhaul vehicle grouping slices P [ i ] [ j ] corresponding to the time slices ST [ i ] [ j ] according to an overhaul sequence;

s602, whether all vehicle maintenance arrangements in the group meet the group requirements or not; if yes, go to step S65; if not, executing step S603;

s603, finding out vehicles which do not meet the grouping requirement in the slice P [ i ] [ j ], storing the vehicles into a scheduling conflict list F of the current slice, and noting the reason causing the conflict;

s604, adjusting the vehicles in the scheduling conflict list F to the previous or next group, rearranging the overhaul dates of the vehicles, updating the scheduling conflict list and returning to the step S602;

s605, updating a vehicle annual overhaul task sequence WY; let the packet number j = j +1, and return to step S5.

The maintenance sequence is the sequence of all vehicles in the maintenance vehicle group according to the previous maintenance date or the trial maintenance date, and if the previous maintenance date of the vehicles is not empty, the previous maintenance date is taken for sequencing; if the date is empty, the trial repair dates are taken for sorting.

The grouping requirements mainly include: the maintenance resources required by each vehicle group must be guaranteed not to exceed the maximum maintenance resources that can be provided by the corresponding time slice; the deviation value of the specific overhaul date and the last overhaul date of all vehicles in the group does not exceed the specified overhaul period deviation days; whether the number of vehicles scheduled for monthly repair per day exceeds the maximum value of the number of monthly repairs allowed to be scheduled per day, generally does not exceed the number of monthly repairs.

The scheduling conflict list F is used for storing vehicle maintenance arrangement information which does not meet grouping requirements in the scheduling process, corresponds to the grouping slices P [ i ] [ j ] one to one, and mainly comprises a vehicle number, a maintenance date, maintenance times, maintenance days and conflict reasons.

Correspondingly, in the method for automatically generating the subway vehicle maintenance plan based on time slice segmentation according to this embodiment, the annual rest plan is taken as a target, and the maintenance plan based on the balance maintenance is automatically generated, as shown in fig. 1, the overall process implementation process includes the following steps.

And S1, setting automatic scheduling parameters, and loading basic data of the vehicle maintenance plan and historical vehicle maintenance data. The automatic scheduling parameters mainly comprise the maximum value and the minimum value of the allowed completion number of each maintenance schedule every day, the scheduled maintenance number per month of each train (mainly referring to balanced maintenance, the scheduled monthly maintenance number per month does not exceed 2 in principle, the monthly maintenance refers to monthly maintenance with two different maintenance times), the annual and monthly maintenance schedules participate in the automatic scheduling maintenance schedule, and the like; basic data of the vehicle maintenance plan comprise vehicle information, workshop maintenance team information, replacement information of the workshop maintenance team, vehicle maintenance schedule information and the like; the vehicle information mainly comprises a vehicle number, a vehicle model, a vehicle code, an attached unit, a trial repair date, a trial repair schedule and a trial repair number, wherein the trial repair date is the date for arranging repair for the first time after the vehicle is delivered for operation, the trial repair schedule is the repair schedule arranged for the first time, a balanced repair schedule is usually arranged, and the trial repair number is determined according to the actual situation and does not necessarily start from 1; the workshop overhaul team information mainly comprises a team name, a team type, a working area and a field section to which the team belongs, wherein the team type mainly refers to a balanced team, also called monthly team, the team goes to work from Monday to Friday, a rest can be taken after working, and the working area is divided into an online area and a warehouse area; the vehicle repair journey information mainly comprises repair journey names, repair journey codes, repair times, vehicle types, cycle days, deviation days, repair days and priorities, the repair journey can be understood as the repair tasks required by different types of vehicles, the cycle days are the days of carrying out a certain repair journey at intervals, the deviation days are the days of allowing a certain repair journey to be properly advanced or delayed for repair, and the repair days are the time consumed when the repair journey is carried out.

And S2, whether the resource validity check before scheduling is met. The validity check step needs to determine whether the overhaul resources required by the annual/monthly overhaul plan will exceed the overhaul resources actually owned by the plant. Firstly, the number of overhaul resources (unit: man-day) required by annual plan is calculated: YS = T Σ Ji, i =1, 2, …, 12, where YS is the total number of repair resources required for the annual plan; t is the total number of the trains attached to the overhaul workshop; and Ji is the number of overhaul days required for repairing the I in the month. And then calculating the number of the actual annual owned overhaul resources of the workshop (unit: man-day): YZ = NJ Gi, i =1, 2, …, 12, where NJ is the number of balanced teams; gi is the number of working days in month i of the year. If YZ is larger than or equal to YS, the requirement of automatic scheduling of maintenance tasks is met; if YZ is larger than or equal to YS, the workshop maintenance resources are insufficient and cannot meet the automatic scheduling requirement, and the increase of maintenance resources or the consideration of overtime of a team group are required to be prompted, namely the monthly maintenance number is increased.

And S3, automatically generating a workshop annual overhaul plan according to the historical overhaul data of the vehicle and the annual plan scheduling constraint. The historical overhaul data of the workshop mainly comprises a car number, an overhaul date, an overhaul schedule, overhaul times, overhaul days and the like. The annual and monthly plan scheduling constraints are the same, and the method mainly comprises the following four points: (1) except the overtime situation, the rest time of 1 day is at least guaranteed in one week of monthly shift repair, and the rest time of 4 days is at least guaranteed in two continuous weeks; (2) when the number of overhaul days of a certain overhaul schedule is more than 1 day, the continuity of the scheduled overhaul date is ensured; (3) the time interval of two times of schedule repair of a certain vehicle should meet the requirement of the cycle days +/-deviation days.

And S4, automatically decomposing and generating a monthly overhaul plan of the workshop according to the compiled year plan data and the monthly plan scheduling constraint. The monthly maintenance plan is mainly obtained by splitting the annual maintenance plan according to months.

As shown in fig. 2, an implementation process of a year plan automatic scheduling algorithm flowchart of an embodiment of an automatic generation algorithm for a subway vehicle maintenance plan based on time slices mainly includes the following steps.

And S1, initializing an annual scheduled maintenance task sequence WY according to the historical maintenance data of the vehicle. When initializing, the overhaul time of all vehicles in the current year is assigned as a default value (No. 1 of each month in a certain year, namely 'yyyy-MM-01'). Then, according to the last overhaul schedule or trial overhaul schedule of the last year in the historical overhaul data, assigning a value to the monthly overhaul schedule of 12 months in the current year according to the change rule of the overhaul schedule, for example, if the last scheduled overhaul schedule of 12 months in the last year in a V1 vehicle is monthly overhaul 3, then the scheduled overhaul schedule of 1 month in the current year is monthly overhaul 4; if the vehicle V1 has no previous annual repair plan, the trial repair schedule needs to be obtained from the vehicle information, if the trial repair schedule is monthly repair 2 and the trial repair date is 1 month and 1 day, the repair schedule should be scheduled to be monthly repair 2 for 1 month of the current year of the vehicle, and so on. The annual planned maintenance task sequence is finally obtained as follows: WY = { key = car number, value = { [ repirardate = repair time, repirationcontent = monthly repair, repirattimes = repair number, repirardays = repair number of days ], … }, where car number corresponds to the car number in the vehicle set V, { [ key = car number, value1= vehicle model, value2= vehicle code, value3= assignment unit, value4= repair date, value5= repair trial pass, value6= repair number, … }.

S2, dividing the maintenance time slices according to the month and generating a maintenance time slice set ST of the annual plan. Dividing a certain year into two time slices with different sizes of Ta and Tb according to months, wherein the size of Tb is equal to the maximum overhaul days in the overhaul scheduled by all trains in a certain month, Ta = Tb +1, namely Tb = max { WY [ V1] [ month i ], WY [ V2] [ month i ], …, WY [ Vn ] [ month i ] }, wherein WY is a train overhaul task sequence, a set V represents all train numbers scheduled to be overhauled in the month, i is the ith overhaul month (i =1, 2, …, 12), and the default value format is 'yyyy-MM-01'. The number of two time slices per month is calculated as follows: ta and Tb satisfy the following formula: ta m + Tb n = Mi (i =1, 2, …, 12), where Mi is the total number of days of a month; m = max { [ (Mi-Tb × n)/Ta ] }, i.e. take the largest integer solution of the equation; n = min { [ (Mi-Ta × m)/Tb ] }, i.e. the smallest integer solution of the equation. The total number of time slices Q [ i ] divided for a certain month i is equal to the sum of the numbers of time slices Ta and Tb, i.e. Q [ i ] = m + n. The two time slices can provide the following overhaul resources: sa = Ta × NJ wherein NJ is the number of balanced shift groups, unit: column day; sb = Tb × NJ where NJ is the number of balanced shift groups. The time slice division result for month i is: ST [ i ] = { Ta1, Ta2, …, Tam, Tb1, Tb2, … and Tbn }, and the overhaul resource result corresponding to the month i is S [ i ] = { Sa1, Sa2, …, Sam, Sb1, Sb2, … and Sbn }; wherein i =1, 2, …, 12, and is an ordered set; therefore, the annual time slice division result set is ST = { ST1, ST2, …, ST12}, and the annual time slice correspondence resource result set is S = { S1, S2, …, S12 }.

Further, as shown in fig. 3, the implementation process of the time slice based slicing procedure includes the following steps.

S201, initializing a time slice subset with an ordered overhaul time slice set ST of the annual plan and 12 element numbers;

s202, circulating according to months, and judging whether all months have finished time slice segmentation; if yes, go to step S4; if not, go to step S203.

S203, dividing the month i into two time slices Ta and Tb, wherein the number of the two time slices is the maximum integer solution and the minimum integer solution of the equation Ta m + Tb n = Mi, the Mi is the total days of the month i, and Tb = Ta-1;

s204, all the dates in the month i are sequentially distributed into the time slice subset ST [ i ], namely ST [ i ] = { Ta1, Ta2, …, Tam, Tb1, Tb2, … and Tbn }; let month i = i +1, and return to step S202.

The two time slices are m and n and respectively correspond to the number of the time slices Ta and Tb, wherein m = max { [ (Mi-Tb x n)/Ta ] }, and n = min { [ (Mi-Ta x m)/Tb ] }. The total number of time slices Q [ i ] divided by the month i is equal to the sum of the numbers of the time slices Ta and Tb, namely Q [ i ] = m + n. The maximum repair resources that can be provided per time slice are Sa = Ta × NJ or Sb = Tb × NJ, where NJ is the number of balanced repair groups.

And S3, grouping the vehicles according to the previous inspection date or trial inspection date of the vehicles, and generating an inspection vehicle grouping set P corresponding to the inspection time slice. The inspection vehicle grouping is to divide all vehicles to be scheduled into corresponding combinations with time slices on the basis of dividing the time slices so as to arrange the specific inspection date of the vehicles in the subsequent steps.

Further, as shown in fig. 4, the implementation process of the inspection vehicle grouping process includes the following steps.

S301, according to the division mode of the overhaul time slices ST, initializing the overhaul vehicle grouping set P into an ordered set with the same number as the ST time slices. And overhauling the vehicle grouping set P [ i ] = { P [ i ] [1], P [ i ] [2], P [ i ] [3], …, P [ i ] [ g ] }, wherein g is the total number of the vehicle grouping and is equal to the total number of time slices q of the corresponding month.

S302, circulating according to the month, and judging whether all vehicles are distributed into a specified group or not; if yes, go to step S4; if not, executing step S302;

s303, distributing all vehicles to the vehicle group P [ i ] in the current month according to the vehicle group rule; let month i = i +1, and return to step S301. If the previous repair date is empty, all vehicles are allocated to the corresponding vehicle grouping set P [ i ] according to the sequence of the repair trial dates, as shown in the following FIG. 5. If not, all vehicles are allocated to the corresponding vehicle grouping set P [ i ] according to the sequence of the last overhaul date, as shown in FIG. 6. In the vehicle grouping process, when the number of days in the previous month is greater than or less than the current month, the number of days in the previous month needs to be redistributed after the last overhaul date value is multiplied by a distribution coefficient eta (eta = current month number/previous month number) for conversion. For example, if the V1 car was serviced on day 1 and day 30, then when its group of day 2 was scheduled, 30 × (28/31) ≈ 28 (rounding off) is calculated, and then the V1 car is assigned to the last slice of the group of cars corresponding to day 2 and day 28.

S4, circulating monthly, and judging whether the maintenance tasks of all vehicles are scheduled to be completed; if yes, go to step S4; if not, step S5 is executed.

S5, circulating according to the time slice, and whether the maintenance task of each vehicle is scheduled to be completed; if yes, let month i = i +1, return to step S4; if not, step S6 is executed.

S6, arranging all vehicles in the vehicle grouping slice P [ i ] [ j ] corresponding to the time slice ST [ i ] [ j ] in sequence according to scheduling constraints, and updating the vehicle maintenance task sequence WY; let the packet number j = j +1, and return to step S5.

Further, as shown in fig. 7, the implementation process of the vehicle inspection task allocation process includes the following steps:

s601, all vehicles in the inspection vehicle grouping slice P [ i ] [ j ] corresponding to the time slice ST [ i ] [ j ] are sequentially assigned with specific inspection dates according to the inspection sequence. The inspection sequence refers to the sequence of the inspection dates or trial maintenance dates of all vehicles in the inspection vehicle group, and if the last inspection date of the vehicle is not empty, the last inspection date is taken for sequencing; if the date is empty, the trial repair dates are taken for sorting. The specific distribution process of the vehicle maintenance tasks in the maintenance vehicle group P [ i ] [ j ], as shown in FIG. 7, needs to pay attention to the fact that the weekends in the time slices are not distributed as much as possible in the distribution process of the date arrangement so as to guarantee the normal rest time of the monthly maintenance group.

S602, whether all vehicle maintenance arrangements in the group meet the group requirements or not; if yes, go to step S65; if not, go to step S603. And carrying out legality inspection on the task allocation of each maintenance vehicle, namely judging whether the task allocation meets the grouping requirement. The grouping requirement includes the following three points: (1) the overhaul resources required by each vehicle group must be ensured not to exceed the maximum overhaul resources which can be provided by the corresponding time slice, namely SP [ i ] [ j ] ≦ S [ i ] [ j ], wherein j =1, 2, …, g, g is the number of overhaul vehicle groups, i is the ith month of a certain year, i =1, 2, …, 12; (2) the deviation value of the specific overhaul date and the last overhaul date of all vehicles in the group does not exceed the specified overhaul period deviation days; (3) whether the number of vehicles scheduled for monthly repair per day exceeds the maximum value of the number of monthly repairs allowed to be scheduled per day, generally does not exceed the number of monthly repairs.

S603, finding out vehicles which do not meet the grouping requirement in the slice P [ i ] [ j ], storing the vehicles into a scheduling conflict list F of the current slice, and noting the reason causing the conflict. The scheduling conflict list mainly includes a car number, a repair date, a repair time, a repair number of days, and a conflict reason, that is, F = { key = car number, { [ repirardate = repair date, repirarttimes = repair number, repirardays = repair number of days, conflictReason = conflict reason ] }.

S604, adjusting the vehicles in the scheduling conflict list F to the previous or next group, rearranging the overhaul dates, updating the scheduling conflict list and returning to the step S602. It should be noted that, when adjusting, the adjustment of the inspection time of the vehicles in the group is performed preferentially, and the adjustment is performed to the previous group or the next group if the adjustment in the group cannot be satisfied.

S605, updating a vehicle annual overhaul task sequence WY; let the packet number j = j +1, and return to step S5. And after all the vehicle maintenance tasks in the group are arranged, updating the maintenance task sequences corresponding to the vehicles.

Claims

1. The subway vehicle maintenance plan automatic generation method based on time slice segmentation is characterized by comprising the following steps of:

the method comprises the steps of initializing, setting automatic scheduling parameters of a subway vehicle maintenance plan, and loading basic data of the vehicle maintenance plan and vehicle historical maintenance data of all subway vehicles to be maintained; the automatic scheduling parameters comprise the times of various maintenance courses required in each set period of each row of subway vehicles to be maintained and the time period of intervals required by each type of maintenance course; the basic data of the vehicle maintenance plan comprise the number of subway vehicles to be maintained, the number of workshop maintenance groups, and the maintenance times and maintenance days of various required maintenance courses; the historical overhaul data of the vehicles comprise overhaul records of all subway vehicles to be overhauled, wherein the overhaul records comprise past overhaul dates, various overhaul and repair times and various overhaul and repair times;

a legality checking step, which is used for checking the legality of the maintenance resources before scheduling for the automatic scheduling parameters set in the initialization step and the basic data of the vehicle maintenance plan, and calculating the number YS (unit: row/day) of the maintenance resources required in a maintenance plan period, wherein YS = the number of rows of the subway vehicles to be maintained and the number of maintenance days required for each subway vehicle to be maintained to complete all maintenance and repair processes scheduled in the maintenance plan period; and calculating the number YZ (unit: column/day) of the maintenance resources which can be provided by the maintenance workshop in the year, wherein YZ = the number of balance maintenance groups of the workshop and the number of all working days of the balance maintenance groups in one year; if YZ is more than or equal to YS, the resource meets the scheduling requirement, and the validity check is passed; if YS is more than or equal to YZ, the workshop maintenance resources are insufficient, and the validity check is not passed;

2. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 1, wherein: in the initialization step, the overhaul schedule comprises routine overhaul and planned overhaul, the overhaul schedule of the routine overhaul comprises weekly check and top check, the overhaul schedule of the planned overhaul refers to balanced overhaul, and the number of times that each row of subway vehicles to be overhauled can be scheduled to be balanced overhaul schedule is not more than 2 per month.

3. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 1 or 2, wherein: the automatic scheduling parameters comprise the maximum value MAX and the minimum value MIN of the number of various overhaul schedules completed by each row of subway vehicles to be overhauled every day, the unit is (number/day), the number N of times that each row of subway vehicles to be overhauled can be scheduled to carry out routine overhaul schedules and the number N of times of scheduled overhaul schedules, each set period is set to contain M complete months, then, the minimum value of the number of times that each row of subway vehicles to be overhauled needs to carry out overhaul schedules in each set period is M (N/MIN + N/MIN), and the maximum value of the number of times is M (N/MAX + N/MAX).

4. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 1, wherein: in the initialization step, the basic data of the vehicle maintenance plan also comprises vehicle information of the subway vehicle to be maintained, and the vehicle information comprises the number, the model number, the vehicle code and an attached unit of the subway vehicle to be maintained; the overhaul record also comprises a trial repair schedule, a trial repair date and a trial repair time of the subway vehicle to be overhauled, wherein the trial repair date is the date of first arrangement of overhaul after the subway vehicle to be overhauled is delivered for operation; the trial repair process is a repair process which is arranged for the subway vehicle to be repaired for the first time; and the trial repair times correspond to the trial repair processes of the subway vehicles to be repaired.

5. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 1, wherein: in the initialization step, the basic data of the vehicle maintenance plan also comprises team information of maintenance teams of each workshop, and the team information comprises team names, team types, working areas and field sections to which the teams belong; the team type comprises a balance team and a routine overhaul team; the work area includes a positive line area and an in-bank area.

6. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 1, wherein: in the initialization step, the overhaul record also comprises vehicle overhaul schedule information, and the vehicle overhaul schedule information comprises an overhaul schedule name, an overhaul schedule code, overhaul schedule times, a vehicle model, cycle days, deviation days, overhaul days and priority information; the cycle days are days at intervals required for overhauling a subway vehicle to be overhauled in a certain overhauling journey; the deviation days refer to the redundant days allowed to be overhauled in advance or in a postponed way in the implementation process of a certain repair process; the number of repair days is the amount of time that a repair process needs to be performed.

7. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 1, wherein said maintenance plan generating step specifically comprises the steps of:

8. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 7, wherein: in the step 1, specifically, the last overhaul schedule of each row of subway vehicles to be overhauled in the historical overhaul data of the vehicles is called, the first overhaul schedule of each row of subway vehicles to be overhauled in the set period is discharged according to the overhaul schedule of each row of subway vehicles to be overhauled in the set period in the automatic scheduling parameters and the repair schedule of each overhaul schedule in the basic data of the vehicle overhaul plan, and then the overhaul schedule and the repair schedule of each row of subway vehicles to be overhauled in the set period are sequentially arranged according to the time period of the interval required by each overhaul schedule, the repair schedule of each overhaul schedule and the repair number of repair days in the set period and the time sequence.

9. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 8, wherein: specifically, a set period is divided into N time slices in the installation time sequence, and each time slice is divided into time sub-slices according to the overhaul days of various overhaul schedules; after the first overhaul schedule of the subway vehicle to be overhauled in the set period is obtained, the starting time of the first overhaul schedule of the subway vehicle to be overhauled in the set period is calculated according to the time of the last overhaul schedule in the vehicle historical overhaul data of the subway vehicle to be overhauled and the time period needing to be spaced between the first overhaul schedule of the subway vehicle to be overhauled in the set period, the time sub-pieces of the first overhaul schedule are found and occupied correspondingly in the set period, and then the corresponding time sub-pieces are sequentially occupied according to the time period needing to be spaced between each overhaul schedule of the subway vehicle to be overhauled in the set period, the overhaul times of various overhaul schedules and the overhaul days until all the time sub-pieces are completely occupied.

10. The method for automatically generating the subway vehicle maintenance plan based on time slice segmentation as claimed in claim 7, wherein: in the step 1, if a certain train of subway vehicles to be detected does not have historical vehicle maintenance data, a trial maintenance process is arranged for the subway vehicles to be detected as the beginning, and the first day in a set period is set as the starting time of the trial maintenance process of the subway vehicles to be detected.